{"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"},"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01958927517900732,"gpt":0.2969287906505696,"spread":0.2773395154715623,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006804299,0.0001033462,0.0001370289,0.0002235179,0.00005553953,0.00007749109,0.0005292132,0.00003846845,0.00002065391],"category_scores_gemma":[0.0002626921,0.00009036114,0.00004871246,0.0007074203,0.00005190007,0.000353948,0.00008124901,0.0001222276,0.00005571887],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003489066,"about_ca_system_score_gemma":0.00002501793,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001294158,"about_ca_topic_score_gemma":0.00000705671,"domain_scores_codex":[0.9989104,0.00009557361,0.0002260286,0.0002138821,0.0002844882,0.0002696412],"domain_scores_gemma":[0.9991419,0.0001653548,0.00006266267,0.0005329928,0.00003765671,0.00005946672],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[7.508028e-7,0.00004322184,0.0001994318,0.00002272537,0.000002811206,0.000008803591,0.00098328,0.00003055865,0.0003457812,0.9974597,0.00002327794,0.0008796443],"study_design_scores_gemma":[0.0002557061,0.00002591337,0.0002911551,0.00002615088,0.000001268398,0.00001129773,0.0001903023,0.01452638,0.002772683,0.9813966,0.0003747921,0.0001277255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08450676,0.00007921039,0.8754576,0.0001381731,0.00008276125,0.0002841838,0.000001098176,0.00009702132,0.03935318],"genre_scores_gemma":[0.7991475,0.00001021529,0.2004315,0.00002980681,0.00000352833,0.00002833529,0.00000109105,0.00001151769,0.0003364713],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7146408,"threshold_uncertainty_score":0.368482,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000167006,0.0001587194,0.0001594215,0.00008397899,0.00009415478,0.00006557607,0.0006671041,0.00003114347,0.00002088646],"category_scores_gemma":[0.00001153806,0.0001155273,0.00009940146,0.000214638,0.00004057914,0.00008323543,0.00007962099,0.0001486937,0.00009155998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006025432,"about_ca_system_score_gemma":0.00001395921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005261827,"about_ca_topic_score_gemma":0.000001191869,"domain_scores_codex":[0.9990257,0.0000267795,0.0002044139,0.0002472022,0.0002296861,0.0002662287],"domain_scores_gemma":[0.9992485,0.00005788781,0.0000329217,0.00054854,0.00002418965,0.0000879459],"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.000005998491,0.0002407568,0.00003493129,0.00008034311,0.00004521324,0.00005507171,0.03187805,0.0003263836,0.0001782629,0.9309884,0.0002171505,0.03594944],"study_design_scores_gemma":[0.0003167694,0.0003194335,0.0005609074,0.0001117498,0.00000994139,0.00003229922,0.00007906613,0.4348284,0.005934441,0.5569083,0.0004820672,0.0004166277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1728192,0.00001701686,0.8153139,0.0001220139,0.0001803916,0.0001200365,0.000004676048,0.0002621126,0.01116061],"genre_scores_gemma":[0.780779,0.000005889433,0.2187074,0.0002572176,0.0000214807,0.000006874805,0.000001087825,0.00002034242,0.0002006676],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6079598,"threshold_uncertainty_score":0.4711069,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998140754","doi":"10.1016/s0012-365x(99)00206-x","title":"Variable neighborhood search for extremal graphs: 1 The AutoGraphiX system","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":209,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal; Polytechnique Montréal","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Variable neighborhood search; Combinatorics; Variable (mathematics); Combinatorial optimization; Discrete mathematics; Metaheuristic; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.02401972062012517,"gpt":0.282112615871467,"spread":0.2580928952513418,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001460034,0.0002526242,0.0003052317,0.0001652102,0.0005645817,0.0003816148,0.002213974,0.00008488595,0.0001113053],"category_scores_gemma":[0.00005286067,0.0001641783,0.0002253124,0.00130065,0.0002051284,0.0004114521,0.0002178141,0.0002504311,0.00009641088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003796713,"about_ca_system_score_gemma":0.00007075926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005587044,"about_ca_topic_score_gemma":7.16173e-7,"domain_scores_codex":[0.9975475,0.0001523222,0.0004199425,0.0004694105,0.0006533326,0.0007574704],"domain_scores_gemma":[0.9972455,0.0008065827,0.00008498529,0.001552847,0.0001539811,0.0001560969],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001207677,0.00005418677,0.00002805221,0.0002223939,0.00004756825,0.000006016352,0.001075619,0.0002889127,0.0001161625,0.9931706,0.0001682917,0.004810176],"study_design_scores_gemma":[0.000512129,0.000143355,0.00003388694,0.0001433954,0.00002623397,0.0001079446,0.0009129604,0.4229778,0.000585935,0.5723245,0.001901418,0.0003305121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00316143,0.0001756986,0.9618266,0.0003710487,0.0001094894,0.001080428,0.00003203901,0.0003645863,0.03287864],"genre_scores_gemma":[0.5548887,0.0000267522,0.4406478,0.0001195727,0.0001132069,0.0005144434,0.00001252118,0.0000819279,0.003595071],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5517272,"threshold_uncertainty_score":0.6694998,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003607779,0.0006272519,0.0008281555,0.0002561003,0.0007328152,0.0001888001,0.000945653,0.0006642284,0.00001776098],"category_scores_gemma":[0.01164077,0.0006594002,0.0004558023,0.0006674281,0.0008661862,0.0004256412,0.0008949054,0.0007969841,0.0001671977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000051822,"about_ca_system_score_gemma":0.0004334884,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001562753,"about_ca_topic_score_gemma":0.0001574517,"domain_scores_codex":[0.9942316,0.0002614858,0.001837391,0.000840927,0.001683274,0.001145277],"domain_scores_gemma":[0.9891188,0.006660902,0.001279065,0.001966106,0.0005867795,0.0003883765],"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.0004013503,0.0005169434,0.00001899681,0.002354049,0.0002888475,0.00008281326,0.0050448,0.00005606985,0.0003759656,0.9891047,0.001613164,0.0001423237],"study_design_scores_gemma":[0.003110349,0.001126288,0.0001226666,0.001748815,0.0003852976,0.0003284969,0.001861367,0.7361894,0.00823046,0.2450141,0.0009009984,0.0009817664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9872834,0.0002174314,0.007336725,0.0001498007,0.0004382139,0.0004468809,0.0006208597,0.0001958378,0.003310816],"genre_scores_gemma":[0.941575,0.0003107534,0.05630305,0.00005106177,0.0003312705,0.0003744684,0.0002334525,0.0003522307,0.0004687323],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7440906,"threshold_uncertainty_score":0.9995857,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001537699,0.0001247382,0.0001835685,0.00003453094,0.00004327012,0.00001448844,0.0001655598,0.00004279061,0.0005825274],"category_scores_gemma":[0.0000473065,0.00007834503,0.00009744853,0.0001903848,0.00006090426,0.00003718207,0.00001202528,0.00009728389,0.0002921654],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009954559,"about_ca_system_score_gemma":9.089104e-7,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.683943e-7,"about_ca_topic_score_gemma":5.591323e-7,"domain_scores_codex":[0.9993784,0.00003230634,0.0002329543,0.00006576638,0.0001561765,0.0001343457],"domain_scores_gemma":[0.9993042,0.000269121,0.00005283195,0.0003312705,0.00001588378,0.00002663497],"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.00000128643,0.00005213992,0.00005775954,0.0004172009,0.0001185392,0.000001828376,0.008427766,0.0004130401,0.0005491009,0.9877007,0.002143387,0.0001172455],"study_design_scores_gemma":[0.0003036033,0.00006869034,0.0001475601,0.0005754982,0.00007313305,0.00003898844,0.003839,0.1198024,0.00717573,0.8674098,0.0001853514,0.0003802759],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8609872,0.00006517881,0.001216257,0.00002371892,0.0001182325,0.0002064324,0.00001124324,0.0001091406,0.1372626],"genre_scores_gemma":[0.9994625,0.000009270313,0.000254818,0.00001620082,0.00001164093,0.00002617491,8.126506e-7,0.00002552336,0.0001930985],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1384752,"threshold_uncertainty_score":0.6378267,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003903794,0.00008367901,0.0001498201,0.00002943272,0.0001617423,0.0001033979,0.0005029459,0.00003307295,0.00002396869],"category_scores_gemma":[0.00007045364,0.00005063563,0.0001037248,0.0002031996,0.00005174808,0.0001237269,0.0000909864,0.00007541993,0.00003398936],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009635583,"about_ca_system_score_gemma":0.000003704539,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006181001,"about_ca_topic_score_gemma":0.000009624955,"domain_scores_codex":[0.9992003,0.0000566864,0.0002670563,0.0001229214,0.0001937881,0.0001592758],"domain_scores_gemma":[0.998862,0.0003473677,0.0001543412,0.0005420526,0.00006112294,0.00003315839],"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":[8.482913e-7,0.00005159657,0.00004848724,0.00004322891,0.0000331331,0.000002682329,0.003739318,0.0001686119,0.00009825813,0.9898375,0.003056292,0.002920053],"study_design_scores_gemma":[0.0001774258,0.00007038449,0.00006189368,0.00006528137,0.000005703112,0.00003604017,0.0002828948,0.932915,0.0006409626,0.06128918,0.004309817,0.0001453978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02022811,0.000204348,0.9486355,0.0004617242,0.0004664331,0.0001666338,0.000001915946,0.00007335188,0.029762],"genre_scores_gemma":[0.9958969,0.00002777461,0.003062844,0.00003411157,0.00003732548,0.00001070877,1.471231e-7,0.000005762641,0.0009244794],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9756687,"threshold_uncertainty_score":0.2064861,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004873976,0.0001181398,0.0001688062,0.0001240933,0.0001936546,0.00009024906,0.0005763717,0.000040359,0.000001688322],"category_scores_gemma":[0.000076191,0.00006897772,0.0001091598,0.000824007,0.00009814854,0.0001035158,0.000166667,0.00007415148,0.00001943438],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006768238,"about_ca_system_score_gemma":0.00001799864,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000519155,"about_ca_topic_score_gemma":0.000006808973,"domain_scores_codex":[0.998789,0.00003455896,0.0003947009,0.0001792899,0.0003808541,0.0002215806],"domain_scores_gemma":[0.9985949,0.0003147422,0.0002076212,0.0007330565,0.0001092861,0.00004033031],"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":[9.04664e-7,0.00005548719,0.0001717878,0.00002720067,0.00001116066,0.000001516034,0.000209384,0.0001946062,0.001810053,0.9955533,0.001028925,0.0009357012],"study_design_scores_gemma":[0.000251583,0.00006238661,0.0003596073,0.00006098839,0.00002180285,0.00001029252,0.0001221574,0.07670529,0.01328238,0.9081832,0.000753527,0.0001868481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4733408,0.005197824,0.4886785,0.002016814,0.0009606002,0.0007618027,0.00001078443,0.0006059289,0.02842697],"genre_scores_gemma":[0.9450737,0.0000301659,0.05449637,0.00002873386,0.000005231292,0.000006929189,0.000001875583,0.000009547899,0.0003474238],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4717329,"threshold_uncertainty_score":0.281283,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976619117","doi":"10.1016/j.disc.2005.12.053","title":"The firefighter problem for graphs of maximum degree three","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":111,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Degree (music); Mathematics; Combinatorics; Vertex (graph theory); Discrete mathematics; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.03299384743016334,"gpt":0.2853029599536012,"spread":0.2523091125234378,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006228808,0.0001484957,0.0001962189,0.00007172758,0.0002402212,0.0001121153,0.001318022,0.00004669483,0.000003822665],"category_scores_gemma":[0.00006222131,0.00008903495,0.0001600544,0.0003447621,0.0002045811,0.0001983898,0.0002437177,0.00009572969,0.00001039778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001424275,"about_ca_system_score_gemma":0.00002830376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005516436,"about_ca_topic_score_gemma":0.00004712492,"domain_scores_codex":[0.998574,0.00002925424,0.0003962966,0.0002276763,0.000377976,0.0003947711],"domain_scores_gemma":[0.9980466,0.0006676124,0.0001901223,0.0008955449,0.0001569237,0.00004314199],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007251819,0.00004017164,0.00009221046,0.0001053297,0.00001627971,9.447336e-7,0.0001711724,0.00002734645,0.0003928446,0.9920619,0.0004652793,0.006619341],"study_design_scores_gemma":[0.0002243181,0.00007059311,0.000159002,0.00003431045,0.000006828978,0.000004545952,0.00003308402,0.01791509,0.002763462,0.9774643,0.001207348,0.0001171776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005445667,0.0001932429,0.9860652,0.0006445124,0.00006214969,0.0007030627,0.00001538528,0.00007746134,0.006793306],"genre_scores_gemma":[0.2301033,0.00001605078,0.7684407,0.00002896422,0.00004490619,0.0002690749,0.000006923029,0.00004172001,0.001048408],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2246576,"threshold_uncertainty_score":0.363074,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001967838,0.0001826521,0.0002448211,0.00005745376,0.0001521567,0.0003057038,0.0006390156,0.00006703125,0.0001394726],"category_scores_gemma":[0.00008130662,0.0001413289,0.0001077176,0.0002882574,0.0001174076,0.000279419,0.0001119145,0.000126066,0.00009636985],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002381601,"about_ca_system_score_gemma":0.00002046524,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000775748,"about_ca_topic_score_gemma":8.233351e-7,"domain_scores_codex":[0.9986654,0.00004232337,0.0003229262,0.0003134062,0.0003302594,0.000325697],"domain_scores_gemma":[0.9989769,0.0001170729,0.0001704902,0.0005830867,0.00005017627,0.0001022897],"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.000003774799,0.0009287549,0.0008001346,0.0008226787,0.0001468677,0.00006948253,0.03043786,0.003607719,0.0001798919,0.867816,0.00514586,0.09004091],"study_design_scores_gemma":[0.0003283806,0.00004903195,0.00003512336,0.00004888184,0.00001818678,0.00002537899,0.0006365496,0.9829354,0.0004242311,0.01445606,0.0007485421,0.0002941999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003930466,0.0001709769,0.8914194,0.0006210697,0.000137015,0.0002073669,0.00001004571,0.0002759787,0.1032277],"genre_scores_gemma":[0.4902339,0.000004487032,0.50939,0.0002132887,0.00004911351,0.00001892193,0.000004492041,0.00001013354,0.00007568098],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9793277,"threshold_uncertainty_score":0.5763226,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002520184,0.0001181589,0.0001381992,0.00008393375,0.0001119811,0.0001447896,0.0004818964,0.00003659913,0.00004668858],"category_scores_gemma":[0.0002324752,0.0001031789,0.00006689468,0.0003472708,0.00002258392,0.0002522054,0.0001058267,0.00005394868,0.0001394739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001900988,"about_ca_system_score_gemma":0.00005083229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001478383,"about_ca_topic_score_gemma":0.000001059796,"domain_scores_codex":[0.9990729,0.00004953296,0.0002215958,0.0001973035,0.0002871155,0.0001715372],"domain_scores_gemma":[0.9991059,0.00009987775,0.00007740426,0.0005852098,0.00006915357,0.00006241183],"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":[5.911749e-7,0.00003497771,0.00001081841,0.00002086344,0.0000117487,0.000001777997,0.00058421,0.001917536,0.0004735744,0.9916904,0.004423429,0.0008300663],"study_design_scores_gemma":[0.0009625249,0.00006984621,0.00008389835,0.00002717248,0.00001837926,0.00005238354,0.0001470449,0.2687305,0.01703398,0.6428007,0.06962553,0.0004479869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01613078,0.0001174709,0.9420903,0.0002027614,0.0002635291,0.0001176661,0.00000413063,0.0001116604,0.04096169],"genre_scores_gemma":[0.2187395,0.00003214916,0.7779049,0.000376055,0.00005663705,0.0000208989,0.00001156019,0.00001274521,0.002845539],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3488896,"threshold_uncertainty_score":0.4207513,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1979733770","doi":"10.1016/s0012-365x(03)00311-x","title":"Variable neighborhood search for extremal graphs. 5. Three ways to automate finding conjectures","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Variable neighborhood search; Heuristic; Variable (mathematics); Algebraic number; Series (stratigraphy); Combinatorics; Discrete mathematics; Algorithm; Mathematical optimization; Metaheuristic","retraction":null,"screen_n_in":null,"score":{"opus":0.05125561456381406,"gpt":0.3153195008242945,"spread":0.2640638862604804,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001388735,0.0002991762,0.0003823142,0.0003167489,0.0003921621,0.00035796,0.001341029,0.0001005624,0.00007450145],"category_scores_gemma":[0.0005283329,0.0002516698,0.0001539976,0.001041867,0.00008441645,0.0003770532,0.0003305244,0.0002168987,0.00006993729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005627317,"about_ca_system_score_gemma":0.0001176113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002783881,"about_ca_topic_score_gemma":0.00000299718,"domain_scores_codex":[0.9973871,0.0000571294,0.0004124072,0.0005828034,0.0006051555,0.0009554027],"domain_scores_gemma":[0.9974676,0.0008369805,0.00009626195,0.001116319,0.0001934779,0.0002893096],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008429342,0.00005536313,0.00007542354,0.00014969,0.00003751045,0.000008600618,0.001058651,0.0007587505,0.002108525,0.9947709,0.0001738304,0.000794357],"study_design_scores_gemma":[0.0004232099,0.0001610519,0.00003013864,0.00007377406,0.00001143653,0.00004091012,0.0001471445,0.0827535,0.01205709,0.9034129,0.0005509654,0.0003379007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004004224,0.00007434224,0.9793574,0.0001445294,0.0001645385,0.00103629,0.00002758652,0.0002760373,0.01491503],"genre_scores_gemma":[0.1948778,0.000002217475,0.8045505,0.0001181078,0.00002550457,0.0001714635,0.000004642323,0.00005093674,0.0001987376],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1908736,"threshold_uncertainty_score":0.9999936,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001587738,0.00008104925,0.0001303664,0.000059948,0.000071772,0.00003414785,0.0002913219,0.00002745342,0.00005148855],"category_scores_gemma":[0.0001201431,0.00006701274,0.0000957622,0.0001603702,0.00003448391,0.0001354927,0.0000658318,0.00003377676,0.00004800815],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008395039,"about_ca_system_score_gemma":0.000007802889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001374288,"about_ca_topic_score_gemma":8.900676e-7,"domain_scores_codex":[0.9993892,0.00001703084,0.0002205639,0.0001289071,0.000113086,0.0001312321],"domain_scores_gemma":[0.9990679,0.0004581787,0.0001126104,0.0002761757,0.00004602442,0.00003909327],"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.000004191493,0.000174789,0.00002321289,0.0001929489,0.00004842122,9.209409e-7,0.006330102,0.0004467676,0.0004552382,0.9214793,0.004599466,0.06624468],"study_design_scores_gemma":[0.0003104254,0.00009844486,0.00007571922,0.00004183226,0.0000238557,0.000004335117,0.0001795187,0.7158359,0.001547689,0.2793002,0.002421201,0.0001609477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01126557,0.00006430797,0.9833069,0.0002380625,0.0002201704,0.0001539066,0.00001374834,0.00006345973,0.004673876],"genre_scores_gemma":[0.8748355,0.0000056187,0.1181622,0.00009951007,0.00007096281,0.00003479205,0.000006115697,0.00001226761,0.006773046],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8651447,"threshold_uncertainty_score":0.27327,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977889556","doi":"10.1016/s0012-365x(02)00803-8","title":"Finding a maximum induced matching in weakly chordal graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":93,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Chordal graph; Mathematics; Bipartite graph; Matching (statistics); Split graph; 3-dimensional matching; Interval graph; Vertex (graph theory); Indifference graph; Discrete mathematics; Factor-critical graph; Cardinality (data modeling); Pathwidth; Graph; 1-planar graph; Line graph; Graph power; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03729535450122503,"gpt":0.314509867878203,"spread":0.277214513376978,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001150082,0.0002237535,0.0002906476,0.0004063052,0.000142453,0.0002018323,0.000992628,0.00008448972,0.00002730266],"category_scores_gemma":[0.0003042266,0.0002021481,0.0001011702,0.001153634,0.00005538844,0.00055629,0.0002408689,0.0004055154,0.00007327382],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006364538,"about_ca_system_score_gemma":0.00005979939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006511171,"about_ca_topic_score_gemma":0.00001236143,"domain_scores_codex":[0.9979033,0.0001666392,0.0004207888,0.000407165,0.0004817831,0.0006203513],"domain_scores_gemma":[0.9985908,0.0003053576,0.0001257763,0.0008053011,0.00004165432,0.0001310693],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002487709,0.0000658165,0.0002745147,0.00006148247,0.00001078921,0.0000382874,0.004024216,0.0000713308,0.005174673,0.9889847,0.00001023314,0.00128149],"study_design_scores_gemma":[0.0003153875,0.00004136996,0.000186885,0.0001008036,0.000002693326,0.00003477805,0.0007581557,0.004950831,0.004817592,0.9884361,0.00008511935,0.0002703003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4711958,0.00004902405,0.5146851,0.0001320274,0.0001412346,0.0003387482,0.000001990617,0.0001376614,0.01331845],"genre_scores_gemma":[0.8017177,0.00000739805,0.1980308,0.00005085143,0.000008141985,0.00003702053,0.000001070444,0.00002656265,0.0001204811],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3305219,"threshold_uncertainty_score":0.8243362,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001966381,0.0001299998,0.0001571959,0.00004972143,0.00008219675,0.00008323838,0.00008504464,0.00005071293,0.00001365861],"category_scores_gemma":[0.00002845317,0.0001128044,0.00002189667,0.000117314,0.0000222717,0.00006508981,0.00002216378,0.00005807367,0.00001068246],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001049938,"about_ca_system_score_gemma":0.00000590522,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001429836,"about_ca_topic_score_gemma":0.000001334907,"domain_scores_codex":[0.9994799,0.00001457344,0.0001748028,0.0001332081,0.00006119985,0.0001362622],"domain_scores_gemma":[0.9995463,0.00007017547,0.00002640971,0.0002208066,0.00001569064,0.0001206039],"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.000001274613,0.000008686522,0.0001409201,0.0002044797,0.00003375911,1.298429e-7,0.003765339,0.00002750984,0.006557524,0.9887468,0.00006752327,0.0004460164],"study_design_scores_gemma":[0.0004965254,0.00004013452,0.00009204281,0.0001706014,0.00006002412,0.00002442041,0.003367838,0.01864408,0.02356219,0.9453549,0.00772211,0.0004651677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3070267,0.0003938063,0.6878508,0.00002307341,0.000115408,0.0005502703,0.00001324679,0.0001911341,0.003835548],"genre_scores_gemma":[0.9905607,0.00001358448,0.009200746,0.000007070261,0.00003332114,0.00006939033,0.000005603187,0.00002544238,0.00008410256],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6835341,"threshold_uncertainty_score":0.4600031,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity"],"category_scores_codex":[0.003965999,0.003100805,0.001879612,0.001125471,0.003063371,0.004021668,0.005925415,0.003377648,0.0007009272],"category_scores_gemma":[0.002381185,0.003794758,0.003703099,0.002517679,0.002836529,0.002931972,0.003805705,0.003663172,0.0167459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002108338,"about_ca_system_score_gemma":0.001909376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001784417,"about_ca_topic_score_gemma":0.0008754338,"domain_scores_codex":[0.9792883,0.0006816852,0.005070135,0.004323825,0.005766848,0.004869214],"domain_scores_gemma":[0.9826055,0.003671579,0.004615946,0.006944554,0.0005670721,0.001595323],"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.0009290897,0.001639206,0.00002112148,0.002040753,0.00124564,0.001670525,0.008977439,0.00707832,0.002161701,0.9623021,0.008225955,0.003708164],"study_design_scores_gemma":[0.00162329,0.002566365,0.00005957909,0.003929373,0.001340788,0.0009725376,0.002605557,0.9064122,0.05223887,0.01676644,0.008291381,0.003193618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9577441,0.001335454,0.01119473,0.001402905,0.005014862,0.0005950745,0.000683383,0.001314411,0.02071511],"genre_scores_gemma":[0.9662243,0.001309922,0.02215593,0.003161497,0.002641865,0.001297196,0.0006084883,0.001369839,0.00123095],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9455357,"threshold_uncertainty_score":0.9998772,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005504407,0.000106249,0.0001254285,0.00006046293,0.0001007659,0.00009360129,0.0004041448,0.00003108229,0.00007190258],"category_scores_gemma":[0.0001945218,0.00006617398,0.00009356769,0.0002953629,0.000048921,0.0001184974,0.000038581,0.00007845792,0.00002518918],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007854801,"about_ca_system_score_gemma":0.00001495885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.30238e-7,"about_ca_topic_score_gemma":0.000001317815,"domain_scores_codex":[0.999151,0.0001286419,0.0002239215,0.0001361672,0.0002270738,0.0001332265],"domain_scores_gemma":[0.9987029,0.0005034463,0.00012074,0.0006142064,0.00002992051,0.00002875605],"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.000001481377,0.00004708273,0.00001855117,0.00002955392,0.00001125058,7.617573e-7,0.002168921,0.00003079094,0.0004032691,0.9966943,0.0003721783,0.0002218313],"study_design_scores_gemma":[0.0001134083,0.00007944042,0.00003200472,0.00006905021,0.000009175715,0.000003513339,0.0002036123,0.01700443,0.004165486,0.9777158,0.0004932305,0.0001108737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1678547,0.00002786875,0.8039867,0.0005278104,0.0001485854,0.0002482352,0.000004342915,0.00006656298,0.02713525],"genre_scores_gemma":[0.9863153,0.000002555305,0.01321754,0.0002658306,0.000008938625,0.00001281725,0.000001318944,0.000007531664,0.000168248],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8184605,"threshold_uncertainty_score":0.2698497,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2042269609","doi":"10.1016/j.disc.2004.05.003","title":"Tight bounds on maximal and maximum matchings","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Bounded function; Upper and lower bounds; Planar graph; Discrete mathematics; Graph; Class (philosophy); Degree (music); Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01734329773186264,"gpt":0.2819589768785469,"spread":0.2646156791466843,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003372054,0.0001857155,0.0001979539,0.0001302268,0.0001900682,0.0002645414,0.0006992831,0.0000554566,0.00001410939],"category_scores_gemma":[0.00007001549,0.0001484163,0.00005840391,0.0002737701,0.0001518046,0.0003749485,0.0003444757,0.0002154489,0.0001445757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004681366,"about_ca_system_score_gemma":0.00003397323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003092519,"about_ca_topic_score_gemma":0.000001585317,"domain_scores_codex":[0.9985952,0.00002654354,0.0002206005,0.0003443772,0.0004315263,0.000381709],"domain_scores_gemma":[0.9989488,0.0001192931,0.00007646369,0.000671453,0.00003827655,0.0001457556],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006124334,0.00005890803,0.00001946594,0.00005721731,0.00001138188,0.00003027782,0.001872156,0.0000527002,0.000420712,0.9951966,0.00003419786,0.002240248],"study_design_scores_gemma":[0.0003874559,0.0001389797,0.0001318037,0.00007426323,0.00000378031,0.00005758872,0.000112265,0.00248809,0.00214223,0.9936407,0.0006216291,0.0002012525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.141471,0.00007600687,0.8424127,0.001794406,0.00009610465,0.0002571145,0.000005850106,0.0002270393,0.01365984],"genre_scores_gemma":[0.6493183,0.00002572558,0.3495888,0.0003456912,0.00004099608,0.00002517097,0.000002764947,0.00003639748,0.0006160683],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5078474,"threshold_uncertainty_score":0.6052243,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004480699,0.0002453154,0.0006024268,0.00008498795,0.0000712796,0.00004202417,0.0002096658,0.0001149181,0.0006740434],"category_scores_gemma":[0.0008386488,0.0001957026,0.0001269677,0.000177315,0.0001856237,0.00009056058,0.0001216093,0.0001465883,0.00004566005],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001381557,"about_ca_system_score_gemma":0.000005156704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003285816,"about_ca_topic_score_gemma":0.000002232648,"domain_scores_codex":[0.9983519,0.00003970623,0.0007073355,0.0002288804,0.0003660385,0.0003060886],"domain_scores_gemma":[0.9979352,0.001018649,0.0003259488,0.0004979441,0.00007682294,0.0001454485],"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.000003857052,0.0002571989,0.00007600278,0.001527386,0.00008320154,0.000005974244,0.002838266,6.19997e-7,0.000980899,0.9926358,0.0008299165,0.0007608972],"study_design_scores_gemma":[0.0004356815,0.0001197086,0.00006668603,0.0002934567,0.0001742907,0.00004213316,0.0008945296,0.07029293,0.0006703076,0.9261636,0.0004854113,0.0003613185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.826948,0.0008335949,0.03634686,0.0008367025,0.0001114535,0.000964381,0.0001062023,0.0002129852,0.1336398],"genre_scores_gemma":[0.8546536,0.0001202221,0.1437763,0.00004703032,0.00003217603,0.00001763392,0.000002216672,0.00006221066,0.001288611],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1323512,"threshold_uncertainty_score":0.798052,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2175518075","doi":"10.1016/j.disc.2003.05.001","title":"Induced matchings in intersection graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Chordal graph; Indifference graph; Split graph; Block graph; Discrete mathematics; Pathwidth; Induced subgraph; Intersection graph; Matching (statistics); Interval graph; 1-planar graph; Cograph; Line graph; Graph; Vertex (graph theory)","retraction":null,"screen_n_in":null,"score":{"opus":0.02698763385987632,"gpt":0.3014352730218232,"spread":0.2744476391619469,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006691866,0.0001315995,0.0001657098,0.0002841035,0.00006377183,0.00009914657,0.0005464577,0.00005391336,0.00001891492],"category_scores_gemma":[0.0002264247,0.0001161494,0.00006368029,0.0007808325,0.00003861854,0.0004431513,0.0001175417,0.000241585,0.00005820512],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005094087,"about_ca_system_score_gemma":0.0000261809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006152003,"about_ca_topic_score_gemma":0.00001266643,"domain_scores_codex":[0.9987804,0.0001058384,0.0002696711,0.00026002,0.0002726573,0.0003114203],"domain_scores_gemma":[0.9991422,0.0001358554,0.00007839309,0.0005361455,0.0000368277,0.00007056832],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001727759,0.00004883338,0.000208977,0.00003048801,0.000005520597,0.000009423743,0.003014666,0.00001784224,0.002573416,0.99313,0.00001450591,0.0009445663],"study_design_scores_gemma":[0.0002445627,0.00004834045,0.0001768078,0.00005341107,0.000001545621,0.00002684117,0.0006965099,0.007350218,0.006722695,0.9844009,0.0001108106,0.0001674022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4400026,0.00001907905,0.5449464,0.00009743193,0.000145781,0.0002168389,6.008592e-7,0.0001137475,0.01445757],"genre_scores_gemma":[0.923646,0.000004104708,0.07612487,0.00005003002,0.000004317058,0.00002470527,5.928414e-7,0.00001404815,0.0001313834],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4836434,"threshold_uncertainty_score":0.4736433,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007666767,0.0002609233,0.0005426381,0.0001028518,0.0001576239,0.00001886945,0.0003865827,0.00009507313,0.00006837171],"category_scores_gemma":[0.0004724131,0.0001403065,0.0002265972,0.0003239814,0.000477101,0.00007811894,0.00008088152,0.0001931016,0.000001417365],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001013423,"about_ca_system_score_gemma":0.00003460034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005016496,"about_ca_topic_score_gemma":0.000006680158,"domain_scores_codex":[0.998319,0.0001257998,0.0006320896,0.0001915164,0.0004454374,0.0002861281],"domain_scores_gemma":[0.9977267,0.0007096579,0.0005254144,0.0007640027,0.0002175485,0.00005672225],"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.00004516792,0.0001159772,0.002446462,0.0008516118,0.0001942669,0.000005380145,0.003988091,0.000006557986,0.0004153152,0.9917805,0.00009015909,0.00006056923],"study_design_scores_gemma":[0.0004617232,0.0003309452,0.0004880893,0.0004352451,0.0002537267,0.00005326015,0.002272984,0.0001265939,0.01456656,0.9805797,0.0001419806,0.0002891724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9603713,0.0001807808,0.009593562,0.00002072723,0.0001145953,0.0004901582,0.00002685425,0.00005147425,0.02915056],"genre_scores_gemma":[0.938718,0.00004817788,0.06096557,0.00002128814,0.00002175875,0.00002353405,0.000001569577,0.00004774001,0.0001523098],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05137201,"threshold_uncertainty_score":0.5721532,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001361107,0.0001480218,0.0001917336,0.00002056242,0.0001194754,0.0001802219,0.000199044,0.00006486369,0.007843526],"category_scores_gemma":[0.00007040257,0.0001037509,0.00003873791,0.00005238748,0.0000955852,0.0002426373,0.00007288012,0.0000903669,0.0002459105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001774095,"about_ca_system_score_gemma":0.000008321083,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002090272,"about_ca_topic_score_gemma":0.00002052963,"domain_scores_codex":[0.9991291,0.0000338131,0.0002218668,0.0002087948,0.000211082,0.0001953507],"domain_scores_gemma":[0.9993852,0.00009023501,0.00007154109,0.0003561259,0.00002128822,0.00007557375],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006296195,0.000385761,0.0008703918,0.0007550498,0.0001866831,0.00005560358,0.05140187,0.00008844442,0.8728877,0.03888337,0.0108134,0.02304205],"study_design_scores_gemma":[0.002231095,0.000496119,0.007935154,0.0006410864,0.0002320909,0.00008600677,0.007143087,0.006989585,0.1670656,0.7660766,0.03950639,0.001597206],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9862731,0.000195989,0.000452246,0.0003710035,0.0001268978,0.0001157684,0.00008236002,0.00007055378,0.01231212],"genre_scores_gemma":[0.982261,0.00005123818,0.01646156,0.0002176051,0.00005930475,0.000005877798,0.000009153565,0.00002395947,0.0009102939],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7271932,"threshold_uncertainty_score":0.9930634,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001042078,0.00007228831,0.0001615643,0.00004023037,0.0002708178,0.00003307654,0.0006803703,0.00003252951,0.0001689724],"category_scores_gemma":[0.0008416284,0.00003555274,0.0001128591,0.000410253,0.0003495295,0.0000523307,0.00006851123,0.00006668927,0.0006014759],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002996802,"about_ca_system_score_gemma":0.00002007629,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001413954,"about_ca_topic_score_gemma":0.000001334469,"domain_scores_codex":[0.9987606,0.00005635711,0.0004021052,0.0001204145,0.0005419019,0.0001185611],"domain_scores_gemma":[0.9974152,0.00148308,0.0002156018,0.0007212568,0.0001220516,0.00004284504],"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.00001361522,0.0001239167,0.0002467386,0.000011967,0.00003698608,0.000003662499,0.0169212,0.00007465277,0.003258332,0.9410167,0.03693707,0.001355184],"study_design_scores_gemma":[0.0000878479,0.00001540786,0.0003580611,0.000009460578,0.00001109964,0.00002840535,0.002466758,0.001644882,0.001619648,0.9834684,0.01020806,0.00008195505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7970381,0.0002586036,0.04074235,0.002132895,0.00008477464,0.0004463389,0.00005975807,0.00006826995,0.1591689],"genre_scores_gemma":[0.9792139,0.00001464883,0.002934833,0.00004692997,0.00001799791,0.00001447459,0.000001472658,0.000007707855,0.01774803],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1821758,"threshold_uncertainty_score":0.7730956,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000276539,0.0002338505,0.0002607367,0.00004402849,0.0001360339,0.0001086909,0.0001365951,0.000077805,0.00004390084],"category_scores_gemma":[0.00009252387,0.0001789577,0.00004267461,0.0001395884,0.00005644477,0.00009512368,0.00001618781,0.0001356391,0.00004033157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001547835,"about_ca_system_score_gemma":0.00000401041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001820648,"about_ca_topic_score_gemma":0.000007201281,"domain_scores_codex":[0.9991276,0.00004051408,0.0002147114,0.0001693555,0.0001798782,0.0002679649],"domain_scores_gemma":[0.999166,0.0002349069,0.00005596187,0.0004237588,0.0000191862,0.0001002179],"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.00003432846,0.0001008865,0.0008600742,0.001080011,0.0002323309,0.00004548947,0.001862044,0.001572146,0.004991573,0.9885595,0.0005235219,0.000138061],"study_design_scores_gemma":[0.007420957,0.003223378,0.005499611,0.003352786,0.0007838989,0.0009911829,0.00817166,0.06617604,0.01593256,0.87676,0.006606278,0.005081649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9511483,0.0001513122,0.01316598,0.00001327401,0.0002058117,0.0003681854,0.00000760353,0.0002575105,0.03468207],"genre_scores_gemma":[0.9929399,0.00001757154,0.006661768,0.00002484831,0.00002195944,0.00001919568,0.000001605321,0.00006438974,0.000248713],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1117995,"threshold_uncertainty_score":0.7297685,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003536367,0.0001556091,0.0001702842,0.00008043839,0.000119404,0.0001280843,0.0004081492,0.00006957536,0.00005862758],"category_scores_gemma":[0.00008210646,0.0001270323,0.000115523,0.0002144143,0.00003354651,0.0002160102,0.00008241579,0.0001358609,0.00007823786],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000143166,"about_ca_system_score_gemma":0.00002540201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.619932e-7,"about_ca_topic_score_gemma":7.608052e-7,"domain_scores_codex":[0.9990055,0.00006790335,0.0001927591,0.0002329776,0.0002549737,0.0002458711],"domain_scores_gemma":[0.9989017,0.0002790976,0.00007770056,0.0006446735,0.00002091541,0.00007591844],"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.000001559455,0.0001037923,0.00001563133,0.0000247107,0.00002375824,0.000006374236,0.001384391,0.00001099843,0.00008111771,0.9975518,0.0005716913,0.0002241538],"study_design_scores_gemma":[0.0002429568,0.0001431246,0.00004369327,0.00004711125,0.00001565855,0.0000138813,0.00005948094,0.007006388,0.004882426,0.9852001,0.002091508,0.0002536592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2415944,0.00008813298,0.7017224,0.0003140757,0.0004983705,0.0002875279,0.000006193608,0.0007003232,0.05478851],"genre_scores_gemma":[0.9285859,0.00001075971,0.07041902,0.0006398763,0.0000384416,0.00001281876,0.000001268059,0.00001508083,0.0002767937],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6869915,"threshold_uncertainty_score":0.5180226,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005102545,0.00009188744,0.0001586131,0.00002201385,0.00004106114,0.00001996239,0.0005616595,0.00003711107,0.00006604577],"category_scores_gemma":[0.00008424078,0.0000562457,0.00007261077,0.00018992,0.00007356816,0.00007495107,0.00005830338,0.00008402397,0.00002402155],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009350983,"about_ca_system_score_gemma":0.00003522445,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000792939,"about_ca_topic_score_gemma":0.000001329216,"domain_scores_codex":[0.9991066,0.00007149561,0.0002939282,0.0001435418,0.0002622333,0.0001222082],"domain_scores_gemma":[0.9988804,0.0002232395,0.0001179394,0.0006894422,0.00005983998,0.00002917676],"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.00002314257,0.000792964,0.0001244872,0.0003543434,0.00004852645,0.000001695746,0.007137563,0.002434039,0.0005148464,0.9691963,0.0001998642,0.01917223],"study_design_scores_gemma":[0.000153029,0.0002377222,0.0002600388,0.0003415359,0.00001221453,0.000002134888,0.00004411058,0.3039764,0.002597729,0.69213,0.0001074581,0.0001377061],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5216238,0.00001497083,0.469963,0.0005779885,0.00004255195,0.0002069201,0.000008095555,0.00003159832,0.007530976],"genre_scores_gemma":[0.9809881,0.000007263184,0.01868385,0.00005444247,0.000006264671,0.000007485851,7.372348e-7,0.000004868063,0.0002469968],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4593642,"threshold_uncertainty_score":0.2293633,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001244049,0.0001118034,0.0001426566,0.00006000996,0.0002049216,0.0002499043,0.001236432,0.00005009832,0.0001214895],"category_scores_gemma":[0.00002329713,0.00009339205,0.00002741069,0.0003719157,0.0001369262,0.0002301835,0.0004644665,0.0001677521,0.00006141086],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002185078,"about_ca_system_score_gemma":0.000009149203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002899038,"about_ca_topic_score_gemma":0.000004729181,"domain_scores_codex":[0.9990317,0.00005245966,0.0002107399,0.000215448,0.0002761822,0.0002134491],"domain_scores_gemma":[0.9984376,0.000194137,0.00008349106,0.001116272,0.00006688118,0.000101602],"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":[3.362841e-7,0.00006232681,0.0001421809,0.0001210045,0.00002559037,0.000002246337,0.002852943,0.000254435,0.0008932722,0.9565495,0.002446344,0.03664981],"study_design_scores_gemma":[0.0001272784,0.00001627314,0.0002169336,0.00002413378,0.000004373942,0.00003324472,0.0001071646,0.930672,0.0001311709,0.05453284,0.01395309,0.0001814559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002979168,0.0005720885,0.9813405,0.002202935,0.00002058099,0.0004635461,0.00001567258,0.0002079059,0.01219766],"genre_scores_gemma":[0.7717472,0.0001675386,0.2274567,0.0001275987,0.00004077523,0.000056341,0.000008083143,0.00001218176,0.0003835718],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9304176,"threshold_uncertainty_score":0.3808417,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005222086,0.0002736009,0.0004002511,0.0001190902,0.0003531983,0.00007229541,0.0004180042,0.0001275423,0.0002564249],"category_scores_gemma":[0.0008875214,0.0002087665,0.000179332,0.000252493,0.00008970249,0.0001225207,0.0002255209,0.0002081792,0.0001886951],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008187464,"about_ca_system_score_gemma":0.00002573141,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002085312,"about_ca_topic_score_gemma":0.00001084192,"domain_scores_codex":[0.9982825,0.00004716839,0.0005589822,0.0002674079,0.0003670066,0.0004769686],"domain_scores_gemma":[0.9983507,0.0003715132,0.0001564317,0.0007364145,0.0001624353,0.000222503],"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.000005215744,0.00009952343,0.00002392786,0.0001257146,0.00005808517,0.000001771312,0.004597112,0.00005748362,0.0004308244,0.9829172,0.01095539,0.0007277586],"study_design_scores_gemma":[0.0003481743,0.00005382266,0.00002588122,0.0001117866,0.00007619552,0.00002358412,0.0002408047,0.001075075,0.001859942,0.9660268,0.02982169,0.0003362168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3370623,0.0003066827,0.5347832,0.006441941,0.0007475275,0.003035693,0.0006237915,0.001101734,0.1158971],"genre_scores_gemma":[0.8508707,0.00001077614,0.1450116,0.0004888786,0.0002886293,0.00009565426,0.00001263435,0.00006992583,0.003151224],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5138083,"threshold_uncertainty_score":0.851325,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003168111,0.0001204982,0.0003317036,0.00006645325,0.00004239488,0.000003767279,0.0003725466,0.00005772653,0.0000401758],"category_scores_gemma":[0.0001419119,0.00007771752,0.0002645919,0.0003640258,0.000338617,0.00003122501,0.0000670002,0.00006806033,0.000001485727],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004582121,"about_ca_system_score_gemma":0.00001817091,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002428445,"about_ca_topic_score_gemma":0.00002113605,"domain_scores_codex":[0.9988661,0.00003992128,0.0006175489,0.00009404934,0.0002581321,0.0001242705],"domain_scores_gemma":[0.9982068,0.000404601,0.0006074558,0.0006599879,0.0001021912,0.0000189533],"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.000004105859,0.0001734321,0.0006221337,0.0004992514,0.00003576697,8.79998e-8,0.0008283194,0.00002659104,0.0117271,0.9857363,0.00032799,0.0000189434],"study_design_scores_gemma":[0.0001675521,0.00002222404,0.000802642,0.0001704951,0.0001051327,0.000002347549,0.00086235,0.0001903296,0.0680093,0.9295462,0.00004079106,0.00008068358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9803874,0.0000562499,0.005762168,0.00006352748,0.00002969128,0.0003450834,0.00008495102,0.00002054466,0.01325036],"genre_scores_gemma":[0.9760631,0.000003893094,0.02361689,0.000002997792,0.000008212999,0.0000138143,0.000002909841,0.00001825575,0.0002698863],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05628219,"threshold_uncertainty_score":0.3169229,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003569006,0.0001113406,0.0001417054,0.00006058914,0.00008130448,0.0001959566,0.0005548088,0.00003983422,0.000008648419],"category_scores_gemma":[0.000107708,0.0000918395,0.00003669136,0.000250156,0.00005820145,0.0004871623,0.0002862086,0.00009030911,0.00005886669],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007339138,"about_ca_system_score_gemma":0.0001163569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005051894,"about_ca_topic_score_gemma":0.000008866411,"domain_scores_codex":[0.9990451,0.00003579464,0.0002046324,0.0002033597,0.0002808324,0.0002302814],"domain_scores_gemma":[0.9990183,0.00006219615,0.0001102911,0.0005616291,0.00008353012,0.0001640648],"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.000008663123,0.0001503726,0.001025912,0.0001293118,0.0000345464,0.00009396678,0.008544076,0.0004067267,0.001853296,0.9212677,0.02102442,0.04546098],"study_design_scores_gemma":[0.0003587488,0.00006000584,0.00004630318,0.00006901578,0.00001048378,0.000245123,0.0005148297,0.6978011,0.002401789,0.2833761,0.0148277,0.0002888847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01384233,0.00004628655,0.9816316,0.0002010652,0.0002142381,0.0000893103,0.00001091548,0.0001748188,0.003789438],"genre_scores_gemma":[0.1182809,0.000005631924,0.8812715,0.0001081351,0.00007076759,0.000007277211,0.00001368579,0.00001148808,0.0002306215],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6973943,"threshold_uncertainty_score":0.3745106,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002853166,0.0002697452,0.0005268029,0.0001203905,0.0001072668,0.00002622592,0.0001845108,0.00009906122,0.0007332684],"category_scores_gemma":[0.002026278,0.0002132579,0.0001235633,0.0002218279,0.0003325425,0.0001202721,0.00008634224,0.000183695,0.0001267338],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002825046,"about_ca_system_score_gemma":0.000005551718,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.761503e-7,"about_ca_topic_score_gemma":8.068569e-7,"domain_scores_codex":[0.9984602,0.00003931247,0.0005732018,0.0002452354,0.0003834183,0.0002986282],"domain_scores_gemma":[0.9970407,0.001858913,0.000272121,0.0006341789,0.00006834736,0.0001257727],"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.000007574488,0.0001925319,0.00001067609,0.0006109965,0.00005460688,0.000003593358,0.002115723,0.000004494902,0.0002984519,0.994625,0.001715731,0.0003606718],"study_design_scores_gemma":[0.0003608337,0.0001481027,0.00000440569,0.000244705,0.00008619963,0.00002277274,0.001483358,0.002234909,0.001369642,0.9935198,0.0002885234,0.0002367776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5031304,0.0004115494,0.2117265,0.0006476961,0.0003096261,0.001259828,0.0001346539,0.0005238702,0.2818558],"genre_scores_gemma":[0.8960561,0.00005875545,0.09650267,0.00006168132,0.00004280914,0.0000430325,0.000003736766,0.00009927116,0.007131903],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3929257,"threshold_uncertainty_score":0.8696405,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006186267,0.0001457218,0.0001508418,0.00006017521,0.0004187474,0.0002778163,0.001348242,0.00004048465,0.000003397259],"category_scores_gemma":[0.0001041131,0.00008537164,0.0001351101,0.0003386685,0.00008937671,0.0002756295,0.0001168925,0.0001197088,0.00003283622],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001722045,"about_ca_system_score_gemma":0.00002407058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.238059e-7,"about_ca_topic_score_gemma":0.000001134349,"domain_scores_codex":[0.9986776,0.00003693622,0.0002674632,0.0002486935,0.0003160122,0.0004533245],"domain_scores_gemma":[0.9983681,0.0004934914,0.00009896515,0.0008590772,0.00009779296,0.00008261474],"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.000004677758,0.00002867802,0.000003096872,0.00002264292,0.00000970855,0.000001229937,0.0006008496,0.000009558716,0.0002980157,0.9825491,0.0008498476,0.01562258],"study_design_scores_gemma":[0.0001755774,0.0001232055,0.00002582059,0.00002487397,0.000004217182,0.000006999899,0.00005174961,0.02291315,0.001337574,0.9686967,0.006509933,0.00013025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002005876,0.0002221635,0.9857669,0.003600636,0.00007985926,0.0007952986,0.000005288457,0.0001827763,0.007341169],"genre_scores_gemma":[0.2249838,0.00007622429,0.7705658,0.0004803296,0.00006694678,0.0002448951,0.000005678702,0.00003463308,0.003541719],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2229779,"threshold_uncertainty_score":0.3481354,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008647606,0.0001730428,0.0002283322,0.0001053456,0.0001275158,0.0001742977,0.001227381,0.00006606866,0.00007256008],"category_scores_gemma":[0.000372256,0.0001370833,0.00007750388,0.000724019,0.00009686201,0.0003071499,0.0003465218,0.0001978197,0.0002226609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002710866,"about_ca_system_score_gemma":0.00003896484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001005116,"about_ca_topic_score_gemma":0.00002736834,"domain_scores_codex":[0.9984477,0.0001365412,0.0002537774,0.0003167565,0.0004177364,0.0004274744],"domain_scores_gemma":[0.9981773,0.0004886827,0.00009014898,0.001009272,0.00009372221,0.0001408745],"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.00001661554,0.0001431453,0.003608266,0.00007500035,0.00005182865,0.0001280268,0.00244339,0.0001495905,0.0005966552,0.984601,0.001202384,0.00698415],"study_design_scores_gemma":[0.0006872709,0.0001642066,0.00401851,0.00007538615,0.000008605301,0.0002671385,0.0002169775,0.07474227,0.001642691,0.9114678,0.006029928,0.0006792486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04082653,0.0001088691,0.9481309,0.0003760738,0.0001002978,0.0002283271,0.000009921272,0.0002323721,0.009986722],"genre_scores_gemma":[0.854973,0.000055171,0.1420541,0.0002180322,0.00005227606,0.00003019606,0.00001391454,0.00003779254,0.002565448],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8141465,"threshold_uncertainty_score":0.5590095,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006746509,0.0001587721,0.0002079859,0.0001500331,0.0001767359,0.0001994138,0.0007249423,0.00005199431,0.00005614542],"category_scores_gemma":[0.0002228508,0.0001379545,0.0001280491,0.0003490089,0.0001070046,0.0006131514,0.00008661005,0.00009521929,0.00003389061],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002958569,"about_ca_system_score_gemma":0.0000225676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002796277,"about_ca_topic_score_gemma":0.000001868558,"domain_scores_codex":[0.9986021,0.00006866722,0.0003311023,0.0002845968,0.0003393102,0.0003742033],"domain_scores_gemma":[0.9984682,0.0006943225,0.00009077985,0.000578361,0.00008548693,0.00008291002],"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.00001176061,0.00004068043,0.00001750416,0.0001333486,0.00001756753,0.000003339085,0.003883891,0.0001647505,0.000321768,0.9787561,0.00008943778,0.01655981],"study_design_scores_gemma":[0.0003121503,0.000075477,0.00001915029,0.00005547014,0.000006529025,0.00001110972,0.0004943198,0.1255749,0.0021199,0.8708577,0.000274188,0.0001990489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1239051,0.0001116451,0.8713514,0.0002187112,0.0000695668,0.0005140348,0.00001322868,0.0001697751,0.003646594],"genre_scores_gemma":[0.4067351,0.00003349038,0.5909881,0.00008559252,0.00002229204,0.0001731854,0.00001179476,0.00002838219,0.001922104],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.28283,"threshold_uncertainty_score":0.562562,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001997339,0.00008624794,0.0001390297,0.0001293601,0.00005108348,0.00004805741,0.0001888851,0.00002637215,0.000001620025],"category_scores_gemma":[0.0000285033,0.00006393652,0.00002640481,0.0002919559,0.0002805752,0.0002707921,0.00005822765,0.00005390222,0.000001084981],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008299212,"about_ca_system_score_gemma":0.00001153598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007017073,"about_ca_topic_score_gemma":0.00001269459,"domain_scores_codex":[0.999247,0.00003404237,0.0001851557,0.0001536661,0.0002460623,0.0001340776],"domain_scores_gemma":[0.999339,0.0001794016,0.0001292739,0.0002596666,0.00006333708,0.00002928602],"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.000008082456,0.00002419176,0.0006323676,0.0000478537,0.000009440161,0.000001739008,0.0003529244,0.0001019318,0.001124209,0.9941491,0.000004860924,0.003543328],"study_design_scores_gemma":[0.0003671917,0.0001334557,0.0008802904,0.00004818322,0.000009606597,0.0000351816,0.000326555,0.02465901,0.01223363,0.9611829,0.000007904217,0.0001161144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3701002,0.00002320744,0.6288129,0.00004297008,0.00001294816,0.0001064458,0.00000249528,0.00002883361,0.0008700044],"genre_scores_gemma":[0.6304126,0.000003643697,0.369543,0.000002571287,0.000002573761,0.000006164358,0.00000158977,0.000004660153,0.00002318959],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.2603124,"threshold_uncertainty_score":0.2607256,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001680584,0.00009790683,0.00009989418,0.00003051457,0.0007050043,0.0001695605,0.0009129976,0.0000239917,0.000005134348],"category_scores_gemma":[0.00006065781,0.00005921326,0.00003796006,0.0002357654,0.00004819285,0.0001937406,0.000414909,0.00007167915,0.0002273317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001503775,"about_ca_system_score_gemma":0.00002264102,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006692685,"about_ca_topic_score_gemma":0.000003797302,"domain_scores_codex":[0.9991568,0.0000241304,0.0001920738,0.0001668093,0.0002621286,0.0001980726],"domain_scores_gemma":[0.9988908,0.0001291352,0.00006033177,0.0007491843,0.00007470522,0.00009579915],"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.000001315845,0.0001315887,0.00003484356,0.00001279161,0.00001600371,0.00002004058,0.003762268,0.000219034,0.0003133226,0.9496685,0.03622162,0.009598661],"study_design_scores_gemma":[0.0004918773,0.0001192094,0.00160058,0.00006869373,0.00001020756,0.0001211574,0.0003254752,0.8752854,0.002549139,0.04686179,0.07208475,0.000481702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01943836,0.00006581896,0.974715,0.001746012,0.0002394286,0.0001727956,0.00001034935,0.0001098478,0.003502382],"genre_scores_gemma":[0.4611336,0.0001275714,0.5329424,0.0006387211,0.0001374521,0.00008130235,0.000021014,0.00002893149,0.004889061],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9028067,"threshold_uncertainty_score":0.5422394,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005512172,0.0001588187,0.000345602,0.0001958616,0.00006730725,0.0000205646,0.0005009763,0.00005193564,0.00001502365],"category_scores_gemma":[0.000523752,0.0001346887,0.00007386566,0.0009453314,0.000464027,0.0002941781,0.0002362994,0.000119626,0.000002769215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001326296,"about_ca_system_score_gemma":0.0000480195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002052717,"about_ca_topic_score_gemma":7.735654e-7,"domain_scores_codex":[0.9984084,0.00008857346,0.0004506902,0.0002817253,0.0004733505,0.0002972074],"domain_scores_gemma":[0.9982921,0.0003996452,0.0002889273,0.0006782363,0.0002361274,0.0001049604],"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.000007291346,0.00008767099,0.0007884302,0.0002444214,0.00002289008,0.000004303351,0.0008986673,0.000008624343,0.006915261,0.9908686,0.000007305222,0.0001465589],"study_design_scores_gemma":[0.0007670969,0.0004426944,0.0004656625,0.0002785665,0.00002643596,0.00004141278,0.001191708,0.004816554,0.1432602,0.847953,0.0004503074,0.0003064507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.476013,0.0001832684,0.5181875,0.00003352595,0.00006093872,0.0002937912,0.0000143867,0.00005354609,0.005160068],"genre_scores_gemma":[0.8393361,0.00006058977,0.1604337,0.00000892963,0.000001558991,0.00001418245,0.000001182146,0.00001281341,0.0001309371],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3633231,"threshold_uncertainty_score":0.5492447,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006421328,0.0001446377,0.0002123449,0.0002514048,0.00007182496,0.000105156,0.0009834957,0.00005227489,0.00002869313],"category_scores_gemma":[0.0001392936,0.0001275031,0.00006869683,0.000680031,0.00008156351,0.0005367997,0.0003075434,0.0002147814,0.0001266967],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004710009,"about_ca_system_score_gemma":0.00002511357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001782814,"about_ca_topic_score_gemma":0.000009245648,"domain_scores_codex":[0.9985467,0.00005994867,0.0003222102,0.0002924535,0.0003596172,0.0004190296],"domain_scores_gemma":[0.998827,0.0002274153,0.00008208255,0.0007239772,0.00004081638,0.00009873028],"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.000002266587,0.00005613814,0.0002764884,0.00004267762,0.000007261165,0.00001645648,0.002343975,0.0002549627,0.0006720378,0.9874189,0.0001240323,0.008784835],"study_design_scores_gemma":[0.0003930147,0.00003469861,0.0002361763,0.00009488331,0.000002537776,0.00002621843,0.0002401054,0.2002634,0.003586354,0.7935828,0.001264796,0.0002749818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.201146,0.0002752962,0.7789472,0.001720067,0.0001124437,0.0004681624,0.000004776032,0.0003132847,0.01701278],"genre_scores_gemma":[0.669961,0.00002248516,0.3296218,0.0001231276,0.00001558524,0.00002066445,0.000001257606,0.00001621895,0.0002179188],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.468815,"threshold_uncertainty_score":0.5199424,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001963769,0.0001451729,0.0001842624,0.00005081607,0.00007459935,0.00005883465,0.00008351142,0.00005563679,0.000006201772],"category_scores_gemma":[0.00002988572,0.0001271008,0.00004765662,0.00009425006,0.00002653112,0.0001010696,0.00002278706,0.00009805757,0.00003032137],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001766035,"about_ca_system_score_gemma":0.000003908553,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002688457,"about_ca_topic_score_gemma":0.000001900938,"domain_scores_codex":[0.9993591,0.000005842599,0.0002255665,0.0001063538,0.00009806649,0.0002050742],"domain_scores_gemma":[0.9996749,0.00003502247,0.00003513687,0.0001784468,0.000009862239,0.00006663503],"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.000007864252,0.00006897494,0.001335462,0.004619419,0.0003695084,0.00005388641,0.06510406,0.01987921,0.0825178,0.8228419,0.0002870004,0.002914907],"study_design_scores_gemma":[0.001982768,0.0001230342,0.0008612055,0.002816183,0.0002104084,0.0002858195,0.03881797,0.02377078,0.09863103,0.8273877,0.003199041,0.001914059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9582048,0.0005993842,0.01856063,0.0000872775,0.0001521796,0.0001408331,0.000002216881,0.0003553157,0.02189734],"genre_scores_gemma":[0.9948428,0.0000135119,0.004975901,0.0000153389,0.00005345006,0.000009914393,0.000001454499,0.00003564217,0.00005193257],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03663803,"threshold_uncertainty_score":0.518302,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00137076,0.0002893414,0.0002507255,0.00006423406,0.001060618,0.0008117936,0.001707307,0.00006293865,0.000008836902],"category_scores_gemma":[0.0001352856,0.0001413647,0.00008152947,0.0004670299,0.0003089224,0.0004897634,0.0006782555,0.0005325738,0.00003334093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003464844,"about_ca_system_score_gemma":0.00004312828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001475642,"about_ca_topic_score_gemma":0.00007121082,"domain_scores_codex":[0.9977395,0.0001597186,0.0003666757,0.0003969815,0.0007028546,0.0006342935],"domain_scores_gemma":[0.9964634,0.001852484,0.000198372,0.001272133,0.00007758697,0.0001359808],"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.00001980044,0.00003769434,0.00004066345,0.00005579837,0.0000649858,0.00001196464,0.01165366,0.0001289367,0.001149478,0.9618728,0.00004304417,0.02492122],"study_design_scores_gemma":[0.0002850938,0.00006608992,0.0001960802,0.00007703924,0.00001331911,0.0001100693,0.00255597,0.00416567,0.0005674522,0.9911341,0.0005816921,0.000247434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.610083,0.0003473746,0.3744557,0.009675459,0.000106384,0.0007894289,0.000005195786,0.0002678291,0.004269646],"genre_scores_gemma":[0.8503585,0.00007538988,0.1484765,0.0004344567,0.00005907327,0.00006684681,7.171297e-7,0.00005032181,0.0004781325],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2402756,"threshold_uncertainty_score":0.815752,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007195244,0.0001061004,0.0002234539,0.0001431743,0.00006321397,0.00002311946,0.0002848053,0.00002835204,0.000001327001],"category_scores_gemma":[0.0004036028,0.00006097199,0.0000462768,0.0005654968,0.00009857264,0.00005846929,0.0001107749,0.00006149409,0.000002060076],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002668166,"about_ca_system_score_gemma":0.00001044189,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008639173,"about_ca_topic_score_gemma":6.204402e-7,"domain_scores_codex":[0.9990462,0.00007226156,0.000269289,0.0001921138,0.0002900966,0.0001300193],"domain_scores_gemma":[0.9985629,0.0004501911,0.0002068159,0.0006440493,0.00009879704,0.00003722326],"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.000001317541,0.00004920949,0.00009060211,0.0001149727,0.00001545036,1.798611e-7,0.000809813,0.000075524,0.003577427,0.9943898,0.0001259631,0.0007497282],"study_design_scores_gemma":[0.0004067923,0.0005265481,0.0005156219,0.000407637,0.00006111252,0.00000605668,0.000249123,0.1703449,0.1008979,0.7262759,0.00004566391,0.0002627481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9691797,0.0003246742,0.02358453,0.0008269878,0.0001374352,0.0003411998,0.000003869367,0.00006965694,0.005531922],"genre_scores_gemma":[0.9787663,0.000008854081,0.02115127,0.00003077036,0.000001782441,0.000003591417,6.135345e-7,0.000006971027,0.00002980879],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2681139,"threshold_uncertainty_score":0.2486366,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.005533184,0.002158303,0.001391466,0.001194741,0.002508725,0.002410016,0.00439582,0.003072662,0.000853144],"category_scores_gemma":[0.001806844,0.003046439,0.003074587,0.002940771,0.002424108,0.002024145,0.003431346,0.002926781,0.002295562],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006967842,"about_ca_system_score_gemma":0.001326131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00131506,"about_ca_topic_score_gemma":0.0004364034,"domain_scores_codex":[0.9820583,0.0005743497,0.004729338,0.003407198,0.004952708,0.004278116],"domain_scores_gemma":[0.9863195,0.002714445,0.00440863,0.003880925,0.0007368414,0.001939632],"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.0006034171,0.001094089,0.00003512239,0.002775506,0.001977776,0.0008466803,0.007583351,0.003705433,0.004990359,0.9651089,0.007892749,0.003386615],"study_design_scores_gemma":[0.003595067,0.002736455,0.00003248011,0.004600937,0.002416731,0.001613053,0.005116016,0.5822244,0.2529734,0.1396261,0.001429296,0.003636132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9765527,0.003074758,0.009106807,0.000565014,0.003117129,0.0003072186,0.0008091589,0.0008103389,0.005656907],"genre_scores_gemma":[0.9677074,0.001341034,0.02678723,0.001079056,0.000833076,0.0004515423,0.0006250496,0.0009439224,0.0002317245],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8254828,"threshold_uncertainty_score":0.9993735,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006930295,0.0003494198,0.0003084926,0.0001555309,0.0003487995,0.0002988261,0.00125874,0.0003010337,0.00006082356],"category_scores_gemma":[0.0004716904,0.000373409,0.0003935753,0.000533569,0.0003491385,0.00107035,0.00070292,0.0003233269,0.0009324753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000015201,"about_ca_system_score_gemma":0.0001469101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000540798,"about_ca_topic_score_gemma":0.00002157635,"domain_scores_codex":[0.9970148,0.0000674685,0.0009413043,0.0004527894,0.0007967021,0.0007269916],"domain_scores_gemma":[0.9970782,0.0004514927,0.0007440669,0.00135815,0.0001093905,0.0002586592],"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.0000142943,0.0002240858,0.00005972044,0.0002474553,0.0001028522,0.00001548895,0.005876377,0.0001482522,0.003259263,0.9889265,0.000179782,0.0009458833],"study_design_scores_gemma":[0.000122776,0.0001442813,0.0001357857,0.0003059734,0.0001109341,0.00006811084,0.0007374701,0.9557509,0.03317474,0.008161669,0.0008959784,0.0003913069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9041595,0.0001256817,0.09211306,0.0002582363,0.0007752904,0.0001000191,0.00007140129,0.0001784525,0.002218302],"genre_scores_gemma":[0.9648077,0.00009887088,0.03415197,0.0002706589,0.0002681119,0.0001134596,0.00007347574,0.00008865562,0.0001271325],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9807649,"threshold_uncertainty_score":0.9998718,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003806866,0.0001845117,0.0002367339,0.00009375771,0.0002940947,0.00006798943,0.0008849251,0.00005335216,0.0000416494],"category_scores_gemma":[0.00007271231,0.0001380386,0.00008416502,0.0006537795,0.0001558189,0.0004800536,0.0002875972,0.0002319284,0.0002122003],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003255553,"about_ca_system_score_gemma":0.00005289051,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002487504,"about_ca_topic_score_gemma":0.000004707616,"domain_scores_codex":[0.9983519,0.00006363176,0.0002482259,0.0003291311,0.0004889449,0.0005182074],"domain_scores_gemma":[0.9985542,0.0001896869,0.0001061983,0.0009044558,0.0001044746,0.0001409743],"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.00000546118,0.00007537483,0.001588106,0.0000506758,0.00002450468,0.0001017215,0.002336618,0.00001679375,0.00009305464,0.9954203,0.0001380487,0.0001492954],"study_design_scores_gemma":[0.001176803,0.0001872718,0.001089534,0.0002113474,0.00001442806,0.0009721188,0.0007721146,0.03790392,0.004009313,0.9504979,0.002319802,0.0008454884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08447641,0.00002951394,0.894789,0.0001807864,0.00003953153,0.0002301223,0.000004335611,0.000242848,0.02000747],"genre_scores_gemma":[0.6926849,0.00003011443,0.3063238,0.0001430626,0.00001910698,0.00003430581,0.00000284884,0.00002978647,0.0007320482],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6082085,"threshold_uncertainty_score":0.5629051,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002654817,0.0001425058,0.0001718255,0.0001390413,0.00009834745,0.0003957724,0.001089683,0.00003620824,0.000007632707],"category_scores_gemma":[0.0001311393,0.0001187912,0.00007453822,0.0006536095,0.0000475008,0.0003422168,0.0003994956,0.0001067924,0.000151826],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003058337,"about_ca_system_score_gemma":0.0000191921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000576048,"about_ca_topic_score_gemma":0.000006583735,"domain_scores_codex":[0.9986663,0.00003211276,0.0001753406,0.000296124,0.0004305296,0.0003996335],"domain_scores_gemma":[0.9987394,0.0001385032,0.00006018925,0.0008662803,0.000077838,0.0001177687],"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.000001457475,0.00004352602,0.00004922334,0.00003186504,0.000005478552,0.00001490236,0.0003426376,0.00009289842,0.001870987,0.9938681,0.001808602,0.001870289],"study_design_scores_gemma":[0.0002014079,0.00007982811,0.0001923679,0.0000428384,0.000004334313,0.00002804692,0.0001371057,0.02094238,0.007344636,0.9558964,0.01480105,0.0003295947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01122184,0.00004334187,0.975859,0.002775891,0.00006048386,0.0002540569,0.000004176245,0.0001935868,0.0095876],"genre_scores_gemma":[0.347391,0.000001706154,0.6446702,0.0001588044,0.00008132516,0.00004143848,0.000002247668,0.00002453915,0.007628711],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3361692,"threshold_uncertainty_score":0.4844166,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005959928,0.0001869421,0.0004100417,0.0005974147,0.0001126914,0.00008055705,0.0007754929,0.00004506585,0.00002923164],"category_scores_gemma":[0.0001270652,0.0001311493,0.0001774052,0.002825939,0.0002053819,0.0002063415,0.00008928506,0.0001365727,0.00001269197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002218281,"about_ca_system_score_gemma":0.00004050864,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003906813,"about_ca_topic_score_gemma":0.00001198662,"domain_scores_codex":[0.9982095,0.0001020899,0.0003106419,0.0003336622,0.0006763846,0.0003676874],"domain_scores_gemma":[0.9981298,0.0003182527,0.000188465,0.001117481,0.0001387921,0.0001072208],"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.00000739222,0.0001201747,0.0007047846,0.00003476086,0.0004764244,0.00001109513,0.0009718323,0.001087635,0.00009303664,0.9956768,0.000007566208,0.0008084741],"study_design_scores_gemma":[0.0008049295,0.0007446826,0.001362364,0.0001160815,0.0004583549,0.00002107943,0.0009018849,0.2566201,0.007585137,0.7305775,0.0001855635,0.0006222871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06456934,0.00004700608,0.9241756,0.00004424135,0.00002969352,0.0002144854,0.00001075861,0.00007842609,0.01083046],"genre_scores_gemma":[0.6140214,0.00001046477,0.3856078,0.00002937908,0.000003328857,0.00002033227,0.000003607296,0.0000189923,0.000284644],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5494521,"threshold_uncertainty_score":0.5348113,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009777239,0.0001397802,0.0003179472,0.0002138523,0.00002146154,0.00004297026,0.0005487571,0.00005082258,0.00002577783],"category_scores_gemma":[0.001420442,0.000109029,0.00005162664,0.0005976874,0.00007797658,0.0003115711,0.0001581704,0.0001483365,0.00001538775],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000465249,"about_ca_system_score_gemma":0.00006041224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008332388,"about_ca_topic_score_gemma":0.0000820259,"domain_scores_codex":[0.9984189,0.000158363,0.000505153,0.0002404928,0.0003136178,0.000363432],"domain_scores_gemma":[0.9984503,0.0008193017,0.0001422845,0.0004652727,0.00006211001,0.00006077304],"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.0002228779,0.0005316705,0.002547035,0.001029477,0.00005836329,0.0002892261,0.04108439,0.0004672239,0.01770629,0.9311655,0.00005336815,0.004844627],"study_design_scores_gemma":[0.006117045,0.000861586,0.001160523,0.0009323257,0.00001705169,0.0000779828,0.007851073,0.6025767,0.02588246,0.3534166,0.0002306794,0.0008760137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9100602,0.00006852392,0.078679,0.0001466084,0.00007592233,0.0005467862,0.000006654934,0.00004099025,0.01037532],"genre_scores_gemma":[0.8838701,0.000004708214,0.1157321,0.00002290193,0.000005866126,0.00002956435,0.000001208616,0.00001261169,0.0003209052],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6021095,"threshold_uncertainty_score":0.4446073,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004105098,0.0004069465,0.0003920617,0.0001673061,0.0003370111,0.0001532331,0.0005514871,0.0003278189,0.00004337176],"category_scores_gemma":[0.00006586158,0.0004506246,0.0005388175,0.0003573829,0.000193888,0.0002953806,0.0001152791,0.0003631363,0.0003442142],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001601989,"about_ca_system_score_gemma":0.0000482451,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002759715,"about_ca_topic_score_gemma":0.00004369454,"domain_scores_codex":[0.9976532,0.00004371918,0.0008651372,0.0003312215,0.0005166531,0.0005900222],"domain_scores_gemma":[0.998239,0.0002295225,0.0003242547,0.0009349659,0.00005391731,0.0002183815],"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.00003483548,0.0001254383,0.000008176461,0.0006584991,0.0002478786,0.00004244113,0.001696244,0.003012829,0.007027314,0.9866967,0.0002514289,0.0001981896],"study_design_scores_gemma":[0.0005487252,0.0002711925,0.0001212187,0.0006792124,0.0002522689,0.0002082575,0.001032996,0.9772614,0.006832686,0.01134804,0.0009449706,0.0004990143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9825945,0.0002569958,0.0055592,0.00007542148,0.0004046056,0.0001126032,0.0002526079,0.000284457,0.01045964],"genre_scores_gemma":[0.9916821,0.0001011951,0.007495997,0.0001210052,0.0001598203,0.00007842663,0.0001911847,0.0001223549,0.00004796666],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9753487,"threshold_uncertainty_score":0.9997945,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008083505,0.0003310955,0.0002415478,0.0002009353,0.0008921089,0.0006565367,0.0009179647,0.0002481856,0.00002965498],"category_scores_gemma":[0.0006554757,0.0003531544,0.0002436987,0.0005704341,0.000417329,0.00100806,0.0008388897,0.0006779304,0.0003243886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001304126,"about_ca_system_score_gemma":0.0001459541,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002973036,"about_ca_topic_score_gemma":0.00009834916,"domain_scores_codex":[0.9972057,0.00007187377,0.000601029,0.0006430281,0.0007846378,0.0006937475],"domain_scores_gemma":[0.9971772,0.0008023817,0.0004160639,0.001235303,0.0000888005,0.0002802786],"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.00002675052,0.00008873064,0.00006151183,0.0001615948,0.00009315627,0.00004619311,0.002699322,0.0002755742,0.00310848,0.9913658,0.0001159628,0.00195693],"study_design_scores_gemma":[0.000448819,0.0001613313,0.0001800565,0.0002077465,0.00008590907,0.0001860525,0.00138159,0.9710275,0.0029981,0.02152567,0.001419909,0.0003773005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8772773,0.0001156996,0.11964,0.0002521654,0.0005271867,0.00009765485,0.00003794648,0.000208075,0.001843979],"genre_scores_gemma":[0.9208753,0.00006904668,0.07806969,0.0001511742,0.0002486583,0.0001779991,0.00006167006,0.00009321493,0.0002533194],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9707519,"threshold_uncertainty_score":0.9998921,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006005004,0.0001012195,0.0001465782,0.00006489442,0.00009511822,0.00004232932,0.001177068,0.00002615216,0.0001280314],"category_scores_gemma":[0.0004348797,0.00005796968,0.0001010484,0.0004596522,0.0001873287,0.0001246764,0.0002315849,0.0001402216,0.00009090501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009781768,"about_ca_system_score_gemma":0.00000437036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.033757e-7,"about_ca_topic_score_gemma":5.061713e-7,"domain_scores_codex":[0.9988506,0.00008898918,0.0002313052,0.000191807,0.000428193,0.0002090962],"domain_scores_gemma":[0.9975466,0.000968164,0.0001000299,0.001280136,0.00005741995,0.0000477186],"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":[9.375262e-7,0.00007814376,0.00003670199,0.00002690176,0.000008830348,0.000001173215,0.00114919,0.00001743478,0.0001463867,0.9970771,0.0002571059,0.001200059],"study_design_scores_gemma":[0.00007162388,0.00006440868,0.00009205741,0.00002657163,0.00000212807,0.000001845142,0.00007768338,0.05468935,0.002234624,0.9426198,0.00004797797,0.00007194087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2458275,0.0001160747,0.7068018,0.001727972,0.00009659991,0.0005534178,0.00001133692,0.0001444635,0.0447208],"genre_scores_gemma":[0.9814726,0.00000966577,0.01811511,0.00007871015,0.000004435136,0.00001369877,2.376317e-7,0.000007975073,0.0002976378],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7356451,"threshold_uncertainty_score":0.2363935,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001959495,0.00007724387,0.000112347,0.0000341583,0.0001310843,0.00005726792,0.0003268879,0.00002154403,0.0000335062],"category_scores_gemma":[0.00007815268,0.00005238328,0.00008415926,0.0002077419,0.0000309171,0.0001136281,0.00009699383,0.00003566859,0.000031028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001470433,"about_ca_system_score_gemma":0.00001101517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000376114,"about_ca_topic_score_gemma":0.000001863898,"domain_scores_codex":[0.9993048,0.00001335423,0.0002412314,0.0001564175,0.0001644171,0.0001197884],"domain_scores_gemma":[0.9990726,0.0003936467,0.00007441311,0.000333049,0.00008116534,0.00004515847],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007593658,0.0004584239,0.00002124599,0.0001740669,0.00008213847,4.714881e-7,0.01005975,0.00193548,0.00193783,0.3172728,0.01616629,0.6518839],"study_design_scores_gemma":[0.0001250675,0.00005679132,0.0001757388,0.00001106567,0.00001059517,0.000003039964,0.00008814895,0.9675554,0.0004740223,0.02674682,0.004671176,0.00008215445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002411922,0.00003149565,0.9937705,0.002726204,0.0001643217,0.0004190904,0.00002497897,0.00004229905,0.000409138],"genre_scores_gemma":[0.4083096,0.000003058259,0.5900429,0.0003226306,0.0001840811,0.0002802023,0.000008965978,0.00001143441,0.0008371017],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9656199,"threshold_uncertainty_score":0.2136128,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}