{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":687,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":687,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"cffd719b121f","filters":{"venue":"Discrete Mathematics"}},"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","authors":[{"name":"E. J. Cockayne","is_ca":true},{"name":"Paul Dreyer","is_ca":false},{"name":"Sandra M. Hedetniemi","is_ca":false},{"name":"Stephen T. Hedetniemi","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001221658,0.0004287591,0.0008472133,0.002350076,0.003170543,0.004080094,0.000851904,0.000992173,0.0104602],"category_scores_gemma":[0.005141162,0.0004488569,0.000594073,0.002336824,0.004230782,0.003896258,0.002065174,0.002514288,0.001235658],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001485913,"about_ca_system_score_gemma":0.0006785092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001380567,"about_ca_topic_score_gemma":0.001473062,"domain_scores_codex":[0.9986069,0.0005692818,0.00004721972,0.0002053327,0.000314354,0.000256887],"domain_scores_gemma":[0.9973176,0.001433636,0.0003248587,0.0002358718,0.000342514,0.0003456055],"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.00001965614,0.00000481451,0.0001106281,0.00001394806,0.000002440501,0.00002522072,0.0002106039,0.0003309166,0.0001450556,0.9956381,0.0009191699,0.002579509],"study_design_scores_gemma":[0.00001237262,0.000005119821,0.0001458718,0.000008429284,0.000004858253,0.0000740917,0.00009883563,0.001681578,0.0001986707,0.9931184,0.004646265,0.000005581234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3851298,0.001662143,0.06799932,0.004307144,0.0003808227,0.00007716176,0.0002833628,0.0002539176,0.5399063],"genre_scores_gemma":[0.9387631,0.0007463815,0.007805411,0.0004479771,0.0002905792,0.00006188911,0.0001981192,0.0001021144,0.0515844],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0104602,"threshold_uncertainty_score":0.03499287,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2131552237","doi":"10.1016/j.disc.2011.06.032","title":"State transfer on graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":223,"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; Adjacency matrix; Vertex (graph theory); Combinatorics; Discrete mathematics; Regular graph; Graph; Transfer (computing); Line graph; Computer science; Graph power","authors":[{"name":"Chris Godsil","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02221340838075977,"gpt":0.2289773331543123,"spread":0.2067639247735526,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005349648,0.0004921952,0.000779157,0.001434702,0.001736303,0.002198402,0.001060137,0.001713471,0.01424775],"category_scores_gemma":[0.002521594,0.0003727533,0.0008150436,0.00113709,0.002197235,0.004049679,0.002307863,0.002488677,0.001477495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001213814,"about_ca_system_score_gemma":0.0006315398,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008698116,"about_ca_topic_score_gemma":0.0004600324,"domain_scores_codex":[0.9994326,0.0001799996,0.00001813538,0.00009398581,0.0001512595,0.0001239905],"domain_scores_gemma":[0.9986494,0.0006084545,0.0001167749,0.0003388108,0.0001353925,0.0001511539],"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.00001596678,0.00001719493,0.00003088436,0.00001402805,0.000002967185,0.00001943508,0.00006802959,0.001318778,0.0004878718,0.9944119,0.0008609836,0.00275193],"study_design_scores_gemma":[0.000005438842,0.000005218285,0.00004081022,0.00000374673,0.000001775544,0.00001486263,0.00001963506,0.006416854,0.0002848916,0.9924602,0.0007430502,0.000003495655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3995197,0.0008559262,0.3176211,0.006593231,0.0008498479,0.0002602991,0.0005772881,0.001252012,0.2724706],"genre_scores_gemma":[0.9371998,0.0004583521,0.01579682,0.0007309185,0.0002945795,0.0001434961,0.0002924973,0.0002790361,0.04480443],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01424775,"threshold_uncertainty_score":0.04766345,"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","authors":[{"name":"Gilles Caporossi","is_ca":true},{"name":"Pierre Hansen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001005891,0.0004163746,0.001587394,0.001106609,0.001371154,0.001712112,0.001850332,0.002075837,0.005914214],"category_scores_gemma":[0.006694944,0.0004946066,0.0006620444,0.0009744796,0.001629399,0.002721288,0.002245588,0.00169058,0.0003677851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001156757,"about_ca_system_score_gemma":0.0008447616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002898533,"about_ca_topic_score_gemma":0.003383013,"domain_scores_codex":[0.9994251,0.0002677588,0.00001364039,0.0001180545,0.00008285855,0.00009273905],"domain_scores_gemma":[0.9970023,0.001979483,0.0003026629,0.0002319271,0.0002123652,0.0002711317],"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.0002083713,0.00009094322,0.001425386,0.0001541068,0.00007880671,0.0001487747,0.0001848211,0.2426357,0.001293805,0.7297418,0.006324615,0.01771299],"study_design_scores_gemma":[0.00004270233,0.00003751281,0.0003088996,0.00001391798,0.00001452243,0.00005644621,0.00004810966,0.7045013,0.0002331767,0.2936725,0.001052095,0.00001872132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.4741597,0.002144611,0.4898641,0.00257537,0.0001695604,0.0000935097,0.0004796521,0.0004216674,0.03009181],"genre_scores_gemma":[0.9354504,0.0006907402,0.05086321,0.0002736231,0.0001526608,0.00008853346,0.0003218207,0.0001247353,0.01203437],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005914214,"threshold_uncertainty_score":0.01978499,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2080042417","doi":"10.1016/j.disc.2007.12.043","title":"A survey of known results and research areas for<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si11.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>n</mml:mi></mml:math>-queens","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":179,"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":"Diagonal; Simple (philosophy); Mathematics; Modular design; Discrete mathematics; Combinatorics; Computer science; Programming language; Geometry","authors":[{"name":"Jordan Bell","is_ca":true},{"name":"Brett Stevens","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06173433587611936,"gpt":0.3231308080187126,"spread":0.2613964721425932,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004084022,0.002230566,0.002342961,0.008724233,0.003214564,0.007709296,0.004459255,0.002404772,0.03895567],"category_scores_gemma":[0.009903243,0.001803468,0.002263483,0.01848812,0.003464411,0.0167743,0.004541412,0.004507325,0.02316946],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003793973,"about_ca_system_score_gemma":0.004152742,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003145082,"about_ca_topic_score_gemma":0.004471516,"domain_scores_codex":[0.9960443,0.0008483314,0.0003399939,0.001188418,0.001263233,0.0003157432],"domain_scores_gemma":[0.98952,0.006748579,0.0003840872,0.001530247,0.001327898,0.0004892664],"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.0001243877,0.0002911098,0.001980939,0.007200502,0.000135039,0.0002092879,0.0003027779,0.002740836,0.000997119,0.3161833,0.1202243,0.5496104],"study_design_scores_gemma":[0.00002275658,0.0001036025,0.00202949,0.001830584,0.00008603572,0.001151274,0.0003338609,0.006522593,0.001215816,0.2983442,0.6882695,0.00009028892],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.005909435,0.6303611,0.1473366,0.0150061,0.003437875,0.0001542109,0.002245841,0.001316707,0.1942322],"genre_scores_gemma":[0.05930936,0.7207388,0.1302314,0.006714244,0.01114079,0.000426045,0.007748911,0.001367624,0.06232287],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.03895567,"threshold_uncertainty_score":0.1303197,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2125862453","doi":"10.1016/s0012-365x(01)00466-6","title":"On the injective chromatic number of graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":134,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds pour la Formation de Chercheurs et l'Aide à la Recherche; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV; Grantová Agentura České Republiky; Ministerstvo Školství, Mládeže a Tělovýchovy","keywords":"Injective function; Mathematics; Chromatic scale; Combinatorics; Graph; Discrete mathematics; Monomorphism; Upper and lower bounds; Hypercube; Critical graph; Context (archaeology); Line graph; Voltage graph","authors":[{"name":"Geňa Hahn","is_ca":true},{"name":"Jan Kratochvı́l","is_ca":false},{"name":"Jozef Širáň","is_ca":false},{"name":"Dominique Sotteau","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01241056388756599,"gpt":0.2081247982007641,"spread":0.1957142343131981,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001615508,0.001037762,0.0009463703,0.004468062,0.002239933,0.004508386,0.002070809,0.001352375,0.01074217],"category_scores_gemma":[0.01050066,0.0007741141,0.0005913022,0.003729011,0.006313661,0.007873175,0.002656892,0.00341242,0.0007430129],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003461819,"about_ca_system_score_gemma":0.001001271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003879531,"about_ca_topic_score_gemma":0.003351499,"domain_scores_codex":[0.9990687,0.0002999194,0.00002788541,0.0002101012,0.0001869705,0.0002065265],"domain_scores_gemma":[0.987649,0.009165664,0.000933482,0.0007370175,0.0006296223,0.0008850702],"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.0001245556,0.00002788641,0.001003164,0.00006305792,0.00001153803,0.00003669709,0.0002737701,0.008179095,0.0008832511,0.979184,0.002644216,0.007568755],"study_design_scores_gemma":[0.00002383457,0.0000194643,0.000855365,0.00003454132,0.00001719046,0.00005911203,0.0001248904,0.02003791,0.0005326271,0.9756557,0.002616123,0.00002323282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6564007,0.003009041,0.1278535,0.005809218,0.0005323189,0.00008003603,0.0009356629,0.000400922,0.2049786],"genre_scores_gemma":[0.9672075,0.001907439,0.01240712,0.0004946722,0.0006038059,0.0001080877,0.000520804,0.0002035019,0.01654709],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01074217,"threshold_uncertainty_score":0.03593618,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2048460015","doi":"10.1016/s0012-365x(01)00180-7","title":"The average connectivity of a graph","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":132,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Combinatorics; Disjoint sets; Graph; Discrete mathematics","authors":[{"name":"Lowell W. Beineke","is_ca":false},{"name":"Ortrud R. Oellermann","is_ca":true},{"name":"Raymond E. Pippert","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02124670697368278,"gpt":0.2279640605392221,"spread":0.2067173535655394,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008136894,0.0006799278,0.001192216,0.002926562,0.0009656096,0.002520656,0.001737578,0.00146978,0.004692217],"category_scores_gemma":[0.01016678,0.0005209369,0.0005632119,0.003038796,0.002019058,0.005778992,0.00114417,0.001234602,0.000484768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000955436,"about_ca_system_score_gemma":0.0004510732,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001089592,"about_ca_topic_score_gemma":0.0008698592,"domain_scores_codex":[0.9991818,0.0002377524,0.0000372541,0.0002832693,0.0001694198,0.00009043915],"domain_scores_gemma":[0.9907505,0.006442396,0.001026373,0.0006080222,0.0006112798,0.0005613852],"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.0002294602,0.00007049141,0.0056195,0.0004427169,0.0001657415,0.0004050651,0.000577012,0.140512,0.00814627,0.7906434,0.007470384,0.04571789],"study_design_scores_gemma":[0.0000268195,0.00008075366,0.003369819,0.00004392502,0.00008457416,0.000539356,0.0001445307,0.2136865,0.001526705,0.775949,0.004509504,0.00003851063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6651569,0.002931633,0.2994997,0.003038744,0.0003382041,0.00004610223,0.001805839,0.0008151595,0.02636773],"genre_scores_gemma":[0.9792494,0.002110923,0.01359754,0.0002077498,0.0005375618,0.00009009298,0.0008508129,0.0001604611,0.00319535],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004692217,"threshold_uncertainty_score":0.01569706,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2073490544","doi":"10.1016/j.disc.2005.09.015","title":"The metric dimension of Cayley digraphs","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":118,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Metric dimension; Cayley graph; Vertex (graph theory); Discrete mathematics; Connectivity; Graph; Line graph; Pathwidth","authors":[{"name":"Melodie Fehr","is_ca":true},{"name":"Shonda Gosselin","is_ca":true},{"name":"Ortrud R. Oellermann","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008927144760715572,"gpt":0.2222670857452978,"spread":0.2133399409845822,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001109552,0.0006935869,0.001020425,0.002586215,0.001978365,0.004630624,0.001788491,0.001501851,0.003986643],"category_scores_gemma":[0.006975085,0.0007507732,0.000557816,0.003275759,0.003242123,0.007876006,0.002105288,0.002798838,0.0003478648],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002278218,"about_ca_system_score_gemma":0.0007927246,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002045627,"about_ca_topic_score_gemma":0.001914453,"domain_scores_codex":[0.9990764,0.0003412065,0.00004773602,0.0002026454,0.0002089347,0.0001230951],"domain_scores_gemma":[0.9930378,0.003986409,0.0009036442,0.0006019124,0.0004925862,0.000977813],"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.00004403866,0.00001621591,0.0008370375,0.00004834483,0.00001319962,0.00002315612,0.0001780274,0.00339623,0.0004141979,0.9875288,0.002067884,0.005432763],"study_design_scores_gemma":[0.00001020172,0.00000829623,0.000465919,0.00001264901,0.000007898369,0.0000415544,0.00007680003,0.01126964,0.0002085347,0.9858001,0.002085335,0.00001290197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7852811,0.004226471,0.1458612,0.007082487,0.0003591592,0.00005119861,0.001785829,0.0002480538,0.05510455],"genre_scores_gemma":[0.9700783,0.001816586,0.01969275,0.0004844686,0.0004174481,0.00007912851,0.0008190165,0.00007676014,0.006535476],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004630624,"threshold_uncertainty_score":0.01652974,"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","authors":[{"name":"Stephen Finbow","is_ca":true},{"name":"Andrew D. King","is_ca":true},{"name":"Gary MacGillivray","is_ca":true},{"name":"Roméo Rizzi","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001783112,0.001215574,0.001878414,0.0009337323,0.003538867,0.002944254,0.004018404,0.005377738,0.0161448],"category_scores_gemma":[0.006832984,0.0009471957,0.001526178,0.00115823,0.002547635,0.006803293,0.002837547,0.003661619,0.001565564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001679833,"about_ca_system_score_gemma":0.001778612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00594076,"about_ca_topic_score_gemma":0.005599359,"domain_scores_codex":[0.998962,0.0002877525,0.00003216514,0.000237931,0.0001102075,0.0003700175],"domain_scores_gemma":[0.996089,0.002330677,0.0003675257,0.0003437563,0.0001941329,0.0006748979],"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.002969215,0.001026152,0.00521074,0.001673265,0.0002494433,0.001775873,0.002106922,0.1994385,0.008343796,0.5807166,0.08450775,0.1119817],"study_design_scores_gemma":[0.0004005561,0.0002585075,0.001450873,0.0001951983,0.0001076965,0.0008198426,0.002858218,0.2043599,0.00494644,0.7624148,0.02212138,0.00006661235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5500996,0.002219798,0.3629513,0.01558883,0.0006726093,0.0006414821,0.002289545,0.0006180073,0.06491888],"genre_scores_gemma":[0.8020613,0.002148939,0.1350031,0.001135249,0.0004411947,0.0003223991,0.002892919,0.0003780362,0.0556169],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0161448,"threshold_uncertainty_score":0.0540098,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007327392","doi":"10.1016/s0012-365x(02)00349-7","title":"A partition-based approach towards constructing Galois (concept) lattices","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":106,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Lattice Miner; Binary relation; Formal concept analysis; Binary number; Mathematics; Lattice (music); Complete lattice; Galois theory; Concept class; Computer science; Theoretical computer science; Algorithm; Discrete mathematics; Universality (dynamical systems); Arithmetic","authors":[{"name":"Petko Valtchev","is_ca":true},{"name":"Rokia Missaoui","is_ca":true},{"name":"P. Lebrun","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04802399937323873,"gpt":0.2501238070432198,"spread":0.2020998076699811,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002525358,0.0007588421,0.001451027,0.002983886,0.001868033,0.005274544,0.002051726,0.001080344,0.003686973],"category_scores_gemma":[0.006113538,0.0009177388,0.00281377,0.002899169,0.003149998,0.005811413,0.004329617,0.003144341,0.001060246],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001248266,"about_ca_system_score_gemma":0.0009810199,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001183203,"about_ca_topic_score_gemma":0.001432166,"domain_scores_codex":[0.9974002,0.001035138,0.0001803192,0.000385457,0.0008153824,0.0001834426],"domain_scores_gemma":[0.9972357,0.001399987,0.0001275728,0.000592899,0.0004556753,0.0001882147],"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.00007607762,0.00004292958,0.0003012104,0.0001586809,0.00006336495,0.00007819224,0.0006995281,0.01440386,0.002714634,0.9215198,0.001449235,0.05849244],"study_design_scores_gemma":[0.0000236758,0.00005647349,0.0001429434,0.00004580023,0.00004488727,0.0001095411,0.0002062093,0.05448656,0.002640386,0.9320377,0.01016918,0.00003663456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007685124,0.0001755928,0.9891791,0.000135975,0.00003722036,0.00005113336,0.0000767919,0.0001357677,0.002523307],"genre_scores_gemma":[0.1177648,0.0002720196,0.8788421,0.0001126986,0.00006258879,0.0001250694,0.0003023234,0.0001092692,0.002409122],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005274544,"threshold_uncertainty_score":0.01335555,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2030083434","doi":"10.1016/s0012-365x(03)00287-5","title":"Generalized cover-free families","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","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":"Lakehead University; University of Waterloo","funders":"","keywords":"Cover (algebra); Generalization; Mathematics; Set (abstract data type); Combinatorics; Set cover problem; Discrete mathematics; Computer science","authors":[{"name":"D. R. Stinson","is_ca":true},{"name":"R. Wei","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01802210635800287,"gpt":0.2506576086366595,"spread":0.2326355022786567,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000644605,0.0006475056,0.0007578076,0.001849897,0.001453276,0.001547577,0.0008170775,0.0008530599,0.009441488],"category_scores_gemma":[0.002440079,0.0004212326,0.0007348753,0.0009919944,0.001565845,0.002993445,0.002680482,0.001780526,0.0007432983],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009572222,"about_ca_system_score_gemma":0.0003713247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005567083,"about_ca_topic_score_gemma":0.0005516504,"domain_scores_codex":[0.9994304,0.00009841203,0.00001833841,0.0001054037,0.0002497993,0.00009758111],"domain_scores_gemma":[0.9990076,0.0003475137,0.0001090297,0.0001871134,0.0001691871,0.00017949],"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.00003464711,0.00001099188,0.0002258968,0.00003256062,0.00001180032,0.00009379841,0.0001377184,0.002972675,0.0009642873,0.9862632,0.001678418,0.007574066],"study_design_scores_gemma":[0.00001719647,0.00002170918,0.000409368,0.00001613537,0.00001390158,0.000283249,0.00009385152,0.01620017,0.0008523349,0.9739455,0.008135732,0.00001084093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4377727,0.001737176,0.3699645,0.002025846,0.0003051415,0.00008633759,0.0006496399,0.0004754763,0.1869833],"genre_scores_gemma":[0.9283039,0.001166053,0.02250065,0.0003441328,0.0002751145,0.0001087477,0.0006745446,0.0002139892,0.04641291],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009441488,"threshold_uncertainty_score":0.03158492,"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","authors":[{"name":"Gilles Caporossi","is_ca":true},{"name":"Pierre Hansen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003811808,0.0005527025,0.001403844,0.001589454,0.001969141,0.002914288,0.004877081,0.002706543,0.00915898],"category_scores_gemma":[0.02519314,0.0005674963,0.001574994,0.001626746,0.003796926,0.008140903,0.005469635,0.003199117,0.00126506],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009215469,"about_ca_system_score_gemma":0.001109995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001230163,"about_ca_topic_score_gemma":0.002132226,"domain_scores_codex":[0.9968836,0.001330941,0.0001438099,0.000570148,0.0006605219,0.0004109833],"domain_scores_gemma":[0.9801276,0.01100324,0.000810468,0.006345293,0.001081151,0.0006323042],"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.0008093426,0.0002848284,0.006428243,0.0004006548,0.0001044934,0.0002031289,0.0006114779,0.03293359,0.003088039,0.8243534,0.01262203,0.1181607],"study_design_scores_gemma":[0.0001123432,0.00009580424,0.0006849482,0.00005245261,0.00004773323,0.0001430559,0.0002035473,0.169977,0.00295765,0.8207329,0.004954034,0.0000385657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1254208,0.0007255853,0.8350186,0.004638399,0.0002745801,0.000249247,0.0003832227,0.001525786,0.03176368],"genre_scores_gemma":[0.593957,0.0003183105,0.3948701,0.0006848307,0.0001946167,0.0002878814,0.000712922,0.0002899503,0.008684418],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00915898,"threshold_uncertainty_score":0.03063983,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2020661143","doi":"10.1016/s0012-365x(01)00297-7","title":"Galois theory for minors of finite functions","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Boolean function; Discrete mathematics; Complement (music); Generalization; Closure (psychology); Complete Boolean algebra; Bounded function; Combinatorics; Two-element Boolean algebra; Separable space; Algebra over a field; Pure mathematics","authors":[{"name":"Nicholas Pippenger","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02510157427757449,"gpt":0.2345089131926011,"spread":0.2094073389150266,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001845993,0.001811891,0.001803195,0.00428796,0.003795404,0.006068194,0.00126635,0.001495916,0.008502511],"category_scores_gemma":[0.003374202,0.0009275126,0.002159166,0.002886509,0.006519181,0.0111668,0.004564294,0.005135244,0.001216094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002892109,"about_ca_system_score_gemma":0.0008745981,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001003202,"about_ca_topic_score_gemma":0.0007652715,"domain_scores_codex":[0.9985947,0.0003705457,0.00006750631,0.0003371554,0.0002789086,0.0003511943],"domain_scores_gemma":[0.9976352,0.001115398,0.0001969807,0.0003179179,0.000221003,0.0005135119],"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.0000467145,0.00002049113,0.0001668464,0.00002127019,0.000009737636,0.00004938252,0.00036223,0.0002248195,0.0003613367,0.9956974,0.0004938937,0.002545872],"study_design_scores_gemma":[0.00001606625,0.00002231808,0.0001364613,0.000008718051,0.00001335118,0.00008569643,0.0000784249,0.0006933786,0.0003061275,0.99632,0.002307583,0.00001183571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5821571,0.004050715,0.252432,0.005882393,0.001214376,0.0001530963,0.0007998188,0.001002126,0.1523084],"genre_scores_gemma":[0.9655032,0.0009448184,0.01028769,0.0004640424,0.0008419086,0.0000815996,0.0003091826,0.0001523527,0.02141523],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008502511,"threshold_uncertainty_score":0.02844375,"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","authors":[{"name":"Kathie Cameron","is_ca":true},{"name":"R. Sritharan","is_ca":false},{"name":"Yingwen Tang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008730702,0.001064324,0.002356849,0.001569495,0.002297076,0.002932981,0.003959285,0.003006223,0.00879702],"category_scores_gemma":[0.009219709,0.001234398,0.001440697,0.002919259,0.00114555,0.006364988,0.003093076,0.002020021,0.001703369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001550666,"about_ca_system_score_gemma":0.001609619,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001578675,"about_ca_topic_score_gemma":0.002923079,"domain_scores_codex":[0.9989287,0.0001895736,0.00008965224,0.0003859316,0.0001805332,0.0002255276],"domain_scores_gemma":[0.9946774,0.003152857,0.0005386531,0.0006436832,0.0003545374,0.0006328374],"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.005672481,0.003018073,0.02486523,0.005247461,0.0008288176,0.001587927,0.00277361,0.1327887,0.09942275,0.2546657,0.03287737,0.4362519],"study_design_scores_gemma":[0.0006211387,0.000903848,0.004641459,0.0002263694,0.0003744658,0.0009243553,0.002008105,0.352772,0.042199,0.584122,0.01111331,0.000093773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7124572,0.0006293666,0.259632,0.002111083,0.0001725557,0.0006343215,0.002483764,0.001450847,0.02042881],"genre_scores_gemma":[0.7364275,0.0004208157,0.2493555,0.0003960594,0.0001023141,0.0002523786,0.003258786,0.0003793536,0.0094073],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00879702,"threshold_uncertainty_score":0.02942896,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2075649093","doi":"10.1016/s0012-365x(03)00283-8","title":"New combinatorial designs and their applications to authentication codes and secret sharing schemes","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":89,"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":"Secret sharing; Mathematics; Converse; Combinatorial design; Discrete mathematics; Upper and lower bounds; Type (biology); Construct (python library); Combinatorics; Scheme (mathematics); Equivalence (formal languages); Cryptography; Computer science; Algorithm","authors":[{"name":"Wakaha Ogata","is_ca":false},{"name":"Kaoru Kurosawa","is_ca":false},{"name":"Douglas R. Stinson","is_ca":true},{"name":"Hajime Saido","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01896666334119578,"gpt":0.2364626543621001,"spread":0.2174959910209043,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001787416,0.0008912134,0.0008193257,0.002272654,0.001241023,0.003212344,0.001346241,0.001860618,0.007089746],"category_scores_gemma":[0.009788048,0.0008910584,0.0009018105,0.003122555,0.003159225,0.002957284,0.001620037,0.002633634,0.001160076],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001211413,"about_ca_system_score_gemma":0.0008573311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003271527,"about_ca_topic_score_gemma":0.0008128486,"domain_scores_codex":[0.9986776,0.0006315827,0.00007428678,0.0001796959,0.0003532723,0.00008366087],"domain_scores_gemma":[0.9938433,0.003953041,0.0005711527,0.0007326651,0.0006536709,0.0002461475],"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.00004798116,0.00003610617,0.0001180892,0.00008217079,0.00001162905,0.00005059983,0.00006411661,0.01364032,0.001279699,0.9598591,0.001720884,0.02308922],"study_design_scores_gemma":[0.00004317479,0.00004533404,0.00008586446,0.00003524986,0.00001773482,0.0001467557,0.00003396078,0.08249789,0.0007575283,0.9095948,0.00671137,0.00003039589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03229604,0.002037098,0.927511,0.001606168,0.0005786796,0.000133532,0.0001809557,0.0002329624,0.0354235],"genre_scores_gemma":[0.4016494,0.004525748,0.5648475,0.0009510584,0.001312019,0.0006517385,0.0003085137,0.0001958732,0.02555818],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007089746,"threshold_uncertainty_score":0.02371752,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2012220350","doi":"10.1016/j.disc.2005.12.038","title":"A note on <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-cop, <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" overflow=\"scroll\"><mml:mi>l</mml:mi></mml:math>-robber games on graphs","year":2006,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria; Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Algorithm; Mathematics; Computer science; Combinatorics","authors":[{"name":"Geňa Hahn","is_ca":true},{"name":"Gary MacGillivray","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02307160409932155,"gpt":0.261477874880912,"spread":0.2384062707815904,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001643611,0.001466121,0.001076147,0.001876311,0.001734692,0.003707797,0.002229773,0.002120708,0.3468299],"category_scores_gemma":[0.007070913,0.0008986583,0.001390522,0.002705608,0.001051892,0.0066438,0.001711902,0.004604167,0.2025376],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002774052,"about_ca_system_score_gemma":0.001768568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01638447,"about_ca_topic_score_gemma":0.03618428,"domain_scores_codex":[0.9989519,0.0002716326,0.0001064529,0.0001282347,0.0004449592,0.0000967178],"domain_scores_gemma":[0.9953586,0.002200774,0.0001345875,0.0004014431,0.001556885,0.0003477454],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002492234,0.00002244392,0.00002916283,0.0000550974,0.000002747448,0.00003267858,0.0000392495,0.000106587,0.00022659,0.01158035,0.9781737,0.009706474],"study_design_scores_gemma":[0.00001423796,0.00001546116,0.0002793926,0.00006105578,0.000003000991,0.00005460731,0.0000394758,0.0003507468,0.0003789566,0.01171623,0.9870613,0.00002556493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.001426071,0.004451835,0.091182,0.1240924,0.06770604,0.0003957105,0.01918564,0.01525244,0.6763079],"genre_scores_gemma":[0.01408483,0.006663219,0.06869866,0.02662498,0.01764171,0.0004689215,0.01454383,0.01278688,0.8384869],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3468299,"threshold_uncertainty_score":0.9316679,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139563752","doi":"10.1016/s0012-365x(03)00158-4","title":"On the iteration of certain quadratic maps over GF(p)","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":88,"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; Quadratic equation; GF(2); Combinatorics; Discrete mathematics; Finite field","authors":[{"name":"Troy Vasiga","is_ca":true},{"name":"Jeffrey Shallit","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01583649233206545,"gpt":0.2384164064629816,"spread":0.2225799141309162,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001360723,0.0005960405,0.0006896835,0.001004064,0.001504456,0.002345107,0.0007340609,0.0009814668,0.006581309],"category_scores_gemma":[0.005820748,0.0003252485,0.0008013998,0.0009774049,0.002629788,0.003119377,0.001875646,0.001835916,0.001102199],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001030384,"about_ca_system_score_gemma":0.0009559314,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009523142,"about_ca_topic_score_gemma":0.0008404881,"domain_scores_codex":[0.9982483,0.0005183379,0.00007079125,0.0001965355,0.0004919223,0.0004740923],"domain_scores_gemma":[0.9967528,0.001958261,0.0003290016,0.0003215084,0.0003892955,0.0002491201],"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.0004552948,0.00008264661,0.0009423079,0.00005545203,0.00001700221,0.0002372559,0.0007144945,0.01526197,0.003699431,0.9627178,0.001488919,0.01432748],"study_design_scores_gemma":[0.0000674877,0.0001676412,0.0005160148,0.00003760891,0.00001677486,0.000301713,0.0001836647,0.1201689,0.009579275,0.8647522,0.004163542,0.00004510591],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5911467,0.0004230949,0.3013074,0.001068891,0.0002367328,0.0001657918,0.0002008972,0.0004539999,0.1049964],"genre_scores_gemma":[0.931466,0.000344297,0.0397635,0.0001720632,0.000227779,0.0001339511,0.0002600787,0.0001928903,0.02743941],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006581309,"threshold_uncertainty_score":0.02201664,"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","authors":[{"name":"Thérèse Biedl","is_ca":true},{"name":"Erik D. Demaine","is_ca":false},{"name":"Christian A. Duncan","is_ca":false},{"name":"Rudolf Fleischer","is_ca":false},{"name":"Stephen Kobourov","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01326416,0.006437758,0.009555369,0.01063121,0.006363899,0.01740915,0.01592717,0.007268539,0.03597095],"category_scores_gemma":[0.1058825,0.006822857,0.004671704,0.01629426,0.01000856,0.04950835,0.01822986,0.0174145,0.005821025],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.009890309,"about_ca_system_score_gemma":0.004043132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003188593,"about_ca_topic_score_gemma":0.00522146,"domain_scores_codex":[0.9852771,0.00317545,0.0006759708,0.002924809,0.00399409,0.003952522],"domain_scores_gemma":[0.8708556,0.1005779,0.005387488,0.01089637,0.004283229,0.007999386],"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.002543444,0.0004797941,0.00190397,0.00126369,0.00024701,0.0001775089,0.0009168976,0.04709711,0.003310052,0.8682785,0.02818522,0.04559685],"study_design_scores_gemma":[0.000104804,0.00006011149,0.000560595,0.0001394146,0.0001384449,0.0001178703,0.0001161406,0.04067389,0.00114701,0.9521908,0.004710164,0.0000408239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1612966,0.0218468,0.5675094,0.02786881,0.001600117,0.0004744592,0.007836405,0.004339767,0.2072277],"genre_scores_gemma":[0.7987635,0.01212357,0.1311104,0.005119591,0.004515278,0.0009646643,0.005775406,0.003256081,0.0383716],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03597095,"threshold_uncertainty_score":0.1203349,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2132838208","doi":"10.1016/s0012-365x(02)00352-7","title":"Lattice animals and heaps of dimers","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":83,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"University of Melbourne","keywords":"Bijection; Mathematics; Combinatorics; Algebraic number; Enumeration; Generating function; Constant (computer programming); Exponential growth; Discrete mathematics; Function (biology); Biology; Evolutionary biology","authors":[{"name":"Mireille Bousquet‐Mélou","is_ca":false},{"name":"Andrew Rechnitzer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05433294052060191,"gpt":0.2997596365732926,"spread":0.2454266960526907,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007649033,0.0002589829,0.0008752,0.001918355,0.002551268,0.005045807,0.001333586,0.001832468,0.007722961],"category_scores_gemma":[0.004824174,0.0006265801,0.000572268,0.00164916,0.00467424,0.006771339,0.002647359,0.001797829,0.0007354831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008733015,"about_ca_system_score_gemma":0.0005296827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000916346,"about_ca_topic_score_gemma":0.001166122,"domain_scores_codex":[0.9994597,0.0001366417,0.0000352019,0.000101456,0.0001601819,0.0001069125],"domain_scores_gemma":[0.9973598,0.001172068,0.0003257889,0.0005255077,0.0002403331,0.0003765755],"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.00001438515,0.000006380877,0.000143669,0.00001839354,0.000003522296,0.00002300193,0.000142858,0.00100876,0.0002384162,0.9957681,0.0005526133,0.002079924],"study_design_scores_gemma":[0.00001180899,0.000004455269,0.00009326639,0.000006927464,0.000003017457,0.00004523839,0.00009973555,0.002313925,0.0001525085,0.9945215,0.002742159,0.000005302735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.630928,0.005345108,0.2355506,0.004993376,0.0006900397,0.00009166333,0.0006650087,0.0006418648,0.1210943],"genre_scores_gemma":[0.9530542,0.001156386,0.02746907,0.0004603259,0.0003205347,0.0001057133,0.0003280699,0.0001185144,0.01698717],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007722961,"threshold_uncertainty_score":0.02583593,"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)","authors":[{"name":"Kathie Cameron","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001445428,0.0006089981,0.001380794,0.003879402,0.003465623,0.005722569,0.002755654,0.002170136,0.0140622],"category_scores_gemma":[0.008498328,0.001383496,0.001358011,0.006120078,0.002309907,0.01275832,0.0035276,0.004050708,0.001775228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00203093,"about_ca_system_score_gemma":0.0009476664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001349552,"about_ca_topic_score_gemma":0.001464275,"domain_scores_codex":[0.9980429,0.0004316753,0.0001466782,0.0004950346,0.0005360774,0.0003474709],"domain_scores_gemma":[0.9935569,0.003136626,0.001064716,0.0007279522,0.000710888,0.0008029538],"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.0001323323,0.00009796055,0.0009921155,0.00007927007,0.00002286595,0.0001122929,0.0005099595,0.001496011,0.0008399452,0.9811952,0.001981449,0.01254051],"study_design_scores_gemma":[0.00002908031,0.00001979317,0.0003651145,0.00002480842,0.00004091501,0.0001422984,0.0002486936,0.007916015,0.0009348018,0.9864606,0.003805812,0.00001210666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6140175,0.001159191,0.2619074,0.002346947,0.0002701615,0.0002307829,0.001537465,0.001182436,0.1173482],"genre_scores_gemma":[0.9122486,0.0009200334,0.05430849,0.0004347505,0.0002334258,0.0002024529,0.00207294,0.0003556834,0.02922381],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0140622,"threshold_uncertainty_score":0.04704273,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2132073309","doi":"10.1016/s0012-365x(03)00197-3","title":"Coloring the hypergraph of maximal cliques of a graph with no long path","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":80,"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; Hypergraph; Mathematics; Graph; Discrete mathematics; Fractional coloring; Graph coloring; Graph power; Line graph","authors":[{"name":"Sylvain Gravier","is_ca":false},{"name":"Chı́nh T. Hoàng","is_ca":true},{"name":"Frédéric Maffray","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01983438949883126,"gpt":0.2645574246920283,"spread":0.244723035193197,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007200694,0.0005592758,0.0006754597,0.001213925,0.002086371,0.002661354,0.001518005,0.001079825,0.006347728],"category_scores_gemma":[0.003410106,0.0007425362,0.0005972745,0.001448339,0.001745783,0.003677233,0.001383657,0.001541573,0.0008211652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001325351,"about_ca_system_score_gemma":0.0009575224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002151375,"about_ca_topic_score_gemma":0.003635648,"domain_scores_codex":[0.9992873,0.0002141222,0.00002529723,0.000214451,0.0001077058,0.0001511807],"domain_scores_gemma":[0.9960908,0.001933519,0.0004139152,0.0005684098,0.0003659099,0.0006272923],"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.0005045419,0.0001948487,0.003088763,0.0002886215,0.00008578768,0.0003277483,0.0007879321,0.01372191,0.01777059,0.9203133,0.009903252,0.03301276],"study_design_scores_gemma":[0.00004908514,0.00004182354,0.001033322,0.00003311986,0.00003339351,0.0001904528,0.0002993045,0.02948318,0.003738611,0.9592916,0.00578462,0.00002153717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6431047,0.0007439355,0.2856398,0.002252323,0.0002496619,0.0001847527,0.001666413,0.0007543761,0.06540396],"genre_scores_gemma":[0.8575771,0.0005800971,0.1182996,0.0004254013,0.000203994,0.0002425364,0.001295124,0.0003598248,0.02101624],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006347728,"threshold_uncertainty_score":0.02123523,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2088696758","doi":"10.1016/s0012-365x(99)00384-2","title":"Diffraction from visible lattice points and kth power free integers","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Quasicrystal Structures and Properties","field":"Materials 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":"University of Alberta","funders":"","keywords":"Mathematics; Diffraction; Lattice (music); Point (geometry); Combinatorics; Dimension (graph theory); Discrete mathematics; Geometry; Physics; Quantum mechanics","authors":[{"name":"Michael Baake","is_ca":false},{"name":"Robert V. Moody","is_ca":true},{"name":"P. A. B. Pleasants","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01012602875415142,"gpt":0.2289366198049502,"spread":0.2188105910507988,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004383766,0.000715618,0.0006660878,0.001609176,0.0009366852,0.002843628,0.0008668256,0.00121289,0.008718931],"category_scores_gemma":[0.002179936,0.0005905334,0.0004277709,0.001376,0.002630542,0.002971394,0.001494731,0.002546507,0.0009632936],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006828146,"about_ca_system_score_gemma":0.0002751172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000400553,"about_ca_topic_score_gemma":0.000473815,"domain_scores_codex":[0.9994115,0.0001506074,0.00002904943,0.00006453558,0.0002594269,0.00008482799],"domain_scores_gemma":[0.9991358,0.0003943481,0.0001196343,0.0002004657,0.00008593789,0.00006382721],"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.00007909286,0.00001072248,0.0001858217,0.00005011226,0.000004055372,0.0001095516,0.0001622277,0.0007113753,0.004386083,0.9871498,0.001186666,0.00596445],"study_design_scores_gemma":[0.00003082107,0.0000220074,0.0004570518,0.00003124115,0.000004931527,0.0005275187,0.0001760375,0.006184158,0.00470553,0.9828811,0.004955493,0.00002417794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.501597,0.005513217,0.1586542,0.004734969,0.001340996,0.00005508786,0.0004270822,0.0004796889,0.3271977],"genre_scores_gemma":[0.9469044,0.001391188,0.02448915,0.0003689507,0.0003114818,0.00003334827,0.0002058504,0.0001612635,0.02613436],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008718931,"threshold_uncertainty_score":0.02916777,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2035417355","doi":"10.1016/j.disc.2008.04.004","title":"The capture time of a graph","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":74,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Université du Québec à Montréal; Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; McGill University","keywords":"Chordal graph; Mathematics; Combinatorics; Discrete mathematics; Time complexity; Bounded function; Indifference graph; Graph","authors":[{"name":"Anthony Bonato","is_ca":true},{"name":"Petr A. Golovach","is_ca":false},{"name":"G. Hahn","is_ca":true},{"name":"Jan Kratochvı́l","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06822045206016554,"gpt":0.3408326131160317,"spread":0.2726121610558662,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001857417,0.0008726864,0.001441644,0.002068932,0.001375544,0.004481761,0.002412082,0.003398986,0.01557441],"category_scores_gemma":[0.01818038,0.0009229743,0.000939161,0.001592148,0.003335216,0.009202267,0.002511536,0.003145369,0.0009723235],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002811696,"about_ca_system_score_gemma":0.001623318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003683937,"about_ca_topic_score_gemma":0.0019313,"domain_scores_codex":[0.9985525,0.0004735643,0.00004309942,0.0003293512,0.000240978,0.000360603],"domain_scores_gemma":[0.9808559,0.01341447,0.001257776,0.001072943,0.0009614418,0.002437467],"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.000236763,0.00004975291,0.000865226,0.0001459488,0.00005100782,0.0001270723,0.0005297506,0.03185798,0.002888766,0.9533572,0.003348022,0.006542523],"study_design_scores_gemma":[0.00008442819,0.0001592744,0.001125733,0.00008633034,0.00007403348,0.0002308483,0.0004678063,0.2143008,0.001648351,0.7776378,0.004114931,0.00006968292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5579178,0.001726472,0.3695656,0.007855683,0.0002475106,0.0001888669,0.001520742,0.0007064682,0.06027084],"genre_scores_gemma":[0.9733792,0.0007548458,0.01071571,0.0003607554,0.0001114267,0.0001336989,0.0004893885,0.0001671329,0.01388784],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01557441,"threshold_uncertainty_score":0.05210167,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116924935","doi":"10.1016/s0012-365x(03)00272-3","title":"On group-divisible designs with block size four and group-type 6um1","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":72,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Group (periodic table); Block size; Block (permutation group theory); Type (biology); Class (philosophy); Spectrum (functional analysis); Construct (python library); Discrete mathematics; Automorphism group; Automorphism; Computer science","authors":[{"name":"Gennian Ge","is_ca":false},{"name":"Rolf S. Rees","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01639847693871242,"gpt":0.202553247140071,"spread":0.1861547702013586,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002127032,0.0009239761,0.0008513956,0.00151816,0.001248622,0.001827924,0.001027038,0.001507478,0.0067565],"category_scores_gemma":[0.009132831,0.0006370734,0.0005866471,0.001467904,0.002097179,0.001919174,0.001707389,0.001293218,0.00091796],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001377346,"about_ca_system_score_gemma":0.0008862996,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007027793,"about_ca_topic_score_gemma":0.001017531,"domain_scores_codex":[0.9981397,0.000885214,0.00006506115,0.0001895735,0.0004387728,0.0002815026],"domain_scores_gemma":[0.9927623,0.004642449,0.0009534538,0.0007612693,0.0005885627,0.0002920348],"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.0003854244,0.0000371398,0.0004390872,0.00009411073,0.00002006008,0.0001504207,0.0002602158,0.0142056,0.003497509,0.9610962,0.00202871,0.01778554],"study_design_scores_gemma":[0.0001090779,0.0001540916,0.0002799407,0.00006945519,0.00002971762,0.0002727069,0.00009993234,0.07054199,0.00313646,0.9194855,0.005779408,0.0000415915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3480882,0.001426091,0.5581511,0.001436873,0.0004530934,0.0001685806,0.0002694232,0.0003510055,0.08965573],"genre_scores_gemma":[0.8870853,0.001023485,0.08439453,0.0006360305,0.0003898941,0.0002003306,0.0002020442,0.0001278703,0.02594036],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0067565,"threshold_uncertainty_score":0.0226028,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994268719","doi":"10.1016/s0012-365x(02)00520-4","title":"On self-dual codes over some prime fields","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":72,"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; Dual (grammatical number); Prime (order theory); Combinatorics; Discrete mathematics; Separable space; Minimum distance; Block code; Linear code; Finite field; Algorithm; Decoding methods","authors":[{"name":"Koichi Betsumiya","is_ca":false},{"name":"S. Georgiou","is_ca":false},{"name":"T. Aaron Gulliver","is_ca":true},{"name":"Masaaki Harada","is_ca":false},{"name":"Christos Koukouvinos","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0115335673435003,"gpt":0.2415222410919872,"spread":0.2299886737484869,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001377214,0.001173118,0.001051206,0.003700879,0.00298231,0.003108136,0.000983744,0.00175806,0.005573838],"category_scores_gemma":[0.004876408,0.0007557023,0.0009670993,0.002838625,0.004463438,0.006289139,0.003989411,0.003517271,0.0007940971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001948081,"about_ca_system_score_gemma":0.001058692,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007674189,"about_ca_topic_score_gemma":0.0005977021,"domain_scores_codex":[0.9989409,0.0002712643,0.00004531401,0.0001528383,0.0003221977,0.0002674079],"domain_scores_gemma":[0.9961733,0.002048237,0.0005247209,0.0003907953,0.0004199146,0.0004429431],"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.00003971918,0.0000137939,0.0001134484,0.00001783593,0.000002960837,0.00006128766,0.0001461549,0.0005766414,0.000239842,0.9967602,0.000531635,0.001496398],"study_design_scores_gemma":[0.00001301356,0.00001329648,0.00007434701,0.00001497441,0.00000535134,0.0001084729,0.00004723458,0.002152585,0.0003018152,0.9959287,0.001331222,0.000008900797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6609262,0.002340487,0.1568193,0.007612118,0.001012779,0.0001226147,0.0006084815,0.0003048858,0.1702532],"genre_scores_gemma":[0.9486635,0.001657924,0.01152518,0.0007987978,0.0009209341,0.00009620673,0.0003706191,0.0001281204,0.03583885],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005573838,"threshold_uncertainty_score":0.01864636,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1979144155","doi":"10.1016/s0012-365x(99)00246-0","title":"A lower bound on the probability of a finite union of events","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Pairwise comparison; Upper and lower bounds; Event (particle physics); Combinatorics; Computation; Discrete mathematics; Statistics; Algorithm; Mathematical analysis","authors":[{"name":"H. Kuai","is_ca":true},{"name":"Fady Alajaji","is_ca":true},{"name":"Glen Takahara","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03659762619660558,"gpt":0.2633228267229263,"spread":0.2267252005263208,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01849457,0.003090172,0.005219556,0.007798259,0.004191075,0.01310167,0.008852357,0.00748182,0.01811117],"category_scores_gemma":[0.1288829,0.003287063,0.004732828,0.006334508,0.007988513,0.02365097,0.009676214,0.01610004,0.003214472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005334598,"about_ca_system_score_gemma":0.002819475,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002384304,"about_ca_topic_score_gemma":0.002210383,"domain_scores_codex":[0.9812505,0.005273068,0.001122488,0.004069486,0.006549809,0.001734712],"domain_scores_gemma":[0.7453956,0.2269177,0.004647236,0.01282591,0.006255835,0.003957767],"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.0003395709,0.0001298461,0.001616507,0.000568783,0.0002125914,0.0002386434,0.000495971,0.044537,0.001402425,0.913816,0.006629608,0.030013],"study_design_scores_gemma":[0.00003818432,0.00004590293,0.0004617318,0.0002279987,0.0001189855,0.0002982092,0.0000607186,0.1746533,0.0009617254,0.8173451,0.005734516,0.00005366806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01100763,0.003169781,0.9672418,0.003543204,0.0003144784,0.00005493204,0.0007043496,0.0004631942,0.01350063],"genre_scores_gemma":[0.4108135,0.009546299,0.540893,0.00405417,0.004651028,0.001116388,0.004322495,0.001427184,0.02317579],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01849457,"threshold_uncertainty_score":0.09780985,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2020519696","doi":"10.1016/s0012-365x(01)00162-5","title":"Complex Golay sequences: structure and applications","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge; University of Manitoba","funders":"","keywords":"Binary Golay code; Mathematics; Hadamard transform; Complementary sequences; Ternary Golay code; Combinatorics; Factorization; Hadamard matrix; Complex Hadamard matrix; Discrete mathematics; Autocorrelation; Algorithm; Mathematical analysis","authors":[{"name":"R. Craigen","is_ca":true},{"name":"W. H. Holzmann","is_ca":true},{"name":"Hadi Kharaghani","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05757504967536323,"gpt":0.3001317181726881,"spread":0.2425566684973249,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000474981,0.0008870246,0.0006455941,0.003519726,0.001006296,0.002463199,0.0006782189,0.001311081,0.005597304],"category_scores_gemma":[0.005364975,0.0003438365,0.0003056623,0.004188799,0.001586088,0.001850444,0.0009796694,0.001403989,0.001503326],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007528889,"about_ca_system_score_gemma":0.0006614478,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006839732,"about_ca_topic_score_gemma":0.0005043352,"domain_scores_codex":[0.9997386,0.00006644715,0.00001579636,0.00005315265,0.00009127427,0.00003460626],"domain_scores_gemma":[0.9975221,0.001052697,0.0004735803,0.0001512329,0.0005917281,0.0002086908],"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.0000765352,0.00003884434,0.0005830612,0.000138442,0.00001156461,0.0001453109,0.0002404357,0.008464605,0.00246916,0.9250364,0.004811561,0.0579841],"study_design_scores_gemma":[0.00002849393,0.0000587046,0.0006247219,0.00005962406,0.00001372867,0.0004631579,0.0001241161,0.07581829,0.00110893,0.9073378,0.01431893,0.00004348515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2401071,0.02169458,0.6524696,0.004458508,0.001580201,0.0001391166,0.0009520188,0.0006048008,0.07799409],"genre_scores_gemma":[0.8431281,0.01335405,0.1123025,0.000713468,0.001880008,0.0002114287,0.0007651774,0.0001902972,0.02745494],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005597304,"threshold_uncertainty_score":0.0187248,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2148534827","doi":"10.1016/j.disc.2005.11.002","title":"Contributions to zero-sum problems","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":63,"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":"Subsequence; Modulo; Mathematics; Generalization; Zero (linguistics); Sequence (biology); Integer (computer science); Combinatorics; Discrete mathematics; Computer science","authors":[{"name":"Sukumar Das Adhikari","is_ca":false},{"name":"Yanhan Chen","is_ca":false},{"name":"John Friedlander","is_ca":true},{"name":"Sergeĭ Konyagin","is_ca":false},{"name":"Francesco Pappalardi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02322831090994227,"gpt":0.3180201888731566,"spread":0.2947918779632144,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002126858,0.001609998,0.002204105,0.003990786,0.004036129,0.005021848,0.00321023,0.00272913,0.01038067],"category_scores_gemma":[0.009143458,0.0007440807,0.001329593,0.004707713,0.006943697,0.01067995,0.005762287,0.007544006,0.001849555],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002374701,"about_ca_system_score_gemma":0.001314278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008422365,"about_ca_topic_score_gemma":0.0007763895,"domain_scores_codex":[0.997978,0.0007693649,0.00007858343,0.0002940996,0.0006833443,0.0001965222],"domain_scores_gemma":[0.9952559,0.002966721,0.0002272469,0.0004846547,0.0005333251,0.0005321754],"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.000009556722,0.00001599095,0.00004735021,0.0000540809,0.000004691795,0.0000182782,0.00008288645,0.0004055279,0.00006801337,0.9939056,0.002503206,0.002884787],"study_design_scores_gemma":[0.000003855708,0.000001860058,0.00002215688,0.00001001753,0.000003950495,0.00002078084,0.00001487928,0.0009389914,0.00004809334,0.9958144,0.003117337,0.000003587953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1298925,0.02886993,0.1922382,0.03756116,0.01081393,0.0000669268,0.0005570432,0.000654956,0.5993453],"genre_scores_gemma":[0.7838297,0.01517506,0.0416902,0.005076056,0.01715943,0.0001615765,0.0005605355,0.0006106576,0.1357367],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01038067,"threshold_uncertainty_score":0.03472674,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1981970597","doi":"10.1016/j.disc.2006.03.054","title":"Sums of powers of the degrees of a graph","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":58,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Combinatorics; Sums of powers; Graph; Discrete mathematics","authors":[{"name":"Sebastian M. Cioabă","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02136883443742171,"gpt":0.2740425652291751,"spread":0.2526737307917534,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001224922,0.0009824792,0.00122563,0.003428835,0.001152149,0.003404723,0.001555334,0.0007153095,0.00962353],"category_scores_gemma":[0.00725976,0.0006639998,0.0009804571,0.001613431,0.002880176,0.007487434,0.002298214,0.002207555,0.001670338],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005595987,"about_ca_system_score_gemma":0.0003083927,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001960895,"about_ca_topic_score_gemma":0.0003589049,"domain_scores_codex":[0.9982623,0.0004580219,0.0001276575,0.0003533439,0.0005774306,0.000221258],"domain_scores_gemma":[0.9947286,0.002983747,0.0004556972,0.0006423463,0.000540354,0.0006492348],"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.00008567225,0.00003066937,0.0004948265,0.0001118665,0.00004935519,0.0001961362,0.0003272538,0.002009076,0.002867854,0.9728023,0.002272822,0.01875221],"study_design_scores_gemma":[0.00000574621,0.00001475258,0.0002778543,0.00002219685,0.00002394393,0.0002756549,0.00006800273,0.005367923,0.001039889,0.9880649,0.004825727,0.00001340875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4236047,0.002870542,0.4185882,0.002183718,0.001524642,0.0001075728,0.001033476,0.0006432756,0.1494439],"genre_scores_gemma":[0.909945,0.001969617,0.04757557,0.0004094722,0.001532486,0.0001622817,0.000592759,0.0004643261,0.0373484],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00962353,"threshold_uncertainty_score":0.0321939,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1745342855","doi":"10.1016/j.disc.2015.08.002","title":"A surprisingly simple de Bruijn sequence construction","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"De Bruijn sequence; Append; String (physics); Mathematics; Complement (music); Sequence (biology); Combinatorics; Amortized analysis; Discrete mathematics; Binary number; Simple (philosophy); Arithmetic; Computer science; Data structure; Programming language","authors":[{"name":"Joe Sawada","is_ca":true},{"name":"Aaron Williams","is_ca":false},{"name":"Dennis Wong","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05442664942256222,"gpt":0.3003084988839092,"spread":0.245881849461347,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008888227,0.0008496427,0.0008476243,0.001317146,0.001577127,0.001910548,0.00121895,0.001546887,0.01123348],"category_scores_gemma":[0.004667193,0.0005415383,0.0006970639,0.001638171,0.001949615,0.004187987,0.002893717,0.002435716,0.004043093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006175925,"about_ca_system_score_gemma":0.000903845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002850439,"about_ca_topic_score_gemma":0.0004226134,"domain_scores_codex":[0.9985825,0.0003611247,0.00007071681,0.0002800198,0.0005652769,0.0001403689],"domain_scores_gemma":[0.9977715,0.001157972,0.00009516734,0.0006234014,0.0002147492,0.0001372704],"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.0001408371,0.00009967486,0.0002165379,0.0001560305,0.00002088613,0.0002088901,0.0001857287,0.004022285,0.008841536,0.9127285,0.008005309,0.06537375],"study_design_scores_gemma":[0.0000426501,0.0000649286,0.0001278564,0.00003761877,0.00002246082,0.0004344065,0.00004657431,0.02012385,0.008954739,0.9483454,0.02175884,0.00004074062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07827208,0.001117881,0.8101584,0.003427241,0.001649467,0.0002095621,0.0005364544,0.001908596,0.1027203],"genre_scores_gemma":[0.5470174,0.00125538,0.3912754,0.001519621,0.0009234695,0.0003397572,0.0008730835,0.0009364773,0.05585941],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01123348,"threshold_uncertainty_score":0.03757972,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2015741724","doi":"10.1016/s0012-365x(01)00293-x","title":"On p-adic q-L-functions and sums of powers","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"advanced mathematical theories","field":"Mathematics","cited_by":58,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Simon Fraser University","keywords":"Mathematics; Combinatorics; Discrete mathematics","authors":[{"name":"Taekyun Kim","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04098667798335974,"gpt":0.3005052482776257,"spread":0.2595185702942659,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003053775,0.001911781,0.00153841,0.004784345,0.004046638,0.006393314,0.001796448,0.002005436,0.007284525],"category_scores_gemma":[0.006347482,0.0009629026,0.001623051,0.004051264,0.01072611,0.01366825,0.004188291,0.005410897,0.001465623],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002825171,"about_ca_system_score_gemma":0.0007840329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001325572,"about_ca_topic_score_gemma":0.001141526,"domain_scores_codex":[0.9986093,0.0005230734,0.00008967744,0.0002232875,0.0003344617,0.0002201411],"domain_scores_gemma":[0.9971159,0.001562844,0.0003112766,0.0002635763,0.0003974012,0.0003490796],"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.000006831731,0.000006304913,0.00004317585,0.00001203602,0.000002729563,0.00003138651,0.0001637689,0.0001221014,0.00008303147,0.9980411,0.0003520434,0.001135416],"study_design_scores_gemma":[0.000002957717,0.000002320675,0.00002825223,0.000005256042,0.000002148613,0.00002597693,0.00002996838,0.0002640345,0.00003042325,0.998673,0.0009325354,0.000003243575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2364756,0.01298096,0.2509313,0.01046761,0.002291192,0.00007680018,0.0003219169,0.0003738855,0.4860808],"genre_scores_gemma":[0.9032874,0.00550344,0.02888943,0.001783932,0.003147118,0.0001291015,0.0002473498,0.0002303846,0.05678186],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007284525,"threshold_uncertainty_score":0.02436918,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2015784652","doi":"10.1016/j.disc.2009.05.007","title":"The firefighter problem for cubic graphs","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria; McGill University","funders":"","keywords":"Combinatorics; Mathematics; Degree (music); Vertex (graph theory); Graph; Discrete mathematics; Time complexity","authors":[{"name":"Andrew D. King","is_ca":true},{"name":"Gary MacGillivray","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02183635650630993,"gpt":0.3053847981573722,"spread":0.2835484416510623,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00121996,0.0009380959,0.001751176,0.000904645,0.003419186,0.003446531,0.003627916,0.004793392,0.02336435],"category_scores_gemma":[0.008272689,0.000904504,0.001314575,0.001735269,0.002481848,0.006566482,0.002839976,0.004750664,0.001827347],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00243612,"about_ca_system_score_gemma":0.00233839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01260681,"about_ca_topic_score_gemma":0.01066973,"domain_scores_codex":[0.9991003,0.0002284532,0.00002769447,0.0002071432,0.0001340848,0.0003022735],"domain_scores_gemma":[0.9968655,0.001886313,0.0002425003,0.0003214712,0.000190192,0.0004940503],"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.001123556,0.0005298221,0.002010598,0.0008556183,0.00009452595,0.000714599,0.0009483325,0.1179171,0.002197891,0.6807911,0.1079492,0.08486775],"study_design_scores_gemma":[0.0002365749,0.00008936418,0.0006224769,0.0001067678,0.00004159571,0.0003225668,0.001065918,0.1420313,0.001347781,0.8346056,0.01949232,0.00003782755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5171571,0.003064744,0.3092707,0.02211165,0.00108305,0.0005818178,0.003292798,0.000787324,0.1426508],"genre_scores_gemma":[0.7868344,0.003209155,0.1150459,0.001461754,0.0007256344,0.0003247284,0.003760511,0.0005130945,0.08812491],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02336435,"threshold_uncertainty_score":0.07816148,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2022623224","doi":"10.1016/s0012-365x(00)00213-2","title":"Hedetniemi's conjecture — a survey","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Conjecture; Mathematics; Combinatorics; Product (mathematics); Chromatic scale; Discrete mathematics; Geometry","authors":[{"name":"Norbert Sauer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03963701189677132,"gpt":0.3202211428898492,"spread":0.2805841309930779,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002897231,0.001077632,0.001752217,0.003104849,0.002724008,0.004012779,0.002490269,0.002926356,0.01079367],"category_scores_gemma":[0.006364617,0.0007965561,0.0008163354,0.005916112,0.004767562,0.01233692,0.003271492,0.005304838,0.002860081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002870924,"about_ca_system_score_gemma":0.002019376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00238708,"about_ca_topic_score_gemma":0.001865304,"domain_scores_codex":[0.9987005,0.0002066072,0.00007799605,0.0004652361,0.0003532905,0.0001963629],"domain_scores_gemma":[0.9959183,0.002545519,0.0001871477,0.0005682039,0.0005419375,0.0002388416],"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.0001354331,0.0001760646,0.002527701,0.001113886,0.00006066689,0.0001970363,0.0002764847,0.002768314,0.0004453896,0.7380047,0.04867749,0.2056168],"study_design_scores_gemma":[0.00004961059,0.00007097829,0.001785738,0.0004136009,0.00003895362,0.0004737862,0.0004374322,0.004787016,0.0009963177,0.70958,0.2813123,0.00005430434],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.04966358,0.450541,0.08690292,0.09117876,0.01064684,0.0001347567,0.001424887,0.0004514969,0.3090559],"genre_scores_gemma":[0.4420016,0.399993,0.05486893,0.01498123,0.0200842,0.000216939,0.004066049,0.0003143976,0.06347357],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.01079367,"threshold_uncertainty_score":0.03610849,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2137906639","doi":"10.1016/s0012-365x(99)00251-4","title":"Extremal graphs for inequalities involving domination parameters","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"National Science Foundation","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Domination analysis; Characterization (materials science); Upper and lower bounds; Discrete mathematics; Graph; Extremal combinatorics; Inequality; Chordal graph","authors":[{"name":"Baogen Xu","is_ca":false},{"name":"E. J. Cockayne","is_ca":true},{"name":"Teresa W. Haynes","is_ca":false},{"name":"Stephen T. Hedetniemi","is_ca":false},{"name":"Zhou Shang-chao","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04637501544429559,"gpt":0.3126208045762193,"spread":0.2662457891319236,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003918451,0.001814212,0.002121834,0.004555932,0.002659453,0.005763284,0.004737457,0.003491821,0.01438845],"category_scores_gemma":[0.02351066,0.001431347,0.001427142,0.003939637,0.004576913,0.0129491,0.004139184,0.00960575,0.00088636],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003223737,"about_ca_system_score_gemma":0.0007344311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001003795,"about_ca_topic_score_gemma":0.001383721,"domain_scores_codex":[0.9971284,0.001116777,0.0001176448,0.0006194355,0.0005730868,0.0004446733],"domain_scores_gemma":[0.977693,0.01747227,0.00178165,0.001134972,0.0008232587,0.00109469],"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.00005008176,0.00002121305,0.000205376,0.00006860888,0.00001717677,0.00004715891,0.0001156215,0.002771551,0.0004713906,0.9919757,0.001275477,0.002980575],"study_design_scores_gemma":[0.000008821061,0.000005646006,0.000176911,0.00002084977,0.00001180931,0.00004824436,0.00004199173,0.0114724,0.0001567775,0.9872214,0.0008244822,0.00001062866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2425475,0.004229422,0.5752442,0.0082407,0.0006317968,0.0001772485,0.001204497,0.0004403145,0.1672843],"genre_scores_gemma":[0.9236846,0.002082257,0.05076946,0.001308625,0.001206498,0.0003427809,0.0007937906,0.0003751697,0.01943684],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01438845,"threshold_uncertainty_score":0.04813415,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2104859703","doi":"10.1016/j.disc.2006.04.031","title":"Construction of trees and graphs with equal domination parameters","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Constructive; Domination analysis; Characterization (materials science); Combinatorics; Simple (philosophy); Discrete mathematics; Constructive proof; Tree (set theory); Graph; Process (computing); Computer science; Vertex (graph theory)","authors":[{"name":"Michael Dorfling","is_ca":false},{"name":"Wayne Goddard","is_ca":false},{"name":"Michael A. Henning","is_ca":false},{"name":"Christina M. Mynhardt","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01280846333514014,"gpt":0.2573611950184089,"spread":0.2445527316832687,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006445444,0.0004723515,0.000699049,0.0012203,0.001407877,0.002081003,0.001320783,0.001223971,0.005246314],"category_scores_gemma":[0.003006243,0.0007247364,0.0008313555,0.001345841,0.001598308,0.002508577,0.002530077,0.002492853,0.001098858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009335463,"about_ca_system_score_gemma":0.0007449108,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004417613,"about_ca_topic_score_gemma":0.0009597236,"domain_scores_codex":[0.9993481,0.0001692379,0.00003402335,0.0001268734,0.0001807783,0.0001409231],"domain_scores_gemma":[0.997827,0.0008868573,0.0001754296,0.0005129531,0.0002761022,0.0003216064],"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.00008423861,0.00005318186,0.0005157795,0.00007161091,0.00001447835,0.0001802513,0.000427214,0.004135916,0.009336133,0.9595935,0.001845449,0.02374223],"study_design_scores_gemma":[0.00003957631,0.00002307167,0.0003918343,0.00002985155,0.00002694431,0.000234024,0.0001805313,0.01413183,0.006848759,0.9678124,0.01025656,0.00002459522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2211308,0.0003491461,0.7187222,0.0008482336,0.0001496048,0.0001730945,0.0004454162,0.000863089,0.05731836],"genre_scores_gemma":[0.7036509,0.0004311966,0.2769017,0.0003261663,0.00007187275,0.0002268862,0.0005934821,0.0005689798,0.0172288],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005246314,"threshold_uncertainty_score":0.01755065,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2027483825","doi":"10.1016/j.disc.2007.11.048","title":"The coolest way to generate combinations","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; String (physics); Prefix; Order (exchange); Discrete mathematics; Ranking (information retrieval); Position (finance); Computer science; Artificial intelligence","authors":[{"name":"Frank Ruskey","is_ca":true},{"name":"Aaron Williams","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02448269265550412,"gpt":0.2550308923122633,"spread":0.2305481996567592,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001489561,0.00115263,0.001028274,0.001567265,0.001643207,0.003165461,0.001595535,0.001288629,0.02070136],"category_scores_gemma":[0.011075,0.0008952275,0.001546696,0.001067533,0.002070282,0.004647851,0.004655037,0.002978184,0.006041852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005430019,"about_ca_system_score_gemma":0.0008896964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002672241,"about_ca_topic_score_gemma":0.0006544402,"domain_scores_codex":[0.9975277,0.0006658449,0.0001819999,0.000470331,0.0009360913,0.0002180619],"domain_scores_gemma":[0.9953237,0.001278204,0.0001654544,0.00237054,0.0007039545,0.0001582081],"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.001269398,0.0001852679,0.001961223,0.0006853209,0.0002581267,0.0005919995,0.0008415398,0.02170348,0.03667109,0.3335488,0.03950147,0.5627824],"study_design_scores_gemma":[0.0002032434,0.00037032,0.0007233824,0.0002923115,0.0002261941,0.001742522,0.0003284571,0.1151621,0.05200702,0.7333719,0.09543075,0.0001417621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02940967,0.0005844759,0.939824,0.001372191,0.0007241886,0.0002146921,0.0006205956,0.003799753,0.02345046],"genre_scores_gemma":[0.2572134,0.0004210123,0.7123951,0.0009382984,0.0003366359,0.0004730692,0.001189763,0.003411007,0.02362156],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02070136,"threshold_uncertainty_score":0.06925291,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2165426231","doi":"10.1016/s0012-365x(03)00086-4","title":"Homomorphisms and oriented colorings of equivalence classes of oriented graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Homomorphism; Combinatorics; Chromatic scale; Friendship graph; Windmill graph; Discrete mathematics; Digraph; Vertex (graph theory); Integer (computer science); Critical graph; Graph; Equivalence (formal languages); Graph homomorphism; Line graph; Graph power; Computer science","authors":[{"name":"William F. Klostermeyer","is_ca":false},{"name":"Gary MacGillivray","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02386329915769704,"gpt":0.289789815704448,"spread":0.265926516546751,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001246035,0.0005887844,0.0006214251,0.002469332,0.001999393,0.003398647,0.001442129,0.0009726635,0.004384232],"category_scores_gemma":[0.004845421,0.0009489815,0.001144176,0.00148827,0.003361573,0.005431094,0.002116549,0.002621887,0.0004259569],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001322112,"about_ca_system_score_gemma":0.0006562117,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001678059,"about_ca_topic_score_gemma":0.001658484,"domain_scores_codex":[0.9988899,0.0002996219,0.00006774042,0.0002968695,0.0001810621,0.0002648325],"domain_scores_gemma":[0.9955402,0.002291485,0.0006704298,0.0004465649,0.0003069115,0.0007444281],"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.000115184,0.0001158971,0.001591158,0.00004483985,0.00001715254,0.0001424642,0.001264364,0.001388368,0.001883617,0.9808939,0.0008218371,0.01172139],"study_design_scores_gemma":[0.00003105695,0.00002444651,0.0008888543,0.00001303844,0.00001861441,0.0001212048,0.0003538767,0.003328744,0.0007936163,0.9926206,0.001792019,0.00001395228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.827612,0.000491999,0.1377163,0.0007814788,0.0002825667,0.00009713652,0.0002950437,0.0003520436,0.03237135],"genre_scores_gemma":[0.9632496,0.000444364,0.02700508,0.0002897888,0.0002785251,0.0001178413,0.000459532,0.0001651319,0.007990151],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004384232,"threshold_uncertainty_score":0.01466668,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2126829018","doi":"10.1016/j.disc.2005.03.020","title":"Rebuilding convex sets in graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"Division of Electrical, Communications and Cyber Systems","keywords":"Combinatorics; Mathematics; Convex hull; Neighbourhood (mathematics); Convex set; Vertex (graph theory); Wheel graph; Discrete mathematics; Independent set; Chordal graph; Distance; Graph; Graph power; Regular polygon; Line graph; Geometry; Convex optimization","authors":[{"name":"José Cáceres","is_ca":false},{"name":"Alberto Márquez","is_ca":false},{"name":"Ortrud R. Oellermann","is_ca":true},{"name":"María Luz Puertas","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02638036816679087,"gpt":0.320545643663371,"spread":0.2941652754965801,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008940899,0.0009213348,0.001352296,0.001843358,0.00163729,0.002780704,0.002153508,0.00129825,0.01093813],"category_scores_gemma":[0.006008062,0.001222437,0.001402842,0.001510135,0.002992115,0.005081881,0.004671823,0.00487629,0.00229404],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001157523,"about_ca_system_score_gemma":0.0005677128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002199729,"about_ca_topic_score_gemma":0.003042207,"domain_scores_codex":[0.9989672,0.0003430563,0.00004605336,0.0002023062,0.0002995528,0.0001419224],"domain_scores_gemma":[0.9959158,0.001698702,0.0001794309,0.00155915,0.0003299629,0.0003170004],"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.0001061964,0.00007050382,0.0003353693,0.0001956334,0.00004851334,0.0001901964,0.000577413,0.03518436,0.00816243,0.8833156,0.007152816,0.06466097],"study_design_scores_gemma":[0.00001268676,0.00002144732,0.0001572483,0.00003211096,0.00001732184,0.00009452268,0.0002399036,0.03918834,0.003227843,0.9452567,0.0117374,0.00001441057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1578722,0.001085372,0.7828807,0.002650203,0.0006525217,0.0001241645,0.0003815002,0.001495083,0.05285833],"genre_scores_gemma":[0.5776268,0.001557359,0.3710082,0.0008674503,0.000291492,0.0001358624,0.0008255436,0.002018026,0.04566935],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01093813,"threshold_uncertainty_score":0.03659171,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999323173","doi":"10.1016/j.disc.2004.04.005","title":"Spanning spiders and light-splitting switches","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":51,"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":"Spanning tree; Mathematics; Combinatorics; Minimum degree spanning tree; Subdivision; Connected dominating set; Minimum spanning tree; Discrete mathematics; Bounded function; Graph","authors":[{"name":"Luisa Gargano","is_ca":false},{"name":"Mikael Hammar","is_ca":false},{"name":"Pavol Hell","is_ca":true},{"name":"Ladislav Stacho","is_ca":true},{"name":"Ugo Vaccaro","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007775992139421603,"gpt":0.1969796497024935,"spread":0.1892036575630719,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002739914,0.000241799,0.0004184987,0.0008329493,0.0009280904,0.001415375,0.0004954037,0.0009141662,0.003569558],"category_scores_gemma":[0.001571428,0.0002697267,0.0002905498,0.0008704288,0.001135543,0.001713819,0.0009315109,0.0009371468,0.0003014423],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004852109,"about_ca_system_score_gemma":0.0002904443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005516412,"about_ca_topic_score_gemma":0.0005971939,"domain_scores_codex":[0.9998488,0.00004136927,0.000006274039,0.00003151599,0.00003696587,0.00003495759],"domain_scores_gemma":[0.9993119,0.0003416022,0.00008958029,0.00007220956,0.00007035892,0.0001142674],"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.00007260645,0.00002921101,0.0002930687,0.0000321616,0.00001082343,0.00009803821,0.0001520568,0.009538389,0.003152222,0.970368,0.001430442,0.0148229],"study_design_scores_gemma":[0.00001578653,0.00001433497,0.0001935692,0.000006335001,0.000006113397,0.00008799956,0.00007515782,0.0333721,0.0005863144,0.9634007,0.002235703,0.000005913582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6320583,0.002319082,0.294158,0.001777364,0.0003038854,0.00007028198,0.0001653426,0.0003552367,0.06879259],"genre_scores_gemma":[0.9625317,0.0009960672,0.02264644,0.000242209,0.0001441359,0.00004588004,0.0000838905,0.00004258956,0.01326713],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003569558,"threshold_uncertainty_score":0.01194131,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1979477295","doi":"10.1016/j.disc.2004.07.022","title":"The graphs with maximum induced matching and maximum matching the same size","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary; Wilfrid Laurier University","funders":"","keywords":"Mathematics; Matching (statistics); Combinatorics; Factor-critical graph; Characterization (materials science); 3-dimensional matching; Graph; Cograph; Discrete mathematics; Simple (philosophy); Line graph; Bipartite graph; Pathwidth; Voltage graph; Statistics","authors":[{"name":"Kathie Cameron","is_ca":true},{"name":"Tracy Walker","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01902994736410249,"gpt":0.279226662895465,"spread":0.2601967155313625,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001410774,0.0008930001,0.001421986,0.001961228,0.002526923,0.003255722,0.002489525,0.002442102,0.00762007],"category_scores_gemma":[0.0136446,0.0008616167,0.001572386,0.002820742,0.00224472,0.00750021,0.001956005,0.00256513,0.001066841],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001290816,"about_ca_system_score_gemma":0.001386951,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008175837,"about_ca_topic_score_gemma":0.0007889941,"domain_scores_codex":[0.9982336,0.000473759,0.00007951661,0.0005924987,0.0003141978,0.000306564],"domain_scores_gemma":[0.9900908,0.003929526,0.0017597,0.002119179,0.001034608,0.001066131],"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.0009408371,0.0001457047,0.001682048,0.0004134631,0.0001429607,0.0003375848,0.0006069191,0.006907211,0.007368464,0.9365836,0.01155974,0.03331143],"study_design_scores_gemma":[0.0001357736,0.00007695446,0.001782558,0.00004602336,0.0001175355,0.0005426486,0.0002780887,0.01325363,0.003370516,0.9708439,0.009517033,0.00003526244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6173689,0.002058702,0.23384,0.007760092,0.0006183116,0.0003411308,0.003438314,0.0009388633,0.1336357],"genre_scores_gemma":[0.8907214,0.001425098,0.08066807,0.001467643,0.0006875137,0.0003838842,0.002490327,0.0003913534,0.02176459],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00762007,"threshold_uncertainty_score":0.02549165,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066705994","doi":"10.1016/j.disc.2014.06.023","title":"On the strong metric dimension of Cartesian and direct products of graphs","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Metric dimension; Mathematics; Combinatorics; Vertex (graph theory); Cartesian product; Discrete mathematics; Packing dimension; Dimension (graph theory); Graph; Chordal graph; Minkowski–Bouligand dimension; 1-planar graph","authors":[{"name":"Juan A. Rodríguez‐Velázquez","is_ca":false},{"name":"Ismael G. Yero","is_ca":false},{"name":"Dorota Kuziak","is_ca":false},{"name":"Ortrud R. Oellermann","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01435913185574652,"gpt":0.2223091152755292,"spread":0.2079499834197827,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004019371,0.001146962,0.002040393,0.003840595,0.003337446,0.006688658,0.002846073,0.002246719,0.005300107],"category_scores_gemma":[0.01670055,0.001385987,0.0012704,0.004879361,0.008770631,0.01973317,0.006937521,0.005422974,0.0004192854],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002794605,"about_ca_system_score_gemma":0.001025373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001777558,"about_ca_topic_score_gemma":0.001491475,"domain_scores_codex":[0.9970006,0.001319587,0.0001752248,0.000611836,0.0005284944,0.0003642455],"domain_scores_gemma":[0.974637,0.01729647,0.002328134,0.001878516,0.001269507,0.00259033],"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.00006734068,0.00002118867,0.0007487844,0.0000494942,0.00001312513,0.0000227193,0.0002985454,0.00152851,0.0001997977,0.9929367,0.001018273,0.00309544],"study_design_scores_gemma":[0.00001379077,0.00001844378,0.0005040391,0.00001971761,0.00001393857,0.0000608204,0.00013407,0.007222409,0.0001511546,0.9903274,0.00151632,0.0000179536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6891646,0.006121308,0.240156,0.009878978,0.0003942639,0.00007258384,0.001342028,0.0002359542,0.05263428],"genre_scores_gemma":[0.9570451,0.001889781,0.03307509,0.0006578015,0.0005628493,0.0001062994,0.0006214961,0.0001203148,0.005921304],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006688658,"threshold_uncertainty_score":0.02125669,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2003367147","doi":"10.1016/j.disc.2007.03.034","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>p</mml:mi><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy=\"false\">)</mml:mo></mml:math>-Total labelling of graphs","year":2007,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of the Fraser Valley","funders":"Centre National de la Recherche Scientifique","keywords":"Conjecture; Combinatorics; Mathematics; Graph; Vertex (graph theory); Discrete mathematics; Algorithm","authors":[{"name":"Frédéric Havet","is_ca":false},{"name":"Min‐Li Yu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01925580421664802,"gpt":0.2429960172408542,"spread":0.2237402130242062,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006896381,0.001028783,0.0007968886,0.001903937,0.0009434879,0.004605981,0.002290852,0.001451421,0.4450425],"category_scores_gemma":[0.003969661,0.0008891743,0.0007382421,0.003259584,0.0006885867,0.005352017,0.002021085,0.002776742,0.3194176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002346203,"about_ca_system_score_gemma":0.001208854,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00600731,"about_ca_topic_score_gemma":0.008347805,"domain_scores_codex":[0.9995046,0.0001048863,0.00004785851,0.00009387639,0.0001916631,0.00005699862],"domain_scores_gemma":[0.9982729,0.0005075005,0.0001107098,0.0004653028,0.00050658,0.0001370463],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005994669,0.0000264495,0.000150199,0.0002003658,0.000007148067,0.00003954077,0.0001184788,0.0004272293,0.00130611,0.07012647,0.8782274,0.04931059],"study_design_scores_gemma":[0.00002757014,0.000009249894,0.0003610554,0.00005702074,0.000005546722,0.0001091262,0.00006400976,0.002658476,0.003801919,0.04710893,0.9457686,0.00002858127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.002422397,0.000361147,0.2685578,0.006655518,0.001303294,0.0002673129,0.09349537,0.09818438,0.5287527],"genre_scores_gemma":[0.0459476,0.001630187,0.2206762,0.002945776,0.0007043448,0.0006622947,0.1578466,0.08924015,0.4803469],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4450425,"threshold_uncertainty_score":0.7915795,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2088306445","doi":"10.1016/j.disc.2012.01.002","title":"Characterizations of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-copwin graphs","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria; Acadia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Scroll; Vertex (graph theory); Combinatorics; Order (exchange); Discrete mathematics; Graph","authors":[{"name":"Nancy E. Clarke","is_ca":true},{"name":"Gary MacGillivray","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02638608327799507,"gpt":0.2677734062068485,"spread":0.2413873229288535,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007990774,0.0008723484,0.000498348,0.002722634,0.001952254,0.004530586,0.001847802,0.001349348,0.03426302],"category_scores_gemma":[0.006371943,0.0006463951,0.0009416995,0.002775835,0.001841372,0.005774533,0.002116132,0.002377759,0.004022176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00171407,"about_ca_system_score_gemma":0.0009957995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002015903,"about_ca_topic_score_gemma":0.00323562,"domain_scores_codex":[0.9986491,0.0002174377,0.00009708616,0.0004412242,0.0003405392,0.0002546159],"domain_scores_gemma":[0.9948134,0.002119818,0.000816601,0.000744127,0.0009069313,0.0005990299],"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.00004441197,0.00003831174,0.000525026,0.00008752741,0.00001333259,0.0001254894,0.0002995903,0.00161879,0.0008892688,0.976439,0.008246965,0.01167234],"study_design_scores_gemma":[0.00002364767,0.00002111606,0.0006823492,0.00006071176,0.000022131,0.0003329663,0.0003203812,0.009558235,0.001616034,0.9606442,0.02669667,0.00002151265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1497879,0.0006910762,0.5226575,0.003061158,0.0002934901,0.0005435867,0.006056211,0.001652571,0.3152566],"genre_scores_gemma":[0.7880701,0.001030747,0.1129838,0.001340806,0.0003036193,0.0008456389,0.01216411,0.001352095,0.08190907],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03426302,"threshold_uncertainty_score":0.1146212,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2027568724","doi":"10.1016/j.disc.2008.05.033","title":"Sweeping graphs with large clique number","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Mathematics; Combinatorics; Clique; Enhanced Data Rates for GSM Evolution; Monotonic function; Clique number; Discrete mathematics; Upper and lower bounds; Clique-sum; Chordal graph; Graph; Computer science; 1-planar graph","authors":[{"name":"Boting Yang","is_ca":true},{"name":"Danny Dyer","is_ca":true},{"name":"Brian Alspach","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0245550563354613,"gpt":0.2972137634861475,"spread":0.2726587071506862,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007027324,0.0005309795,0.0009569205,0.001874795,0.001690159,0.002076303,0.001493771,0.001631556,0.01195532],"category_scores_gemma":[0.007140994,0.001023019,0.0007688312,0.002339169,0.001491396,0.003445796,0.001838078,0.001997263,0.0007313319],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006830902,"about_ca_system_score_gemma":0.0004539482,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009808925,"about_ca_topic_score_gemma":0.001903309,"domain_scores_codex":[0.999353,0.0001604089,0.00002329463,0.0001803595,0.0001480956,0.0001348022],"domain_scores_gemma":[0.9885344,0.008081029,0.0008179655,0.001145842,0.0004032373,0.001017484],"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.0006849577,0.0002495409,0.005664793,0.0004050192,0.000167205,0.001161383,0.0007468775,0.06566279,0.02262551,0.8461702,0.0125385,0.04392309],"study_design_scores_gemma":[0.0001570869,0.00006706517,0.003125118,0.00003410627,0.00007121357,0.0007432778,0.0003487373,0.1669326,0.00475243,0.8172266,0.006509976,0.00003183665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7736908,0.000582566,0.1758229,0.002004261,0.0001067338,0.0001768197,0.001305985,0.0008276636,0.04548237],"genre_scores_gemma":[0.9172217,0.0004928243,0.06239881,0.0003354849,0.0001572302,0.0001651026,0.001321347,0.0003255969,0.01758187],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01195532,"threshold_uncertainty_score":0.03999454,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2153548489","doi":"10.1016/j.disc.2005.12.032","title":"How to build a brick","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Graph factorization; Factor-critical graph; Conjecture; Matching (statistics); Graph; Connected component; Discrete mathematics; Graph power; Line graph","authors":[{"name":"Marcelo H. de Carvalho","is_ca":false},{"name":"Cláudio L. Lucchesi","is_ca":false},{"name":"U. S. R. Murty","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01802467165638636,"gpt":0.283069835033532,"spread":0.2650451633771456,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001380931,0.0009352571,0.0008441785,0.001405476,0.003306331,0.004068862,0.001778874,0.00248761,0.06268023],"category_scores_gemma":[0.007603289,0.001244028,0.001217598,0.0006262201,0.002813976,0.01399428,0.006595484,0.005150912,0.02982763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007287623,"about_ca_system_score_gemma":0.001435903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001649865,"about_ca_topic_score_gemma":0.002179567,"domain_scores_codex":[0.99899,0.0002410489,0.00005581839,0.0001983726,0.0003363695,0.0001782384],"domain_scores_gemma":[0.9972856,0.000551869,0.00008766684,0.001037354,0.0006459461,0.0003916671],"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.000163261,0.000152963,0.000703809,0.0003412924,0.00005581726,0.0003323851,0.001351863,0.00604443,0.007227352,0.7350839,0.09337738,0.1551654],"study_design_scores_gemma":[0.00004670514,0.00008785522,0.0002804827,0.0002761698,0.00003871494,0.0002952489,0.001408509,0.009336577,0.004222206,0.6219422,0.3620032,0.00006216361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02035919,0.001674322,0.7294626,0.02314896,0.005258944,0.000449175,0.0004580963,0.004565058,0.2146236],"genre_scores_gemma":[0.1619925,0.001459192,0.682299,0.004665462,0.0003769915,0.0004973342,0.0006762011,0.003562743,0.1444706],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.06268023,"threshold_uncertainty_score":0.2096863,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2094803507","doi":"10.1016/s0012-365x(03)00241-3","title":"Analysis of greedy algorithms on graphs with bounded degrees","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Heuristics; Combinatorics; Bounded function; Sequence (biology); Greedy algorithm; Algorithm; Random graph; Discrete mathematics; Mathematical optimization; Graph","authors":[{"name":"Nicholas Wormald","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02857594893496281,"gpt":0.2982504229598212,"spread":0.2696744740248584,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006197549,0.002677368,0.002865375,0.00407968,0.00215528,0.005795953,0.006384124,0.003902176,0.009709852],"category_scores_gemma":[0.05447374,0.001860767,0.001936932,0.00439061,0.006075909,0.01051141,0.00416392,0.004039643,0.001036738],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006539938,"about_ca_system_score_gemma":0.004783081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003802435,"about_ca_topic_score_gemma":0.00364061,"domain_scores_codex":[0.9950393,0.002056191,0.0001500784,0.0006386755,0.001106424,0.001009347],"domain_scores_gemma":[0.9196687,0.06784895,0.004102525,0.00271924,0.002885724,0.002774793],"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.000757964,0.0002754166,0.002438786,0.0004531923,0.0001425212,0.0001462073,0.0004942596,0.3587701,0.002458944,0.6050373,0.007113107,0.02191216],"study_design_scores_gemma":[0.00009701376,0.00008046927,0.0004606519,0.0000584307,0.00005460496,0.00007752993,0.0001451412,0.5729127,0.0006120493,0.4243514,0.001126322,0.00002371831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3026081,0.003397885,0.6595966,0.005187052,0.000179288,0.0003263974,0.0006274523,0.001035874,0.02704144],"genre_scores_gemma":[0.8775885,0.002759992,0.09891605,0.001010047,0.0005197013,0.0005337698,0.00112499,0.0009913264,0.0165555],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009709852,"threshold_uncertainty_score":0.04745084,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2026675463","doi":"10.1016/s0012-365x(02)00447-8","title":"Vertices contained in all or in no minimum total dominating set of a tree","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Dominating set; Vertex (graph theory); Graph; Tree (set theory); Discrete mathematics","authors":[{"name":"Ernest J. Cockayne","is_ca":true},{"name":"Michael A. Henning","is_ca":false},{"name":"Christina M. Mynhardt","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0440434861314269,"gpt":0.3371172881744353,"spread":0.2930738020430084,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005517798,0.0006611588,0.001269261,0.0009587707,0.001807499,0.002737427,0.001297849,0.0009367119,0.002787653],"category_scores_gemma":[0.002204139,0.0006005298,0.0009023934,0.001456669,0.0008444602,0.002757675,0.001166532,0.001062909,0.0005010561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007176326,"about_ca_system_score_gemma":0.0008014773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008968825,"about_ca_topic_score_gemma":0.00170346,"domain_scores_codex":[0.9993536,0.00009843911,0.00006064629,0.0002305658,0.0001485726,0.0001082593],"domain_scores_gemma":[0.9973952,0.001256314,0.0002590598,0.0003361191,0.0003246269,0.0004286779],"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.004842066,0.0009053092,0.02642552,0.004232066,0.001122043,0.002672085,0.005480426,0.1173292,0.2591097,0.3841548,0.01826853,0.1754582],"study_design_scores_gemma":[0.0002713251,0.0007399566,0.0132968,0.0002714737,0.00134792,0.005514172,0.003224753,0.1771068,0.08423113,0.6705145,0.04338875,0.0000925233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8340198,0.0008061336,0.1374532,0.001470385,0.0001463072,0.0001529944,0.003268315,0.0002433747,0.02243944],"genre_scores_gemma":[0.8326992,0.0009466763,0.1481112,0.0002824379,0.0001125537,0.0001581372,0.004739312,0.0001647474,0.01278572],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002787653,"threshold_uncertainty_score":0.009325624,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2146551015","doi":"10.1016/j.disc.2009.03.047","title":"Hamiltonian decompositions of complete<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-uniform hypergraphs","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":44,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Mathematics; Hamiltonian (control theory); Scroll; Discrete mathematics; Combinatorics; Algorithm","authors":[{"name":"R. A. Bailey","is_ca":true},{"name":"Brett Stevens","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01353898309012999,"gpt":0.2282907591119615,"spread":0.2147517760218315,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002292419,0.0002935723,0.000240494,0.001220559,0.0006895327,0.001328771,0.0005192628,0.0005057151,0.019237],"category_scores_gemma":[0.0009425652,0.0003125526,0.0003604617,0.0007422871,0.0007132412,0.001472885,0.0008069486,0.0007104161,0.001419092],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008041917,"about_ca_system_score_gemma":0.0003602744,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001149116,"about_ca_topic_score_gemma":0.002920735,"domain_scores_codex":[0.9997602,0.00005250478,0.00001218864,0.00005132413,0.00005424462,0.00006956318],"domain_scores_gemma":[0.9993879,0.0001667192,0.0001041038,0.00007684701,0.0001265773,0.0001378892],"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.00004438517,0.00002394759,0.0002189673,0.00006580405,0.000013851,0.0001216064,0.0002228563,0.00466503,0.002460017,0.9764885,0.005468703,0.01020635],"study_design_scores_gemma":[0.00003195793,0.00001739844,0.0007531452,0.00002889191,0.00001126284,0.0001042045,0.0002126975,0.01880695,0.001113164,0.97082,0.008087914,0.00001255079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4163423,0.00108701,0.4043043,0.001017155,0.0002415378,0.000189707,0.003094653,0.0003561415,0.173367],"genre_scores_gemma":[0.8508242,0.00070316,0.05508052,0.0003885241,0.0001524351,0.000186873,0.002737982,0.0002904463,0.08963601],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.019237,"threshold_uncertainty_score":0.06435424,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2049916150","doi":"10.1016/j.disc.2010.01.002","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si37.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>G</mml:mi></mml:math>-parking functions, acyclic orientations and spanning trees","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Bijection; Mathematics; Graph; Combinatorics; Vertex (graph theory); Discrete mathematics; Function (biology)","authors":[{"name":"Brian Benson","is_ca":false},{"name":"Deeparnab Chakrabarty","is_ca":true},{"name":"Prasad Tetali","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02071628522511293,"gpt":0.2785681418201496,"spread":0.2578518565950367,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005556298,0.001189671,0.0009888818,0.001998707,0.0007468737,0.004260854,0.002371918,0.001489127,0.5307989],"category_scores_gemma":[0.003371001,0.0007724378,0.0007883489,0.004138057,0.0006428185,0.005095354,0.001546748,0.002086623,0.31044],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001651803,"about_ca_system_score_gemma":0.001001323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005308478,"about_ca_topic_score_gemma":0.007841627,"domain_scores_codex":[0.999606,0.00007065629,0.00004034892,0.00006483094,0.0001791744,0.00003902205],"domain_scores_gemma":[0.9986608,0.0004605858,0.00009799407,0.0002773835,0.0003934549,0.0001097959],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005792366,0.00003538032,0.0001533386,0.0002896043,0.000007968664,0.00005938937,0.0001032165,0.0006112561,0.00132495,0.07522961,0.8704144,0.05171293],"study_design_scores_gemma":[0.00004317618,0.00001498409,0.0005576647,0.00007765756,0.000006463923,0.0002057243,0.00006559223,0.004060093,0.003547832,0.07270196,0.9186804,0.00003845439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.002545949,0.0006333984,0.2698095,0.00606036,0.001575327,0.0002794302,0.1298429,0.07407656,0.5151765],"genre_scores_gemma":[0.04709741,0.002723297,0.2248898,0.002769338,0.00119321,0.0006618643,0.1950704,0.07698987,0.4486048],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5307989,"threshold_uncertainty_score":0.6692585,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1992400796","doi":"10.1016/s0012-365x(01)00054-1","title":"On the divisibility of graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"Agence Nationale pour la Gestion des Déchets Radioactifs","keywords":"Mathematics; Combinatorics; Divisibility rule; Perfect graph; Perfect graph theorem; Conjecture; Trivially perfect graph; Induced subgraph; Split graph; Discrete mathematics; Graph; Clique number; Vertex (graph theory); Partition (number theory); Cograph; Chromatic scale; Line graph; Pathwidth","authors":[{"name":"Chı́nh T. Hoàng","is_ca":true},{"name":"Colin McDiarmid","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04652455214468322,"gpt":0.2935728521492843,"spread":0.2470483000046011,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002463299,0.001061959,0.001697554,0.003992434,0.00292911,0.003455498,0.002679646,0.002282162,0.01014852],"category_scores_gemma":[0.01703993,0.001120905,0.001311199,0.002862582,0.0114348,0.01480341,0.0053661,0.00858142,0.0008785077],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002021159,"about_ca_system_score_gemma":0.0005392362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009616136,"about_ca_topic_score_gemma":0.0006738067,"domain_scores_codex":[0.9986143,0.0005192542,0.00006237414,0.0003338846,0.00028473,0.0001854442],"domain_scores_gemma":[0.9785242,0.01601951,0.001266282,0.00192548,0.00106261,0.001202046],"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.00007387633,0.00002441802,0.00031965,0.00008637347,0.00001157198,0.0000647066,0.0004909416,0.001866561,0.0004274831,0.9887293,0.001729444,0.006175642],"study_design_scores_gemma":[0.000007360501,0.000006804728,0.00009353,0.00001127706,0.000002803187,0.00003241927,0.00004053819,0.001194889,0.00005957411,0.9974076,0.001139186,0.000004005729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5770765,0.008713726,0.1599786,0.02433313,0.001341076,0.0001211944,0.000792625,0.0003884543,0.2272547],"genre_scores_gemma":[0.9276596,0.006371717,0.02381886,0.001889243,0.002400758,0.0001476671,0.0006571322,0.0003750751,0.03667999],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01014852,"threshold_uncertainty_score":0.03395021,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2034438073","doi":"10.1016/s0012-365x(02)00442-9","title":"A criterion for the applicability of Zeilberger's algorithm to rational functions","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":43,"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":"Univerza v Ljubljani","keywords":"Mathematics; Combinatorics; Generating function; Algorithm","authors":[{"name":"С. А. Абрамов","is_ca":false},{"name":"H. Q. Le","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02481368113949652,"gpt":0.2568352382709909,"spread":0.2320215571314944,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007881415,0.0007927087,0.001448235,0.004863707,0.002969678,0.00482321,0.003263322,0.003565447,0.008990105],"category_scores_gemma":[0.04701923,0.0004636591,0.001151475,0.003979892,0.006483546,0.005273031,0.004504767,0.003620794,0.002668577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001386599,"about_ca_system_score_gemma":0.002028503,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009672199,"about_ca_topic_score_gemma":0.0005611281,"domain_scores_codex":[0.9958407,0.001285535,0.0004456273,0.0005623992,0.001298309,0.0005673858],"domain_scores_gemma":[0.9701948,0.0188416,0.001146039,0.003641757,0.005021006,0.001154812],"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.0002922259,0.00005927362,0.002844268,0.0001406213,0.00003512077,0.0002349143,0.0003982778,0.01295453,0.005314789,0.9469317,0.002075759,0.02871848],"study_design_scores_gemma":[0.00009020725,0.0001668521,0.001230857,0.0001426557,0.00004079717,0.0003755415,0.0002291136,0.10494,0.01048205,0.8737754,0.008477256,0.00004934895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2143313,0.001150298,0.6904365,0.004603399,0.0003580986,0.0005192659,0.0004625927,0.001327908,0.08681072],"genre_scores_gemma":[0.8518338,0.001223187,0.1326183,0.0008186315,0.0005391939,0.0005640932,0.000544865,0.0004537531,0.01140412],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008990105,"threshold_uncertainty_score":0.04168141,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}