{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":2515,"total_is_capped":false,"direct_labels_cover":3,"predictions_cover":2515,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"19ae3fcddb76","filters":{"topic":"Advanced Graph Theory Research"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Vertex (graph theory); Graph; Dominating set; Minimum weight; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01958927517900732,"gpt":0.2969287906505696,"spread":0.2773395154715623,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006804299,0.0001033462,0.0001370289,0.0002235179,0.00005553953,0.00007749109,0.0005292132,0.00003846845,0.00002065391],"category_scores_gemma":[0.0002626921,0.00009036114,0.00004871246,0.0007074203,0.00005190007,0.000353948,0.00008124901,0.0001222276,0.00005571887],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003489066,"about_ca_system_score_gemma":0.00002501793,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001294158,"about_ca_topic_score_gemma":0.00000705671,"domain_scores_codex":[0.9989104,0.00009557361,0.0002260286,0.0002138821,0.0002844882,0.0002696412],"domain_scores_gemma":[0.9991419,0.0001653548,0.00006266267,0.0005329928,0.00003765671,0.00005946672],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[7.508028e-7,0.00004322184,0.0001994318,0.00002272537,0.000002811206,0.000008803591,0.00098328,0.00003055865,0.0003457812,0.9974597,0.00002327794,0.0008796443],"study_design_scores_gemma":[0.0002557061,0.00002591337,0.0002911551,0.00002615088,0.000001268398,0.00001129773,0.0001903023,0.01452638,0.002772683,0.9813966,0.0003747921,0.0001277255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08450676,0.00007921039,0.8754576,0.0001381731,0.00008276125,0.0002841838,0.000001098176,0.00009702132,0.03935318],"genre_scores_gemma":[0.7991475,0.00001021529,0.2004315,0.00002980681,0.00000352833,0.00002833529,0.00000109105,0.00001151769,0.0003364713],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7146408,"threshold_uncertainty_score":0.368482,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.01698177873404861,"gpt":0.296070846226851,"spread":0.2790890674928024,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0007379696,0.0000756113,0.0001496655,0.00006312849,0.0001064291,0.00003306119,0.006384731,0.00004308674,0.00001436049],"category_scores_gemma":[0.001024504,0.00003542579,0.0001967964,0.0003771666,0.0005789885,0.0002847195,0.001796117,0.0007293674,0.000001928644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000257609,"about_ca_system_score_gemma":0.0002248354,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000032506,"about_ca_topic_score_gemma":0.00000944618,"domain_scores_codex":[0.9987387,0.0001793309,0.0002680693,0.00009749457,0.0005348636,0.0001815413],"domain_scores_gemma":[0.9975111,0.0001774731,0.0003982262,0.001525698,0.0003240962,0.00006334382],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000293342,0.0003192146,0.02063441,0.00004137553,0.000298094,0.00005324373,0.002593189,0.003528089,0.2991849,0.5160586,0.007069159,0.1499263],"study_design_scores_gemma":[0.0005859098,0.0001388748,0.01040466,0.00004429315,0.00001231288,0.001029598,0.00007138727,0.0025627,0.2600961,0.7228092,0.002152825,0.00009216287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.914277,0.00006850725,0.07502752,0.007964049,0.001921086,0.0001697325,0.000002281038,0.000005571444,0.0005642129],"genre_scores_gemma":[0.9675344,0.000001588011,0.03194263,0.0001332374,0.000168122,8.784744e-7,9.789734e-9,0.000005308511,0.0002138723],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2067505,"threshold_uncertainty_score":0.9989912,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University; Toronto Metropolitan University","funders":"","keywords":"Computer science; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.01995840713689621,"gpt":0.2728467777638407,"spread":0.2528883706269445,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003558668,0.0002905222,0.0004415156,0.0001679338,0.00009269326,0.0001619944,0.002370938,0.000144201,0.00008478415],"category_scores_gemma":[0.0000517264,0.0001794771,0.0001617582,0.0001696532,0.0006792146,0.0003708002,0.001603456,0.0005009877,0.0001270234],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001377314,"about_ca_system_score_gemma":0.0001164451,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.877063e-8,"about_ca_topic_score_gemma":9.176897e-8,"domain_scores_codex":[0.9978526,0.0001297689,0.0004386373,0.0004475059,0.0007720537,0.0003593828],"domain_scores_gemma":[0.9968669,0.001582132,0.0001975874,0.001155209,0.00002944438,0.0001687345],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001839813,0.00008291039,0.00001189093,0.0001074767,0.00007708846,0.00001700801,0.0004604794,3.345535e-7,0.000002027717,0.9894595,0.00711495,0.002647939],"study_design_scores_gemma":[0.0001521333,0.0002371579,0.00006165692,0.0002626737,0.00001196316,0.000007663923,0.00002251345,0.00006257091,0.00007684774,0.9845445,0.01437771,0.000182627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0001930575,0.001109355,0.005715629,0.0003558813,0.0001384918,0.000731318,0.00001356309,0.0001669425,0.9915758],"genre_scores_gemma":[0.003327664,0.001182553,0.01502076,0.0003576932,0.0000851354,0.0001042572,0.000009656468,0.0001254284,0.9797869],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.01178891,"threshold_uncertainty_score":0.7318863,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0249769581685761,"gpt":0.2703662459958378,"spread":0.2453892878272617,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002680007,0.0002776974,0.0003943251,0.0003627516,0.00004557153,0.00003341334,0.00145044,0.0001911288,0.0004263274],"category_scores_gemma":[0.00002473434,0.0002468179,0.0001831521,0.0001127708,0.0001932384,0.000200539,0.0003329259,0.0003714841,0.0002312829],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005413339,"about_ca_system_score_gemma":0.0001219816,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002772036,"about_ca_topic_score_gemma":0.00001005144,"domain_scores_codex":[0.9981694,0.00003069484,0.0003072947,0.00056148,0.0006087921,0.0003223549],"domain_scores_gemma":[0.9981182,0.0001425181,0.0001639989,0.001273929,0.0001735771,0.0001277269],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002302964,0.000009656691,4.838329e-7,0.00001532622,0.00002976627,0.00003579144,0.00001610326,0.000002729509,0.00005789617,0.935582,0.0008863198,0.06336157],"study_design_scores_gemma":[0.0001649888,0.0001190645,0.000003446815,0.00004225923,0.000005005053,0.00002374012,0.000001018409,0.0003042558,0.00143931,0.91791,0.0797369,0.0002499407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[4.463366e-7,0.000322197,0.2902686,0.0001072418,0.0001360997,0.0001771444,0.000003830977,0.00007898918,0.7089055],"genre_scores_gemma":[0.0003821385,0.0001472436,0.1016416,0.0002035807,0.00005429909,0.000006538904,0.000003175507,0.00004699769,0.8975144],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.188627,"threshold_uncertainty_score":0.9999984,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04184605298491346,"gpt":0.2974343397464628,"spread":0.2555882867615493,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00341654,0.000129033,0.0001488038,0.0001617189,0.0004479804,0.0002113946,0.003795618,0.00004014512,0.0001321244],"category_scores_gemma":[0.0004343846,0.00007825829,0.00005781038,0.001308711,0.01296404,0.0004549227,0.0006514207,0.0004856347,0.00006965602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001602732,"about_ca_system_score_gemma":0.0001004311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000190429,"about_ca_topic_score_gemma":0.000002051881,"domain_scores_codex":[0.9977493,0.0001720399,0.0002515033,0.0005487584,0.0008461772,0.0004322395],"domain_scores_gemma":[0.9971123,0.0008304449,0.00009103326,0.001503665,0.000308066,0.0001544869],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006344228,0.00004694998,0.000008376092,0.000003255692,0.000001575672,8.205675e-7,0.0002038494,0.00007463386,0.01774219,0.9698718,0.00001936212,0.01202089],"study_design_scores_gemma":[0.00006967686,0.0001639968,0.0003971664,0.00001016662,5.751849e-7,0.000009515372,0.000002081478,0.2067305,0.03529591,0.7572078,0.0000329764,0.00007964717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1039117,0.000002151212,0.8822166,0.004071025,0.0004402151,0.0002753094,0.000001326102,0.00008805465,0.008993648],"genre_scores_gemma":[0.9381642,7.034623e-7,0.06144895,0.0003219959,0.00004181478,0.00001004707,2.591675e-7,0.000004720767,0.000007282377],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8342525,"threshold_uncertainty_score":0.9897221,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02382651196834527,"gpt":0.3362367416029343,"spread":0.312410229634589,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001825354,0.0001064021,0.0001783151,0.0007866748,0.0001674725,0.0002166421,0.005124066,0.0000229346,0.0001027213],"category_scores_gemma":[0.000259021,0.00007300705,0.0001709283,0.00103149,0.0009882601,0.002010332,0.0002492574,0.000230263,0.00001481051],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007083338,"about_ca_system_score_gemma":0.0004672889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005303869,"about_ca_topic_score_gemma":0.000001053379,"domain_scores_codex":[0.9971703,0.0001332708,0.0005885239,0.0002153524,0.001695288,0.0001972686],"domain_scores_gemma":[0.9963065,0.0009641348,0.0004787083,0.000487684,0.001678651,0.00008428536],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004959702,0.0002085791,0.0002562859,0.000003229427,0.00005532541,0.000008825999,0.0003321803,0.01293782,0.002216148,0.8548802,0.0002230642,0.1288288],"study_design_scores_gemma":[0.0007749217,0.001183928,0.01250994,0.0002528118,0.000009521324,0.0002507737,0.0000224862,0.05972134,0.02458238,0.8988541,0.001617048,0.0002207753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3744083,0.0000502351,0.6196644,0.003903247,0.0008907479,0.00009549627,0.000003579717,0.00001264469,0.0009713812],"genre_scores_gemma":[0.9503284,0.00007942262,0.04912636,0.0003005039,0.0001160527,0.000001766714,3.387697e-7,0.000004105625,0.00004308689],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5759201,"threshold_uncertainty_score":0.9521874,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04175281659476747,"gpt":0.2951102300940967,"spread":0.2533574134993292,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.004637875,0.0002977413,0.0004667098,0.005502422,0.001026235,0.000442601,0.0006250009,0.0001346308,0.0004272836],"category_scores_gemma":[0.0003723742,0.0002011795,0.0008666158,0.03520605,0.000371529,0.0003336165,0.0003836694,0.0003773785,0.0001378804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009444045,"about_ca_system_score_gemma":0.00008546954,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001378869,"about_ca_topic_score_gemma":0.0001390444,"domain_scores_codex":[0.9966025,0.00007433671,0.0005675579,0.0009317876,0.001022264,0.0008015262],"domain_scores_gemma":[0.9939316,0.004314173,0.000173768,0.0007131331,0.0005819501,0.0002853964],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005267546,0.0002921576,0.03313987,0.0001349279,0.02277585,0.00004309392,0.0003351281,0.01720561,0.0000847855,0.3540049,0.01003622,0.5614207],"study_design_scores_gemma":[0.001063501,0.0004745223,0.3327257,0.00001759874,0.0104282,0.00004070289,0.0009260436,0.3819642,0.0001144036,0.0397616,0.2315856,0.0008979177],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003396358,0.02108213,0.9718842,0.001928519,0.0005857137,0.0002811534,0.0000630077,0.00005019525,0.0007287342],"genre_scores_gemma":[0.9749705,0.0009325597,0.004718742,0.0004064836,0.0007757397,0.00003873436,0.00004694832,0.00002197778,0.0180883],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9715742,"threshold_uncertainty_score":0.9853011,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02401972062012517,"gpt":0.282112615871467,"spread":0.2580928952513418,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001460034,0.0002526242,0.0003052317,0.0001652102,0.0005645817,0.0003816148,0.002213974,0.00008488595,0.0001113053],"category_scores_gemma":[0.00005286067,0.0001641783,0.0002253124,0.00130065,0.0002051284,0.0004114521,0.0002178141,0.0002504311,0.00009641088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003796713,"about_ca_system_score_gemma":0.00007075926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005587044,"about_ca_topic_score_gemma":7.16173e-7,"domain_scores_codex":[0.9975475,0.0001523222,0.0004199425,0.0004694105,0.0006533326,0.0007574704],"domain_scores_gemma":[0.9972455,0.0008065827,0.00008498529,0.001552847,0.0001539811,0.0001560969],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001207677,0.00005418677,0.00002805221,0.0002223939,0.00004756825,0.000006016352,0.001075619,0.0002889127,0.0001161625,0.9931706,0.0001682917,0.004810176],"study_design_scores_gemma":[0.000512129,0.000143355,0.00003388694,0.0001433954,0.00002623397,0.0001079446,0.0009129604,0.4229778,0.000585935,0.5723245,0.001901418,0.0003305121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00316143,0.0001756986,0.9618266,0.0003710487,0.0001094894,0.001080428,0.00003203901,0.0003645863,0.03287864],"genre_scores_gemma":[0.5548887,0.0000267522,0.4406478,0.0001195727,0.0001132069,0.0005144434,0.00001252118,0.0000819279,0.003595071],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5517272,"threshold_uncertainty_score":0.6694998,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06192859394975599,"gpt":0.2857134996855245,"spread":0.2237849057357685,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007536593,0.0001918531,0.0002855537,0.0001794148,0.0001332819,0.00007517198,0.0008642633,0.00006897307,0.0001092352],"category_scores_gemma":[0.000123548,0.0001306636,0.00006601887,0.001015261,0.0002791944,0.000161042,0.0001903571,0.000272438,0.00004573382],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003654881,"about_ca_system_score_gemma":0.00003202098,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008848126,"about_ca_topic_score_gemma":0.00005254976,"domain_scores_codex":[0.9983678,0.00007167897,0.000429539,0.0003275162,0.0004080559,0.0003954188],"domain_scores_gemma":[0.9980745,0.0007260535,0.0001920722,0.000881231,0.00007068807,0.00005547852],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001280762,0.0001305451,0.00003514142,0.00007365401,0.000011821,0.000002700089,0.00101263,0.001137554,0.002227927,0.9948533,0.00005413908,0.0004477336],"study_design_scores_gemma":[0.0002889911,0.00006499411,0.0001741756,0.00003384375,0.000003225878,0.000005019549,0.0001614704,0.03349373,0.002628517,0.9629403,0.00005751065,0.0001482352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2155292,0.00004201274,0.7654068,0.0004729044,0.00002976454,0.001112801,0.00000639825,0.00006936217,0.01733077],"genre_scores_gemma":[0.8919675,0.00001620413,0.1074314,0.0002151309,0.000006177801,0.0002114968,0.000006975518,0.0000176035,0.000127533],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6764383,"threshold_uncertainty_score":0.5328306,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Disjoint sets; Minor (academic); Combinatorics; Time complexity; Mathematics; Mathematical proof; Discrete mathematics; Computer science; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01470044315439314,"gpt":0.2461503881490396,"spread":0.2314499449946465,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004588527,0.000156564,0.0002957657,0.0001712384,0.0002129462,0.0001430023,0.001843815,0.00006248014,0.00004689876],"category_scores_gemma":[0.0005065114,0.00009840664,0.0001345395,0.000539051,0.0003014266,0.001350912,0.0003035661,0.0004994656,0.00003043933],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007867871,"about_ca_system_score_gemma":0.000192281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001839601,"about_ca_topic_score_gemma":0.000001505776,"domain_scores_codex":[0.997382,0.0009029455,0.0006502079,0.0001602164,0.000515205,0.0003894156],"domain_scores_gemma":[0.9979442,0.000704257,0.0004088959,0.0005218076,0.0002872405,0.000133614],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006246002,0.0001187953,0.00008569042,0.000006017131,0.00002578567,0.00008620477,0.002006743,0.000006264797,0.0004680037,0.9901106,0.0001007641,0.006360515],"study_design_scores_gemma":[0.0006763188,0.0008073314,0.0002641143,0.00004455778,0.00000420122,0.0001019173,0.0002397059,0.00006841685,0.002375111,0.9928981,0.002399557,0.0001206792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.506521,0.006730231,0.3023675,0.006385008,0.04040901,0.003920821,0.000009920644,0.0005407917,0.1331157],"genre_scores_gemma":[0.9852391,0.0001415446,0.01324956,0.00005524397,0.0002712675,0.00001633171,1.841457e-7,0.00002725031,0.0009994494],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4787182,"threshold_uncertainty_score":0.4012906,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01294776214586673,"gpt":0.2731152441474006,"spread":0.2601674820015338,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002431265,0.0001564724,0.0003661526,0.0001180563,0.0001906019,0.00005594474,0.002212463,0.00006508037,0.00008445817],"category_scores_gemma":[0.0006131261,0.00008232146,0.0003085094,0.0007105243,0.0005902157,0.0005854354,0.0001852801,0.0004408929,0.000006242342],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005029492,"about_ca_system_score_gemma":0.0001740558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001451036,"about_ca_topic_score_gemma":0.000001175438,"domain_scores_codex":[0.9972039,0.0008778453,0.0006351176,0.0001238229,0.0009170386,0.0002422755],"domain_scores_gemma":[0.9967207,0.001219585,0.0008237868,0.0007807089,0.0003821447,0.0000731063],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004774019,0.0001631668,0.0001893461,0.00002464529,0.00008254019,0.000005015258,0.001230975,0.00005512483,0.001129614,0.9954383,0.0004368833,0.0007669497],"study_design_scores_gemma":[0.0007061124,0.0005023073,0.0004386087,0.0001436352,0.0000151399,0.0001097619,0.0003203942,0.00002157752,0.0207898,0.974409,0.00245737,0.00008629413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9835163,0.000270423,0.005050873,0.003414955,0.002622793,0.0003634734,0.00000735781,0.00001983046,0.004734037],"genre_scores_gemma":[0.9985304,0.00002714269,0.0009686737,0.0001057415,0.0002116718,0.000003647993,1.013095e-7,0.00001234151,0.000140274],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02102933,"threshold_uncertainty_score":0.4111343,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03728163721373292,"gpt":0.2879195756049232,"spread":0.2506379383911903,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005070502,0.0003341135,0.0004386693,0.0006027622,0.0001473162,0.00008934637,0.002028415,0.0003773596,0.0000028002],"category_scores_gemma":[0.00004709908,0.0004067055,0.0001421342,0.00008775441,0.0002564871,0.0004750871,0.00129863,0.0007935988,0.000006212045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005164369,"about_ca_system_score_gemma":0.0004207928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003556303,"about_ca_topic_score_gemma":5.303127e-7,"domain_scores_codex":[0.9975497,0.0007446492,0.0002232904,0.0007660202,0.0003041286,0.0004122561],"domain_scores_gemma":[0.998126,0.000295403,0.0002153788,0.0009293541,0.0002673623,0.0001665185],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00007308705,0.00002361153,7.299356e-7,0.00003209193,0.00003824515,0.0002193324,0.0002519555,0.0002712368,0.00001519837,0.9926362,0.004394011,0.002044312],"study_design_scores_gemma":[0.002959011,0.0002939361,0.000009463404,0.0003213467,0.00005923438,0.00002182715,0.00003726207,0.03435997,0.002376036,0.005458912,0.9527174,0.001385612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[9.484727e-7,0.00004211238,0.4673418,0.000002613114,0.0003591251,0.0003004073,0.00001555434,0.00009030104,0.5318471],"genre_scores_gemma":[0.00001438294,0.00003170111,0.1359569,0.00002087262,0.0000608605,0.000002686716,0.00002350976,0.00002759181,0.8638616],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.9871773,"threshold_uncertainty_score":0.9998385,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04045361536678201,"gpt":0.3106491400712147,"spread":0.2701955247044327,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00217506,0.0001058375,0.0001225357,0.0001169198,0.0009741614,0.0002173172,0.002738653,0.00002444873,0.00003168154],"category_scores_gemma":[0.0001374726,0.00006938363,0.00006509703,0.001408809,0.0150193,0.0007307766,0.0009703197,0.0001909413,0.0001145798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004992185,"about_ca_system_score_gemma":0.00009757566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001097821,"about_ca_topic_score_gemma":0.000002625632,"domain_scores_codex":[0.9978547,0.0001618083,0.0002659381,0.0004134055,0.0007797646,0.0005243713],"domain_scores_gemma":[0.9979419,0.0004596811,0.0000697653,0.001035446,0.0003104666,0.0001828021],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007764982,0.0000375174,0.00001752892,0.00000145432,0.000002098548,5.062492e-7,0.00009689214,0.0004013423,0.0006314819,0.9236303,0.00005305828,0.07512006],"study_design_scores_gemma":[0.00009608372,0.0001053865,0.0007206265,0.000006131927,0.000001215869,0.00001149376,0.000005378414,0.3416099,0.006977708,0.649463,0.0009237322,0.00007934462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01020814,0.00003856308,0.9798897,0.005097442,0.0002574704,0.0001343944,0.000001555152,0.0001122185,0.004260549],"genre_scores_gemma":[0.8961343,0.000005752139,0.1035922,0.0001451223,0.00008640872,0.000007773617,2.884546e-7,0.000003581962,0.00002459692],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8859261,"threshold_uncertainty_score":0.9876612,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Control reconfiguration; Sequence (biology); Computer science; Graph; Space (punctuation); Topology (electrical circuits); Theoretical computer science; Mathematics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01935662206999441,"gpt":0.3025947238044617,"spread":0.2832381017344673,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003125836,0.00005938023,0.00005932619,0.0001278995,0.0001217728,0.00007701658,0.0004256755,0.00002465179,0.000111151],"category_scores_gemma":[0.00009455487,0.00005650682,0.00001796616,0.0006223512,0.00004741721,0.0004756301,0.00009770647,0.00006662121,0.00181253],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003205391,"about_ca_system_score_gemma":0.00001970197,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005412915,"about_ca_topic_score_gemma":0.000004285872,"domain_scores_codex":[0.9991487,0.0000459744,0.00009649818,0.0003235694,0.0001807774,0.0002045087],"domain_scores_gemma":[0.9991937,0.00002592157,0.0000210351,0.0004902114,0.0001820254,0.00008711185],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000009031311,0.00001987686,0.00001252789,0.000001434759,0.000006290286,0.000003734015,0.0005252389,0.00001968447,0.01023444,0.100768,0.01559976,0.8728],"study_design_scores_gemma":[0.0003598391,0.001116343,0.001386946,0.000009899152,0.000002806808,0.00009859808,0.00006928554,0.05436599,0.2057906,0.1528844,0.5834762,0.0004391068],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002609905,0.000009841509,0.9846249,0.008601993,0.0008957475,0.000128918,5.569299e-7,0.0001463269,0.002981807],"genre_scores_gemma":[0.1758376,0.000009206668,0.8066831,0.001264083,0.008331616,0.00006944848,0.000005763503,0.00002274562,0.007776462],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8723609,"threshold_uncertainty_score":0.9989647,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02909574141401513,"gpt":0.3354879927491539,"spread":0.3063922513351388,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002899557,0.00008871441,0.0001871807,0.00007554572,0.0001618432,0.00008275684,0.002383632,0.00004590506,0.00001836458],"category_scores_gemma":[0.001804277,0.00005428022,0.0001360377,0.0002693177,0.0002588175,0.000405776,0.0006297352,0.0004115921,0.000009061589],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006822354,"about_ca_system_score_gemma":0.0001020365,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009181124,"about_ca_topic_score_gemma":0.000003742154,"domain_scores_codex":[0.9982439,0.0006671699,0.0003404641,0.0001303466,0.0003884054,0.000229661],"domain_scores_gemma":[0.9976086,0.0006325775,0.0003522061,0.001083072,0.0002170891,0.0001064484],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003249483,0.00007454421,0.002178103,0.0000321543,0.00009928394,0.00000553669,0.0004242265,0.002415258,0.09695037,0.1081002,0.01249709,0.7771908],"study_design_scores_gemma":[0.0006102888,0.0002984196,0.001592347,0.00007697538,0.00001494113,0.0005760389,0.00008436924,0.01050576,0.03203215,0.9358866,0.01817492,0.0001471472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005438399,0.0002531302,0.9880055,0.004762745,0.000528846,0.0000883239,6.560674e-7,0.00001545575,0.0009069603],"genre_scores_gemma":[0.591504,0.00002501192,0.4078784,0.0003214006,0.00005709752,0.00000199586,5.287373e-8,0.000007551525,0.0002045078],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8277865,"threshold_uncertainty_score":0.4429421,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1657644237840136,"gpt":0.3205390979875744,"spread":0.1547746742035607,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002767025,0.0001530977,0.0001965897,0.0002460566,0.0002105926,0.00002115175,0.0006286067,0.00005941178,0.0002475572],"category_scores_gemma":[0.00004948295,0.0001458001,0.0001028258,0.0005860768,0.0006831394,0.0003829389,0.00002303721,0.0002513723,0.00005813881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000056499,"about_ca_system_score_gemma":0.0001172142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007661943,"about_ca_topic_score_gemma":0.00003141644,"domain_scores_codex":[0.9984904,0.0001881941,0.0003377989,0.0003618381,0.0003978117,0.0002239743],"domain_scores_gemma":[0.998376,0.0005620361,0.000146249,0.0004675456,0.0003586937,0.00008951571],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005971554,0.0003144553,0.00059805,0.00002560898,0.00007669454,0.000006020633,0.0009979744,0.04329232,0.0003128838,0.920845,0.00001190853,0.03345932],"study_design_scores_gemma":[0.0004177953,0.0003588485,0.03420271,0.00002164947,0.000006000316,0.00003163394,0.00008068935,0.01959391,0.001732318,0.9433887,0.00001580584,0.0001499609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01201083,0.00001447631,0.9852003,0.0005435931,0.0001309079,0.0003199648,0.00003862103,0.0001414878,0.001599799],"genre_scores_gemma":[0.669648,0.000003940199,0.330145,0.000144223,0.000003743093,0.00002639761,0.000004261858,0.000005445033,0.00001897255],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6576372,"threshold_uncertainty_score":0.5945556,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02828176812337445,"gpt":0.2673533262481674,"spread":0.239071558124793,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003399084,0.0002458372,0.0002875061,0.00016257,0.0002226976,0.0001689801,0.0006218244,0.00006492148,0.00002104271],"category_scores_gemma":[0.00004276671,0.0001868423,0.0000404275,0.0005092092,0.0002028482,0.0002072515,0.0002748765,0.0002704051,0.00005250163],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002691612,"about_ca_system_score_gemma":0.000009241199,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.635042e-7,"about_ca_topic_score_gemma":0.000001862338,"domain_scores_codex":[0.9983611,0.00002635407,0.0002640777,0.0004613406,0.0004414801,0.0004456772],"domain_scores_gemma":[0.9984662,0.0004818561,0.0001530691,0.0006975153,0.00004822088,0.0001531279],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001885506,0.00006590782,0.00003972701,0.0001152501,0.00002383407,0.00001404438,0.002447281,0.00002696752,0.001396658,0.9890845,0.0001425338,0.006624424],"study_design_scores_gemma":[0.002269587,0.0007181376,0.0002107607,0.0002500798,0.0000320508,0.00007043511,0.001227858,0.05762142,0.01454101,0.9211392,0.0009181075,0.001001305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2841811,0.00009542771,0.6117011,0.0004913137,0.00005848849,0.001476066,0.00001418357,0.0005536824,0.1014286],"genre_scores_gemma":[0.7427121,0.0000288741,0.2565683,0.0001592804,0.00001473218,0.000132178,0.000002222734,0.00003585297,0.0003464363],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.458531,"threshold_uncertainty_score":0.7619209,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Planar graph; Combinatorics; Mathematics; Conjecture; Graph coloring; Graph; Plane (geometry); Discrete mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01415230470762358,"gpt":0.2708427278237021,"spread":0.2566904231160785,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001432451,0.0002091972,0.0006003382,0.0003822314,0.0001492356,0.00009607755,0.001803341,0.00009966645,0.00002659627],"category_scores_gemma":[0.0005201441,0.0001767131,0.0001971219,0.0007176747,0.0002314307,0.001307377,0.0002133331,0.000405081,0.00001126725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009439845,"about_ca_system_score_gemma":0.0002263186,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001441342,"about_ca_topic_score_gemma":0.000004706977,"domain_scores_codex":[0.9976197,0.0003566847,0.0006412152,0.0002444159,0.0007761444,0.0003618013],"domain_scores_gemma":[0.9975355,0.0004140406,0.0006467889,0.000588304,0.0005365988,0.0002787453],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001209463,0.0001850485,0.0008772646,0.00001151827,0.0001091787,0.00007540925,0.001040335,0.0006473445,0.005218719,0.989778,0.0001313207,0.0007163803],"study_design_scores_gemma":[0.001671496,0.001107213,0.001256198,0.0001435416,0.0000145158,0.00004080278,0.0004821297,0.000003253508,0.04340951,0.9504202,0.001274952,0.0001762154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9013063,0.0005247546,0.09067319,0.001107616,0.004841419,0.0002882565,0.0000216237,0.00006540117,0.001171442],"genre_scores_gemma":[0.9813344,0.00005278887,0.01821109,0.00009468329,0.0002169259,0.0000041279,6.152858e-7,0.00002080654,0.00006459902],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08002807,"threshold_uncertainty_score":0.7206151,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01361824642734606,"gpt":0.278929148448292,"spread":0.265310902020946,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005259155,0.00007193493,0.00006026497,0.00009318988,0.0003151383,0.0003716806,0.0001285625,0.0000290624,0.000002197763],"category_scores_gemma":[0.0000281391,0.00005251174,0.00002697587,0.0002087859,0.00007244126,0.001587359,0.00004263943,0.00006984296,0.000007560578],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002949883,"about_ca_system_score_gemma":0.00004537084,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005651456,"about_ca_topic_score_gemma":0.00001024398,"domain_scores_codex":[0.9993042,0.00003000579,0.0002357934,0.00008745963,0.0002035368,0.0001389718],"domain_scores_gemma":[0.9993209,0.0002261536,0.0001334817,0.00009380203,0.0002034436,0.00002223185],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006867746,0.000002782664,0.000140838,0.00001485541,0.000003670599,5.537564e-8,0.0003433744,0.005315599,0.00002731065,0.5300096,0.0001054371,0.4640296],"study_design_scores_gemma":[0.0004622655,0.00003724811,0.01192595,0.00001028,0.000003131669,0.00001492876,0.0002003145,0.676091,0.0001657375,0.3069376,0.004066169,0.00008537693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009397312,0.0000314538,0.9866529,0.0007936696,0.00008367066,0.0005581792,0.000004042428,0.0001102786,0.002368556],"genre_scores_gemma":[0.9511014,0.000006374371,0.04854,0.0002145487,0.00002865784,0.00008003114,0.00001643538,0.000002629066,0.00000994445],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9417041,"threshold_uncertainty_score":0.3584124,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06090426272339177,"gpt":0.294004860554233,"spread":0.2331005978308412,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007399147,0.0001433705,0.0002626558,0.0004483958,0.0001152806,0.00006363274,0.0009976504,0.00006742127,0.00002377541],"category_scores_gemma":[0.0009736096,0.0001064327,0.00009856641,0.0006942261,0.0002712455,0.0005350364,0.000208825,0.0004395926,0.000005549225],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002083029,"about_ca_system_score_gemma":0.00008691379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006220008,"about_ca_topic_score_gemma":0.000009592071,"domain_scores_codex":[0.997497,0.001099385,0.0004839502,0.0002313238,0.0003837231,0.0003046533],"domain_scores_gemma":[0.9976615,0.0008541974,0.0004058132,0.000456069,0.0003937112,0.0002287178],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003087395,0.0002312887,0.004338917,0.00001696067,0.0002126569,0.0003487841,0.004669136,0.000008753976,0.001257224,0.8628891,0.001121807,0.121818],"study_design_scores_gemma":[0.001152199,0.0006607418,0.03817677,0.0000359783,0.000008084482,0.0004390677,0.00008568075,0.00002503276,0.002929938,0.9547783,0.001536804,0.0001714497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3307824,0.007551708,0.6483178,0.0008577589,0.001679631,0.0003741046,0.00002771713,0.0001125559,0.01029628],"genre_scores_gemma":[0.9788031,0.001134912,0.01968615,0.0002116032,0.00005134655,0.000001328219,5.364737e-7,0.00001477287,0.00009623586],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6480207,"threshold_uncertainty_score":0.4340201,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01388077732672764,"gpt":0.2756073184042633,"spread":0.2617265410775357,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005729655,0.0002887969,0.0007296285,0.00005628312,0.0002840559,0.00004890104,0.001677878,0.00006990487,0.000132081],"category_scores_gemma":[0.00005303305,0.0001892946,0.0007744415,0.0021858,0.003931211,0.0003081183,0.0000487217,0.0005389015,0.00001261694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007066828,"about_ca_system_score_gemma":0.0002079306,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003779914,"about_ca_topic_score_gemma":0.000001978575,"domain_scores_codex":[0.9973345,0.0002254086,0.0005577743,0.0003845531,0.000980511,0.0005172867],"domain_scores_gemma":[0.9970535,0.000625937,0.0005252942,0.001355989,0.0002807554,0.0001585343],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006439858,0.004707514,0.0003140699,0.001216361,0.001686204,0.000005107072,0.03353028,0.005432633,0.01527836,0.8685807,0.0005902191,0.06801455],"study_design_scores_gemma":[0.001375862,0.004453428,0.006058062,0.0006490509,0.000564795,0.00008827016,0.009777079,0.02777306,0.03489394,0.9132773,0.0001552695,0.0009338188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06953793,0.0001080622,0.9250313,0.003607259,0.00004402121,0.0003953889,0.00002099118,0.00005639224,0.001198642],"genre_scores_gemma":[0.9037483,0.00009881554,0.09537052,0.0002453407,0.00001097928,0.000007965851,2.514135e-7,0.00001899572,0.0004988311],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8342104,"threshold_uncertainty_score":0.9987795,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01925852887274516,"gpt":0.2874328338617217,"spread":0.2681743049889766,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004935176,0.0002174259,0.0004746895,0.0007954995,0.0001262402,0.0000523776,0.001042318,0.0001089194,0.0000149583],"category_scores_gemma":[0.0003945954,0.0001587499,0.0003226076,0.00127748,0.0003019483,0.001071853,0.0002752402,0.0005002187,0.000004969872],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003520467,"about_ca_system_score_gemma":0.00004099298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003340949,"about_ca_topic_score_gemma":0.000001722247,"domain_scores_codex":[0.9971753,0.0006491643,0.0007391621,0.0002408594,0.0006091575,0.0005863174],"domain_scores_gemma":[0.9973047,0.0008071942,0.0005518761,0.0005340837,0.0002736319,0.0005284786],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001331865,0.0005090404,0.02783326,0.00008306419,0.0004566425,0.00005113257,0.005169808,0.0001832305,0.02101053,0.7177491,0.0004193976,0.225203],"study_design_scores_gemma":[0.0006409065,0.0005772345,0.01553546,0.00009184111,0.00003161827,0.0002618918,0.0001455059,0.00003811,0.007200575,0.9750273,0.0002520405,0.0001974774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7789274,0.001745874,0.2179404,0.0002460812,0.0003632026,0.0001995927,0.000004007361,0.00002886809,0.0005446142],"genre_scores_gemma":[0.9648575,0.0001501298,0.03474698,0.0001506838,0.00001824495,0.000004159952,3.420521e-7,0.00001380083,0.00005821317],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2572783,"threshold_uncertainty_score":0.6473634,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05932091638277751,"gpt":0.2304805378386378,"spread":0.1711596214558603,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007260084,0.0006507706,0.0006828691,0.0005761478,0.0003390713,0.0002202565,0.005188789,0.0005567171,0.000002399957],"category_scores_gemma":[0.00005937321,0.0007193022,0.0003475058,0.0001016923,0.0008913861,0.0005595672,0.003144562,0.001234817,0.00008634831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007751525,"about_ca_system_score_gemma":0.001170753,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002195015,"about_ca_topic_score_gemma":0.000001246131,"domain_scores_codex":[0.9960293,0.0004312869,0.0002782691,0.00137395,0.001015045,0.0008722203],"domain_scores_gemma":[0.9959971,0.0002888986,0.0003077984,0.002438084,0.0003739395,0.0005941307],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005954475,0.00002337286,7.329793e-7,0.00007920051,0.0001216,0.0003633802,0.0001697212,0.00001328325,0.000008612105,0.8606188,0.1337383,0.004803417],"study_design_scores_gemma":[0.000852235,0.0001216033,0.000003468793,0.0001228961,0.00006799449,0.00005553105,0.00006945406,0.001400353,0.0002584126,0.007663958,0.9884852,0.0008988889],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00002247701,0.0004807569,0.0759391,0.00003830004,0.0003297187,0.0007141635,0.0001146073,0.0005530842,0.9218078],"genre_scores_gemma":[0.000388478,0.00003898604,0.002941602,0.00006899977,0.0002003361,0.000004048063,0.00006494254,0.00007549807,0.9962171],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.8547469,"threshold_uncertainty_score":0.9995258,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Vertex (graph theory); Conjecture; Mathematics; Graph; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03238984281134506,"gpt":0.3031178416169424,"spread":0.2707279988055973,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001737763,0.0002813741,0.0003253175,0.0002143691,0.000602591,0.0002465737,0.002000626,0.0001139127,0.00000882559],"category_scores_gemma":[0.0009702017,0.0002905845,0.0001351007,0.001758281,0.0001542572,0.0003973533,0.001222087,0.0006659862,0.00009538655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004887923,"about_ca_system_score_gemma":0.000125036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000126626,"about_ca_topic_score_gemma":0.000003543398,"domain_scores_codex":[0.996748,0.0003296956,0.0004361167,0.0009497185,0.0006975406,0.0008389789],"domain_scores_gemma":[0.9966853,0.0011082,0.0001472154,0.001486571,0.0003128645,0.0002598359],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000288578,0.0004397623,0.008465779,0.00004401775,0.00001061259,0.00006642018,0.0004534144,0.001679704,0.0001861744,0.956898,0.00009104685,0.03163615],"study_design_scores_gemma":[0.0006749953,0.000307497,0.003311282,0.00006761069,0.000002686307,0.00003325564,0.000009905015,0.1506204,0.0008526476,0.8414813,0.002277022,0.0003613796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5487,0.00008632569,0.4376927,0.001011535,0.001299568,0.0006311546,7.804934e-7,0.0008039616,0.009773996],"genre_scores_gemma":[0.9872321,0.000007316563,0.01232653,0.0002077644,0.00005293774,0.00001139302,0.000001279704,0.00002279607,0.0001378893],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4385321,"threshold_uncertainty_score":0.9999546,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0487071365618233,"gpt":0.2748106614581519,"spread":0.2261035248963286,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003983254,0.0001594503,0.0004320975,0.0005226178,0.0002276303,0.0000790503,0.001581321,0.0000542616,0.00008926597],"category_scores_gemma":[0.0003015385,0.00009637835,0.0003208532,0.0009474717,0.004097895,0.0005068326,0.0002719474,0.000514711,0.000003815684],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001282757,"about_ca_system_score_gemma":0.00002135776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003999555,"about_ca_topic_score_gemma":0.000002157489,"domain_scores_codex":[0.9973715,0.0009596737,0.0005730355,0.0001840191,0.0006180585,0.0002936936],"domain_scores_gemma":[0.9972312,0.001097384,0.0005705381,0.0006027347,0.0003344554,0.0001636357],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002075766,0.00009064998,0.0002673029,0.00001523659,0.00008187283,0.00003004153,0.0008199528,0.00001069466,0.000566686,0.9893486,0.0002758231,0.008285597],"study_design_scores_gemma":[0.001574702,0.0002287191,0.001049115,0.00004323839,0.00002041041,0.0003684611,0.0001407839,0.0006985355,0.0009346327,0.9945567,0.0002792408,0.0001055032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5284723,0.02699076,0.4194351,0.009487778,0.001235071,0.0007886961,0.0000242912,0.0001162265,0.0134498],"genre_scores_gemma":[0.99172,0.0009531116,0.006926532,0.0002134147,0.00003234343,0.000002318686,1.157632e-7,0.00001119648,0.0001410188],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4632476,"threshold_uncertainty_score":0.9986124,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05866841925032519,"gpt":0.3937555524694554,"spread":0.3350871332191303,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.01221834,0.0001773057,0.000267218,0.000240041,0.0004109151,0.0003754753,0.001496788,0.00006489796,0.000007680923],"category_scores_gemma":[0.0004407375,0.0001069172,0.00005128875,0.001635775,0.002864116,0.001396947,0.001467264,0.0004663989,0.000008771714],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007915953,"about_ca_system_score_gemma":0.00004828625,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001869184,"about_ca_topic_score_gemma":0.000002563587,"domain_scores_codex":[0.9963645,0.001280919,0.0003469746,0.0006453983,0.0005238208,0.000838403],"domain_scores_gemma":[0.9965723,0.002368928,0.0001067065,0.0006431303,0.00006103272,0.0002479439],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006128109,0.00001748456,0.006092422,0.00000437159,0.000001567793,0.0000023396,0.0004530486,0.00007758597,0.001346249,0.4777658,0.000001549928,0.5142314],"study_design_scores_gemma":[0.0007206462,0.00008100236,0.1419683,0.0000322415,0.000002386381,0.0001914165,0.00002263594,0.13949,0.002143741,0.71496,0.0001158843,0.0002718612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03144248,0.0002425274,0.9658651,0.0007750234,0.0004591197,0.0003742515,2.691401e-7,0.00010118,0.00073999],"genre_scores_gemma":[0.4480294,0.0000173803,0.5515796,0.00029846,0.00004817585,0.00002145264,4.057244e-8,0.000002798915,0.000002694853],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5139596,"threshold_uncertainty_score":0.9998495,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0341002519929163,"gpt":0.3108631411316437,"spread":0.2767628891387274,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008299634,0.0001630176,0.0001700084,0.0003741796,0.0001741444,0.0001030519,0.0006771561,0.00008798343,0.000008763493],"category_scores_gemma":[0.00005131794,0.0001511194,0.00006019714,0.000794397,0.0001435926,0.000499631,0.00003486597,0.0004909243,0.00001483699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007405775,"about_ca_system_score_gemma":0.00002270806,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004639013,"about_ca_topic_score_gemma":0.0006077131,"domain_scores_codex":[0.9984444,0.0000940029,0.0002376199,0.0004480414,0.0002964776,0.0004794484],"domain_scores_gemma":[0.9986227,0.00040342,0.00003339317,0.0007223401,0.00005616775,0.0001619557],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002648632,0.0002216873,0.0004807498,0.000006921178,0.00001186787,0.00004143224,0.000672601,0.0003765463,0.0001342709,0.0006120903,0.000001339997,0.997414],"study_design_scores_gemma":[0.0052896,0.001076609,0.03032609,0.0002712829,0.00002260834,0.00022623,0.001409685,0.826274,0.01762548,0.1145313,0.001713072,0.001234068],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01987232,0.00007940295,0.978761,0.0005390912,0.0001531935,0.0003041287,0.000002392088,0.0001426431,0.0001458792],"genre_scores_gemma":[0.6837619,0.000028056,0.3160321,0.00007264566,0.00001491466,0.00003194069,8.691155e-7,0.00001164358,0.00004595334],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9961799,"threshold_uncertainty_score":0.6162469,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0153158103495201,"gpt":0.2745306702123444,"spread":0.2592148598628243,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002846621,0.0003164307,0.0005699027,0.0005751678,0.0003571536,0.0003058465,0.002136156,0.000135457,0.00004002215],"category_scores_gemma":[0.000857571,0.0002762667,0.0003861415,0.001107099,0.000319771,0.002828043,0.0004287985,0.0007132452,0.000027534],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000240864,"about_ca_system_score_gemma":0.000438728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004599543,"about_ca_topic_score_gemma":0.000002415088,"domain_scores_codex":[0.9967529,0.000442618,0.0007617947,0.0003503808,0.001004834,0.0006875033],"domain_scores_gemma":[0.9973529,0.000507345,0.0005957599,0.0006372727,0.0005141051,0.0003925906],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001082009,0.0002159937,0.00009910688,0.00002372498,0.0001139982,0.0004581526,0.001267803,0.000350014,0.006723023,0.9852896,0.00003979165,0.004336827],"study_design_scores_gemma":[0.0028333,0.001584639,0.0001684425,0.0001637938,0.00001820183,0.0005314779,0.0002977734,0.00001127871,0.0277322,0.964175,0.002193917,0.0002899765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8421847,0.000993073,0.1351905,0.001379007,0.0126762,0.000471583,0.000002319386,0.0001973125,0.006905352],"genre_scores_gemma":[0.986439,0.0001242427,0.01231049,0.0001306235,0.0006705523,0.00001117564,3.392964e-7,0.00003531486,0.0002782607],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1442543,"threshold_uncertainty_score":0.9999689,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Degree (music); Mathematics; Combinatorics; Vertex (graph theory); Discrete mathematics; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.03299384743016334,"gpt":0.2853029599536012,"spread":0.2523091125234378,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006228808,0.0001484957,0.0001962189,0.00007172758,0.0002402212,0.0001121153,0.001318022,0.00004669483,0.000003822665],"category_scores_gemma":[0.00006222131,0.00008903495,0.0001600544,0.0003447621,0.0002045811,0.0001983898,0.0002437177,0.00009572969,0.00001039778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001424275,"about_ca_system_score_gemma":0.00002830376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005516436,"about_ca_topic_score_gemma":0.00004712492,"domain_scores_codex":[0.998574,0.00002925424,0.0003962966,0.0002276763,0.000377976,0.0003947711],"domain_scores_gemma":[0.9980466,0.0006676124,0.0001901223,0.0008955449,0.0001569237,0.00004314199],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007251819,0.00004017164,0.00009221046,0.0001053297,0.00001627971,9.447336e-7,0.0001711724,0.00002734645,0.0003928446,0.9920619,0.0004652793,0.006619341],"study_design_scores_gemma":[0.0002243181,0.00007059311,0.000159002,0.00003431045,0.000006828978,0.000004545952,0.00003308402,0.01791509,0.002763462,0.9774643,0.001207348,0.0001171776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005445667,0.0001932429,0.9860652,0.0006445124,0.00006214969,0.0007030627,0.00001538528,0.00007746134,0.006793306],"genre_scores_gemma":[0.2301033,0.00001605078,0.7684407,0.00002896422,0.00004490619,0.0002690749,0.000006923029,0.00004172001,0.001048408],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2246576,"threshold_uncertainty_score":0.363074,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","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","retraction":null,"screen_n_in":null,"score":{"opus":0.03359346603976615,"gpt":0.3027998815668668,"spread":0.2692064155271007,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006395846,0.0001273793,0.0002354613,0.0004244435,0.0001217402,0.00009093311,0.001045074,0.00005107694,0.00004433647],"category_scores_gemma":[0.0002179893,0.00009901651,0.0002315064,0.00050154,0.00007128929,0.0005336372,0.00005814444,0.0002902137,0.00002593883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004903602,"about_ca_system_score_gemma":0.00002407752,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.431888e-7,"about_ca_topic_score_gemma":6.311886e-7,"domain_scores_codex":[0.9985064,0.00007176486,0.0003409511,0.0001877468,0.0005465663,0.000346585],"domain_scores_gemma":[0.9984966,0.0004571131,0.0002420202,0.0003318491,0.0002942011,0.0001782268],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003722315,0.001290388,0.0001163931,0.00003790876,0.0004032319,0.0004687269,0.002169072,0.004201855,0.007837825,0.1827552,0.03441151,0.7659357],"study_design_scores_gemma":[0.009287728,0.01096123,0.0005601627,0.0002232687,0.00004353909,0.0007936193,0.0002757831,0.1835527,0.01590231,0.7330955,0.04439,0.0009142273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00971924,0.0006946633,0.9855723,0.002310569,0.000749701,0.0001735396,0.000003724788,0.00003619088,0.0007400155],"genre_scores_gemma":[0.4085287,0.0006586592,0.5845398,0.001246507,0.0008120199,0.00002209856,0.000001339647,0.00006987902,0.004121083],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7650214,"threshold_uncertainty_score":0.4037776,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Combinatorics; GF(2); Mathematics; Computer science; Finite field","retraction":null,"screen_n_in":null,"score":{"opus":0.01250534148642135,"gpt":0.2825219572415087,"spread":0.2700166157550874,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003382055,0.0001822572,0.000323794,0.0001101052,0.0006381573,0.0003697946,0.002374902,0.00007608746,0.0001285918],"category_scores_gemma":[0.0004969822,0.0001219212,0.0002828882,0.0004407145,0.0003327017,0.001459253,0.0001690003,0.0003418277,0.00001807498],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006877921,"about_ca_system_score_gemma":0.000164421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001312022,"about_ca_topic_score_gemma":6.704346e-7,"domain_scores_codex":[0.9975761,0.0004949169,0.0005847394,0.000207489,0.0006166329,0.0005201513],"domain_scores_gemma":[0.9967272,0.001640943,0.000301136,0.0007005291,0.0004480714,0.0001821067],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002080095,0.00007173498,0.00002416524,0.000007673475,0.00007374103,0.00001556055,0.0002620285,0.0000810728,0.0005879077,0.9655935,0.00291904,0.02828351],"study_design_scores_gemma":[0.001189125,0.000667971,0.00003234606,0.00001440231,0.00001015013,0.0001139344,0.0001441625,0.00007274938,0.007050246,0.823486,0.167098,0.0001209158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4827848,0.009039613,0.3756302,0.01555612,0.05127778,0.00366641,0.00003574699,0.0005215938,0.06148776],"genre_scores_gemma":[0.946889,0.0008916305,0.01979956,0.000261062,0.002658059,0.00007538418,0.000001708694,0.00008317226,0.02934041],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4641043,"threshold_uncertainty_score":0.4971803,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Matching (statistics); Computer science; Graph; Graph theory; Theoretical computer science; Mathematics; Combinatorics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02745059931612261,"gpt":0.2899493540374657,"spread":0.2624987547213432,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001977603,0.0002724428,0.0002916555,0.0003959807,0.0001934647,0.0001560023,0.0008883947,0.0001687333,0.00003577166],"category_scores_gemma":[0.00002648267,0.0002063496,0.0001053567,0.0001675176,0.0001136528,0.0003456747,0.0004910567,0.0005144522,0.00003837913],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003819328,"about_ca_system_score_gemma":0.0001167069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006416384,"about_ca_topic_score_gemma":0.00001153044,"domain_scores_codex":[0.9984555,0.00004848754,0.0001779966,0.0005868199,0.0003817714,0.0003494804],"domain_scores_gemma":[0.9985575,0.0003214462,0.00006706241,0.0007869463,0.00007212382,0.0001949307],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001251217,0.000009209834,0.00001197705,0.00001079113,0.00001462966,0.00003512593,0.0001513906,0.000005933928,0.00003688846,0.9742947,0.01209754,0.01333057],"study_design_scores_gemma":[0.00006608124,0.0000492644,0.0002775415,0.00004991558,0.000003922068,0.00001889467,0.000009666228,0.00007802735,0.00003529505,0.9733487,0.02580167,0.0002610614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0002250261,0.000694136,0.4007552,0.000267647,0.0001231013,0.0002567404,0.000003545311,0.0003988805,0.5972757],"genre_scores_gemma":[0.001358903,0.0002726209,0.044356,0.00040062,0.00005365381,0.000003881756,0.0000104305,0.00003118146,0.9535127],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.3563992,"threshold_uncertainty_score":0.8414694,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02914474183978229,"gpt":0.3172132712211289,"spread":0.2880685293813466,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01049746,0.0002610569,0.0004218546,0.0002349932,0.0004880325,0.0001739699,0.002488953,0.0001076496,0.000003424278],"category_scores_gemma":[0.0001181022,0.000193562,0.0001410716,0.0008785975,0.0002971901,0.0003098686,0.0002809905,0.0002669246,0.00001804065],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008161678,"about_ca_system_score_gemma":0.00009238631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003254181,"about_ca_topic_score_gemma":0.000003886331,"domain_scores_codex":[0.9966499,0.0007277011,0.0006609894,0.0005618755,0.0005985305,0.0008010585],"domain_scores_gemma":[0.9935334,0.004191169,0.000362862,0.001288206,0.0004511951,0.0001731111],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007016467,0.00009142618,0.00005864256,0.000121035,0.0001097842,0.000006341721,0.003065785,0.004583657,0.001725445,0.6826939,0.0002168137,0.307257],"study_design_scores_gemma":[0.001061015,0.0005066234,0.0009361132,0.0002630476,0.00002333496,0.00006573248,0.001515705,0.8656185,0.003055497,0.1247654,0.001741103,0.00044799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01608377,0.0004943199,0.9797782,0.0000589406,0.0009438896,0.001255197,0.00001330149,0.0003842512,0.000988084],"genre_scores_gemma":[0.9232524,0.000003759571,0.07604267,0.00005786703,0.0002396446,0.00001970741,0.000006961816,0.00004085786,0.0003361173],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9071686,"threshold_uncertainty_score":0.7893231,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01045793543277344,"gpt":0.2442487909695447,"spread":0.2337908555367713,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001524732,0.0001649019,0.0003439719,0.0003787833,0.0001281145,0.0001728576,0.0005553133,0.00007348746,0.00004024254],"category_scores_gemma":[0.0002152899,0.0001458169,0.00006415741,0.0004951573,0.0002785297,0.001539615,0.0002556636,0.0004297831,0.000002911156],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002958696,"about_ca_system_score_gemma":0.00002090432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001283987,"about_ca_topic_score_gemma":0.000001101958,"domain_scores_codex":[0.9983516,0.0003524391,0.000422539,0.000203467,0.000353077,0.000316843],"domain_scores_gemma":[0.9988352,0.000407138,0.0002055991,0.0002654945,0.000117843,0.0001687206],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000226368,0.00008805263,0.001002034,0.00002371212,0.00002232026,0.00007975307,0.000993591,0.00001200663,0.001180415,0.981176,0.00004578575,0.01514997],"study_design_scores_gemma":[0.00152769,0.0007244055,0.0008081101,0.00005776785,0.00000474967,0.0003637275,0.0001310556,0.000177184,0.001449942,0.9927877,0.001810682,0.0001569428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9714146,0.004240455,0.01798589,0.0009208627,0.002479592,0.0001868367,8.315542e-7,0.00004521067,0.00272576],"genre_scores_gemma":[0.9958996,0.001035228,0.002764321,0.00005088571,0.0001097581,0.000002264726,6.137327e-8,0.00001407586,0.0001238281],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02448502,"threshold_uncertainty_score":0.5946242,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04505282759936129,"gpt":0.3107119446623994,"spread":0.2656591170630381,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000879876,0.0001681731,0.0002478274,0.0001136816,0.0001672413,0.00006688259,0.0008473075,0.00005686322,0.00002539161],"category_scores_gemma":[0.0001449327,0.0001182998,0.0001409278,0.0005507297,0.0001686675,0.0001467637,0.0001501216,0.0001505914,0.00002041121],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001352246,"about_ca_system_score_gemma":0.00003565219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000211627,"about_ca_topic_score_gemma":0.000002543697,"domain_scores_codex":[0.9986507,0.00004002163,0.0003767858,0.0002645415,0.0003251026,0.0003428848],"domain_scores_gemma":[0.9978303,0.001005428,0.0001974238,0.0007540032,0.0001441652,0.00006865386],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000637194,0.00007335778,0.000001662204,0.00008905968,0.00005109005,6.286842e-7,0.0008909409,0.00002246908,0.001220634,0.8859209,0.00008050601,0.1116423],"study_design_scores_gemma":[0.0004259329,0.00007549741,0.000006476182,0.00002101371,0.00002270428,0.000006354058,0.0009302694,0.05048544,0.02008929,0.9268503,0.0009297311,0.0001570017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002142456,0.00005038275,0.9930312,0.00004199125,0.00005616748,0.0008404681,0.00003377845,0.00006901244,0.003734567],"genre_scores_gemma":[0.1268005,0.00002802623,0.8725408,0.00008580471,0.00001909292,0.0003855764,0.00001737988,0.00003564742,0.00008711382],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1246581,"threshold_uncertainty_score":0.4824126,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2119116325","doi":"10.1017/s0963548309990290","title":"Conflict-Free Colourings of Graphs and Hypergraphs","year":2009,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Hypergraph; Mathematics; Neighbourhood (mathematics); Vertex (graph theory); Lemma (botany); Upper and lower bounds; Graph; Chromatic scale; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02230752856673305,"gpt":0.2705696345529421,"spread":0.248262105986209,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001511399,0.0002315977,0.000408683,0.0002689169,0.0002619063,0.00009207043,0.001908245,0.0001045005,0.00000137154],"category_scores_gemma":[0.0006881881,0.0002372758,0.0001127618,0.001464656,0.000327838,0.0003660878,0.001055914,0.0003660635,0.000001550197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005922692,"about_ca_system_score_gemma":0.00006987763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007560571,"about_ca_topic_score_gemma":6.372611e-7,"domain_scores_codex":[0.9975758,0.0002016395,0.0005065916,0.0006855439,0.0005027234,0.0005276997],"domain_scores_gemma":[0.9971592,0.0005250247,0.000219194,0.001474088,0.0004164281,0.0002060113],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001162725,0.0002095178,0.009404681,0.00006040159,0.00001123083,0.00000511148,0.0005109728,0.00005738907,0.000876599,0.9778544,0.00004467958,0.01095337],"study_design_scores_gemma":[0.0007578725,0.0004109896,0.02155998,0.00003734579,0.000004575665,0.00001744019,0.00001650216,0.008213989,0.002539543,0.9660839,0.0001316667,0.0002262344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9432079,0.000697325,0.05242458,0.0007159051,0.000229525,0.0005339244,0.000001801399,0.0003420642,0.001846957],"genre_scores_gemma":[0.9740596,0.00002699733,0.02577903,0.00009528721,0.000007047705,0.000003100573,6.843646e-7,0.000009068669,0.00001912587],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03085174,"threshold_uncertainty_score":0.9675827,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Homomorphism; Bounded function; Mathematics; Partially ordered set; Combinatorics; Discrete mathematics; Type (biology); Variety (cybernetics)","retraction":null,"screen_n_in":null,"score":{"opus":0.01613953013336916,"gpt":0.2517842117618099,"spread":0.2356446816284408,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006628975,0.0001529783,0.0001441085,0.0002921852,0.0002129019,0.0001346588,0.0007978995,0.0000723624,0.00003076911],"category_scores_gemma":[0.00004931134,0.0001515128,0.00004577106,0.0008169371,0.0002586759,0.001032567,0.0004144679,0.0001881209,0.0000433634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006344412,"about_ca_system_score_gemma":0.00004604146,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006810405,"about_ca_topic_score_gemma":0.00008729439,"domain_scores_codex":[0.9984601,0.00006311991,0.0001600702,0.0004554789,0.0003306213,0.00053062],"domain_scores_gemma":[0.9988078,0.0002236509,0.00006092017,0.0005716542,0.00009398059,0.000241958],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001255034,0.00002727984,0.0008647058,0.000009895656,0.00002364949,0.0000812911,0.001224585,0.000003818794,0.001239804,0.9702603,0.0002143887,0.02603769],"study_design_scores_gemma":[0.001246583,0.0002620741,0.006602342,0.00003419721,0.00001179068,0.00009603627,0.0003864327,0.001306007,0.007743019,0.935769,0.04599226,0.0005502486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2464754,0.0003398267,0.7321526,0.001021737,0.0001888097,0.000345669,0.000002950091,0.0004470843,0.01902588],"genre_scores_gemma":[0.9620248,0.00006876395,0.03622251,0.0003623043,0.00004150166,0.000002460939,0.000003520955,0.00002006802,0.001254033],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7155494,"threshold_uncertainty_score":0.6178513,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02757993635894723,"gpt":0.2840963481317202,"spread":0.256516411772773,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006112137,0.00008002289,0.0001819307,0.0004095515,0.0001906953,0.00007203459,0.0009774592,0.00002224295,0.00007069483],"category_scores_gemma":[0.00009663877,0.0000480386,0.0002082614,0.003201372,0.0001140651,0.0001517322,0.0001525379,0.0001133387,0.00001867565],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001453582,"about_ca_system_score_gemma":0.000005172812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000184542,"about_ca_topic_score_gemma":0.00002391719,"domain_scores_codex":[0.9987977,0.0001273973,0.0001812747,0.0002416176,0.0003933038,0.0002587659],"domain_scores_gemma":[0.9981105,0.0009558936,0.00005627241,0.0007318567,0.00008401467,0.0000614693],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004185121,0.0001215485,0.0002775162,0.000002798502,0.0007030898,0.00001296445,0.0005924343,0.002086722,0.000294018,0.362124,0.0003438312,0.6333992],"study_design_scores_gemma":[0.0008419877,0.0001278101,0.0008721268,0.000005482377,0.00005481642,0.000001568741,0.00005620951,0.9627982,0.002739231,0.03041784,0.001951889,0.0001328355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008396272,0.000244749,0.9774359,0.0005708196,0.00008280903,0.0001686286,0.000001772363,0.00008862395,0.01301041],"genre_scores_gemma":[0.9540415,0.000246944,0.0413278,0.0001627683,0.00002337545,0.00004979451,4.983845e-7,0.000008672152,0.004138623],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9607115,"threshold_uncertainty_score":0.1958957,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05125561456381406,"gpt":0.3153195008242945,"spread":0.2640638862604804,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001388735,0.0002991762,0.0003823142,0.0003167489,0.0003921621,0.00035796,0.001341029,0.0001005624,0.00007450145],"category_scores_gemma":[0.0005283329,0.0002516698,0.0001539976,0.001041867,0.00008441645,0.0003770532,0.0003305244,0.0002168987,0.00006993729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005627317,"about_ca_system_score_gemma":0.0001176113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002783881,"about_ca_topic_score_gemma":0.00000299718,"domain_scores_codex":[0.9973871,0.0000571294,0.0004124072,0.0005828034,0.0006051555,0.0009554027],"domain_scores_gemma":[0.9974676,0.0008369805,0.00009626195,0.001116319,0.0001934779,0.0002893096],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008429342,0.00005536313,0.00007542354,0.00014969,0.00003751045,0.000008600618,0.001058651,0.0007587505,0.002108525,0.9947709,0.0001738304,0.000794357],"study_design_scores_gemma":[0.0004232099,0.0001610519,0.00003013864,0.00007377406,0.00001143653,0.00004091012,0.0001471445,0.0827535,0.01205709,0.9034129,0.0005509654,0.0003379007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004004224,0.00007434224,0.9793574,0.0001445294,0.0001645385,0.00103629,0.00002758652,0.0002760373,0.01491503],"genre_scores_gemma":[0.1948778,0.000002217475,0.8045505,0.0001181078,0.00002550457,0.0001714635,0.000004642323,0.00005093674,0.0001987376],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1908736,"threshold_uncertainty_score":0.9999936,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03805669037780503,"gpt":0.2392331797498589,"spread":0.2011764893720538,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002412527,0.00009726168,0.000159651,0.000181174,0.00007807097,0.00002866958,0.001418851,0.00001300464,0.00002715231],"category_scores_gemma":[0.0005024172,0.0000611092,0.00009913256,0.0005697821,0.000108844,0.0002484454,0.0001503111,0.0003490627,0.00003376282],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002968151,"about_ca_system_score_gemma":0.00005670535,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.004109e-7,"about_ca_topic_score_gemma":2.436763e-8,"domain_scores_codex":[0.9978644,0.0008216052,0.0004533541,0.0001080427,0.0005745862,0.0001779761],"domain_scores_gemma":[0.9980966,0.000229698,0.0005560323,0.0004548458,0.0005722059,0.00009056536],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004551732,0.0001620439,0.0003577879,0.000007210739,0.00002354166,0.000126073,0.0004497641,0.00001672689,0.0006296189,0.9964927,0.000278105,0.001410942],"study_design_scores_gemma":[0.001349339,0.004437797,0.02462045,0.0001524781,0.00001970222,0.0002480057,0.0001185239,0.0006381242,0.02025503,0.9471554,0.0007798705,0.0002252746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6783245,0.0001360017,0.2973952,0.0003206991,0.0007769997,0.0001597398,5.72639e-7,0.00003688546,0.0228494],"genre_scores_gemma":[0.9980056,0.00001818942,0.001796661,0.00005109924,0.00001994668,3.436908e-7,8.293105e-8,0.0000143629,0.00009368491],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3196811,"threshold_uncertainty_score":0.2636602,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03729535450122503,"gpt":0.314509867878203,"spread":0.277214513376978,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001150082,0.0002237535,0.0002906476,0.0004063052,0.000142453,0.0002018323,0.000992628,0.00008448972,0.00002730266],"category_scores_gemma":[0.0003042266,0.0002021481,0.0001011702,0.001153634,0.00005538844,0.00055629,0.0002408689,0.0004055154,0.00007327382],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006364538,"about_ca_system_score_gemma":0.00005979939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006511171,"about_ca_topic_score_gemma":0.00001236143,"domain_scores_codex":[0.9979033,0.0001666392,0.0004207888,0.000407165,0.0004817831,0.0006203513],"domain_scores_gemma":[0.9985908,0.0003053576,0.0001257763,0.0008053011,0.00004165432,0.0001310693],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002487709,0.0000658165,0.0002745147,0.00006148247,0.00001078921,0.0000382874,0.004024216,0.0000713308,0.005174673,0.9889847,0.00001023314,0.00128149],"study_design_scores_gemma":[0.0003153875,0.00004136996,0.000186885,0.0001008036,0.000002693326,0.00003477805,0.0007581557,0.004950831,0.004817592,0.9884361,0.00008511935,0.0002703003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4711958,0.00004902405,0.5146851,0.0001320274,0.0001412346,0.0003387482,0.000001990617,0.0001376614,0.01331845],"genre_scores_gemma":[0.8017177,0.00000739805,0.1980308,0.00005085143,0.000008141985,0.00003702053,0.000001070444,0.00002656265,0.0001204811],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3305219,"threshold_uncertainty_score":0.8243362,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Planar; Decomposition; Planar graph; Mathematics; Graph; Discrete mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01770934675867425,"gpt":0.2716123867468868,"spread":0.2539030399882126,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003074253,0.0002276971,0.0003159742,0.0006550967,0.0002353424,0.00002515784,0.001296845,0.0001171508,0.00006403303],"category_scores_gemma":[0.00001741068,0.0002377803,0.0001787759,0.001503573,0.0002388793,0.0007169305,0.00002129399,0.0004591224,0.0001447128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006056275,"about_ca_system_score_gemma":0.00007456481,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004148658,"about_ca_topic_score_gemma":0.00000363188,"domain_scores_codex":[0.9978721,0.0001736254,0.0004108738,0.0005315916,0.0005430895,0.0004687759],"domain_scores_gemma":[0.9982444,0.0003453964,0.00007647786,0.001088836,0.00009759999,0.0001472828],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007529713,0.004273756,0.0004559498,0.0001090006,0.0003055932,0.0005855556,0.007468311,0.4673488,0.02826498,0.01228552,0.0008100294,0.4773395],"study_design_scores_gemma":[0.01071189,0.003678638,0.004876269,0.0004087151,0.00006082281,0.001655062,0.0002991588,0.6008521,0.2401721,0.1319506,0.002755299,0.002579401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08109193,0.00008483,0.9172496,0.0005011362,0.00008656245,0.000310883,0.00004667007,0.0001753458,0.0004530845],"genre_scores_gemma":[0.6677212,0.0002327561,0.3313138,0.0002442293,0.0000261848,0.00007519386,0.00001208446,0.00003633905,0.0003382768],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5866292,"threshold_uncertainty_score":0.96964,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02416877056378365,"gpt":0.2894888853845869,"spread":0.2653201148208033,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002441877,0.0002214752,0.0002282681,0.0003691059,0.0001626214,0.0001463802,0.0009498607,0.00007966034,0.00001702191],"category_scores_gemma":[0.0001078765,0.0001845203,0.00008407115,0.001017946,0.0001127748,0.0002549763,0.0002220148,0.00020925,0.0001823267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003808233,"about_ca_system_score_gemma":0.00001926173,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001249483,"about_ca_topic_score_gemma":0.000002025867,"domain_scores_codex":[0.9982558,0.00003288014,0.0003187881,0.0004108846,0.0005573786,0.0004243003],"domain_scores_gemma":[0.9982278,0.0004485258,0.0001322362,0.001013415,0.00006438152,0.0001136359],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002076271,0.0001255237,0.00002702141,0.00004057004,0.00001532436,0.00002319855,0.001024254,0.00008042981,0.006518813,0.9477693,0.0001246896,0.04423013],"study_design_scores_gemma":[0.0006158661,0.0001640334,0.0005224218,0.0000511532,0.00001207926,0.00002220349,0.0003713174,0.02547427,0.01144884,0.9596233,0.001218424,0.0004761372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04415759,0.0000143092,0.9121478,0.0001471902,0.00006640059,0.0004298578,0.000003414667,0.0003084668,0.04272494],"genre_scores_gemma":[0.6190067,0.0001045048,0.3799942,0.0002325281,0.00004612732,0.0001773412,0.00001048287,0.00004228625,0.0003858442],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5748491,"threshold_uncertainty_score":0.7524518,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02499197815101134,"gpt":0.3024142130318423,"spread":0.277422234880831,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002845431,0.0001094246,0.0001033718,0.0001843524,0.0001647921,0.0001218508,0.0004492015,0.00002772617,0.00001260697],"category_scores_gemma":[0.00005721483,0.00008185345,0.00001599334,0.0007839221,0.00006541119,0.0004094303,0.0003814597,0.000151327,0.00006877982],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004839322,"about_ca_system_score_gemma":0.00005741092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002444013,"about_ca_topic_score_gemma":0.00008232347,"domain_scores_codex":[0.9988372,0.00003981618,0.00009557205,0.0004274784,0.0002499476,0.0003499317],"domain_scores_gemma":[0.9991618,0.00009963031,0.0000201504,0.0004673654,0.00006011505,0.0001908805],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000804379,0.0003024353,0.006500667,0.0001003103,0.0001252575,0.001517854,0.007405409,0.0102735,0.08577143,0.5866274,0.0006403517,0.299931],"study_design_scores_gemma":[0.0086076,0.01227031,0.05130352,0.0005435303,0.00001971776,0.001910664,0.002227363,0.01024474,0.3503485,0.5496563,0.009631695,0.003236085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5585001,0.00005865846,0.4362026,0.00136658,0.00003442996,0.0002132452,4.691022e-7,0.0002150957,0.003408752],"genre_scores_gemma":[0.7892391,0.000004481506,0.210188,0.0002548776,0.0000141576,0.00001113021,9.488691e-8,0.00001045422,0.0002777228],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2966949,"threshold_uncertainty_score":0.3337887,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Path (computing); Combinatorics; Discrete mathematics; Computer science; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01788312941742499,"gpt":0.274049836676602,"spread":0.2561667072591771,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002653395,0.0002836869,0.0006657577,0.0005456261,0.0001727897,0.000201288,0.001199055,0.0001310797,0.000003979495],"category_scores_gemma":[0.001084902,0.00018784,0.0001528508,0.0007238747,0.0001363842,0.0005812959,0.0004632798,0.0004942548,0.000006790681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001483278,"about_ca_system_score_gemma":0.0001563103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002483135,"about_ca_topic_score_gemma":2.055589e-7,"domain_scores_codex":[0.9969828,0.0002052782,0.001016809,0.0003341669,0.0009492491,0.0005116914],"domain_scores_gemma":[0.9963965,0.00176619,0.0007207352,0.0004350862,0.0004403209,0.000241167],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001110153,0.0004399429,0.0002872254,0.00004479615,0.00002589652,0.00007534373,0.000398381,0.00001018733,0.001417178,0.9926473,0.00005567321,0.004486983],"study_design_scores_gemma":[0.00485668,0.001519826,0.0001973732,0.0006989187,0.000007605448,0.00007767653,0.00004550001,0.001046231,0.001579959,0.9894699,0.0002460714,0.0002542669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9474006,0.0001266347,0.04270025,0.000565924,0.007416657,0.0003669904,8.656712e-7,0.00005997721,0.001362152],"genre_scores_gemma":[0.9916201,0.00004183808,0.008040159,0.00002842741,0.0002277837,0.000003385928,6.454994e-8,0.00002532294,0.00001296088],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04421951,"threshold_uncertainty_score":0.7659894,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01734329773186264,"gpt":0.2819589768785469,"spread":0.2646156791466843,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003372054,0.0001857155,0.0001979539,0.0001302268,0.0001900682,0.0002645414,0.0006992831,0.0000554566,0.00001410939],"category_scores_gemma":[0.00007001549,0.0001484163,0.00005840391,0.0002737701,0.0001518046,0.0003749485,0.0003444757,0.0002154489,0.0001445757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004681366,"about_ca_system_score_gemma":0.00003397323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003092519,"about_ca_topic_score_gemma":0.000001585317,"domain_scores_codex":[0.9985952,0.00002654354,0.0002206005,0.0003443772,0.0004315263,0.000381709],"domain_scores_gemma":[0.9989488,0.0001192931,0.00007646369,0.000671453,0.00003827655,0.0001457556],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006124334,0.00005890803,0.00001946594,0.00005721731,0.00001138188,0.00003027782,0.001872156,0.0000527002,0.000420712,0.9951966,0.00003419786,0.002240248],"study_design_scores_gemma":[0.0003874559,0.0001389797,0.0001318037,0.00007426323,0.00000378031,0.00005758872,0.000112265,0.00248809,0.00214223,0.9936407,0.0006216291,0.0002012525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.141471,0.00007600687,0.8424127,0.001794406,0.00009610465,0.0002571145,0.000005850106,0.0002270393,0.01365984],"genre_scores_gemma":[0.6493183,0.00002572558,0.3495888,0.0003456912,0.00004099608,0.00002517097,0.000002764947,0.00003639748,0.0006160683],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5078474,"threshold_uncertainty_score":0.6052243,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.02698763385987632,"gpt":0.3014352730218232,"spread":0.2744476391619469,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006691866,0.0001315995,0.0001657098,0.0002841035,0.00006377183,0.00009914657,0.0005464577,0.00005391336,0.00001891492],"category_scores_gemma":[0.0002264247,0.0001161494,0.00006368029,0.0007808325,0.00003861854,0.0004431513,0.0001175417,0.000241585,0.00005820512],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005094087,"about_ca_system_score_gemma":0.0000261809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006152003,"about_ca_topic_score_gemma":0.00001266643,"domain_scores_codex":[0.9987804,0.0001058384,0.0002696711,0.00026002,0.0002726573,0.0003114203],"domain_scores_gemma":[0.9991422,0.0001358554,0.00007839309,0.0005361455,0.0000368277,0.00007056832],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001727759,0.00004883338,0.000208977,0.00003048801,0.000005520597,0.000009423743,0.003014666,0.00001784224,0.002573416,0.99313,0.00001450591,0.0009445663],"study_design_scores_gemma":[0.0002445627,0.00004834045,0.0001768078,0.00005341107,0.000001545621,0.00002684117,0.0006965099,0.007350218,0.006722695,0.9844009,0.0001108106,0.0001674022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4400026,0.00001907905,0.5449464,0.00009743193,0.000145781,0.0002168389,6.008592e-7,0.0001137475,0.01445757],"genre_scores_gemma":[0.923646,0.000004104708,0.07612487,0.00005003002,0.000004317058,0.00002470527,5.928414e-7,0.00001404815,0.0001313834],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4836434,"threshold_uncertainty_score":0.4736433,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01927022417299054,"gpt":0.2982417351459352,"spread":0.2789715109729447,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001487502,0.0002473613,0.0002606859,0.002104212,0.0003006702,0.0002284192,0.000873816,0.00009559473,0.00001865608],"category_scores_gemma":[0.0002728806,0.0002335735,0.0001166623,0.005513709,0.0003019623,0.0007506135,0.0004477109,0.0003453355,0.00004548696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005362235,"about_ca_system_score_gemma":0.00005831733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001640411,"about_ca_topic_score_gemma":0.000004461594,"domain_scores_codex":[0.9972044,0.0001030574,0.0003852338,0.00069517,0.0009483669,0.0006638002],"domain_scores_gemma":[0.997148,0.001718175,0.0001312947,0.0004492708,0.000225603,0.0003276888],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001216685,0.0001776351,0.03602981,0.00007903038,0.0001782804,0.0001697805,0.0005857064,0.03438014,0.0001848016,0.6311395,0.0002991843,0.2966544],"study_design_scores_gemma":[0.00122589,0.0002838095,0.3943202,0.00003516879,0.00001528093,0.0001916967,0.0002032743,0.03402014,0.0004358095,0.5677725,0.000749786,0.0007464034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2236431,0.0005106842,0.774095,0.0002579382,0.0001734039,0.0001724493,0.000009233651,0.0001479995,0.0009902084],"genre_scores_gemma":[0.8356196,0.00001902498,0.1638051,0.0003610163,0.00003484578,0.00000847861,0.0000237424,0.00001788834,0.0001103529],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6119765,"threshold_uncertainty_score":0.952485,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01505732805158794,"gpt":0.2993394964102967,"spread":0.2842821683587087,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00248951,0.0002085399,0.0002247202,0.0003933143,0.0005912127,0.0005601206,0.004723408,0.00004847014,0.00009769015],"category_scores_gemma":[0.0001828865,0.00017441,0.000080562,0.002725777,0.003075098,0.001833872,0.002034958,0.0003571419,0.000498263],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001251079,"about_ca_system_score_gemma":0.0001130466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.179318e-7,"about_ca_topic_score_gemma":1.767667e-7,"domain_scores_codex":[0.9964616,0.0001499589,0.0003065983,0.0009754897,0.001109465,0.0009968862],"domain_scores_gemma":[0.9974242,0.0003654603,0.00005986038,0.001405316,0.0002651778,0.0004799343],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006219807,0.00003580035,0.00004994603,0.000003392203,0.0000022789,0.0000118831,0.000162138,0.0001954522,0.001251161,0.8896527,0.00003456055,0.1085945],"study_design_scores_gemma":[0.0003089225,0.0001608216,0.0006830332,0.00003433129,0.000002298091,0.0000665386,0.000002831576,0.5950605,0.01496743,0.3853117,0.00306171,0.0003399306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02381196,0.00005890368,0.96277,0.001721215,0.0002202082,0.0002258865,6.718613e-7,0.0004498952,0.01074128],"genre_scores_gemma":[0.6958839,0.000006248466,0.3032374,0.0006440771,0.0001847873,0.00001028605,2.338934e-7,0.000007929609,0.00002518019],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6720719,"threshold_uncertainty_score":0.999638,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03197586937708036,"gpt":0.2621459650223334,"spread":0.230170095645253,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.009453803,0.002117013,0.001034421,0.001531224,0.003480792,0.003711063,0.008535828,0.002506399,0.01621563],"category_scores_gemma":[0.006802146,0.003523662,0.003772011,0.003496812,0.003518859,0.004296464,0.007081145,0.00585061,0.003271937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009880371,"about_ca_system_score_gemma":0.003659473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007827634,"about_ca_topic_score_gemma":0.0005883045,"domain_scores_codex":[0.9776818,0.002065478,0.004919237,0.003521127,0.006808025,0.005004376],"domain_scores_gemma":[0.9794554,0.003732068,0.006353144,0.006110345,0.0009660051,0.003383015],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.006229797,0.001270871,0.00002974025,0.001315384,0.002234562,0.007236511,0.003360818,0.004244052,0.002404765,0.8802742,0.08895098,0.002448311],"study_design_scores_gemma":[0.01074063,0.01039646,0.0003636786,0.00374831,0.002097303,0.0051479,0.002609582,0.4596281,0.4876924,0.003583355,0.009919058,0.004073252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8107993,0.002143189,0.003434495,0.001256423,0.008551617,0.0001340817,0.0005837213,0.0004821747,0.172615],"genre_scores_gemma":[0.9827703,0.002357879,0.006290856,0.001926519,0.003345054,0.0004886514,0.0007525557,0.001609256,0.0004589816],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8766909,"threshold_uncertainty_score":0.999193,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}