{"meta":{"query_hash":"cffd719b121f","filters":{"venue":"Discrete Mathematics"},"cohort_total":687,"direct_labels_cover":0,"predictions_cover":687,"exported":687,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/cffd719b121f","api":"https://metacan.xera.ac/api/v1/cohort?venue=Discrete+Mathematics"},"results":[{"id":"W1001014873","doi":"10.1016/j.disc.2015.04.021","title":"New bounds for chromatic polynomials and chromatic roots","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Chromatic scale; Upper and lower bounds; Graph; Chromatic polynomial; Order (exchange); Discrete mathematics; Mathematical analysis","score_opus":0.06934156671547613,"score_gpt":0.3475302862876567,"score_spread":0.27818871957218055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1001014873","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036177937,0.018849533,0.6520347,0.017749375,0.0046147364,0.00019503041,0.001622501,0.0018119641,0.26694417],"genre_scores_gemma":[0.59067327,0.023223476,0.23830467,0.008587371,0.016747694,0.0011253838,0.0031774137,0.0033421384,0.11481864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946767,0.00094486645,0.00021654823,0.0012469533,0.0019649898,0.00094989804],"domain_scores_gemma":[0.9668081,0.022973653,0.0015667338,0.0032115635,0.003011477,0.0024285237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066336393,0.005140723,0.0033175952,0.012790995,0.004641456,0.010916096,0.009007646,0.003956044,0.03633719],"category_scores_gemma":[0.043082554,0.0023123997,0.0029655558,0.011729982,0.009698987,0.030379975,0.013149971,0.024091793,0.008103053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013223547,0.00010421743,0.0005047586,0.00027531316,0.000036851005,0.00007391842,0.00034557175,0.0045142006,0.0012594955,0.94485074,0.01605272,0.031849988],"study_design_scores_gemma":[0.000018956893,0.000021336282,0.00039003947,0.000094250674,0.00005083211,0.0000788992,0.00008356472,0.013424126,0.0005207449,0.9726943,0.012580336,0.00004270161],"about_ca_topic_score_codex":0.003151727,"about_ca_topic_score_gemma":0.0056984564,"teacher_disagreement_score":0.03633719,"about_ca_system_score_codex":0.007874322,"about_ca_system_score_gemma":0.0020703922,"threshold_uncertainty_score":0.12156004},"labels":[],"label_agreement":null},{"id":"W1486394389","doi":"10.1016/j.disc.2014.03.002","title":"Semidefinite programming for permutation codes","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Semidefinite programming; Permutation (music); Combinatorics; Permutation group; Conjugacy class; Upper and lower bounds; Order (exchange); Symmetric group; Discrete mathematics","score_opus":0.01757138752844671,"score_gpt":0.2605234870199942,"score_spread":0.2429520994915475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486394389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038495965,0.00075981603,0.9121329,0.002751647,0.00027127934,0.000108577515,0.0006515732,0.0002715154,0.04455677],"genre_scores_gemma":[0.6805896,0.0027394663,0.25156036,0.0018308546,0.0008973297,0.0009897099,0.0017380149,0.00061878114,0.059035912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984201,0.0007784172,0.00005043304,0.00023452367,0.00035795599,0.00015845514],"domain_scores_gemma":[0.99407876,0.0042602275,0.00035957398,0.00041928253,0.00057302136,0.00030925596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021790173,0.0016060392,0.0012099296,0.0007717906,0.00072001864,0.0029727013,0.0013470845,0.001300932,0.007841059],"category_scores_gemma":[0.008670049,0.0007378007,0.0007174579,0.0012932189,0.002393142,0.0037366713,0.0014907164,0.004245952,0.0012439372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006144685,0.000091541224,0.00013075862,0.00010513635,0.000018398314,0.00006234769,0.00009532434,0.037712194,0.0006305442,0.9402038,0.006969009,0.013919515],"study_design_scores_gemma":[0.000017563394,0.000027318978,0.00003592694,0.000015854557,0.0000036766978,0.000024662735,0.00001972285,0.11885994,0.0001768902,0.879323,0.0014847704,0.00001062671],"about_ca_topic_score_codex":0.0011258346,"about_ca_topic_score_gemma":0.0014652057,"teacher_disagreement_score":0.007841059,"about_ca_system_score_codex":0.0017005816,"about_ca_system_score_gemma":0.0018376224,"threshold_uncertainty_score":0.026230931},"labels":[],"label_agreement":null},{"id":"W1488690765","doi":"10.1016/j.disc.2015.11.015","title":"Locating patterns in the de Bruijn torus","year":2015,"lang":"nl","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"De Bruijn sequence; Torus; Mathematics; Combinatorics; Sequence (biology); Binary number; Decoding methods; Square tiling; Matrix (chemical analysis); Discrete mathematics; Hexagonal tiling; Grid; De Bruijn graph; Algorithm; Arithmetic; Geometry","score_opus":0.07189366474569335,"score_gpt":0.3402101218077608,"score_spread":0.2683164570620674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488690765","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7117962,0.00039615433,0.13043045,0.0013229044,0.0003491585,0.00011233807,0.00049401936,0.0005726808,0.15452614],"genre_scores_gemma":[0.9178646,0.00034362962,0.047794927,0.00017702038,0.00009326139,0.00009532,0.0004526476,0.00022231892,0.03295636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994537,0.00011261994,0.000031735057,0.00011356809,0.00015580552,0.00013261005],"domain_scores_gemma":[0.9988411,0.0004884533,0.00021234217,0.00018248966,0.00013912517,0.00013660846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029744077,0.0003264056,0.00052500877,0.001427661,0.0018294313,0.0026536337,0.00093005685,0.001261091,0.008251622],"category_scores_gemma":[0.0029843056,0.0005592598,0.0003791763,0.0015071062,0.0018490077,0.0031410484,0.0017292168,0.0012329327,0.0021642498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015966382,0.00004298933,0.0008520935,0.0000780726,0.000011765535,0.0005028524,0.00070812553,0.007444776,0.004775754,0.9634092,0.003950973,0.018063841],"study_design_scores_gemma":[0.000051997402,0.000047844544,0.00038457024,0.000028627592,0.000009949464,0.0005136442,0.00076927437,0.017391313,0.0027763888,0.96805286,0.009953,0.000020439948],"about_ca_topic_score_codex":0.0010647172,"about_ca_topic_score_gemma":0.0010489844,"teacher_disagreement_score":0.008251622,"about_ca_system_score_codex":0.0006141552,"about_ca_system_score_gemma":0.00047878808,"threshold_uncertainty_score":0.02760446},"labels":[],"label_agreement":null},{"id":"W1512105312","doi":"10.1016/j.disc.2015.12.030","title":"Bounds on the maximum number of minimum dominating sets","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation of Sri Lanka","keywords":"Mathematics; Combinatorics; Lexicographical order; Domination analysis; Dominating set; Graph; Discrete mathematics; Upper and lower bounds; Vertex (graph theory)","score_opus":0.028074880962659372,"score_gpt":0.3196065664226326,"score_spread":0.2915316854599732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512105312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0920998,0.03206511,0.66212016,0.028085865,0.0026862125,0.0003168643,0.005035794,0.00175694,0.1758333],"genre_scores_gemma":[0.6943297,0.019636625,0.24308829,0.004779112,0.0053403135,0.001382425,0.003976244,0.0017610551,0.02570631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99246174,0.0022296945,0.00035758544,0.0016501691,0.00206549,0.0012354382],"domain_scores_gemma":[0.8800413,0.10188023,0.0029430427,0.0061487476,0.0043230955,0.004663676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010532898,0.005114261,0.004089666,0.0061754007,0.0028262604,0.009674771,0.009147403,0.0044133198,0.014086668],"category_scores_gemma":[0.07045722,0.0025014326,0.0029623061,0.005838804,0.005309346,0.017864702,0.008797157,0.011080575,0.0029782522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003013529,0.0005532465,0.004072684,0.0038749762,0.00060856214,0.00042392488,0.00090478593,0.17569263,0.017782792,0.6438011,0.04288248,0.10638924],"study_design_scores_gemma":[0.00017764731,0.00023957071,0.0021068805,0.00062441453,0.00029978974,0.00061505643,0.00018582918,0.21160552,0.005209587,0.764325,0.014503537,0.0001071729],"about_ca_topic_score_codex":0.00087713014,"about_ca_topic_score_gemma":0.00209819,"teacher_disagreement_score":0.014086668,"about_ca_system_score_codex":0.0062486986,"about_ca_system_score_gemma":0.0022529769,"threshold_uncertainty_score":0.055703998},"labels":[],"label_agreement":null},{"id":"W1572651318","doi":"10.1016/j.disc.2006.05.018","title":"A characterization of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si4.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>-comparability graphs","year":2006,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Bipartite graph; Mathematics; Comparability; Combinatorics; Graph; Transitive relation; Characterization (materials science); Path (computing); Discrete mathematics; Computer science","score_opus":0.021004266821016766,"score_gpt":0.257866261394366,"score_spread":0.23686199457334925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572651318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20168182,0.0008636804,0.42672858,0.008969657,0.00059672876,0.0005140958,0.00843857,0.0018666192,0.35034025],"genre_scores_gemma":[0.8312232,0.0010143846,0.07474996,0.0017480644,0.0011746576,0.0005303503,0.01210155,0.001276773,0.07618105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998075,0.00033847743,0.0001229408,0.00074180344,0.00044232004,0.0002794646],"domain_scores_gemma":[0.987909,0.006337128,0.0018193434,0.0013416455,0.0015567405,0.0010360254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012962562,0.00087119837,0.00059037976,0.0030196172,0.002365836,0.004838124,0.0021093695,0.0015178596,0.04738653],"category_scores_gemma":[0.011097334,0.0006009472,0.001043205,0.0036544865,0.0023825057,0.008951604,0.0022434902,0.002900731,0.004794494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013226578,0.00010418696,0.0014331973,0.00015831801,0.000021303906,0.0002381615,0.00042844817,0.0018127932,0.002371621,0.9610556,0.012757866,0.019486332],"study_design_scores_gemma":[0.000033498593,0.00006967486,0.0017759042,0.00006636411,0.000028703436,0.0008873722,0.00032870084,0.009241879,0.0030368497,0.942852,0.04165399,0.000025102236],"about_ca_topic_score_codex":0.0013198309,"about_ca_topic_score_gemma":0.001413083,"teacher_disagreement_score":0.04738653,"about_ca_system_score_codex":0.0026323274,"about_ca_system_score_gemma":0.0012653123,"threshold_uncertainty_score":0.15852374},"labels":[],"label_agreement":null},{"id":"W157468222","doi":"10.1016/j.disc.2003.12.003","title":"Light edges in degree-constrained graphs","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Degree (music); Mathematics; Combinatorics; Graph; Bounded function; Constant (computer programming); Discrete mathematics; 1-planar graph; Line graph; Computer science; Physics","score_opus":0.026238300099238197,"score_gpt":0.2545521773285069,"score_spread":0.22831387722926869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W157468222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4639706,0.0006075049,0.51749486,0.0008805842,0.00013064846,0.00011376858,0.00034688375,0.0003988197,0.016056407],"genre_scores_gemma":[0.87214357,0.0007017276,0.10827189,0.0003491717,0.00007842036,0.0001354817,0.00044894507,0.0003215902,0.017549293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997259,0.00006263526,0.000012748264,0.000054992015,0.00009265891,0.000051081395],"domain_scores_gemma":[0.99829,0.00084302993,0.000226808,0.00016106565,0.00017850543,0.0003005827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042406886,0.00045601957,0.0006006855,0.0014336373,0.0011732627,0.0014409539,0.0011976868,0.0013120908,0.0053449366],"category_scores_gemma":[0.003419235,0.00066809973,0.00035774687,0.0011477033,0.0012566904,0.0020767031,0.00178531,0.0012878475,0.0004840901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004447345,0.0002098198,0.002857615,0.00035265286,0.000039887473,0.0005584786,0.00058494345,0.19637561,0.015271055,0.6801156,0.0064879437,0.09670168],"study_design_scores_gemma":[0.000045609053,0.000037597107,0.0008020899,0.000048153423,0.00001983616,0.00013398254,0.00023507739,0.3087825,0.0038187646,0.68139464,0.004655949,0.000025828755],"about_ca_topic_score_codex":0.0027772458,"about_ca_topic_score_gemma":0.004738955,"teacher_disagreement_score":0.0053449366,"about_ca_system_score_codex":0.0005735956,"about_ca_system_score_gemma":0.00039523272,"threshold_uncertainty_score":0.017880559},"labels":[],"label_agreement":null},{"id":"W1574893070","doi":"10.1016/j.disc.2012.03.018","title":"The intersection spectrum of Skolem sequences and its applications to <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si94.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>λ</mml:mi></mml:math>-fold cyclic triple systems","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Intersection (aeronautics); Mathematics; Spectrum (functional analysis); Scroll; Discrete mathematics; Algorithm; Combinatorics; Physics","score_opus":0.014777833416157732,"score_gpt":0.23422135265150526,"score_spread":0.21944351923534752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574893070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20909311,0.0028754685,0.5130856,0.0024200114,0.00069464074,0.000065139095,0.00036283748,0.0010122512,0.270391],"genre_scores_gemma":[0.901154,0.0016323375,0.068006985,0.00036019005,0.000611223,0.00010132929,0.00035638534,0.0005112854,0.027266238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994235,0.00016709646,0.00003826826,0.00010847271,0.0001656684,0.00009697872],"domain_scores_gemma":[0.9986539,0.0006571134,0.0001337782,0.0001257243,0.00027175905,0.00015766728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007922533,0.0005266254,0.0004615733,0.0042462763,0.0015957488,0.0024826534,0.000725241,0.00086519006,0.010944046],"category_scores_gemma":[0.0032891692,0.00035445258,0.00062961696,0.0021001038,0.0020993862,0.0037579334,0.002222453,0.0019992818,0.002232438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025794445,0.000011821829,0.00010863514,0.000019357065,0.0000029735172,0.000081390725,0.0002406843,0.00057739334,0.00065185584,0.9866001,0.0012755162,0.010404485],"study_design_scores_gemma":[0.000007225008,0.000016248876,0.00013067518,0.000028822415,0.000004016394,0.00024065372,0.00016710725,0.007642291,0.0011641163,0.9838451,0.0067366264,0.000017071441],"about_ca_topic_score_codex":0.00069620775,"about_ca_topic_score_gemma":0.00049326563,"teacher_disagreement_score":0.010944046,"about_ca_system_score_codex":0.0009854091,"about_ca_system_score_gemma":0.0004940901,"threshold_uncertainty_score":0.036611438},"labels":[],"label_agreement":null},{"id":"W1584410877","doi":"10.1016/j.disc.2015.06.025","title":"Homomorphisms of binary Cayley graphs","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Cayley graph; Combinatorics; Foster graph; Bipartite graph; Discrete mathematics; Vertex-transitive graph; Edge-transitive graph; Petersen graph; Voltage graph; Graph; Line graph","score_opus":0.020814942163330904,"score_gpt":0.21761016459963592,"score_spread":0.196795222436305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584410877","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53019434,0.001390571,0.2993852,0.0016289656,0.00075076654,0.00014990363,0.00058003236,0.0008287221,0.16509151],"genre_scores_gemma":[0.9390718,0.00078651047,0.030660734,0.00056094874,0.00041214074,0.00011093337,0.00042448932,0.00014447261,0.027827991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993925,0.00016588824,0.000029647368,0.00014567,0.00016561098,0.000100612946],"domain_scores_gemma":[0.99796593,0.0008243101,0.00026913,0.00023506956,0.00028817946,0.0004174541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004934406,0.00041387774,0.00040311477,0.0021387648,0.0011157347,0.002027175,0.00076696486,0.00061376573,0.007435211],"category_scores_gemma":[0.0027139115,0.0004161286,0.0005207555,0.0011027482,0.0013655416,0.0028932502,0.0013528547,0.0017009557,0.0007096596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023046448,0.000030991512,0.00018212151,0.000024617868,0.000005855599,0.00005538883,0.00021336332,0.00077608426,0.0012986755,0.9889339,0.0009483367,0.007507593],"study_design_scores_gemma":[0.000017101675,0.000022739421,0.00035702676,0.000014249957,0.0000066866332,0.00014124176,0.0001360457,0.0062727863,0.001040633,0.98739773,0.004580711,0.000013067171],"about_ca_topic_score_codex":0.0009645577,"about_ca_topic_score_gemma":0.0007818621,"teacher_disagreement_score":0.007435211,"about_ca_system_score_codex":0.0008009077,"about_ca_system_score_gemma":0.0004954183,"threshold_uncertainty_score":0.024873257},"labels":[],"label_agreement":null},{"id":"W1643754303","doi":"10.1016/j.disc.2016.08.026","title":"On acyclic edge-coloring of complete bipartite graphs","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Nuclear Receptors and Signaling","field":"Neuroscience","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Indian Statistical Institute","keywords":"Combinatorics; Mathematics; Edge coloring; Bipartite graph; Vertex (graph theory); Directed acyclic graph; Complete coloring; Discrete mathematics; Graph; Graph power; Line graph","score_opus":0.053752018305178645,"score_gpt":0.27566751090423286,"score_spread":0.22191549259905421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1643754303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2926346,0.0018318596,0.5949184,0.0035909293,0.00051279366,0.00023368528,0.002520571,0.0006391779,0.103118114],"genre_scores_gemma":[0.77247727,0.0037814165,0.15362507,0.0017584618,0.00084300013,0.00042165985,0.0037345684,0.0007958843,0.06256273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986299,0.00057384913,0.000045276975,0.0002892989,0.00020418417,0.00025753907],"domain_scores_gemma":[0.9921326,0.0050648795,0.00075102324,0.0006083776,0.00064582785,0.00079730083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001298619,0.0015426449,0.0012664619,0.0018787043,0.0018063826,0.0028781113,0.002471847,0.0015157805,0.012726493],"category_scores_gemma":[0.006596171,0.0010002257,0.0011710196,0.0029728326,0.0024451052,0.0038099086,0.0018949376,0.002758252,0.0012675951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001870115,0.000088763765,0.00074287335,0.00022193766,0.000033459295,0.00015217591,0.0003694704,0.027792908,0.0014758309,0.9391969,0.011132043,0.018606592],"study_design_scores_gemma":[0.00003128606,0.000014048737,0.00029695337,0.00003302469,0.000015783133,0.000080242775,0.00008816803,0.046274386,0.00025512898,0.94938993,0.003508708,0.000012414177],"about_ca_topic_score_codex":0.00479585,"about_ca_topic_score_gemma":0.0063657537,"teacher_disagreement_score":0.012726493,"about_ca_system_score_codex":0.0024018143,"about_ca_system_score_gemma":0.0012261776,"threshold_uncertainty_score":0.042574346},"labels":[],"label_agreement":null},{"id":"W1673750067","doi":"10.1016/j.disc.2015.08.024","title":"Colorings and spectral radius of digraphs","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fundamental Research Funds for the Central Universities; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Spectral radius; Mathematics; Combinatorics; RADIUS; Order (exchange); Discrete mathematics; Eigenvalues and eigenvectors; Computer science; Physics; Quantum mechanics","score_opus":0.06394697952593209,"score_gpt":0.31423237553647776,"score_spread":0.25028539601054567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1673750067","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72340894,0.0021478953,0.21408372,0.0022550176,0.00018506922,0.00007963487,0.0008737759,0.00053027953,0.056435782],"genre_scores_gemma":[0.96887577,0.0009657939,0.02184104,0.0002940826,0.000218117,0.000103944185,0.00048452514,0.00017633558,0.0070403125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984536,0.0005797823,0.00007735741,0.00037192422,0.00027835934,0.00023895642],"domain_scores_gemma":[0.9829895,0.010270769,0.0022405402,0.000982449,0.0010831073,0.0024337051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016000805,0.000909396,0.0014907144,0.00391532,0.0023809536,0.00454816,0.0022831475,0.0014087759,0.0074791824],"category_scores_gemma":[0.014242704,0.0012000191,0.00066987186,0.00254507,0.0040821317,0.005188433,0.0024856948,0.0017405695,0.0009669698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013573105,0.000054327767,0.0012418281,0.00009423143,0.000027300215,0.000056502286,0.0004889504,0.013675817,0.0016466124,0.9740365,0.002324839,0.006217262],"study_design_scores_gemma":[0.000028191502,0.000020283376,0.0007036157,0.000028792827,0.000018826247,0.00011386981,0.00022532465,0.035569567,0.0005629537,0.9609252,0.0017844395,0.000018881718],"about_ca_topic_score_codex":0.001673722,"about_ca_topic_score_gemma":0.0018873573,"teacher_disagreement_score":0.0074791824,"about_ca_system_score_codex":0.0023013502,"about_ca_system_score_gemma":0.0006794967,"threshold_uncertainty_score":0.025020361},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.05442664942256222,"score_gpt":0.3003084988839092,"score_spread":0.24588184946134697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1745342855","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07827208,0.0011178809,0.81015843,0.003427241,0.0016494672,0.00020956209,0.0005364544,0.0019085961,0.102720276],"genre_scores_gemma":[0.5470174,0.0012553796,0.3912754,0.0015196208,0.0009234695,0.00033975719,0.0008730835,0.00093647727,0.055859413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985825,0.0003611247,0.000070716815,0.0002800198,0.00056527695,0.00014036894],"domain_scores_gemma":[0.9977715,0.0011579716,0.000095167336,0.00062340137,0.00021474923,0.00013727037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008888227,0.0008496427,0.0008476243,0.001317146,0.001577127,0.0019105478,0.00121895,0.0015468871,0.011233482],"category_scores_gemma":[0.004667193,0.00054153835,0.00069706386,0.0016381713,0.0019496146,0.004187987,0.0028937168,0.0024357163,0.0040430934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014083715,0.000099674864,0.00021653793,0.00015603054,0.000020886133,0.00020889012,0.00018572873,0.004022285,0.008841536,0.9127285,0.008005309,0.06537375],"study_design_scores_gemma":[0.000042650103,0.0000649286,0.00012785645,0.000037618775,0.00002246082,0.00043440648,0.000046574307,0.020123849,0.008954739,0.94834536,0.021758841,0.000040740622],"about_ca_topic_score_codex":0.00028504388,"about_ca_topic_score_gemma":0.0004226134,"teacher_disagreement_score":0.011233482,"about_ca_system_score_codex":0.00061759254,"about_ca_system_score_gemma":0.000903845,"threshold_uncertainty_score":0.037579715},"labels":[],"label_agreement":null},{"id":"W1765056582","doi":"10.1016/j.disc.2012.08.017","title":"Cayley graphs of order <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mn>30</mml:mn><mml:mi>p</mml:mi></mml:math> are Hamiltonian","year":2012,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Cayley graph; Combinatorics; Graph; Order (exchange); Discrete mathematics","score_opus":0.030197457730830032,"score_gpt":0.2787445718120991,"score_spread":0.24854711408126906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1765056582","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18222906,0.0013409815,0.26728877,0.0032583475,0.0013925342,0.00034905729,0.008894571,0.0031986667,0.5320479],"genre_scores_gemma":[0.7398723,0.0015549698,0.055368867,0.0014882614,0.00039357264,0.00022455334,0.006356867,0.00095169264,0.19378898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961406,0.00006432768,0.000019063997,0.00009750471,0.00010900948,0.000096081334],"domain_scores_gemma":[0.9981797,0.00053348124,0.0002133875,0.00030373517,0.0005425437,0.00022732145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029047474,0.00048566874,0.00039925874,0.0010435351,0.0012305974,0.0020553167,0.00064618053,0.00059911545,0.042321816],"category_scores_gemma":[0.0021625296,0.00040042648,0.0004582124,0.001052736,0.0008691972,0.0022705572,0.00061248074,0.0013243185,0.0055835675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007356043,0.000032300988,0.00036756537,0.00009611334,0.000016518718,0.00023060328,0.00025232334,0.0014000543,0.0035238552,0.9527168,0.02496254,0.016327767],"study_design_scores_gemma":[0.00005539901,0.000041660853,0.0009611636,0.000040384628,0.000023282042,0.0002874119,0.0002522035,0.007181003,0.0046680933,0.9145016,0.07194602,0.000041850522],"about_ca_topic_score_codex":0.0041966583,"about_ca_topic_score_gemma":0.008011432,"teacher_disagreement_score":0.042321816,"about_ca_system_score_codex":0.0010023572,"about_ca_system_score_gemma":0.0011291197,"threshold_uncertainty_score":0.14158064},"labels":[],"label_agreement":null},{"id":"W1780397282","doi":"10.1016/j.disc.2015.08.021","title":"On the geometric Ramsey numbers of trees","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; General position; Ramsey's theorem; Graph; Regular polygon; Discrete mathematics; Geometry","score_opus":0.0659309890628435,"score_gpt":0.308355392422251,"score_spread":0.24242440335940751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1780397282","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56219774,0.008828338,0.13340412,0.010935477,0.0007937545,0.00006481187,0.00051090674,0.00033224828,0.28293258],"genre_scores_gemma":[0.95979804,0.003382107,0.017058095,0.0007354914,0.0007740122,0.00010719118,0.0002386094,0.00010555622,0.017800845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904686,0.00035998362,0.000043829812,0.00017068193,0.00024638933,0.00013219475],"domain_scores_gemma":[0.9935256,0.004425162,0.0005698868,0.00035402089,0.0005066223,0.0006186476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018456243,0.00066407636,0.0011023412,0.0033161559,0.002278667,0.0036867002,0.0015347551,0.0012609252,0.0071617914],"category_scores_gemma":[0.011300475,0.0006697707,0.0005764713,0.0027345498,0.0058778496,0.012793644,0.003392228,0.0035502259,0.0007814387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020104966,0.000008989791,0.00012995278,0.000023446253,0.0000023757595,0.000014749098,0.00016234015,0.0009257854,0.00013097576,0.994966,0.00077975757,0.0028356172],"study_design_scores_gemma":[0.000005013484,0.000005138664,0.00012376386,0.000012375236,0.0000026723742,0.000026528007,0.000063470885,0.001897606,0.000059483387,0.9964275,0.0013712439,0.000005302774],"about_ca_topic_score_codex":0.0013978106,"about_ca_topic_score_gemma":0.0013514792,"teacher_disagreement_score":0.0071617914,"about_ca_system_score_codex":0.0019986122,"about_ca_system_score_gemma":0.00081447995,"threshold_uncertainty_score":0.023958623},"labels":[],"label_agreement":null},{"id":"W1782134016","doi":"10.1016/j.disc.2015.04.012","title":"Two-dimensional balanced sampling plans avoiding adjacent units","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"China Scholarship Council; National Natural Science Foundation of China; Fundamental Research Funds for the Central Universities; Victoria University; University of Victoria","keywords":"Adjacency list; Sampling (signal processing); Mathematics; Column (typography); Point (geometry); Wright; Scheme (mathematics); Sampling scheme; Adjacency matrix; Mathematical optimization; Discrete mathematics; Combinatorics; Computer science; Statistics; Geometry; Connection (principal bundle); Mathematical analysis","score_opus":0.04944068887286893,"score_gpt":0.25395106434571846,"score_spread":0.20451037547284953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1782134016","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1486276,0.00023137471,0.8354862,0.0003258147,0.00006819063,0.00014734782,0.00033466416,0.00034017224,0.014438657],"genre_scores_gemma":[0.6935117,0.00022306506,0.2946779,0.000115911294,0.000031681706,0.00022252898,0.0004927898,0.00010180961,0.010622685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994672,0.0001499362,0.000025049687,0.00007223993,0.00017750263,0.00010813093],"domain_scores_gemma":[0.9987431,0.0005581966,0.00011996236,0.00019779692,0.00021464124,0.00016627273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050355535,0.0004870507,0.0006173333,0.0006817666,0.00058639137,0.0012329404,0.00093808834,0.0008118199,0.00568584],"category_scores_gemma":[0.003055759,0.00039096895,0.00030334972,0.00085330015,0.0006330527,0.00109749,0.0015881781,0.00073130336,0.0006756773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020844578,0.0003494402,0.0028125828,0.00020598675,0.00007542364,0.00036716697,0.0002046457,0.49833977,0.03844443,0.31345168,0.0056407577,0.13802363],"study_design_scores_gemma":[0.000102925595,0.0001480802,0.0005118391,0.000019662793,0.000017514854,0.00011960502,0.00008143522,0.9277801,0.0068833022,0.06169856,0.0026179308,0.000019159921],"about_ca_topic_score_codex":0.0015540303,"about_ca_topic_score_gemma":0.0019177783,"teacher_disagreement_score":0.00568584,"about_ca_system_score_codex":0.00075556035,"about_ca_system_score_gemma":0.00074177375,"threshold_uncertainty_score":0.019021034},"labels":[],"label_agreement":null},{"id":"W1881477017","doi":"10.1016/j.disc.2015.09.020","title":"Entropy of symmetric graphs","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Discrete mathematics; Perfect graph theorem; Perfect graph; Factor-critical graph; Circulant graph; Line graph; Disjoint sets; Windmill graph; Voltage graph; Graph power; Graph","score_opus":0.051681198523323764,"score_gpt":0.3078868075246955,"score_spread":0.25620560900137174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1881477017","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8125302,0.0016779136,0.0935776,0.004472535,0.00033132592,0.00003383539,0.00048258097,0.00019393514,0.086700045],"genre_scores_gemma":[0.9884682,0.0004536419,0.0025677474,0.00022743168,0.00041074184,0.00003244069,0.00019701406,0.000045597433,0.0075971014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991702,0.00030188842,0.000030629744,0.000098768935,0.00028118814,0.00011738077],"domain_scores_gemma":[0.9968405,0.0016949938,0.00039214885,0.00031016278,0.00029395154,0.00046825007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00138701,0.0004848754,0.00086558505,0.0026657525,0.0012077425,0.0024336006,0.0010942797,0.0010797061,0.004432486],"category_scores_gemma":[0.005995355,0.00035164587,0.00051943876,0.0011018976,0.0034248142,0.005013942,0.0021473088,0.0014459016,0.00032963222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015153848,0.000007712037,0.0002000187,0.00001157557,0.0000031827383,0.000014408187,0.00007116185,0.0011247164,0.00020558282,0.996926,0.0003707872,0.001049674],"study_design_scores_gemma":[0.000003999105,0.000003236027,0.00017528741,0.0000036851848,0.0000017858397,0.000017200191,0.000020419051,0.004811556,0.0000819403,0.99462116,0.0002556807,0.0000040881237],"about_ca_topic_score_codex":0.0008130779,"about_ca_topic_score_gemma":0.00070794317,"teacher_disagreement_score":0.004432486,"about_ca_system_score_codex":0.0013646439,"about_ca_system_score_gemma":0.00065183325,"threshold_uncertainty_score":0.014828205},"labels":[],"label_agreement":null},{"id":"W1963635783","doi":"10.1016/s0012-365x(02)00298-4","title":"Solution of an outstanding conjecture: the non-existence of universal cycles with k=n−2","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Memorial University of Newfoundland; University of Saskatchewan; York University; University of Guelph; Simon Fraser University; University of Manitoba; University of Toronto; Carleton University","funders":"University of British Columbia; York University; Simon Fraser University; University of Saskatchewan","keywords":"Mathematics; Conjecture; Combinatorics; Sequence (biology); Word (group theory); Discrete mathematics; Set (abstract data type)","score_opus":0.0354910501675276,"score_gpt":0.2709126714978926,"score_spread":0.235421621330365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963635783","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69661266,0.004159116,0.13859388,0.055770036,0.002244864,0.00006379643,0.0007396512,0.00040540655,0.10141063],"genre_scores_gemma":[0.9471409,0.0011411059,0.03566905,0.002304395,0.0015291887,0.00010977409,0.0005013435,0.00010107715,0.011503179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920326,0.00028818502,0.000035935685,0.00024199643,0.000111282534,0.000119315766],"domain_scores_gemma":[0.9922375,0.0051480667,0.00068610394,0.0009285119,0.0004147336,0.0005851964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015244053,0.00038606563,0.0010103779,0.00095206295,0.0023673815,0.0030024613,0.0023875886,0.0041828537,0.0077710445],"category_scores_gemma":[0.013252688,0.00061389914,0.0008410504,0.0008902454,0.0043552015,0.0072182748,0.0029766087,0.0029883191,0.0005803638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080085454,0.000030805048,0.0005852627,0.00013181465,0.000014554674,0.0001320386,0.00022005897,0.003561843,0.00041903215,0.98295295,0.0064118886,0.0054595885],"study_design_scores_gemma":[0.000021853999,0.000007740607,0.00013719221,0.000015275547,0.0000037213692,0.000083188184,0.00011005048,0.0069024586,0.00015328267,0.99097276,0.0015829363,0.000009505614],"about_ca_topic_score_codex":0.00077695126,"about_ca_topic_score_gemma":0.000871668,"teacher_disagreement_score":0.0077710445,"about_ca_system_score_codex":0.0009376889,"about_ca_system_score_gemma":0.0010365498,"threshold_uncertainty_score":0.025996745},"labels":[],"label_agreement":null},{"id":"W1964148783","doi":"10.1016/j.disc.2007.08.052","title":"Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Steiner tree problem; Connectivity; Neighbourhood (mathematics); Discrete mathematics; Graph; Induced subgraph","score_opus":0.015517588845970518,"score_gpt":0.28714373773133084,"score_spread":0.2716261488853603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964148783","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8923189,0.0004739415,0.06384276,0.001002766,0.000085894186,0.000045907935,0.00085978396,0.00012710897,0.041242912],"genre_scores_gemma":[0.96727544,0.0004417405,0.018277498,0.00022079158,0.00008437787,0.00006914175,0.00077957887,0.000057059497,0.012794313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994061,0.000109568005,0.000040344003,0.00013306813,0.000190292,0.000120561475],"domain_scores_gemma":[0.997471,0.0012423798,0.00054107764,0.0002000103,0.00021126587,0.00033429332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050173135,0.00041704852,0.00080992107,0.0017373775,0.0022941849,0.0026123493,0.001315352,0.0011734745,0.0072339484],"category_scores_gemma":[0.0023754984,0.0006849321,0.0006559664,0.0030778311,0.0022076461,0.0035896522,0.0016416063,0.0015299531,0.00049490365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001324493,0.00005057229,0.0016134212,0.000077995144,0.000020240543,0.00024925,0.0005746511,0.008117842,0.0018080364,0.9773907,0.001648664,0.008316214],"study_design_scores_gemma":[0.000055101315,0.000043711116,0.0022652624,0.000031046944,0.00004919867,0.0006545444,0.0006566523,0.021260254,0.0021214357,0.96797377,0.0048647616,0.000024258188],"about_ca_topic_score_codex":0.0019635004,"about_ca_topic_score_gemma":0.003255436,"teacher_disagreement_score":0.0072339484,"about_ca_system_score_codex":0.0014554067,"about_ca_system_score_gemma":0.0006434731,"threshold_uncertainty_score":0.024199963},"labels":[],"label_agreement":null},{"id":"W1964296470","doi":"10.1016/s0012-365x(00)00055-8","title":"Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Multipartite; Digraph; Combinatorics; Mathematics; Bipartite graph; Path (computing); Discrete mathematics; Graph; Computer science; Quantum","score_opus":0.02621749155710442,"score_gpt":0.29682061700021123,"score_spread":0.27060312544310683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964296470","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8836168,0.00022379404,0.10110854,0.00052631414,0.0000365061,0.00007676248,0.0007713869,0.00018727226,0.013452534],"genre_scores_gemma":[0.9619635,0.00029280546,0.0303968,0.00017500126,0.000036708712,0.00013507479,0.0010670292,0.00007503604,0.005858053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960715,0.00009581804,0.000029283055,0.000101316815,0.000076865195,0.00008959701],"domain_scores_gemma":[0.9959455,0.0022500574,0.00058979227,0.00024368048,0.00037767357,0.0005932811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044551195,0.00041126745,0.00053912593,0.00116163,0.0015613054,0.0016934855,0.00080044084,0.0008317045,0.00446617],"category_scores_gemma":[0.0031889372,0.0009096148,0.0005611371,0.0014984887,0.0009482712,0.0022873648,0.0014804848,0.0011201873,0.0003949405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042757456,0.00015230599,0.0057019866,0.0004741249,0.00011512129,0.00089301483,0.0013953737,0.026707686,0.017061995,0.917976,0.0035972507,0.025497483],"study_design_scores_gemma":[0.000055777982,0.00006632345,0.002850687,0.00005177358,0.00006418439,0.00040021705,0.0005032716,0.05963918,0.0036525764,0.9293943,0.0033015308,0.000020209964],"about_ca_topic_score_codex":0.0008252945,"about_ca_topic_score_gemma":0.0019379125,"teacher_disagreement_score":0.00446617,"about_ca_system_score_codex":0.0006759041,"about_ca_system_score_gemma":0.00047434738,"threshold_uncertainty_score":0.014940858},"labels":[],"label_agreement":null},{"id":"W1964476238","doi":"10.1016/s0012-365x(03)00302-9","title":"On i−-ER-critical graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of South Africa","keywords":"Combinatorics; Mathematics; Corollary; Discrete mathematics; Indifference graph; Enhanced Data Rates for GSM Evolution; Graph; Domination analysis; Computer science; Vertex (graph theory)","score_opus":0.02765724729133736,"score_gpt":0.3274778824452344,"score_spread":0.29982063515389706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964476238","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47791627,0.0012855937,0.11119896,0.0036002952,0.00051813526,0.00023484528,0.00085070264,0.00055559684,0.40383962],"genre_scores_gemma":[0.9122685,0.0011981202,0.018111952,0.0012091633,0.00033536096,0.00014995274,0.0010463871,0.00029791362,0.06538268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995956,0.000082824336,0.000014705835,0.0000989953,0.0000736369,0.00013434808],"domain_scores_gemma":[0.99840397,0.00053658284,0.00032179023,0.00013991045,0.00023929297,0.00035837985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005001241,0.0010323161,0.0007217093,0.002996673,0.002220411,0.0022087859,0.0010593013,0.0010377449,0.016929224],"category_scores_gemma":[0.0021286001,0.00046424512,0.00066562364,0.0012718417,0.0019901018,0.0037371116,0.0020384213,0.002106969,0.0017203309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007435037,0.000022860228,0.00024908304,0.000075303375,0.000007017965,0.00014180013,0.00019599232,0.0010558997,0.0014035917,0.9891093,0.003215209,0.0044494695],"study_design_scores_gemma":[0.000027714801,0.000021033678,0.00028475464,0.000045169985,0.0000118721,0.00016766143,0.00025412635,0.0035445709,0.0010860551,0.9899502,0.0045963665,0.000010521027],"about_ca_topic_score_codex":0.0011877245,"about_ca_topic_score_gemma":0.0012945376,"teacher_disagreement_score":0.016929224,"about_ca_system_score_codex":0.0011848747,"about_ca_system_score_gemma":0.000447505,"threshold_uncertainty_score":0.05663395},"labels":[],"label_agreement":null},{"id":"W1964602237","doi":"10.1016/j.disc.2010.06.037","title":"SC-Hamiltonian graphs and digraphs: New necessary conditions and their impacts","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Hamiltonian path; Combinatorics; Hamiltonian (control theory); Separable space; Conjecture; Discrete mathematics; Pancyclic graph; Hamiltonian path problem; Digraph; Graph; Line graph; Pathwidth; Mathematical analysis","score_opus":0.019654365323875926,"score_gpt":0.2929845635242216,"score_spread":0.27333019820034565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964602237","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1580689,0.0078143375,0.54939485,0.019002922,0.0022329385,0.00043210358,0.004643341,0.0007549245,0.25765574],"genre_scores_gemma":[0.8509833,0.010146814,0.096565515,0.0033535988,0.0036586511,0.00091185566,0.0029065069,0.0005078252,0.030965894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820435,0.0005236534,0.00014801288,0.00040223234,0.00047261314,0.00024910248],"domain_scores_gemma":[0.9791878,0.014046281,0.0015545724,0.0010936704,0.002315543,0.0018021656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030009814,0.0014421674,0.0021051082,0.0042908234,0.003172506,0.0040130313,0.0025259387,0.0034597802,0.025077533],"category_scores_gemma":[0.022218103,0.0013182667,0.0022576195,0.004351948,0.0055690138,0.01251601,0.0044514444,0.008780383,0.001875997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043528216,0.00007199121,0.00037443935,0.00017603156,0.000013504643,0.00012959952,0.00016866362,0.0016144093,0.0005005005,0.9872896,0.0037989274,0.0058186892],"study_design_scores_gemma":[0.000019176654,0.000016290263,0.00026937484,0.00004460977,0.000017585122,0.00009930455,0.00014396558,0.006933759,0.00033955113,0.9897376,0.0023605116,0.000018363504],"about_ca_topic_score_codex":0.002016337,"about_ca_topic_score_gemma":0.0038674045,"teacher_disagreement_score":0.025077533,"about_ca_system_score_codex":0.002514192,"about_ca_system_score_gemma":0.0025842588,"threshold_uncertainty_score":0.08389264},"labels":[],"label_agreement":null},{"id":"W1965205248","doi":"10.1016/j.disc.2007.03.009","title":"p-adic valuations and k-regular sequences","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.016861409466790607,"score_gpt":0.26977123419743393,"score_spread":0.25290982473064333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965205248","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6571923,0.003771318,0.21226199,0.003172054,0.0006888005,0.00007622624,0.00051418185,0.0004132649,0.12190999],"genre_scores_gemma":[0.9790146,0.0006704433,0.009042003,0.00012805975,0.00018421303,0.000037753005,0.00012534927,0.000031973104,0.010765643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924076,0.00016913215,0.00007833665,0.0002302473,0.00015660108,0.00012481792],"domain_scores_gemma":[0.9972836,0.0016209629,0.00028718298,0.00024647903,0.0002443625,0.00031738062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091460755,0.0006383668,0.0008083678,0.0015144013,0.0016275443,0.004671089,0.0008029791,0.00094145985,0.0052399775],"category_scores_gemma":[0.0035334206,0.0005942332,0.00069164496,0.0018806083,0.004883994,0.0065827803,0.0019507656,0.0023518596,0.0007542385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004952588,0.000016031372,0.00019212833,0.000037442293,0.0000064615215,0.0001462847,0.00033001215,0.00060167385,0.00073166005,0.99311286,0.00028865677,0.004487228],"study_design_scores_gemma":[0.00001621481,0.000016100661,0.00012344574,0.000009114492,0.000006430472,0.00023008617,0.00011583457,0.0013321262,0.00041307585,0.9958786,0.0018494626,0.000009573765],"about_ca_topic_score_codex":0.0002926814,"about_ca_topic_score_gemma":0.00027397962,"teacher_disagreement_score":0.0052399775,"about_ca_system_score_codex":0.0011315116,"about_ca_system_score_gemma":0.00046854798,"threshold_uncertainty_score":0.017529428},"labels":[],"label_agreement":null},{"id":"W1965839285","doi":"10.1016/j.disc.2006.04.042","title":"Constructions and bounds for <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si50.gif\" overflow=\"scroll\"><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy=\"false\">)</mml:mo></mml:math>-splitting systems","year":2006,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; University of Manitoba; University of Waterloo","funders":"","keywords":"Block (permutation group theory); Mathematics; Combinatorics; Type (biology); Discrete mathematics; Algorithm","score_opus":0.01351620445440694,"score_gpt":0.22577824832043367,"score_spread":0.21226204386602673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965839285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012701878,0.0014028751,0.7860346,0.0039065983,0.00052863633,0.00016262505,0.0021884167,0.001961323,0.19111308],"genre_scores_gemma":[0.3694645,0.0024823316,0.4999686,0.002152839,0.0006752575,0.0011228246,0.00594533,0.0031937438,0.11499466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964366,0.0008827234,0.00027592684,0.0007413737,0.0010900903,0.000573345],"domain_scores_gemma":[0.9905166,0.0056856526,0.0004710102,0.0015332225,0.0012885253,0.0005050462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031941542,0.001436739,0.00077657524,0.002830568,0.003097103,0.007665247,0.002705227,0.0021110564,0.05083021],"category_scores_gemma":[0.012887056,0.0012338537,0.0016421003,0.0030140178,0.0025270996,0.012533455,0.006424759,0.0071006566,0.01730218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023210125,0.000019039271,0.00008842385,0.00006334409,0.000006803296,0.000031227188,0.00019757716,0.0010849151,0.0005416157,0.9783066,0.010834526,0.008802747],"study_design_scores_gemma":[0.00001363954,0.000016549206,0.00016491613,0.0000792409,0.00001655009,0.0001037004,0.00012197668,0.0077114,0.0020507406,0.93807024,0.05162276,0.000028298276],"about_ca_topic_score_codex":0.0021607196,"about_ca_topic_score_gemma":0.003361979,"teacher_disagreement_score":0.05083021,"about_ca_system_score_codex":0.0045332857,"about_ca_system_score_gemma":0.0016698533,"threshold_uncertainty_score":0.170044},"labels":[],"label_agreement":null},{"id":"W1965909478","doi":"10.1016/j.disc.2004.08.044","title":"q and <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si5.gif\" overflow=\"scroll\"><mml:mi>q</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:math>-analogs of non-commutative symmetric functions","year":2005,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Scroll; Mathematics; Algorithm; Philosophy; Theology","score_opus":0.02118273781054072,"score_gpt":0.26596799874176386,"score_spread":0.24478526093122313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965909478","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042795297,0.00041889068,0.09280737,0.006096483,0.0022475584,0.00020449981,0.025707109,0.011986327,0.85625225],"genre_scores_gemma":[0.10377421,0.0011387934,0.057225008,0.002663856,0.0016807491,0.00038687966,0.02846187,0.017923255,0.78674537],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995726,0.000089297915,0.000032633663,0.000096554606,0.00015294368,0.000055968885],"domain_scores_gemma":[0.99836856,0.0004902128,0.00011514537,0.00026184318,0.00060789596,0.00015641784],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00078903843,0.00069235597,0.0005709717,0.0010496621,0.0010234739,0.003362022,0.0010295293,0.0008654585,0.4892598],"category_scores_gemma":[0.0034867714,0.00043761428,0.0006659155,0.0016507264,0.000926685,0.004989745,0.0012830715,0.002115498,0.16984552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014676027,0.000041512612,0.00020646834,0.00023114537,0.00001084124,0.00011507014,0.00020633626,0.00031694863,0.0016476797,0.37628376,0.58336526,0.037428334],"study_design_scores_gemma":[0.000052838364,0.000023128192,0.0006081151,0.00003954762,0.0000052064315,0.00020242095,0.00012073467,0.0016935557,0.0022036028,0.16376558,0.83125323,0.00003204833],"about_ca_topic_score_codex":0.004227882,"about_ca_topic_score_gemma":0.0030857506,"teacher_disagreement_score":0.4892598,"about_ca_system_score_codex":0.0014483002,"about_ca_system_score_gemma":0.0008660285,"threshold_uncertainty_score":0.7285089},"labels":[],"label_agreement":null},{"id":"W1966250211","doi":"10.1016/j.disc.2005.10.002","title":"Extensions of the Critical Theorem","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Matroid; Discrete mathematics; Combinatorics; Identity (music)","score_opus":0.015465550735839117,"score_gpt":0.26586045480771964,"score_spread":0.25039490407188053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966250211","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08702765,0.008253944,0.25537625,0.016468037,0.0031306548,0.000084340776,0.00066433876,0.0004841277,0.6285106],"genre_scores_gemma":[0.8706694,0.0050972938,0.031054081,0.0043313364,0.00652686,0.00020981718,0.00063854223,0.00034078816,0.08113186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990822,0.00028751494,0.000041146708,0.00023599189,0.00023266932,0.00012040695],"domain_scores_gemma":[0.99687874,0.0015159657,0.00026681717,0.00050178694,0.00053092954,0.00030571787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015633726,0.00091816776,0.000985304,0.0027030075,0.0020671722,0.0030947207,0.0011897796,0.001462841,0.013819376],"category_scores_gemma":[0.006982362,0.00038679005,0.0010852292,0.0014198669,0.004410905,0.008009175,0.0032157581,0.004125089,0.0016525367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007954319,0.000004679404,0.00003463208,0.000012025402,0.0000023098175,0.000015289072,0.000031791795,0.00011817742,0.000058878526,0.996664,0.0015568157,0.0014934795],"study_design_scores_gemma":[0.000008127099,0.000003574858,0.00004224714,0.000006680816,0.0000026660352,0.00003368364,0.000014692604,0.000685898,0.00006133776,0.9936487,0.00548927,0.000003250001],"about_ca_topic_score_codex":0.0008288433,"about_ca_topic_score_gemma":0.00048220533,"teacher_disagreement_score":0.013819376,"about_ca_system_score_codex":0.0019106742,"about_ca_system_score_gemma":0.0009149614,"threshold_uncertainty_score":0.046230376},"labels":[],"label_agreement":null},{"id":"W1966947400","doi":"10.1016/s0012-365x(01)00284-9","title":"Complete latin squares of order pn exist for odd primes p and n&gt;2","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Arizona State University","keywords":"Mathematics; Latin square; Combinatorics; Order (exchange); Integer (computer science); Prime (order theory); Group (periodic table); Discrete mathematics; Cyclic group; Abelian group; Physics","score_opus":0.026909461635927022,"score_gpt":0.2220562871268048,"score_spread":0.19514682549087778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966947400","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42381644,0.0035111625,0.1886787,0.003720667,0.0011183056,0.00031881663,0.0015444888,0.0019170234,0.37537438],"genre_scores_gemma":[0.83435005,0.0012685637,0.07949318,0.0015654485,0.0004322196,0.00049178995,0.0014493463,0.00062935817,0.08032011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985184,0.00044160296,0.00006970355,0.00036425138,0.0003072835,0.00029865367],"domain_scores_gemma":[0.99547136,0.0023516647,0.00071937917,0.00067705335,0.0004125279,0.0003680749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097537966,0.0019359004,0.0014075106,0.0014784554,0.0023448307,0.0038071496,0.000801283,0.0020142684,0.01791002],"category_scores_gemma":[0.0056727985,0.0012074169,0.000636442,0.0019342152,0.0027182086,0.004318711,0.003336642,0.0019976841,0.00509402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006809997,0.00009798922,0.0013388436,0.00030113687,0.0000549063,0.0005327439,0.0007492698,0.0030353733,0.01953203,0.9238375,0.011219589,0.03861964],"study_design_scores_gemma":[0.00018098732,0.00018284189,0.0011456668,0.000113650545,0.000055451008,0.0013588648,0.00065817934,0.009308246,0.02961623,0.90137833,0.05590982,0.00009175167],"about_ca_topic_score_codex":0.00020321218,"about_ca_topic_score_gemma":0.00048511397,"teacher_disagreement_score":0.01791002,"about_ca_system_score_codex":0.0007382839,"about_ca_system_score_gemma":0.0008033254,"threshold_uncertainty_score":0.059915006},"labels":[],"label_agreement":null},{"id":"W1967400666","doi":"10.1016/s0012-365x(03)00159-6","title":"Lattice paths and the antiautomorphism of the poset of descending plane partitions","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Partially ordered set; Combinatorics; Lattice (music); Discrete mathematics; Plane (geometry); Geometry","score_opus":0.030069452569262627,"score_gpt":0.28664111295384037,"score_spread":0.25657166038457774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967400666","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6097402,0.00082328497,0.25378346,0.0017592446,0.00053751824,0.00010456408,0.00096566166,0.00053816586,0.1317479],"genre_scores_gemma":[0.9217312,0.0006799212,0.046612076,0.00034794156,0.00024117787,0.00013424683,0.0007102315,0.00019733496,0.029345922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919134,0.00020856493,0.00005497137,0.00018740409,0.00019151009,0.00016615026],"domain_scores_gemma":[0.9986041,0.0006324367,0.00019602329,0.0001563721,0.00018551291,0.00022555496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007462636,0.0003887765,0.00048232236,0.0012736152,0.0022404918,0.0039607068,0.000855145,0.000758374,0.008501908],"category_scores_gemma":[0.0022285879,0.0004960518,0.0008317366,0.0013394239,0.00348405,0.0057171127,0.0019521669,0.0021841812,0.0011661641],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033968823,0.000014164486,0.0001478292,0.000011407564,0.0000025260981,0.000046465404,0.00027771003,0.00033582363,0.00061097834,0.9945156,0.000366236,0.0036372954],"study_design_scores_gemma":[0.0000134713,0.000017298169,0.00015327295,0.000006351381,0.000003289775,0.00008567793,0.00014288,0.0012516892,0.0004996882,0.99419254,0.0036254094,0.000008419543],"about_ca_topic_score_codex":0.0016607202,"about_ca_topic_score_gemma":0.0015826698,"teacher_disagreement_score":0.008501908,"about_ca_system_score_codex":0.00087514747,"about_ca_system_score_gemma":0.0008756746,"threshold_uncertainty_score":0.028441727},"labels":[],"label_agreement":null},{"id":"W1967832448","doi":"10.1016/j.disc.2007.04.003","title":"Planarity of iterated line graphs","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Line graph; Combinatorics; Iterated function; Planarity testing; Graph; Block graph; Discrete mathematics; Line (geometry); 1-planar graph; Geometry","score_opus":0.043474325233040824,"score_gpt":0.3347128059348521,"score_spread":0.29123848070181124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967832448","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8162985,0.00060497224,0.098408945,0.0015099857,0.00008004593,0.000062481435,0.00032443766,0.000322447,0.08238819],"genre_scores_gemma":[0.9730839,0.0006285035,0.012323452,0.00020428335,0.00019927348,0.00006882426,0.00036273838,0.00011842738,0.013010618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993857,0.00013521453,0.000022896995,0.00015135627,0.00018703914,0.000117791096],"domain_scores_gemma":[0.9966625,0.0014534823,0.0007875208,0.00028671525,0.00045148487,0.00035835986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039850452,0.0005430308,0.0007524825,0.0025441526,0.0015036823,0.0033708678,0.0014603309,0.0012090235,0.0083066365],"category_scores_gemma":[0.0041683516,0.0006000812,0.0007615149,0.001574868,0.0030746346,0.0039953357,0.0018581835,0.0027509271,0.0007580012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000490259,0.000018956425,0.00056504,0.000053696527,0.000014773377,0.00011703975,0.00037994274,0.003133353,0.0017093617,0.98707217,0.00090350496,0.005983184],"study_design_scores_gemma":[0.000021734932,0.000021106436,0.00060118217,0.000011638242,0.000017534432,0.00017506938,0.00023021591,0.008228714,0.00078202336,0.9879723,0.0019233618,0.00001529191],"about_ca_topic_score_codex":0.0013181455,"about_ca_topic_score_gemma":0.001153809,"teacher_disagreement_score":0.0083066365,"about_ca_system_score_codex":0.0010293566,"about_ca_system_score_gemma":0.000373791,"threshold_uncertainty_score":0.0277884},"labels":[],"label_agreement":null},{"id":"W1968078289","doi":"10.1016/j.disc.2011.02.009","title":"Extra two-fold Steiner pentagon systems","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Beijing Institute For Brain Disorders","keywords":"Pentagon; Combinatorics; Mathematics; Fold (higher-order function); Multigraph; Steiner system; Path (computing); Discrete mathematics; Geometry; Computer science; Graph","score_opus":0.02788486845778938,"score_gpt":0.2116887652868379,"score_spread":0.18380389682904852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968078289","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48908535,0.0006598742,0.20502649,0.0012454872,0.0009811069,0.00011001207,0.00060146843,0.0005936786,0.30169642],"genre_scores_gemma":[0.8999985,0.00038341415,0.050684523,0.0004327478,0.00013833687,0.00008083305,0.0005080262,0.00013115043,0.047642455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996898,0.00008330318,0.00001584456,0.00005975998,0.00009029221,0.000060903378],"domain_scores_gemma":[0.99947685,0.00010779508,0.000056147695,0.00015147016,0.000086961,0.00012079202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001780919,0.0005138901,0.0006718756,0.0008551283,0.0010216234,0.0014763037,0.0009562902,0.0013101527,0.017539335],"category_scores_gemma":[0.00091792195,0.00036113017,0.00051835633,0.0008585855,0.00074226625,0.0017708594,0.0016424616,0.0016430349,0.0021418487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030497718,0.00009074013,0.00059492455,0.00017856198,0.000036878933,0.0008450529,0.00020472545,0.025755668,0.013337319,0.91204214,0.007006139,0.03960285],"study_design_scores_gemma":[0.000103206105,0.00014885083,0.001102961,0.00005429764,0.00003967915,0.0017610774,0.00041740816,0.13080227,0.007824809,0.8316605,0.026029903,0.000055088778],"about_ca_topic_score_codex":0.00022582464,"about_ca_topic_score_gemma":0.00043403413,"teacher_disagreement_score":0.017539335,"about_ca_system_score_codex":0.00043974823,"about_ca_system_score_gemma":0.00028343173,"threshold_uncertainty_score":0.058674872},"labels":[],"label_agreement":null},{"id":"W1968105630","doi":"10.1016/j.disc.2007.06.025","title":"The diameter of protean graphs","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Giant component; Discrete mathematics; Graph; Degree distribution; Random graph; Complex network","score_opus":0.010262389157823898,"score_gpt":0.2737825081792333,"score_spread":0.26352011902140937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968105630","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68056315,0.0037875427,0.24589162,0.0064632893,0.00034994417,0.00007717616,0.001071134,0.000506893,0.06128923],"genre_scores_gemma":[0.9689359,0.0026993915,0.018275483,0.00040574692,0.0007415681,0.00016873432,0.0005645005,0.00016395893,0.008044765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988073,0.00044012777,0.000043995336,0.00027243243,0.00028176422,0.00015441615],"domain_scores_gemma":[0.9800729,0.01378606,0.0020364686,0.0009189418,0.0010695858,0.0021160196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018998085,0.0008000638,0.0014094006,0.0035148289,0.0022450031,0.003756461,0.0020343736,0.0015574263,0.0036082065],"category_scores_gemma":[0.018313728,0.0011135717,0.0005458681,0.0023060762,0.0035483914,0.0074004354,0.0027326907,0.0020919123,0.0005671162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014749457,0.000036846228,0.0020987664,0.00013609287,0.000034190864,0.00012035769,0.00058135693,0.019072851,0.002289705,0.9597374,0.004954707,0.010790142],"study_design_scores_gemma":[0.000020763086,0.000030202653,0.0014773636,0.000041821404,0.00002687489,0.00029841604,0.00019882641,0.08033013,0.0008318385,0.91149175,0.005228838,0.000023208935],"about_ca_topic_score_codex":0.0011967431,"about_ca_topic_score_gemma":0.00091849366,"teacher_disagreement_score":0.003756461,"about_ca_system_score_codex":0.0017650889,"about_ca_system_score_gemma":0.0006365952,"threshold_uncertainty_score":0.012806654},"labels":[],"label_agreement":null},{"id":"W1968120658","doi":"10.1016/j.disc.2003.06.003","title":"Explicit enumeration of 321, hexagon-avoiding permutations","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Enumeration; Mathematics; Generating function; Combinatorics; Recurrence relation; Simple (philosophy); Class (philosophy); Product (mathematics); Homogeneous space; Enumerative combinatorics; Term (time); Discrete mathematics; Computer science","score_opus":0.050434782911579,"score_gpt":0.3357405044320268,"score_spread":0.2853057215204478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968120658","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48440242,0.0005873175,0.19555096,0.0014249044,0.0004203819,0.00009755482,0.00091538316,0.00056902925,0.31603205],"genre_scores_gemma":[0.8636699,0.0006970478,0.06711801,0.00044302343,0.00012795423,0.00011484475,0.0013996562,0.0003051207,0.066124454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953175,0.00010969721,0.00003424395,0.000066845794,0.0001602147,0.000097272576],"domain_scores_gemma":[0.99924636,0.00032123225,0.000087855115,0.00014993711,0.00013534001,0.000059314138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039280887,0.0006169169,0.0005444223,0.00076373026,0.0014509714,0.0027704753,0.00098221,0.0010339465,0.012216565],"category_scores_gemma":[0.0023122313,0.00043086114,0.00040671532,0.0016105635,0.00081932446,0.0024094596,0.0014565844,0.0014303665,0.0028800278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012350435,0.0000714427,0.0007231516,0.00011671263,0.000008547976,0.00027087322,0.00034630185,0.0035264017,0.003524511,0.94740874,0.005712687,0.03816714],"study_design_scores_gemma":[0.000019765695,0.000017666007,0.00035697228,0.000039479273,0.000013993366,0.00034763318,0.0001587188,0.009860696,0.002522822,0.97419524,0.012450863,0.000016219143],"about_ca_topic_score_codex":0.0004325284,"about_ca_topic_score_gemma":0.0013400371,"teacher_disagreement_score":0.012216565,"about_ca_system_score_codex":0.00077789807,"about_ca_system_score_gemma":0.00085379137,"threshold_uncertainty_score":0.04086852},"labels":[],"label_agreement":null},{"id":"W1968125253","doi":"10.1016/j.disc.2005.09.046","title":"Mobility of vertex-transitive graphs","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Division of Electrical, Communications and Cyber Systems","keywords":"Mathematics; Combinatorics; Vertex-transitive graph; Symmetric graph; Cayley graph; Automorphism; Vertex (graph theory); Graph automorphism; Discrete mathematics; Lexicographical order; Transitive relation; Transitive reduction; Graph; Line graph; Voltage graph","score_opus":0.03776495248668868,"score_gpt":0.3203422358461354,"score_spread":0.28257728335944676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968125253","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8271311,0.0011503902,0.12542962,0.0025701036,0.00026319677,0.000101339785,0.0007648,0.00032426967,0.04226518],"genre_scores_gemma":[0.97976345,0.0010325408,0.008991336,0.00017606482,0.0001697179,0.00008607777,0.00054718094,0.00007400241,0.009159581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990011,0.00023521959,0.00007496913,0.00023064628,0.00021698665,0.0002410134],"domain_scores_gemma":[0.9947584,0.0023933798,0.0009333279,0.0007261587,0.0003293001,0.00085928093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008679665,0.00060998363,0.0009429088,0.0028361632,0.0028345883,0.0038537611,0.0017464628,0.0013188507,0.006333181],"category_scores_gemma":[0.005538875,0.0005075548,0.0011666346,0.0027417683,0.0038968634,0.0072588255,0.0031155755,0.0018696053,0.00064981094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005920953,0.000018648774,0.00056129077,0.000029014678,0.000012464274,0.0001645638,0.0008271127,0.002172954,0.0010906655,0.99101263,0.0006853576,0.003366028],"study_design_scores_gemma":[0.000017093302,0.000013349475,0.00023975344,0.000013166246,0.000013419373,0.00012049032,0.00032225053,0.004677447,0.00052636745,0.9920684,0.0019771797,0.000011069553],"about_ca_topic_score_codex":0.0026678715,"about_ca_topic_score_gemma":0.0015984556,"teacher_disagreement_score":0.006333181,"about_ca_system_score_codex":0.0013776493,"about_ca_system_score_gemma":0.00086867396,"threshold_uncertainty_score":0.02118659},"labels":[],"label_agreement":null},{"id":"W1968128554","doi":"10.1016/j.disc.2003.11.031","title":"The Hamilton–Waterloo problem: the case of Hamilton cycles and triangle-factors","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV; Ministerstvo školstva, vedy, výskumu a športu Slovenskej republiky; Natural Sciences and Engineering Research Council of Canada; Slovenská Akadémia Vied","keywords":"Mathematics; Combinatorics; Hamiltonian path; Hamiltonian (control theory); Factorization; Discrete mathematics; Mathematical optimization; Algorithm; Graph","score_opus":0.010628488815673309,"score_gpt":0.20978061464927777,"score_spread":0.19915212583360448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968128554","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30738088,0.005502046,0.49618736,0.0116652455,0.00054351037,0.00021156538,0.0007943449,0.00024873592,0.17746635],"genre_scores_gemma":[0.88057506,0.0036373998,0.06818439,0.0008631474,0.00053074677,0.00013134624,0.0005200089,0.00011944747,0.04543835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926203,0.00022959,0.000029275405,0.00015731918,0.00015177159,0.00017003156],"domain_scores_gemma":[0.9973546,0.001697554,0.00024250244,0.00021730253,0.00023853433,0.00024953522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083782175,0.00048365194,0.00092119176,0.0009473717,0.0014913625,0.002493081,0.0016672275,0.0033077113,0.011505942],"category_scores_gemma":[0.0071612564,0.0005558663,0.0006355746,0.0020366798,0.0021744727,0.0048484453,0.0014849607,0.0018019385,0.000698443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058844027,0.000024721521,0.00021859037,0.00007357488,0.000014931589,0.00016346014,0.0001299444,0.011589475,0.00029611628,0.97097576,0.0058143167,0.010640269],"study_design_scores_gemma":[0.000026198752,0.0000063206157,0.000072897536,0.000012727803,0.0000057244047,0.00005525306,0.0001019911,0.03133669,0.00014878671,0.96505064,0.0031740773,0.000008749627],"about_ca_topic_score_codex":0.012094094,"about_ca_topic_score_gemma":0.008999018,"teacher_disagreement_score":0.012094094,"about_ca_system_score_codex":0.0015460881,"about_ca_system_score_gemma":0.0014151023,"threshold_uncertainty_score":0.03849119},"labels":[],"label_agreement":null},{"id":"W1968181001","doi":"10.1016/j.disc.2004.02.003","title":"Ramsey numbers in complete balanced multipartite graphs. Part II: Size numbers","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Multipartite; Ramsey's theorem; Combinatorics; Discrete mathematics; Graph","score_opus":0.029877456998500543,"score_gpt":0.28952597875345,"score_spread":0.25964852175494946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968181001","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59098524,0.009787236,0.18795566,0.0069411956,0.00060470635,0.00013408206,0.0013544223,0.0005269971,0.20171043],"genre_scores_gemma":[0.9660017,0.0024884536,0.014575904,0.00034101927,0.00039911683,0.00021577081,0.0002998511,0.000097833865,0.015580351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938846,0.00013679886,0.000030235446,0.00013286417,0.00021844744,0.00009307313],"domain_scores_gemma":[0.9953551,0.0030561837,0.00047079404,0.00041888707,0.0003612303,0.0003377687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010876947,0.00038017528,0.00045885428,0.0017592333,0.00083504175,0.0028717373,0.00087407907,0.000912143,0.0073367087],"category_scores_gemma":[0.007083518,0.00045516988,0.00035515917,0.0014066055,0.002307483,0.006360734,0.0014493412,0.0013744457,0.00068083947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048702772,0.000015338723,0.000458993,0.000082402425,0.0000060558855,0.00002270969,0.00014515786,0.003215412,0.0015772297,0.9826999,0.0028616772,0.008866437],"study_design_scores_gemma":[0.000012635127,0.000019037088,0.0007180598,0.000038719612,0.000008541304,0.00015433172,0.000100070974,0.011509886,0.001311809,0.9802807,0.00583444,0.000011740251],"about_ca_topic_score_codex":0.0003182173,"about_ca_topic_score_gemma":0.00041334683,"teacher_disagreement_score":0.0073367087,"about_ca_system_score_codex":0.0012451955,"about_ca_system_score_gemma":0.00046202407,"threshold_uncertainty_score":0.024543703},"labels":[],"label_agreement":null},{"id":"W1969337449","doi":"10.1016/j.disc.2007.11.006","title":"Bipartite graphs are not universal fixers","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.02775671963024989,"score_gpt":0.2992228160809777,"score_spread":0.27146609645072783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969337449","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39393032,0.0044142273,0.36512977,0.008176238,0.0012281791,0.0003736282,0.001785536,0.0038102805,0.22115192],"genre_scores_gemma":[0.8775124,0.001970737,0.04734975,0.0021680673,0.00052315387,0.0005570341,0.0014802259,0.0013748991,0.06706377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99624926,0.00057004567,0.00017387175,0.0013423357,0.00056845794,0.0010959299],"domain_scores_gemma":[0.98437923,0.0075235297,0.0013777297,0.003846515,0.0014034888,0.0014694541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003541243,0.0015637357,0.003563115,0.0047214692,0.0071100015,0.0078408625,0.003126862,0.004605209,0.021996116],"category_scores_gemma":[0.016603118,0.0032157565,0.003521504,0.0034213185,0.009502407,0.021319035,0.010270463,0.0080616865,0.0029386394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006229236,0.000017368067,0.00024530315,0.00006774209,0.00003868271,0.000042161704,0.00022340965,0.00045876415,0.0003502995,0.99301815,0.0018612405,0.003614592],"study_design_scores_gemma":[0.00003306782,0.000011999134,0.0001703133,0.000038010592,0.000049599843,0.000107774504,0.00016922597,0.0011341937,0.00051238184,0.99305576,0.0046948367,0.000023004293],"about_ca_topic_score_codex":0.0023780377,"about_ca_topic_score_gemma":0.0024887044,"teacher_disagreement_score":0.021996116,"about_ca_system_score_codex":0.0036763914,"about_ca_system_score_gemma":0.0014972385,"threshold_uncertainty_score":0.07358432},"labels":[],"label_agreement":null},{"id":"W1969412240","doi":"10.1016/j.disc.2008.01.039","title":"On Tutte polynomial uniqueness of twisted wheels","year":2008,"lang":"it","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada; Nankai University","keywords":"Tutte polynomial; Mathematics; Combinatorics; Polyhedral graph; Discrete mathematics; Hypercube; Chromatic polynomial; Uniqueness; Graph; Matroid; Line graph; Pathwidth; Voltage graph","score_opus":0.04184147399083735,"score_gpt":0.30485081405496806,"score_spread":0.2630093400641307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969412240","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51064974,0.00096920127,0.40328845,0.0021458685,0.00069082563,0.00010990918,0.00046494493,0.00039735276,0.08128379],"genre_scores_gemma":[0.9333821,0.0007259324,0.028252192,0.00040884572,0.00029338183,0.00010653478,0.0004070411,0.0004119967,0.03601197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988701,0.0002595884,0.000047000845,0.0002247751,0.0002101163,0.00038828448],"domain_scores_gemma":[0.9967552,0.0015005728,0.00032502372,0.00034453024,0.00055557664,0.0005191096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012611282,0.000814452,0.0015919177,0.0023332483,0.0035420458,0.0035226939,0.0021709814,0.002174127,0.0113701],"category_scores_gemma":[0.009815873,0.00096912903,0.0019271062,0.0019550035,0.004541552,0.006815777,0.00561097,0.004207667,0.0016511839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003224024,0.000009770696,0.00024728943,0.00002109873,0.0000052834375,0.00003892626,0.00013576497,0.0016052889,0.00032923173,0.99477106,0.0006302033,0.0021739951],"study_design_scores_gemma":[0.000009361902,0.000014429095,0.00016033552,0.000015819749,0.000007215411,0.00005579715,0.00016310133,0.008743059,0.00033354672,0.98908067,0.0014001775,0.000016560007],"about_ca_topic_score_codex":0.0029104953,"about_ca_topic_score_gemma":0.0027445627,"teacher_disagreement_score":0.0113701,"about_ca_system_score_codex":0.0018356381,"about_ca_system_score_gemma":0.0013458462,"threshold_uncertainty_score":0.038036764},"labels":[],"label_agreement":null},{"id":"W1971489185","doi":"10.1016/j.disc.2014.12.001","title":"Point determining digraphs, <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mrow><mml:mo>{</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>}</mml:mo></mml:mrow></mml:math>-matrix partitions, and dualities in full homomorphisms","year":2014,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scroll; Mathematics; Algorithm; Theology; Philosophy","score_opus":0.022036936684090846,"score_gpt":0.2675929174034697,"score_spread":0.24555598071937884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971489185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3002476,0.0009623934,0.40053254,0.0020158477,0.00040938257,0.00029093528,0.004819756,0.0019338937,0.2887876],"genre_scores_gemma":[0.7899588,0.0007688418,0.09089315,0.0004299293,0.00018404821,0.00015871729,0.0038933721,0.00054212473,0.11317109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961495,0.000075919874,0.000023110484,0.00013687358,0.00008165055,0.00006746994],"domain_scores_gemma":[0.99904853,0.00033160014,0.00008127521,0.00013578493,0.00023845503,0.00016446925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043582267,0.00037622594,0.00032359964,0.0013959289,0.0014210728,0.0020524412,0.00069062575,0.00051942543,0.0214014],"category_scores_gemma":[0.0020621773,0.00035367758,0.00045552012,0.0010772424,0.0011141442,0.0038338616,0.0012272286,0.0013241217,0.0038205124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050280596,0.000047166053,0.00041579126,0.00007196465,0.000008432313,0.00012188177,0.0004421662,0.0006944081,0.0015459204,0.96667236,0.0073088664,0.022620667],"study_design_scores_gemma":[0.000017448025,0.000034719167,0.0006558309,0.000023006653,0.000012873209,0.00038612392,0.00035531854,0.003599177,0.002654978,0.9654845,0.02675304,0.000022934932],"about_ca_topic_score_codex":0.001994277,"about_ca_topic_score_gemma":0.0030313449,"teacher_disagreement_score":0.0214014,"about_ca_system_score_codex":0.0009832736,"about_ca_system_score_gemma":0.00067423773,"threshold_uncertainty_score":0.071594834},"labels":[],"label_agreement":null},{"id":"W1971956496","doi":"10.1016/s0012-365x(99)00342-8","title":"Modified group divisible designs with block size four","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Block size; Block (permutation group theory); Combinatorics; Group (periodic table); Discrete mathematics; Arithmetic; Computer science","score_opus":0.017692051282143628,"score_gpt":0.20049401682381235,"score_spread":0.18280196554166872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971956496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21181971,0.0007288187,0.75252044,0.0008149743,0.00053285575,0.0003156235,0.0003505803,0.0009208244,0.031996187],"genre_scores_gemma":[0.7064183,0.00031426136,0.2754202,0.0005131042,0.00020880954,0.00033526664,0.00020070544,0.00010306759,0.016486352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983367,0.0007160832,0.000091490096,0.00025648094,0.00040754525,0.0001917156],"domain_scores_gemma":[0.9965581,0.00085469545,0.00045356745,0.0014098536,0.00054274773,0.00018094308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011729492,0.0009025928,0.0007756626,0.0008282796,0.000584165,0.0011189262,0.0010698437,0.0010411716,0.006672745],"category_scores_gemma":[0.0034564,0.0003830704,0.0004465073,0.00089072186,0.0008267813,0.0010282315,0.001073205,0.00086184125,0.0014072788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037255343,0.00025010647,0.0015153409,0.0003494593,0.00017730724,0.00043776206,0.00036181818,0.04329444,0.12369788,0.6330786,0.004499709,0.18861197],"study_design_scores_gemma":[0.0012319686,0.0026844435,0.001678624,0.00019717889,0.0003243532,0.0013167562,0.00013944737,0.3278839,0.09904516,0.5082436,0.057038497,0.00021610188],"about_ca_topic_score_codex":0.00032294285,"about_ca_topic_score_gemma":0.0007211579,"teacher_disagreement_score":0.006672745,"about_ca_system_score_codex":0.0008638243,"about_ca_system_score_gemma":0.00077166554,"threshold_uncertainty_score":0.022322536},"labels":[],"label_agreement":null},{"id":"W1972322699","doi":"10.1016/j.disc.2012.07.018","title":"Separation properties of 3-Steiner and 3-monophonic convexity in graphs","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Convexity; Combinatorics; Disjoint sets; Regular polygon; Convex set; Subderivative; Space (punctuation); Discrete mathematics; Convex optimization; Geometry; Computer science","score_opus":0.039361960832035935,"score_gpt":0.3071247290695605,"score_spread":0.2677627682375246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972322699","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7674347,0.0007912366,0.14815462,0.002339189,0.00011828711,0.000084626656,0.0009769126,0.00023388687,0.07986653],"genre_scores_gemma":[0.9673931,0.00063851645,0.01997717,0.0003668752,0.00020335552,0.00011484218,0.0009848634,0.0002313407,0.01009004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913484,0.00018156705,0.00004449649,0.00015900028,0.00025969069,0.0002204351],"domain_scores_gemma":[0.9941923,0.0033314354,0.00078129343,0.00044234926,0.0004896675,0.00076292845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008782864,0.000866804,0.0013374845,0.0019254879,0.002261921,0.0042451047,0.0017950662,0.0014049581,0.010855475],"category_scores_gemma":[0.0053634867,0.001115511,0.001675419,0.002472182,0.0034332632,0.0053740637,0.0024651203,0.0040290053,0.0008966005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002119016,0.000060929324,0.0013957673,0.00009842027,0.000036703845,0.00022194014,0.00048048917,0.008603544,0.0034424528,0.97503996,0.0027614878,0.007646383],"study_design_scores_gemma":[0.000051911236,0.00004262502,0.0023026096,0.000028436007,0.000040877232,0.00038955288,0.00032681812,0.034543,0.0020304592,0.95748943,0.0027200724,0.0000342198],"about_ca_topic_score_codex":0.0027100567,"about_ca_topic_score_gemma":0.002659125,"teacher_disagreement_score":0.010855475,"about_ca_system_score_codex":0.0016981403,"about_ca_system_score_gemma":0.0010847888,"threshold_uncertainty_score":0.036315143},"labels":[],"label_agreement":null},{"id":"W1972419950","doi":"10.1016/s0012-365x(03)00262-0","title":"Existence of (v,{5,w∗},1)-PBDs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; University Research Committee, Emory University; Mount Saint Vincent University","keywords":"Mathematics; Combinatorics; Block (permutation group theory); Embedding; Line (geometry); Discrete mathematics; Geometry; Computer science","score_opus":0.011148453049231023,"score_gpt":0.20617023034433635,"score_spread":0.19502177729510534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972419950","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6650614,0.00057531346,0.22753194,0.0019334712,0.00022816168,0.00019319875,0.0011774341,0.0007614809,0.10253753],"genre_scores_gemma":[0.91908187,0.00044892344,0.055377383,0.00040496365,0.000069721886,0.00025115526,0.0008133951,0.00018221488,0.02337049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908483,0.00020282321,0.000046289708,0.00020596947,0.00016291444,0.00029717106],"domain_scores_gemma":[0.9965395,0.0018433597,0.00037857026,0.00029527355,0.00041427425,0.0005291072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008525728,0.0006769284,0.0010906133,0.0014492177,0.0025406713,0.004677722,0.0013759126,0.0020222226,0.011631327],"category_scores_gemma":[0.0056716474,0.0011843279,0.0009091686,0.0010486726,0.0017809101,0.003067675,0.0031525553,0.002470017,0.0015891576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021349064,0.000066802415,0.00058239186,0.000090409616,0.000028351496,0.00016161769,0.0002584176,0.0029093183,0.00497118,0.9806192,0.0028967895,0.0072020567],"study_design_scores_gemma":[0.00017027245,0.00009905986,0.0008142716,0.00006507566,0.000045999288,0.0004950348,0.00038869222,0.026075076,0.0071204775,0.95660067,0.008081761,0.000043632106],"about_ca_topic_score_codex":0.0007484972,"about_ca_topic_score_gemma":0.0008664263,"teacher_disagreement_score":0.011631327,"about_ca_system_score_codex":0.0011698089,"about_ca_system_score_gemma":0.0015391337,"threshold_uncertainty_score":0.038910687},"labels":[],"label_agreement":null},{"id":"W1972595683","doi":"10.1016/s0012-365x(02)00482-x","title":"A note on {4}-GDDs of type 210","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Block size; Class (philosophy); Block (permutation group theory); Type (biology); Combinatorics; Discrete mathematics; Group (periodic table); Arithmetic; Computer science; Chemistry","score_opus":0.01162020813950074,"score_gpt":0.22679861714162675,"score_spread":0.215178409002126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972595683","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12661561,0.0027849425,0.2509003,0.01050942,0.007739851,0.0002063097,0.0015512368,0.00086611777,0.5988262],"genre_scores_gemma":[0.68724823,0.0033878142,0.13630387,0.005912709,0.0022285606,0.00033348854,0.0015029105,0.0007645578,0.16231784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991812,0.00022549168,0.00005875944,0.00016875587,0.00020036145,0.00016546232],"domain_scores_gemma":[0.99858224,0.0006185147,0.00010617389,0.0003205009,0.00021055316,0.00016203099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007081871,0.0006446215,0.0013195084,0.0012634414,0.0028500247,0.0029178842,0.0014374377,0.0018077656,0.012411236],"category_scores_gemma":[0.0029822206,0.000541711,0.0014873368,0.0020069468,0.0021804275,0.0038432777,0.002596411,0.0040590405,0.0021273051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002914321,0.0000066580415,0.000068359004,0.000024528947,0.0000037191057,0.000061018578,0.000076199576,0.00027453058,0.00038908306,0.9910739,0.004107802,0.0038852077],"study_design_scores_gemma":[0.00001356697,0.000013647271,0.00007885365,0.000020872867,0.000009038826,0.00018569556,0.000059497397,0.0017802741,0.00046019917,0.9711949,0.026170164,0.00001313854],"about_ca_topic_score_codex":0.0015309768,"about_ca_topic_score_gemma":0.001514087,"teacher_disagreement_score":0.012411236,"about_ca_system_score_codex":0.001533447,"about_ca_system_score_gemma":0.001033236,"threshold_uncertainty_score":0.0415197},"labels":[],"label_agreement":null},{"id":"W1973160280","doi":"10.1016/j.disc.2005.02.020","title":"Flows that are sums of hamiltonian cycles in Cayley graphs on abelian groups","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Cayley graph; Abelian group; Combinatorics; Hamiltonian (control theory); Hamiltonian path; Graph; Discrete mathematics","score_opus":0.04186396644668725,"score_gpt":0.2956952100526406,"score_spread":0.2538312436059533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973160280","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9123787,0.00051831483,0.0446106,0.00046068232,0.00035732306,0.000089892754,0.00023912311,0.00030670795,0.04103858],"genre_scores_gemma":[0.97042793,0.00037429258,0.010701309,0.00023831677,0.00028687582,0.00010113723,0.00046592837,0.00013876152,0.017265437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999585,0.00006933172,0.000031408723,0.00007763881,0.00012477188,0.000111800626],"domain_scores_gemma":[0.9986634,0.00042962498,0.00025877872,0.00010068837,0.0002281818,0.00031925054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004375765,0.0005306522,0.00069073134,0.0031406183,0.0017688273,0.0029498083,0.0008276985,0.0012495107,0.006472554],"category_scores_gemma":[0.0021290812,0.00066310144,0.00061450567,0.0014455017,0.0016827375,0.004477342,0.0013344822,0.0011673967,0.00048013264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100044,0.000071450166,0.0010801033,0.00006217421,0.000034352724,0.00038751375,0.00051411527,0.002428782,0.0035124023,0.98268086,0.0020295372,0.0070986287],"study_design_scores_gemma":[0.00002045974,0.000017751892,0.0008220249,0.00002170364,0.000023975927,0.00025411916,0.00033341657,0.01034984,0.0010058236,0.9842589,0.002875146,0.000016849956],"about_ca_topic_score_codex":0.0006479063,"about_ca_topic_score_gemma":0.0012720313,"teacher_disagreement_score":0.006472554,"about_ca_system_score_codex":0.0006012646,"about_ca_system_score_gemma":0.0003735815,"threshold_uncertainty_score":0.021652877},"labels":[],"label_agreement":null},{"id":"W1973195334","doi":"10.1016/j.disc.2013.07.016","title":"The maximum Perron roots of digraphs with some given parameters","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Digraph; Combinatorics; Root (linguistics); Arc (geometry); Discrete mathematics; Geometry","score_opus":0.020782416247532434,"score_gpt":0.2620764638242689,"score_spread":0.24129404757673648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973195334","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5942365,0.0022574111,0.22249772,0.00430966,0.00041233902,0.00019370225,0.002243598,0.0009276964,0.1729213],"genre_scores_gemma":[0.91879493,0.001061926,0.04072107,0.00052606466,0.000264069,0.00025415205,0.00072421,0.00038186123,0.037271664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991019,0.0002967938,0.000041664884,0.00022211259,0.0001764373,0.00016119848],"domain_scores_gemma":[0.99585766,0.0024852064,0.00048491213,0.00032189835,0.00032251014,0.0005277323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093887834,0.00095891923,0.0014714783,0.0022514532,0.002016269,0.0035246927,0.0020310953,0.002587978,0.01414908],"category_scores_gemma":[0.00992841,0.0009125476,0.00080155145,0.0020217106,0.0021498573,0.0051364866,0.0018094642,0.0029875748,0.002239442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021844344,0.00005166396,0.0004695588,0.0002884812,0.000033177224,0.00014265803,0.00052509486,0.007259039,0.0031645221,0.9678093,0.0053155823,0.014722333],"study_design_scores_gemma":[0.000053686606,0.000030944208,0.000480964,0.00005542034,0.000025944142,0.00016821949,0.00020355337,0.014516122,0.0011235352,0.9788138,0.004498592,0.000029080098],"about_ca_topic_score_codex":0.00063586753,"about_ca_topic_score_gemma":0.0011305404,"teacher_disagreement_score":0.01414908,"about_ca_system_score_codex":0.0018252338,"about_ca_system_score_gemma":0.00080360146,"threshold_uncertainty_score":0.04733336},"labels":[],"label_agreement":null},{"id":"W1974039284","doi":"10.1016/j.disc.2015.02.023","title":"Elementary proof that <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:msubsup><mml:mrow><mml:mi mathvariant=\"double-struck\">Z</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msubsup></mml:math> is a DCI-group","year":2015,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Abelian group; Mathematics; Rank (graph theory); Combinatorics; Automorphism; Order (exchange); Discrete mathematics","score_opus":0.03736477245235436,"score_gpt":0.27586553055987456,"score_spread":0.2385007581075202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974039284","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068542217,0.0005712649,0.1788345,0.012908846,0.0040305015,0.00036849038,0.007343603,0.0031724381,0.78591615],"genre_scores_gemma":[0.27669552,0.002176226,0.10851034,0.006756739,0.0020998851,0.0007538227,0.01703394,0.0048186462,0.58115494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895453,0.00012877215,0.000058996622,0.0002495268,0.0004073468,0.00020086886],"domain_scores_gemma":[0.9967443,0.0007045641,0.00014334565,0.00043566976,0.0017211152,0.00025106172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009649433,0.0014043936,0.000835255,0.0011620291,0.002648457,0.0036393758,0.0014479368,0.001038875,0.15934815],"category_scores_gemma":[0.003716341,0.00063040503,0.0021731982,0.0010361257,0.0023789348,0.0049300115,0.0033511003,0.004868235,0.063276656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009032149,0.00012093153,0.00035525995,0.00030180527,0.00004673624,0.00034776356,0.0009037909,0.00035822578,0.0048641106,0.7352939,0.23256744,0.024749653],"study_design_scores_gemma":[0.00006762925,0.000038973303,0.0011121319,0.00013095114,0.000055995442,0.00073363265,0.0005558045,0.0014616377,0.009644477,0.45036685,0.535787,0.000044928038],"about_ca_topic_score_codex":0.0053269123,"about_ca_topic_score_gemma":0.0056795618,"teacher_disagreement_score":0.15934815,"about_ca_system_score_codex":0.0021495812,"about_ca_system_score_gemma":0.0022984257,"threshold_uncertainty_score":0.53307265},"labels":[],"label_agreement":null},{"id":"W1974712349","doi":"10.1016/j.disc.2012.11.001","title":"Corrigendum to “A criterion for the half-plane property” [Discrete Math. 309 (2008) 1385–1390]","year":2012,"lang":"en","type":"erratum","venue":"Discrete Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Property (philosophy); Plane (geometry); Discrete mathematics; Combinatorics; Pure mathematics; Applied mathematics; Geometry","score_opus":0.03259908505706661,"score_gpt":0.27105931372479103,"score_spread":0.23846022866772443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974712349","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037105748,0.005335979,0.0034210142,0.08221719,0.87549293,0.00009130908,0.0017031936,0.0006465007,0.030720929],"genre_scores_gemma":[0.021922408,0.017051384,0.010678564,0.115236655,0.24845111,0.00054102094,0.0046965624,0.0022319276,0.5791903],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9951251,0.0008685111,0.0005907512,0.0008334638,0.0021172506,0.00046483017],"domain_scores_gemma":[0.9858995,0.002972164,0.0005672537,0.001179729,0.008820022,0.00056123204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028043545,0.0027544417,0.0028636423,0.0052836114,0.0041704504,0.0039357194,0.0057308963,0.0061352802,0.10601536],"category_scores_gemma":[0.030305518,0.0013328221,0.0028208245,0.0034168162,0.003307312,0.004830164,0.002617172,0.007254044,0.056266267],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034485845,0.000010249016,0.00004147468,0.00014472484,0.000016601942,0.00009140495,0.000019734705,0.00007505992,0.000070802154,0.0047989213,0.9900034,0.0046931133],"study_design_scores_gemma":[0.000058096877,0.000045256333,0.0014870928,0.00028039972,0.00006460994,0.0003310502,0.00008272427,0.00087274984,0.0006499189,0.02189993,0.97413003,0.00009822607],"about_ca_topic_score_codex":0.02126982,"about_ca_topic_score_gemma":0.026670668,"teacher_disagreement_score":0.10601536,"about_ca_system_score_codex":0.0072136014,"about_ca_system_score_gemma":0.0033301564,"threshold_uncertainty_score":0.3546567},"labels":[],"label_agreement":null},{"id":"W1974807847","doi":"10.1016/j.disc.2005.03.023","title":"Extended Petersen graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Combinatorics; Mathematics; Petersen graph; Discrete mathematics; Chordal graph; Indifference graph; Graph; Line graph; Voltage graph","score_opus":0.007963816504260353,"score_gpt":0.20945181349046588,"score_spread":0.20148799698620554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974807847","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22665413,0.0010967572,0.26823318,0.002107539,0.0006968549,0.00019195638,0.001631501,0.00058990705,0.49879816],"genre_scores_gemma":[0.8011748,0.0015023702,0.039187193,0.0008836389,0.0005502343,0.00018206022,0.0013524556,0.0003062156,0.15486096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953127,0.00009434327,0.000018308945,0.00013681815,0.00013096255,0.0000883334],"domain_scores_gemma":[0.99913496,0.0002695663,0.00011379745,0.00020863034,0.00016197712,0.00011119292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031170962,0.00067523867,0.00063702336,0.0020125485,0.0014162173,0.0021424417,0.00080213253,0.0009289396,0.022637133],"category_scores_gemma":[0.0017062341,0.00046086896,0.00073747145,0.001401236,0.0011745867,0.003748605,0.0017424522,0.0023036343,0.0028081443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021927823,0.000012220044,0.00006819688,0.000022580085,0.0000067600276,0.00006087989,0.0000761088,0.0010414786,0.00056178897,0.9900367,0.0018680368,0.006223198],"study_design_scores_gemma":[0.0000073211945,0.000008511351,0.00016099609,0.000008933048,0.00000777055,0.00010320921,0.00005386387,0.0033235596,0.00057387276,0.9858273,0.0099172015,0.0000075013186],"about_ca_topic_score_codex":0.00047473007,"about_ca_topic_score_gemma":0.0005752068,"teacher_disagreement_score":0.022637133,"about_ca_system_score_codex":0.00056053547,"about_ca_system_score_gemma":0.00040301486,"threshold_uncertainty_score":0.075728714},"labels":[],"label_agreement":null},{"id":"W1975011389","doi":"10.1016/s0012-365x(00)00345-9","title":"Bounded vertex coloring of trees","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Bounded function; Combinatorics; Mathematics; Fractional coloring; Vertex (graph theory); Complete coloring; Chromatic scale; Brooks' theorem; Discrete mathematics; List coloring; Graph; Graph power; 1-planar graph; Chordal graph","score_opus":0.033826241284818,"score_gpt":0.3093333693216396,"score_spread":0.2755071280368216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975011389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.422975,0.0017364689,0.4746842,0.0023984099,0.00037997315,0.00007732768,0.0009476125,0.0011737323,0.095627226],"genre_scores_gemma":[0.8778122,0.001081571,0.08882755,0.0005936818,0.00023302832,0.00011259662,0.0011486564,0.0005337621,0.02965683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913055,0.00026458356,0.00003029032,0.00016726446,0.0002066585,0.00020068155],"domain_scores_gemma":[0.9939605,0.0036331161,0.0003322659,0.000736302,0.00060103176,0.000736838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061502354,0.00064332166,0.00093967834,0.0010898141,0.0014239928,0.0033274197,0.001858189,0.0008601402,0.006485509],"category_scores_gemma":[0.0056287036,0.00069323473,0.0006911133,0.002036992,0.0016076334,0.0030797936,0.0018849083,0.0029054582,0.00093893375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011468904,0.000043827473,0.0005232789,0.00008338261,0.000014555818,0.00008584506,0.0003154525,0.013651847,0.0029846283,0.9643394,0.005027138,0.012815957],"study_design_scores_gemma":[0.000017463215,0.000009691522,0.00021912775,0.000013598549,0.0000108662625,0.000049170176,0.00006785206,0.02829406,0.0006718863,0.96775913,0.0028796752,0.0000074790846],"about_ca_topic_score_codex":0.0045613307,"about_ca_topic_score_gemma":0.0062348153,"teacher_disagreement_score":0.006485509,"about_ca_system_score_codex":0.0024762328,"about_ca_system_score_gemma":0.0010233154,"threshold_uncertainty_score":0.02169621},"labels":[],"label_agreement":null},{"id":"W1975017470","doi":"10.1016/j.disc.2009.07.015","title":"Graph-like spaces: An introduction","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Graph; Discrete mathematics; Combinatorics","score_opus":0.02130881350651235,"score_gpt":0.30365715907637125,"score_spread":0.2823483455698589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975017470","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067975335,0.48817343,0.30469662,0.015205192,0.02027183,0.00016947747,0.0014436474,0.0004991796,0.16274306],"genre_scores_gemma":[0.13111293,0.46470317,0.19077158,0.017351687,0.07191887,0.0011239983,0.0027270408,0.0012490769,0.11904166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987998,0.0004084257,0.00011211175,0.00032444447,0.0002621397,0.000092975824],"domain_scores_gemma":[0.99895144,0.00058648305,0.00009205912,0.00008759431,0.0001697736,0.000112605325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014405197,0.0036993935,0.0027213022,0.007950847,0.0020233826,0.0066237175,0.0035641512,0.0044432487,0.011267779],"category_scores_gemma":[0.001739462,0.0017818697,0.0025850378,0.009862113,0.006847967,0.01402969,0.0047026197,0.00790804,0.0055727963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021767011,0.00010832973,0.00022084138,0.0009302749,0.00002937492,0.00021221221,0.00033615297,0.001347303,0.0006007088,0.9108892,0.037232615,0.048071273],"study_design_scores_gemma":[0.000010301116,0.000081339655,0.00037733337,0.00037492393,0.000024856263,0.00071289676,0.00019502416,0.002301801,0.00021022683,0.73509365,0.26056346,0.000054207463],"about_ca_topic_score_codex":0.00092759886,"about_ca_topic_score_gemma":0.0014476224,"teacher_disagreement_score":0.011267779,"about_ca_system_score_codex":0.0023658762,"about_ca_system_score_gemma":0.0008701742,"threshold_uncertainty_score":0.037694454},"labels":[],"label_agreement":null},{"id":"W1975645051","doi":"10.1016/s0012-365x(02)00518-6","title":"Factor d-domatic colorings of graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Fractional coloring; Discrete mathematics; Edge coloring; Vertex (graph theory); Disjoint sets; Graph; Graph power; Line graph","score_opus":0.029955070364367387,"score_gpt":0.2972155256529396,"score_spread":0.26726045528857223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975645051","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47681433,0.0010751206,0.431476,0.0016334642,0.0003649026,0.00015748509,0.0016708043,0.0011217379,0.08568608],"genre_scores_gemma":[0.8461306,0.00080150255,0.11319597,0.0006400696,0.00019351262,0.00015293939,0.0021076319,0.00045105763,0.03632684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999062,0.00020346718,0.00005543641,0.00030374978,0.0001502554,0.00022514183],"domain_scores_gemma":[0.99624026,0.0014552544,0.00041106192,0.00070705573,0.00052104477,0.0006653582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077688054,0.0008306634,0.0007671103,0.0019257317,0.0016981143,0.0033031963,0.0011474076,0.0010334911,0.010991836],"category_scores_gemma":[0.003837535,0.00085656025,0.00089629384,0.0017551841,0.0019461578,0.0029686491,0.0019964506,0.0018174908,0.0015334418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043200987,0.00008430024,0.0020488868,0.00014592554,0.000030366553,0.00014898316,0.00049141067,0.0058286637,0.0067927884,0.9502198,0.0076737655,0.026103104],"study_design_scores_gemma":[0.000060604223,0.000041636904,0.0006714815,0.00002684904,0.00002404365,0.00026524792,0.00022765035,0.0150393685,0.002119725,0.97216,0.0093415715,0.00002195101],"about_ca_topic_score_codex":0.0021740226,"about_ca_topic_score_gemma":0.0035954437,"teacher_disagreement_score":0.010991836,"about_ca_system_score_codex":0.0014835818,"about_ca_system_score_gemma":0.00074823573,"threshold_uncertainty_score":0.036771357},"labels":[],"label_agreement":null},{"id":"W1975666971","doi":"10.1016/s0012-365x(03)00273-5","title":"HGDDs with block size four","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Mathematics; Block size; Block (permutation group theory); Combinatorics; Discrete mathematics; Computer science; Key (lock)","score_opus":0.008262183121001977,"score_gpt":0.18470170720327095,"score_spread":0.17643952408226898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975666971","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31221077,0.0014456543,0.6037156,0.0030640452,0.00044933645,0.00035022572,0.0030586906,0.0042227604,0.071482934],"genre_scores_gemma":[0.8176496,0.0005408506,0.14196804,0.00080910366,0.00013046713,0.00025450485,0.0014637673,0.00030487677,0.03687867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887115,0.0003091463,0.00011026189,0.00019862989,0.00030167922,0.00020904024],"domain_scores_gemma":[0.99648666,0.0016575425,0.00028777344,0.0009635311,0.00045372616,0.00015069947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084859243,0.00046640346,0.00076862174,0.0010577897,0.0008668804,0.0019533136,0.0008322186,0.0008176839,0.009229244],"category_scores_gemma":[0.0029610293,0.00045172812,0.0005282822,0.0012366917,0.001088586,0.0023922543,0.0015941155,0.0012221088,0.0018657944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085243327,0.00018629555,0.0020136659,0.00035217506,0.000087487,0.00064520683,0.00039603928,0.02339993,0.015043343,0.8050802,0.015873821,0.13606939],"study_design_scores_gemma":[0.00022385978,0.0001544745,0.00057357305,0.000069457994,0.000081400394,0.0004667347,0.0001456204,0.06282961,0.024432026,0.87272954,0.038249522,0.00004420538],"about_ca_topic_score_codex":0.0010628899,"about_ca_topic_score_gemma":0.0012713397,"teacher_disagreement_score":0.009229244,"about_ca_system_score_codex":0.0011780255,"about_ca_system_score_gemma":0.0011977558,"threshold_uncertainty_score":0.030874908},"labels":[],"label_agreement":null},{"id":"W1976619117","doi":"10.1016/j.disc.2005.12.053","title":"The firefighter problem for graphs of maximum degree three","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":111,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Degree (music); Mathematics; Combinatorics; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.03299384743016334,"score_gpt":0.28530295995360117,"score_spread":0.2523091125234378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976619117","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55009955,0.0022197983,0.36295128,0.015588834,0.00067260925,0.0006414821,0.0022895446,0.00061800727,0.064918876],"genre_scores_gemma":[0.80206126,0.002148939,0.13500312,0.0011352492,0.00044119466,0.0003223991,0.002892919,0.00037803617,0.055616897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896204,0.00028775245,0.000032165135,0.00023793102,0.000110207475,0.00037001746],"domain_scores_gemma":[0.996089,0.002330677,0.0003675257,0.0003437563,0.00019413288,0.00067489786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017831121,0.0012155743,0.001878414,0.00093373226,0.0035388665,0.002944254,0.0040184036,0.0053777383,0.016144805],"category_scores_gemma":[0.006832984,0.0009471957,0.001526178,0.0011582302,0.0025476352,0.0068032932,0.002837547,0.0036616186,0.0015655644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002969215,0.0010261523,0.0052107396,0.0016732652,0.00024944326,0.0017758735,0.0021069217,0.19943851,0.008343796,0.5807166,0.08450775,0.11198172],"study_design_scores_gemma":[0.00040055613,0.00025850753,0.0014508732,0.00019519826,0.00010769646,0.0008198426,0.0028582183,0.20435987,0.0049464395,0.7624148,0.022121385,0.000066612345],"about_ca_topic_score_codex":0.0059407596,"about_ca_topic_score_gemma":0.0055993586,"teacher_disagreement_score":0.016144805,"about_ca_system_score_codex":0.001679833,"about_ca_system_score_gemma":0.0017786117,"threshold_uncertainty_score":0.054009795},"labels":[],"label_agreement":null},{"id":"W1977101828","doi":"10.1016/j.disc.2010.06.010","title":"Spreads, arcs, and multiple wavelength codes","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Division of Mathematical Sciences","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.006451104124225585,"score_gpt":0.19599923977507003,"score_spread":0.18954813565084444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977101828","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43842074,0.0066548726,0.4534842,0.0042065126,0.00030961624,0.000057808993,0.00042802983,0.0004305969,0.096007586],"genre_scores_gemma":[0.9268198,0.0034078837,0.03552552,0.00038694698,0.0004717559,0.00006799835,0.00013955521,0.000080443344,0.033100158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995789,0.00013438992,0.0000147342,0.00008350327,0.0001395761,0.00004886624],"domain_scores_gemma":[0.99515826,0.0032575051,0.0006897105,0.0003236731,0.00032086438,0.00024994038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005381618,0.00050224864,0.00046764172,0.0021244385,0.0008306152,0.001532325,0.0007349306,0.0010424267,0.0050053443],"category_scores_gemma":[0.005828591,0.00040823416,0.00026131584,0.0021424906,0.0021224057,0.0030098928,0.0011373195,0.0019420424,0.00047893828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007186227,0.00002144927,0.00040533976,0.00004115737,0.000012828653,0.00007975849,0.00014628103,0.023192748,0.0011509631,0.958677,0.0016589878,0.014541623],"study_design_scores_gemma":[0.000016006114,0.000010724067,0.0002185221,0.0000137875295,0.000008822134,0.0000950779,0.00007291968,0.030398652,0.00036403802,0.9662023,0.0025881557,0.000011007127],"about_ca_topic_score_codex":0.0015582844,"about_ca_topic_score_gemma":0.0015236391,"teacher_disagreement_score":0.0050053443,"about_ca_system_score_codex":0.000841977,"about_ca_system_score_gemma":0.00056446943,"threshold_uncertainty_score":0.016744494},"labels":[],"label_agreement":null},{"id":"W1977305469","doi":"10.1016/j.disc.2011.10.011","title":"Häggkvist–Hell graphs: A class of Kneser-colorable graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Triangle-free graph; Homomorphism; Graph; Graph homomorphism; Discrete mathematics; Odd graph; Symmetric graph; 1-planar graph; Chordal graph; Graph power; Line graph; Voltage graph","score_opus":0.04894744649945722,"score_gpt":0.28071702798371423,"score_spread":0.23176958148425703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977305469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6667213,0.0022035365,0.18300202,0.003799218,0.00021908489,0.00010032322,0.00075806445,0.00087103655,0.1423254],"genre_scores_gemma":[0.95228595,0.0008953984,0.021918228,0.0003723863,0.0001642931,0.00007222698,0.0004644526,0.00016838322,0.023658706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939144,0.000112393514,0.000024970417,0.00018485442,0.00017903006,0.000107179156],"domain_scores_gemma":[0.99803287,0.00073505624,0.00033775473,0.00030197934,0.0001958527,0.00039648882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005539392,0.0005198722,0.00077223126,0.0022221052,0.002925904,0.0033554973,0.0016424389,0.001497913,0.0049060457],"category_scores_gemma":[0.0029556155,0.0005522352,0.0005991468,0.0020211623,0.004084577,0.0059538847,0.002187142,0.0029246719,0.0005882684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025208543,0.000014338814,0.0003273533,0.000035402943,0.000007256765,0.00010761569,0.00041685335,0.0011490596,0.0005031423,0.9920797,0.0011792865,0.004154863],"study_design_scores_gemma":[0.000008918835,0.000005306212,0.00032403177,0.000011982231,0.000007424556,0.000203231,0.00023989892,0.003066723,0.00035845232,0.99125797,0.0045044282,0.000011642253],"about_ca_topic_score_codex":0.0016177555,"about_ca_topic_score_gemma":0.001869269,"teacher_disagreement_score":0.0049060457,"about_ca_system_score_codex":0.0012349226,"about_ca_system_score_gemma":0.00077371113,"threshold_uncertainty_score":0.016412377},"labels":[],"label_agreement":null},{"id":"W1977332922","doi":"10.1016/s0012-365x(01)00431-9","title":"Balanced k-colorings","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Context (archaeology); Upper and lower bounds; Dimension (graph theory); Discrete mathematics; Set (abstract data type); Graph; Computer science","score_opus":0.07268317869649793,"score_gpt":0.30393492210329887,"score_spread":0.23125174340680094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977332922","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41301322,0.0015928514,0.287398,0.00398577,0.0010965887,0.00020164033,0.002477272,0.0016305515,0.28860402],"genre_scores_gemma":[0.82998073,0.0013294489,0.07368803,0.001124767,0.00028005193,0.00027741367,0.001969614,0.0007588825,0.090591095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906904,0.00018805733,0.00004222593,0.0002479097,0.0001689261,0.00028382975],"domain_scores_gemma":[0.99764204,0.0006854195,0.00022832067,0.00051115436,0.00041261016,0.00052056636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006557017,0.0010296534,0.00092610903,0.0013919538,0.0025128615,0.0039800806,0.0012938085,0.00096911145,0.020740446],"category_scores_gemma":[0.0028047867,0.0007443541,0.00067474943,0.0021481712,0.0014573823,0.0035902115,0.0022122157,0.0025758457,0.0033388406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016802973,0.000037102232,0.00030870314,0.00007672937,0.000015457652,0.000049397728,0.00016763806,0.0021044016,0.0026938128,0.9690017,0.009337292,0.01603968],"study_design_scores_gemma":[0.00005010798,0.000025921981,0.00037334807,0.000028965227,0.000026164958,0.00015683622,0.00015355153,0.0071441475,0.0021086081,0.9724672,0.017446408,0.000018677189],"about_ca_topic_score_codex":0.001639219,"about_ca_topic_score_gemma":0.0022177526,"teacher_disagreement_score":0.020740446,"about_ca_system_score_codex":0.0019828735,"about_ca_system_score_gemma":0.0010026022,"threshold_uncertainty_score":0.06938374},"labels":[],"label_agreement":null},{"id":"W1977467103","doi":"10.1016/j.disc.2015.04.007","title":"Linearized Wenger graphs","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Bipartite graph; Combinatorics; Discrete mathematics; Class (philosophy); Indifference graph; Graph; Computer science","score_opus":0.0922781901024348,"score_gpt":0.34059069890046945,"score_spread":0.24831250879803463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977467103","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37255943,0.0013735204,0.1683426,0.005357315,0.0008457148,0.00011478025,0.00093040697,0.0015570957,0.44891924],"genre_scores_gemma":[0.8092683,0.0007636283,0.008710735,0.0011315163,0.00037207452,0.00007575924,0.0006154809,0.0003981747,0.17866443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99980015,0.000042650357,0.0000062128474,0.000040546714,0.000057292855,0.00005320304],"domain_scores_gemma":[0.99964213,0.000068556,0.00007635484,0.000058735044,0.00006967134,0.0000844839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019727586,0.0005783083,0.0004842793,0.0020301205,0.0011286164,0.0015135081,0.0006030526,0.0009962446,0.020662405],"category_scores_gemma":[0.0010391576,0.00031936858,0.0004195605,0.0008529262,0.0010516609,0.0025667679,0.0016459745,0.0021750634,0.0028996347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026368554,0.000015760676,0.000113382644,0.000021128688,0.000007721956,0.000062765735,0.00008698814,0.0019514463,0.0017497748,0.98715186,0.0025970568,0.006215838],"study_design_scores_gemma":[0.000011630036,0.000017533637,0.00049531425,0.0000105703,0.00000813653,0.0001725964,0.00016471463,0.009691157,0.0018851705,0.97944885,0.008075106,0.00001927141],"about_ca_topic_score_codex":0.0009079813,"about_ca_topic_score_gemma":0.0010098538,"teacher_disagreement_score":0.020662405,"about_ca_system_score_codex":0.00080545974,"about_ca_system_score_gemma":0.0003384781,"threshold_uncertainty_score":0.06912261},"labels":[],"label_agreement":null},{"id":"W1977889556","doi":"10.1016/s0012-365x(02)00803-8","title":"Finding a maximum induced matching in weakly chordal graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":93,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Chordal graph; Mathematics; Bipartite graph; Matching (statistics); Split graph; 3-dimensional matching; Interval graph; Vertex (graph theory); Indifference graph; Discrete mathematics; Factor-critical graph; Cardinality (data modeling); Pathwidth; Graph; 1-planar graph; Line graph; Graph power; Computer science","score_opus":0.03729535450122503,"score_gpt":0.314509867878203,"score_spread":0.277214513376978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977889556","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71245724,0.0006293666,0.25963202,0.0021110827,0.0001725557,0.00063432154,0.002483764,0.0014508469,0.020428807],"genre_scores_gemma":[0.73642755,0.00042081575,0.24935547,0.00039605945,0.00010231412,0.00025237858,0.0032587864,0.00037935356,0.0094073],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989287,0.00018957363,0.00008965224,0.00038593158,0.00018053324,0.00022552759],"domain_scores_gemma":[0.9946774,0.0031528568,0.00053865305,0.0006436832,0.00035453745,0.0006328374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087307015,0.0010643242,0.0023568494,0.0015694952,0.0022970757,0.0029329807,0.0039592846,0.0030062231,0.00879702],"category_scores_gemma":[0.009219709,0.0012343981,0.0014406967,0.0029192592,0.0011455498,0.0063649877,0.0030930762,0.002020021,0.0017033687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0056724814,0.0030180728,0.024865234,0.005247461,0.0008288176,0.0015879271,0.0027736097,0.1327887,0.099422745,0.2546657,0.032877367,0.43625194],"study_design_scores_gemma":[0.0006211387,0.00090384803,0.004641459,0.00022636943,0.00037446583,0.0009243553,0.002008105,0.35277203,0.042199004,0.584122,0.011113309,0.000093773],"about_ca_topic_score_codex":0.0015786745,"about_ca_topic_score_gemma":0.0029230788,"teacher_disagreement_score":0.00879702,"about_ca_system_score_codex":0.001550666,"about_ca_system_score_gemma":0.0016096192,"threshold_uncertainty_score":0.029428959},"labels":[],"label_agreement":null},{"id":"W1978202062","doi":"10.1016/s0012-365x(03)00039-6","title":"Resolvable group divisible designs with block size four and group size six","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Block size; Combinatorics; Block (permutation group theory); Group (periodic table); Discrete mathematics; Arithmetic; Computer science","score_opus":0.014082470600140767,"score_gpt":0.1977526242482627,"score_spread":0.18367015364812195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978202062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28160167,0.0006856428,0.6725806,0.0014344989,0.00026180333,0.00033649025,0.0004699806,0.0011523879,0.04147691],"genre_scores_gemma":[0.75126827,0.0003676332,0.23563007,0.00058145286,0.0001752041,0.00043595428,0.00030263953,0.000105358675,0.011133396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960995,0.0016062817,0.00023884882,0.0005584279,0.0009156631,0.0005813402],"domain_scores_gemma":[0.9868974,0.0056906384,0.0017924994,0.004103653,0.0009551116,0.0005608034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028397525,0.0011176298,0.001218368,0.0012170543,0.0013129377,0.0021454091,0.0017720762,0.0019954978,0.0068280636],"category_scores_gemma":[0.006850286,0.0008051574,0.0008700503,0.0012786363,0.0018248126,0.002043138,0.0025310174,0.002068793,0.001605894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026630252,0.00027370505,0.0012409292,0.00039968296,0.0001561645,0.0003628618,0.0005440887,0.035395414,0.04692434,0.806217,0.0036727202,0.10214999],"study_design_scores_gemma":[0.0013030985,0.0013890329,0.0004728331,0.00020057343,0.00016409357,0.0007131571,0.00017430959,0.10892979,0.05568149,0.8137846,0.017033702,0.00015338877],"about_ca_topic_score_codex":0.00034001775,"about_ca_topic_score_gemma":0.00061465555,"teacher_disagreement_score":0.0068280636,"about_ca_system_score_codex":0.0011906197,"about_ca_system_score_gemma":0.0017983768,"threshold_uncertainty_score":0.022842169},"labels":[],"label_agreement":null},{"id":"W1978631091","doi":"10.1016/j.disc.2007.12.075","title":"The obstructions for toroidal graphs with no <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si14.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:math>’s","year":2008,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Toroid; Combinatorics; Mathematics; Planar graph; Subdivision; Discrete mathematics; Physics; Graph","score_opus":0.021273118216842864,"score_gpt":0.25545277334377403,"score_spread":0.23417965512693117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978631091","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39855653,0.0019586668,0.16004546,0.008210658,0.0014317154,0.00025688307,0.0018589915,0.0014006948,0.42628053],"genre_scores_gemma":[0.9216551,0.0008551541,0.013109437,0.00078807276,0.0005425726,0.00015937045,0.0012243497,0.0004398748,0.061226096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988381,0.00023564798,0.00006735337,0.00021850607,0.00027885268,0.0003614639],"domain_scores_gemma":[0.9967539,0.0012525704,0.00045287027,0.0003772699,0.000377618,0.0007858512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008304208,0.0006769432,0.0008274241,0.0031251798,0.004429276,0.0035283226,0.0009984333,0.0014591771,0.022589901],"category_scores_gemma":[0.004832911,0.00064565515,0.0014203726,0.0012892368,0.004455398,0.0059178877,0.0047424687,0.0029920095,0.0032179535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004050845,0.000010711001,0.00019763935,0.000040928808,0.000004996188,0.00012363154,0.00022430228,0.0005019673,0.00026537565,0.99218905,0.0040942063,0.0023066166],"study_design_scores_gemma":[0.000020564907,0.000016574302,0.0004265995,0.000025261903,0.000012088079,0.00020607954,0.00022811012,0.0025612745,0.00038763613,0.9853109,0.010781358,0.000023601066],"about_ca_topic_score_codex":0.0044209966,"about_ca_topic_score_gemma":0.004202324,"teacher_disagreement_score":0.022589901,"about_ca_system_score_codex":0.002088156,"about_ca_system_score_gemma":0.001301933,"threshold_uncertainty_score":0.0755707},"labels":[],"label_agreement":null},{"id":"W1978705134","doi":"10.1016/j.disc.2003.11.034","title":"Mixed partitions of sets of triples into small planes","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Disjoint sets; Combinatorics; Pairwise comparison; Set (abstract data type); Line (geometry); Discrete mathematics; Computer science; Geometry; Statistics","score_opus":0.02249479605233382,"score_gpt":0.21483600644783965,"score_spread":0.19234121039550583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978705134","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58522725,0.00060402334,0.35682395,0.00066782377,0.00016574928,0.00024254376,0.0011123292,0.0002466797,0.054909687],"genre_scores_gemma":[0.8725213,0.00041536707,0.10300906,0.0002791764,0.00009999297,0.000521708,0.001617347,0.00024504555,0.021291034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988104,0.00033611036,0.00008198909,0.00022981783,0.00030694774,0.00023470442],"domain_scores_gemma":[0.99772996,0.00093232945,0.00030636785,0.00044299185,0.00031335867,0.00027494974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065770006,0.0006965585,0.0009949123,0.0020918536,0.0016139762,0.004763672,0.0012764296,0.0010976577,0.011424611],"category_scores_gemma":[0.0029267026,0.000948408,0.0008475581,0.0018850734,0.0022444874,0.0038297921,0.0023767427,0.0017934693,0.0011209121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004111264,0.000060522187,0.00093664875,0.00011054358,0.000055514767,0.0001779153,0.00043037426,0.009235959,0.007863418,0.96584606,0.0022201017,0.01265178],"study_design_scores_gemma":[0.00007954881,0.000072044226,0.0010421963,0.00007151945,0.000047712834,0.0003288194,0.0009189749,0.048504315,0.0055039986,0.9359065,0.007497204,0.000027046877],"about_ca_topic_score_codex":0.0009132004,"about_ca_topic_score_gemma":0.0012376986,"teacher_disagreement_score":0.011424611,"about_ca_system_score_codex":0.00098609,"about_ca_system_score_gemma":0.00045594331,"threshold_uncertainty_score":0.038219094},"labels":[],"label_agreement":null},{"id":"W1978793076","doi":"10.1016/j.disc.2008.02.024","title":"A trace representation of binary Jacobi sequences","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; TRACE (psycholinguistics); Hadamard transform; Combinatorics; Binary number; Prime (order theory); Representation (politics); Discrete mathematics; Function (biology); Arithmetic; Mathematical analysis","score_opus":0.03788848420678235,"score_gpt":0.278392634844204,"score_spread":0.24050415063742167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978793076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31510684,0.0014256188,0.46979702,0.0035199053,0.0017614303,0.0001469067,0.0005338186,0.0008165637,0.20689194],"genre_scores_gemma":[0.88956326,0.0008739553,0.038368594,0.0007460924,0.0010000516,0.00009816337,0.00035421466,0.0004124312,0.06858326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948585,0.00010296031,0.000028489332,0.000073313444,0.0001944345,0.000114881565],"domain_scores_gemma":[0.99919707,0.00020241081,0.00009679691,0.00014569375,0.00018181038,0.00017620708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073875766,0.00078161556,0.00066791545,0.0016820598,0.0013238713,0.0028856997,0.0011402565,0.0014523919,0.010659328],"category_scores_gemma":[0.002581987,0.00031698975,0.00058196654,0.0014424443,0.0020713776,0.0031790335,0.0016410031,0.002581199,0.0019515742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002221417,0.000016203438,0.000039184895,0.000011042021,0.0000015241002,0.000026529638,0.000093267285,0.0005538572,0.0007414995,0.9930687,0.0006926282,0.004733368],"study_design_scores_gemma":[0.00000933831,0.000026325133,0.000049838978,0.000011568349,0.0000020624532,0.0000597521,0.00003952504,0.008854595,0.00054138387,0.9879382,0.0024555142,0.000011948072],"about_ca_topic_score_codex":0.00079125626,"about_ca_topic_score_gemma":0.00043106737,"teacher_disagreement_score":0.010659328,"about_ca_system_score_codex":0.00095170236,"about_ca_system_score_gemma":0.000843934,"threshold_uncertainty_score":0.035659015},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03659762619660558,"score_gpt":0.26332282672292634,"score_spread":0.22672520052632075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979144155","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011007627,0.0031697806,0.9672418,0.0035432042,0.00031447844,0.000054932043,0.0007043496,0.00046319424,0.013500627],"genre_scores_gemma":[0.4108135,0.0095462985,0.540893,0.0040541696,0.004651028,0.0011163882,0.004322495,0.0014271841,0.023175793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98125046,0.005273068,0.0011224884,0.0040694857,0.006549809,0.0017347124],"domain_scores_gemma":[0.7453956,0.22691765,0.004647236,0.012825905,0.0062558353,0.003957767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018494572,0.003090172,0.005219556,0.007798259,0.0041910745,0.013101675,0.008852357,0.00748182,0.018111167],"category_scores_gemma":[0.12888287,0.0032870625,0.0047328277,0.006334508,0.0079885125,0.023650972,0.009676214,0.016100042,0.0032144715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003395709,0.00012984611,0.0016165066,0.00056878297,0.00021259137,0.00023864344,0.000495971,0.044537,0.0014024249,0.91381603,0.0066296076,0.030013002],"study_design_scores_gemma":[0.000038184317,0.000045902925,0.00046173183,0.00022799865,0.00011898549,0.00029820917,0.000060718605,0.17465326,0.0009617254,0.8173451,0.005734516,0.000053668056],"about_ca_topic_score_codex":0.002384304,"about_ca_topic_score_gemma":0.0022103828,"teacher_disagreement_score":0.018494572,"about_ca_system_score_codex":0.0053345985,"about_ca_system_score_gemma":0.0028194755,"threshold_uncertainty_score":0.09780985},"labels":[],"label_agreement":null},{"id":"W1979477295","doi":"10.1016/j.disc.2004.07.022","title":"The graphs with maximum induced matching and maximum matching the same size","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Wilfrid Laurier University","funders":"","keywords":"Mathematics; Matching (statistics); Combinatorics; Factor-critical graph; Characterization (materials science); 3-dimensional matching; Graph; Cograph; Discrete mathematics; Simple (philosophy); Line graph; Bipartite graph; Pathwidth; Voltage graph; Statistics","score_opus":0.019029947364102493,"score_gpt":0.27922666289546505,"score_spread":0.26019671553136253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979477295","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61736894,0.0020587018,0.23383996,0.007760092,0.00061831163,0.00034113077,0.0034383137,0.0009388633,0.1336357],"genre_scores_gemma":[0.89072144,0.0014250983,0.08066807,0.0014676433,0.00068751373,0.00038388424,0.0024903268,0.0003913534,0.021764588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823356,0.000473759,0.00007951661,0.0005924987,0.0003141978,0.00030656398],"domain_scores_gemma":[0.99009085,0.003929526,0.0017597004,0.0021191793,0.0010346078,0.0010661306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014107743,0.0008930001,0.0014219858,0.0019612275,0.0025269228,0.0032557223,0.002489525,0.0024421017,0.00762007],"category_scores_gemma":[0.013644605,0.0008616167,0.0015723865,0.0028207423,0.00224472,0.00750021,0.0019560049,0.0025651301,0.0010668407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009408371,0.00014570475,0.0016820481,0.0004134631,0.00014296071,0.00033758476,0.00060691906,0.006907211,0.007368464,0.9365836,0.011559743,0.03331143],"study_design_scores_gemma":[0.00013577359,0.000076954464,0.0017825583,0.000046023357,0.00011753552,0.0005426486,0.00027808867,0.013253628,0.003370516,0.9708439,0.009517033,0.00003526244],"about_ca_topic_score_codex":0.0008175837,"about_ca_topic_score_gemma":0.0007889941,"teacher_disagreement_score":0.00762007,"about_ca_system_score_codex":0.0012908156,"about_ca_system_score_gemma":0.0013869512,"threshold_uncertainty_score":0.025491655},"labels":[],"label_agreement":null},{"id":"W1979595999","doi":"10.1016/j.disc.2004.11.015","title":"Enumeration of solid 2-trees according to edge number and edge degree distribution","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Enumeration; Mathematics; Degree (music); Combinatorics; Enhanced Data Rates for GSM Evolution; Distribution (mathematics); Discrete mathematics; Computer science; Artificial intelligence; Mathematical analysis","score_opus":0.04441625055827287,"score_gpt":0.3404536988173486,"score_spread":0.29603744825907574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979595999","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7931599,0.00026160758,0.18344115,0.00054678513,0.00005047114,0.00009860739,0.0015871313,0.00039775937,0.020456595],"genre_scores_gemma":[0.815161,0.00040978796,0.17020099,0.00015448188,0.000046383608,0.00015841128,0.0032509153,0.00027652143,0.010341566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991862,0.0001945303,0.00006076725,0.00011490134,0.000273898,0.00016979051],"domain_scores_gemma":[0.9961779,0.0018942797,0.00046291764,0.00050796126,0.0006624223,0.00029452052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051260105,0.00039704915,0.0007498147,0.0019475743,0.0009799303,0.0029382175,0.0010421457,0.00106131,0.006199884],"category_scores_gemma":[0.0044679386,0.00054103584,0.0004224817,0.0031532506,0.0009534868,0.002003196,0.0011062667,0.00087455765,0.0009078481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016965617,0.00036045627,0.017554132,0.00045776926,0.000080195285,0.0005412493,0.00088409206,0.093134776,0.045228396,0.6575406,0.012187034,0.17033467],"study_design_scores_gemma":[0.0000919423,0.00014057657,0.00551928,0.00009715211,0.00004445123,0.00063640455,0.00044113555,0.28715938,0.0123919975,0.68424845,0.009190829,0.00003844073],"about_ca_topic_score_codex":0.0006840674,"about_ca_topic_score_gemma":0.0017638416,"teacher_disagreement_score":0.006199884,"about_ca_system_score_codex":0.00067153503,"about_ca_system_score_gemma":0.0006713335,"threshold_uncertainty_score":0.020740747},"labels":[],"label_agreement":null},{"id":"W1979685415","doi":"10.1016/j.disc.2012.04.009","title":"An improved bound on parity vertex colourings of outerplane graphs","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; St. Francis Xavier University","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Bipartite graph; Parity (physics); Chromatic scale; Upper and lower bounds; Graph; Discrete mathematics; Physics","score_opus":0.01660307506976808,"score_gpt":0.261172423748193,"score_spread":0.24456934867842492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979685415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41078436,0.0043011317,0.43558335,0.011436732,0.0019223556,0.00041665783,0.0040765563,0.0041309986,0.12734777],"genre_scores_gemma":[0.8024285,0.0023737648,0.15785226,0.0031021826,0.0010537722,0.0004588114,0.003941285,0.0026600158,0.026129471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99591535,0.0010280381,0.00016165608,0.00084122753,0.0010194076,0.0010342875],"domain_scores_gemma":[0.9712422,0.019452231,0.0010085145,0.005295681,0.0013456573,0.0016557369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033905616,0.003120026,0.003095939,0.0023628417,0.0028136696,0.0074146558,0.007357132,0.0037438087,0.024143305],"category_scores_gemma":[0.02468419,0.0018178298,0.0026817315,0.003875831,0.004784806,0.015167765,0.008712854,0.008885932,0.003601419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0049746875,0.0008414583,0.0075771348,0.0015837917,0.00028176117,0.0006887555,0.001331931,0.11957659,0.03142502,0.6264186,0.059708677,0.1455917],"study_design_scores_gemma":[0.00033256083,0.00023811858,0.0020945675,0.00018226498,0.00026914754,0.00031761272,0.00025933355,0.21670161,0.00886063,0.7600415,0.010610754,0.000091913884],"about_ca_topic_score_codex":0.003326762,"about_ca_topic_score_gemma":0.0047556646,"teacher_disagreement_score":0.024143305,"about_ca_system_score_codex":0.004402869,"about_ca_system_score_gemma":0.00218311,"threshold_uncertainty_score":0.08076739},"labels":[],"label_agreement":null},{"id":"W1979733770","doi":"10.1016/s0012-365x(03)00311-x","title":"Variable neighborhood search for extremal graphs. 5. Three ways to automate finding conjectures","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Variable neighborhood search; Heuristic; Variable (mathematics); Algebraic number; Series (stratigraphy); Combinatorics; Discrete mathematics; Algorithm; Mathematical optimization; Metaheuristic","score_opus":0.051255614563814056,"score_gpt":0.3153195008242945,"score_spread":0.26406388626048044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979733770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12542081,0.00072558527,0.83501863,0.004638399,0.00027458012,0.00024924698,0.00038322268,0.0015257857,0.03176368],"genre_scores_gemma":[0.593957,0.00031831054,0.39487007,0.0006848307,0.00019461673,0.00028788144,0.000712922,0.0002899503,0.008684418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968836,0.0013309409,0.00014380988,0.000570148,0.0006605219,0.00041098328],"domain_scores_gemma":[0.9801276,0.01100324,0.00081046805,0.006345293,0.0010811512,0.0006323042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038118078,0.0005527025,0.0014038441,0.0015894535,0.0019691414,0.0029142878,0.004877081,0.0027065433,0.00915898],"category_scores_gemma":[0.025193136,0.0005674963,0.001574994,0.0016267457,0.0037969258,0.008140903,0.005469635,0.0031991166,0.0012650597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008093426,0.00028482842,0.0064282427,0.00040065477,0.00010449342,0.00020312892,0.0006114779,0.03293359,0.0030880393,0.8243534,0.012622031,0.11816072],"study_design_scores_gemma":[0.00011234317,0.00009580424,0.0006849482,0.000052452608,0.000047733232,0.00014305589,0.0002035473,0.16997698,0.0029576502,0.8207329,0.0049540345,0.000038565704],"about_ca_topic_score_codex":0.0012301626,"about_ca_topic_score_gemma":0.002132226,"teacher_disagreement_score":0.00915898,"about_ca_system_score_codex":0.0009215469,"about_ca_system_score_gemma":0.0011099946,"threshold_uncertainty_score":0.030639827},"labels":[],"label_agreement":null},{"id":"W1979947096","doi":"10.1016/s0012-365x(00)00369-1","title":"The upper domination Ramsey number u(3,3,3)","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Combinatorics; Ramsey's theorem; Domination analysis; Upper and lower bounds; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Graph; Vertex (graph theory); Computer science","score_opus":0.024625825096035517,"score_gpt":0.2973754815534076,"score_spread":0.2727496564573721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979947096","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74949574,0.0016933763,0.038505476,0.0039682267,0.00047654402,0.00006105467,0.0010702861,0.00073750614,0.2039918],"genre_scores_gemma":[0.97683835,0.0003504944,0.0066426764,0.00037708282,0.00013476342,0.00004768922,0.00027685647,0.00007952748,0.015252446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995352,0.00011438478,0.000016443053,0.00011377053,0.00008415596,0.00013614485],"domain_scores_gemma":[0.9987342,0.0006655963,0.000145716,0.00012482639,0.00008509254,0.00024454552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005824735,0.00040924567,0.0006477346,0.0013169866,0.0032130326,0.0026791047,0.00063116645,0.0009474376,0.012609825],"category_scores_gemma":[0.0021195202,0.00029772703,0.0003589901,0.0011352726,0.0018271062,0.0025992214,0.0014227688,0.0017878107,0.0012897698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042954375,0.000043145094,0.0008486684,0.00013463691,0.000016609727,0.00014788975,0.0005334058,0.0017046862,0.0055337385,0.9496328,0.011395244,0.029579736],"study_design_scores_gemma":[0.000044988097,0.00004406791,0.0013518109,0.00004195296,0.000022743958,0.00037940452,0.00018572774,0.005803782,0.0051147663,0.9706937,0.016282154,0.00003477966],"about_ca_topic_score_codex":0.0011575327,"about_ca_topic_score_gemma":0.0011107409,"teacher_disagreement_score":0.012609825,"about_ca_system_score_codex":0.00087322865,"about_ca_system_score_gemma":0.00061886525,"threshold_uncertainty_score":0.042183995},"labels":[],"label_agreement":null},{"id":"W1980356269","doi":"10.1016/s0012-365x(02)00492-2","title":"On the non-existence of quasi-3 designs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; Okanagan College","funders":"","keywords":"Mathematics; Dual (grammatical number); Discrete mathematics; Combinatorics; Arithmetic; Linguistics","score_opus":0.023208766331806904,"score_gpt":0.22167077100832394,"score_spread":0.19846200467651703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980356269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3517488,0.0016666311,0.5875047,0.003926035,0.00037021004,0.00011648776,0.00024758207,0.00026017913,0.0541594],"genre_scores_gemma":[0.89947814,0.0009566624,0.086422466,0.0011092239,0.00020491994,0.0002653359,0.00020403542,0.00011514256,0.01124406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99603623,0.0019490182,0.00020837362,0.000594836,0.0006883639,0.0005232444],"domain_scores_gemma":[0.9413179,0.04773091,0.0029920938,0.003607134,0.002951329,0.0014007094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075134216,0.00072114175,0.0015632177,0.0014024283,0.0024637089,0.0039674393,0.0015257609,0.0037991179,0.0073076747],"category_scores_gemma":[0.033844244,0.001668289,0.0014733698,0.0012428061,0.005391099,0.00709575,0.0042203185,0.0042389217,0.000883689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017212643,0.000027208629,0.00056537474,0.00007385041,0.000021424474,0.00008600164,0.0002509314,0.0052483333,0.0013400612,0.9860524,0.0008959192,0.005266473],"study_design_scores_gemma":[0.000063035186,0.00007262215,0.00025358354,0.000050675564,0.00001634337,0.0001735836,0.0001078316,0.030909518,0.000759469,0.9657791,0.0017885299,0.000025568981],"about_ca_topic_score_codex":0.0006315509,"about_ca_topic_score_gemma":0.00074673706,"teacher_disagreement_score":0.0075134216,"about_ca_system_score_codex":0.0015136875,"about_ca_system_score_gemma":0.001491185,"threshold_uncertainty_score":0.039735258},"labels":[],"label_agreement":null},{"id":"W1980634280","doi":"10.1016/j.disc.2011.11.032","title":"A degree condition for cycles of maximum length in bipartite digraphs","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Digraph; Mathematics; Combinatorics; Degree (music); Hamiltonian (control theory); Discrete mathematics; Graph; Physics","score_opus":0.08954373980614025,"score_gpt":0.3256156053587312,"score_spread":0.23607186555259094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980634280","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6498087,0.0014505062,0.26584518,0.006080188,0.0007665124,0.00048284722,0.004826525,0.0012963071,0.06944321],"genre_scores_gemma":[0.9445124,0.00097612065,0.03799288,0.001248385,0.00082441437,0.00044027716,0.0022058224,0.0005565142,0.011243146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979031,0.00036681135,0.00018806693,0.00064601575,0.00038534732,0.00051066396],"domain_scores_gemma":[0.967744,0.021504486,0.001820899,0.0019647675,0.0029184856,0.0040474012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019513189,0.0012641479,0.0020985673,0.00349564,0.0033489747,0.0043728123,0.0027975806,0.003561282,0.012287387],"category_scores_gemma":[0.02404442,0.0017405429,0.002103524,0.0036791153,0.0041044136,0.010114492,0.003885541,0.004795269,0.0017289396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000994408,0.00024058456,0.003984717,0.0005736676,0.00007915605,0.00068400806,0.0014841987,0.016413314,0.01456272,0.93208,0.009308912,0.019594364],"study_design_scores_gemma":[0.00021519214,0.0001576752,0.0016273209,0.00012110921,0.00007715721,0.00047320672,0.00046717547,0.042930502,0.0044963537,0.94399154,0.0053260922,0.00011665067],"about_ca_topic_score_codex":0.0030724795,"about_ca_topic_score_gemma":0.0041763955,"teacher_disagreement_score":0.012287387,"about_ca_system_score_codex":0.0024029845,"about_ca_system_score_gemma":0.0020603342,"threshold_uncertainty_score":0.04110539},"labels":[],"label_agreement":null},{"id":"W1980687521","doi":"10.1016/s0012-365x(01)00292-8","title":"On interleaved sequences over finite fields","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Finite field; Mathematics; Sequence (biology); Combinatorics; Polynomial; Discrete mathematics; Field (mathematics); Mathematical analysis; Pure mathematics","score_opus":0.025723502834655305,"score_gpt":0.24486290502364497,"score_spread":0.21913940218898967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980687521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23902552,0.0028181034,0.6722871,0.00233999,0.0007084259,0.00011402956,0.00032552908,0.0005199212,0.081861384],"genre_scores_gemma":[0.90254956,0.004246698,0.055358592,0.0007363317,0.0010106388,0.0001934151,0.0004784765,0.00027508318,0.035151236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810517,0.00055460085,0.00011554813,0.00020236748,0.00065592513,0.00036638565],"domain_scores_gemma":[0.9912952,0.005552389,0.0008971834,0.0012013932,0.00064483297,0.00040894432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020393364,0.0014874133,0.0012288035,0.0033806362,0.001874131,0.0029185142,0.0014398277,0.0017441466,0.0065942276],"category_scores_gemma":[0.00845261,0.0010004943,0.0008234708,0.004893384,0.0040053464,0.009417633,0.0045708064,0.0034980674,0.001037103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079771125,0.000023694793,0.0001529392,0.000034075725,0.0000061473424,0.000100037854,0.00016126972,0.006365516,0.00058538816,0.98390144,0.0006619907,0.007927772],"study_design_scores_gemma":[0.000010934827,0.000022727236,0.000056701414,0.000030456198,0.000007874933,0.00009187867,0.000034679426,0.015462142,0.0007118943,0.9815392,0.0020184675,0.000013125695],"about_ca_topic_score_codex":0.0010210011,"about_ca_topic_score_gemma":0.0008597837,"teacher_disagreement_score":0.0065942276,"about_ca_system_score_codex":0.001868801,"about_ca_system_score_gemma":0.001131538,"threshold_uncertainty_score":0.022059917},"labels":[],"label_agreement":null},{"id":"W1980758215","doi":"10.1016/s0012-365x(99)00256-3","title":"Applications of integer relation algorithms","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Integer (computer science); Combinatorics; Relation (database); Zero (linguistics); Discrete mathematics; Algorithm; Computer science; Programming language","score_opus":0.02701054782946852,"score_gpt":0.32568484199527126,"score_spread":0.2986742941658027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980758215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018495169,0.006671319,0.81678873,0.0035664223,0.0012964035,0.00008074359,0.00021296162,0.0007360533,0.15215217],"genre_scores_gemma":[0.43016797,0.008775569,0.51078147,0.0013926774,0.0028352372,0.00019541431,0.00071480195,0.0008070513,0.04432985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760205,0.00094568805,0.0001607963,0.00040848812,0.0006871771,0.00019584919],"domain_scores_gemma":[0.9944108,0.003570182,0.00030952337,0.0010218194,0.00050000177,0.00018768868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023401815,0.0009884104,0.0011128803,0.0024468668,0.0018581058,0.0042773597,0.0019651833,0.0012590674,0.0144803645],"category_scores_gemma":[0.013441048,0.0005723002,0.0012741243,0.0037340645,0.003205386,0.008113772,0.003404482,0.004232896,0.0034813015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003556102,0.000028018443,0.00016149631,0.00005889253,0.000009880081,0.00001889678,0.000089024004,0.0023498796,0.00024181239,0.9566663,0.0025337576,0.037806366],"study_design_scores_gemma":[0.000013862388,0.000010775991,0.00006485399,0.000029158815,0.000008406136,0.00004329347,0.000027478722,0.015709817,0.00043403666,0.967864,0.015784545,0.0000097795055],"about_ca_topic_score_codex":0.0011322384,"about_ca_topic_score_gemma":0.000980806,"teacher_disagreement_score":0.0144803645,"about_ca_system_score_codex":0.0019407378,"about_ca_system_score_gemma":0.0011796217,"threshold_uncertainty_score":0.04844159},"labels":[],"label_agreement":null},{"id":"W1980966478","doi":"10.1016/j.disc.2007.07.115","title":"Colouring even cycle systems","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.0071205228748530405,"score_gpt":0.2108613125004122,"score_spread":0.20374078962555917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980966478","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5663122,0.0011963419,0.25922042,0.0015324112,0.00050011073,0.00014426836,0.00037660715,0.0005540147,0.1701636],"genre_scores_gemma":[0.92001706,0.00063990644,0.030503582,0.0004077066,0.00012364298,0.00010903216,0.00027092375,0.00022399316,0.047704265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971133,0.000070968534,0.000011174083,0.000055985623,0.00006063982,0.0000898115],"domain_scores_gemma":[0.99898237,0.00043333202,0.00010170497,0.00018010168,0.00013411594,0.00016839981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029170248,0.00048020587,0.000555056,0.0010742004,0.0012743687,0.0017385193,0.00067071285,0.0010646497,0.010824166],"category_scores_gemma":[0.0018216321,0.00036490266,0.000500677,0.00093943573,0.001350248,0.0023455548,0.0020151627,0.0016893534,0.0009042283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005211602,0.000015777925,0.00016322212,0.00003754707,0.0000056447097,0.00005842013,0.00020738298,0.0037210083,0.0025454364,0.983173,0.0014445964,0.008575763],"study_design_scores_gemma":[0.000012933775,0.000015953421,0.00010910434,0.000011150398,0.0000054978136,0.00004337115,0.00007016554,0.011501833,0.0009312163,0.98299,0.004299971,0.000008733229],"about_ca_topic_score_codex":0.0017484216,"about_ca_topic_score_gemma":0.0022199908,"teacher_disagreement_score":0.010824166,"about_ca_system_score_codex":0.00090376195,"about_ca_system_score_gemma":0.0005298541,"threshold_uncertainty_score":0.036210477},"labels":[],"label_agreement":null},{"id":"W1981011157","doi":"10.1016/j.disc.2014.02.006","title":"Binary matroids with no 4-spike minors","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Matroid; Combinatorics; Minor (academic); Mathematics; Binary number; Simple (philosophy); Rank (graph theory); Circumference; Bounding overwatch; Discrete mathematics; Computer science; Arithmetic","score_opus":0.012548588064515712,"score_gpt":0.26391457852280636,"score_spread":0.25136599045829067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981011157","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7443773,0.00035845445,0.11540514,0.0032886053,0.0006118494,0.00021788428,0.0022094515,0.0009868371,0.13254462],"genre_scores_gemma":[0.88805926,0.00032197172,0.048611615,0.001254551,0.00037081135,0.00024871767,0.0026761966,0.00051941775,0.057937287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989497,0.00017937759,0.00008433196,0.00024214738,0.00028059923,0.00026389665],"domain_scores_gemma":[0.9975903,0.00061536604,0.00047419884,0.00042878062,0.00033143078,0.0005600199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055641227,0.000994674,0.0013343602,0.0011443376,0.0019967516,0.004342848,0.0017714646,0.0021254586,0.01599104],"category_scores_gemma":[0.0031659368,0.0011740727,0.0011895252,0.0014397886,0.0015230023,0.004723195,0.0029438664,0.0036302628,0.0035002688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080999185,0.00031306795,0.0011606836,0.00025942948,0.000066982946,0.00065874046,0.000513834,0.002993187,0.016952142,0.9322609,0.015523481,0.028487675],"study_design_scores_gemma":[0.0001500558,0.00011187896,0.00094784104,0.000036107653,0.0000403272,0.0009405941,0.00028394882,0.016205369,0.0054447767,0.9661049,0.009683961,0.000050251037],"about_ca_topic_score_codex":0.00047840463,"about_ca_topic_score_gemma":0.000778159,"teacher_disagreement_score":0.01599104,"about_ca_system_score_codex":0.0009828503,"about_ca_system_score_gemma":0.0006886865,"threshold_uncertainty_score":0.053495347},"labels":[],"label_agreement":null},{"id":"W1981737915","doi":"10.1016/j.disc.2007.03.017","title":"Perfect matchings after vertex deletions","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Factor-critical graph; Distance-hereditary graph; Perfect graph theorem; Discrete mathematics; Induced subgraph; Graph; Line graph; Pathwidth; Graph power","score_opus":0.013243460046563798,"score_gpt":0.29337321976176767,"score_spread":0.2801297597152039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981737915","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5057423,0.0016019499,0.344511,0.0038228508,0.0011620983,0.00040929898,0.0025494376,0.0028893843,0.1373117],"genre_scores_gemma":[0.8746051,0.00087771873,0.060504835,0.00086389756,0.00029451767,0.00020033123,0.0017235203,0.00078624865,0.06014379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981937,0.00035838023,0.00012079248,0.00041451774,0.0004446842,0.00046796104],"domain_scores_gemma":[0.9915244,0.0037539275,0.00086311187,0.0025351944,0.0006919819,0.00063143607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018883924,0.0007713403,0.0016513342,0.0021424438,0.0025488955,0.0028430829,0.002419516,0.0022641735,0.014935344],"category_scores_gemma":[0.01464249,0.0011762151,0.0014079068,0.0032393886,0.0019364633,0.007709095,0.0031406048,0.0033004375,0.0027108546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069193664,0.00015460822,0.0009350423,0.00025112342,0.000071463706,0.000721098,0.00062398746,0.012392579,0.006525543,0.91534853,0.012531319,0.04975281],"study_design_scores_gemma":[0.0000680945,0.000039740768,0.0004437415,0.00003528023,0.000046611938,0.000284581,0.00016589634,0.015031962,0.0035454782,0.97325504,0.007064904,0.000018676674],"about_ca_topic_score_codex":0.0012161805,"about_ca_topic_score_gemma":0.0015900651,"teacher_disagreement_score":0.014935344,"about_ca_system_score_codex":0.001257906,"about_ca_system_score_gemma":0.0012480583,"threshold_uncertainty_score":0.049963713},"labels":[],"label_agreement":null},{"id":"W1981877143","doi":"10.1016/j.disc.2004.07.019","title":"On the equivalence problem for succession rules","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Bijection; Enumeration; Equivalence (formal languages); Sequence (biology); Catalan number; Equivalence class (music); Combinatorics; Class (philosophy); Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.05257438641715501,"score_gpt":0.3441903810210842,"score_spread":0.2916159946039292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981877143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3059668,0.002535075,0.3802918,0.015358927,0.0014479661,0.00021446082,0.00072230824,0.0003916929,0.29307103],"genre_scores_gemma":[0.89508486,0.0021570923,0.0543011,0.001652839,0.0016992349,0.00015716553,0.0015022899,0.00034711364,0.0430984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99699175,0.001048889,0.0002045206,0.00059356465,0.0005935137,0.00056770287],"domain_scores_gemma":[0.9886673,0.0083343815,0.00048556694,0.0009572804,0.00083782553,0.00071754167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041617993,0.0008492542,0.0022805703,0.0018724441,0.004230848,0.0050973534,0.0032261224,0.0050074304,0.027247977],"category_scores_gemma":[0.02013829,0.0010001437,0.002080831,0.0025180914,0.0054656006,0.024824413,0.004603968,0.0077758483,0.001848661],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005187197,0.00006480411,0.00018304473,0.000041366708,0.000007639165,0.00008607375,0.0001635124,0.00084317534,0.00009996572,0.9897878,0.0019985195,0.006672363],"study_design_scores_gemma":[0.000013687506,0.000005760301,0.000046851397,0.0000061794585,0.0000026737937,0.000031870266,0.00004303953,0.0016972839,0.000045577664,0.99732286,0.00078091584,0.000003415066],"about_ca_topic_score_codex":0.0017740983,"about_ca_topic_score_gemma":0.0011975358,"teacher_disagreement_score":0.027247977,"about_ca_system_score_codex":0.0017333927,"about_ca_system_score_gemma":0.0011458844,"threshold_uncertainty_score":0.0911535},"labels":[],"label_agreement":null},{"id":"W1981884232","doi":"10.1016/j.disc.2005.12.048","title":"Can transitive orientation make sandwich problems easier?","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Transitive relation; Combinatorics; Mathematics; Partially ordered set; Comparability graph; Transitive reduction; Orientation (vector space); Comparability; Graph; Discrete mathematics; Line graph; Pathwidth; Voltage graph","score_opus":0.01616633255282864,"score_gpt":0.27545241161224837,"score_spread":0.25928607905941975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981884232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2008371,0.0014083572,0.62164533,0.011626014,0.0035842892,0.00024306313,0.0004465389,0.002378597,0.15783073],"genre_scores_gemma":[0.7113298,0.0014889194,0.22296831,0.0028350626,0.0010582979,0.00029021292,0.0009126205,0.001963519,0.057153255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982711,0.0005955959,0.00011471349,0.00038827767,0.00026431886,0.00036603617],"domain_scores_gemma":[0.98918825,0.0054663178,0.0006067818,0.003301197,0.00063400384,0.0008033538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031578285,0.0013237201,0.001533731,0.00079822814,0.0022143438,0.0039513684,0.0026876095,0.003732502,0.049697485],"category_scores_gemma":[0.018389046,0.0012531255,0.0021314167,0.0010435738,0.0027315267,0.025626445,0.004422508,0.0064629843,0.0092595015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019691215,0.00018135607,0.0004663536,0.00023159434,0.00003679882,0.00013730949,0.00029250508,0.004033915,0.00210074,0.9357393,0.012701092,0.04388203],"study_design_scores_gemma":[0.000034790126,0.000027074791,0.00008942938,0.000027657441,0.000017725424,0.00007090752,0.00015888916,0.004265695,0.00092024973,0.99006313,0.004309499,0.000014955728],"about_ca_topic_score_codex":0.0004067485,"about_ca_topic_score_gemma":0.00065530837,"teacher_disagreement_score":0.049697485,"about_ca_system_score_codex":0.0006040723,"about_ca_system_score_gemma":0.0009148472,"threshold_uncertainty_score":0.16625464},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Combinatorics; Sums of powers; Graph; Discrete mathematics","score_opus":0.02136883443742171,"score_gpt":0.2740425652291751,"score_spread":0.25267373079175337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981970597","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4236047,0.0028705418,0.4185882,0.002183718,0.0015246421,0.0001075728,0.0010334759,0.0006432756,0.14944392],"genre_scores_gemma":[0.90994495,0.0019696173,0.04757557,0.00040947224,0.0015324859,0.00016228172,0.000592759,0.00046432615,0.037348397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826235,0.00045802185,0.0001276575,0.00035334387,0.0005774306,0.00022125796],"domain_scores_gemma":[0.9947286,0.002983747,0.00045569724,0.00064234633,0.000540354,0.0006492348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001224922,0.0009824792,0.0012256304,0.003428835,0.0011521489,0.0034047232,0.0015553338,0.00071530946,0.00962353],"category_scores_gemma":[0.0072597596,0.00066399976,0.000980457,0.0016134306,0.0028801758,0.0074874344,0.0022982135,0.0022075546,0.0016703383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008567225,0.00003066937,0.0004948265,0.00011186648,0.000049355192,0.00019613623,0.00032725383,0.0020090756,0.0028678542,0.97280234,0.0022728224,0.018752206],"study_design_scores_gemma":[0.00000574621,0.000014752584,0.00027785427,0.000022196851,0.000023943934,0.0002756549,0.00006800273,0.005367923,0.0010398887,0.98806494,0.004825727,0.000013408754],"about_ca_topic_score_codex":0.00019608953,"about_ca_topic_score_gemma":0.00035890492,"teacher_disagreement_score":0.00962353,"about_ca_system_score_codex":0.0005595987,"about_ca_system_score_gemma":0.00030839274,"threshold_uncertainty_score":0.0321939},"labels":[],"label_agreement":null},{"id":"W1982282944","doi":"10.1016/j.disc.2011.11.029","title":"Chop vectors and the lattice of integer partitions","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Combinatorics; Integer (computer science); Lattice (music); Discrete mathematics; Sequence (biology); Order (exchange); Element (criminal law); Computer science; Law","score_opus":0.033542135627341,"score_gpt":0.2555180730623817,"score_spread":0.22197593743504074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982282944","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45209578,0.003288199,0.35776925,0.0030328948,0.0008487007,0.00008873748,0.0010384822,0.000530842,0.18130715],"genre_scores_gemma":[0.9075221,0.0012621431,0.05800294,0.00042996844,0.00036931795,0.00010015793,0.00079239946,0.00018719157,0.031333793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934214,0.00016982398,0.000036219386,0.00009350403,0.0002108529,0.00014742043],"domain_scores_gemma":[0.99892706,0.00039963267,0.00016602696,0.00012214643,0.00017763967,0.00020747079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054064195,0.00044775993,0.0005831837,0.0020746952,0.0013816337,0.0040008593,0.0008038982,0.0005989752,0.009280793],"category_scores_gemma":[0.0027999764,0.00036143066,0.0003778657,0.0019164891,0.002916392,0.0032055976,0.0017876584,0.001913149,0.0011534836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006041519,0.0000127391895,0.000110293135,0.000019504616,0.0000030781832,0.0000228472,0.00008252731,0.0018608845,0.00036923288,0.98745537,0.001144362,0.008858796],"study_design_scores_gemma":[0.0000116568235,0.000012105122,0.000070556554,0.000009708018,0.0000018663817,0.000028755929,0.00008886504,0.004700544,0.00021514152,0.9916848,0.0031693003,0.0000067186634],"about_ca_topic_score_codex":0.0009970597,"about_ca_topic_score_gemma":0.0008420612,"teacher_disagreement_score":0.009280793,"about_ca_system_score_codex":0.0008531014,"about_ca_system_score_gemma":0.0005443323,"threshold_uncertainty_score":0.031047344},"labels":[],"label_agreement":null},{"id":"W1982754491","doi":"10.1016/j.disc.2011.06.002","title":"Vertex partitions of metric spaces with finite distance sets","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Isometry (Riemannian geometry); Metric space; Subspace topology; Injective metric space; Combinatorics; Metric (unit); Intrinsic metric; Countable set; Convex metric space; Discrete mathematics; Vertex (graph theory); Space (punctuation); Finite set; Isometry group; Pure mathematics; Mathematical analysis; Graph; Computer science","score_opus":0.054622212270232375,"score_gpt":0.30333353630806004,"score_spread":0.24871132403782767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982754491","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68718505,0.0016061974,0.26882848,0.0010471516,0.0002480205,0.000089970665,0.00080284715,0.00028767285,0.039904557],"genre_scores_gemma":[0.9427488,0.00075658876,0.039649643,0.00017674614,0.00018292258,0.00013991375,0.00110374,0.00018768312,0.015053843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853146,0.0003710864,0.00008927606,0.00022259612,0.00051520276,0.00027036484],"domain_scores_gemma":[0.99593854,0.0020966507,0.0005241198,0.00036498174,0.00040932032,0.0006662938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010433522,0.0008139081,0.001318541,0.0035857195,0.0028018889,0.007436273,0.002228146,0.0019065258,0.005699132],"category_scores_gemma":[0.006023944,0.00093558105,0.0010060066,0.003036211,0.0035375129,0.0061884634,0.0035507795,0.0022405898,0.0006936425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009944429,0.000015332158,0.00034997417,0.00003434747,0.000012512813,0.00006897876,0.00036443252,0.0025919091,0.00072660774,0.99172884,0.0005296159,0.0034779285],"study_design_scores_gemma":[0.000019687723,0.000013755128,0.00022268482,0.000015154498,0.000010005055,0.00007534217,0.00021603554,0.0081068585,0.00042294236,0.98926127,0.0016247013,0.000011567073],"about_ca_topic_score_codex":0.0013853902,"about_ca_topic_score_gemma":0.001530697,"teacher_disagreement_score":0.007436273,"about_ca_system_score_codex":0.0018852707,"about_ca_system_score_gemma":0.0005369746,"threshold_uncertainty_score":0.0190655},"labels":[],"label_agreement":null},{"id":"W1982895103","doi":"10.1016/s0012-365x(03)00031-1","title":"Bhaskar Rao designs with block size four","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Block size; Incidence matrix; Combinatorics; Block (permutation group theory); Block design; Row; Discrete mathematics; Product (mathematics); Computer science; Key (lock)","score_opus":0.016759671315099114,"score_gpt":0.1989495018509451,"score_spread":0.18218983053584598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982895103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02793282,0.0011020793,0.9364218,0.0008155729,0.00031303483,0.0002504009,0.00022112747,0.001028035,0.031915076],"genre_scores_gemma":[0.46119788,0.0012989573,0.5046163,0.0008591137,0.00039631606,0.0007166501,0.0003035382,0.00021117835,0.030400114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946188,0.0029088964,0.00026333175,0.00047739505,0.0011606847,0.00057086756],"domain_scores_gemma":[0.9910609,0.0029679937,0.0008731225,0.0028131357,0.0019335513,0.0003513974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032919154,0.0020084162,0.0014175234,0.0014585075,0.0012768,0.0019058726,0.0012687782,0.0023010646,0.01040142],"category_scores_gemma":[0.01012458,0.0009068417,0.00076628366,0.0016543139,0.0013906307,0.0015829547,0.0019171241,0.0016243915,0.0066553433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023190659,0.00024715904,0.0012229147,0.00053521746,0.00024292886,0.0003424627,0.00046298633,0.038360246,0.08493658,0.6437368,0.008287133,0.21930653],"study_design_scores_gemma":[0.0010851491,0.0034016664,0.0014795109,0.0004046963,0.00042361583,0.002226038,0.00028992043,0.29642507,0.095923364,0.5217123,0.07627414,0.00035456946],"about_ca_topic_score_codex":0.0006640327,"about_ca_topic_score_gemma":0.0011588318,"teacher_disagreement_score":0.01040142,"about_ca_system_score_codex":0.00084789534,"about_ca_system_score_gemma":0.0018686997,"threshold_uncertainty_score":0.034796238},"labels":[],"label_agreement":null},{"id":"W1982921028","doi":"10.1016/j.disc.2008.01.028","title":"On the fractional chromatic number of monotone self-dual Boolean functions","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Mathematics; Monotone polygon; Chromatic scale; Dual (grammatical number); Discrete mathematics; Combinatorics; Boolean function","score_opus":0.01700502452972911,"score_gpt":0.2437170119604473,"score_spread":0.2267119874307182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982921028","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8694304,0.0009845844,0.06793691,0.0018570181,0.0002566946,0.000035909412,0.00019407207,0.00019641667,0.05910794],"genre_scores_gemma":[0.98506343,0.0003562208,0.006804642,0.00015289016,0.0002000723,0.000041211606,0.000104701554,0.000060470993,0.007216323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993494,0.00019654843,0.000025398522,0.00013333,0.00014557468,0.00014971322],"domain_scores_gemma":[0.9938928,0.004183814,0.00054623734,0.00041486902,0.0003642765,0.00059797114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018371161,0.0007167093,0.0009008976,0.003107937,0.002311785,0.0041769827,0.001554304,0.0015883899,0.0070094587],"category_scores_gemma":[0.0074060457,0.00051454594,0.0006646877,0.0016766214,0.005591102,0.006297283,0.001727036,0.0022600535,0.00039243535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014154859,0.000021582418,0.00046660923,0.000030504954,0.000006063705,0.00003081848,0.00016249718,0.0029909818,0.0013848075,0.9912266,0.000509579,0.0030283679],"study_design_scores_gemma":[0.00003578966,0.000026991069,0.0005729356,0.000022636821,0.0000145331205,0.00007588423,0.00008624499,0.029176248,0.0011467589,0.9673935,0.0014220934,0.000026329337],"about_ca_topic_score_codex":0.0017701834,"about_ca_topic_score_gemma":0.0015327177,"teacher_disagreement_score":0.0070094587,"about_ca_system_score_codex":0.0033656352,"about_ca_system_score_gemma":0.0008106901,"threshold_uncertainty_score":0.024419487},"labels":[],"label_agreement":null},{"id":"W1984228559","doi":"10.1016/j.disc.2003.06.004","title":"Roman domination in graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":556,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Vertex (graph theory); Graph; Dominating set; Minimum weight; Discrete mathematics","score_opus":0.01958927517900732,"score_gpt":0.2969287906505696,"score_spread":0.27733951547156227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984228559","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3851298,0.0016621426,0.06799932,0.004307144,0.00038082266,0.00007716176,0.00028336284,0.00025391762,0.53990626],"genre_scores_gemma":[0.93876314,0.00074638147,0.0078054112,0.00044797707,0.00029057916,0.00006188911,0.00019811922,0.00010211441,0.0515844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860686,0.0005692818,0.000047219717,0.0002053327,0.000314354,0.000256887],"domain_scores_gemma":[0.9973176,0.0014336356,0.00032485867,0.00023587182,0.00034251402,0.0003456055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012216577,0.00042875906,0.00084721326,0.0023500759,0.0031705434,0.0040800944,0.000851904,0.000992173,0.0104602035],"category_scores_gemma":[0.005141162,0.00044885694,0.000594073,0.0023368238,0.004230782,0.0038962583,0.0020651743,0.0025142878,0.001235658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019656138,0.00000481451,0.00011062807,0.000013948062,0.0000024405006,0.000025220717,0.00021060393,0.0003309166,0.00014505564,0.9956381,0.00091916986,0.0025795086],"study_design_scores_gemma":[0.000012372616,0.000005119821,0.00014587176,0.000008429284,0.000004858253,0.0000740917,0.000098835626,0.0016815785,0.00019867072,0.9931184,0.004646265,0.000005581234],"about_ca_topic_score_codex":0.0013805671,"about_ca_topic_score_gemma":0.0014730617,"teacher_disagreement_score":0.0104602035,"about_ca_system_score_codex":0.0014859127,"about_ca_system_score_gemma":0.0006785092,"threshold_uncertainty_score":0.034992874},"labels":[],"label_agreement":null},{"id":"W1984327345","doi":"10.1016/j.disc.2004.08.036","title":"Efficient enumeration of sensed planar maps","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Enumeration; Mathematics; Combinatorics; Homeomorphism (graph theory); Embedding; Planar; Quotient; Discrete mathematics; Computer science","score_opus":0.02610764014380604,"score_gpt":0.28508251985170635,"score_spread":0.2589748797079003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984327345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14169596,0.00039848284,0.8271926,0.00035730112,0.00011257297,0.000107591244,0.0009964085,0.0016036944,0.027535336],"genre_scores_gemma":[0.69462854,0.000450637,0.2906392,0.00010267881,0.000043004075,0.00013281962,0.0024574716,0.000323455,0.0112221865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900776,0.00020071067,0.00006534442,0.00016108387,0.00042486438,0.00014016179],"domain_scores_gemma":[0.9984415,0.0006485093,0.00010277919,0.00047342904,0.00026676466,0.00006696164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037849337,0.00072321366,0.0009784815,0.0009966708,0.00071467884,0.002380496,0.001432102,0.00085235666,0.0074893944],"category_scores_gemma":[0.0038989314,0.0004731504,0.0004767237,0.0016038289,0.0006351628,0.003912394,0.0035639142,0.0008564986,0.0015012058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008202205,0.0001583436,0.002199205,0.0006032124,0.00007169663,0.0003528251,0.000523242,0.16237913,0.037747506,0.46249706,0.012154341,0.3204932],"study_design_scores_gemma":[0.0000622884,0.00013741697,0.0006904789,0.00006550031,0.000039882034,0.00038214907,0.00049397553,0.5828198,0.028505722,0.3646054,0.02215254,0.00004479941],"about_ca_topic_score_codex":0.0007191309,"about_ca_topic_score_gemma":0.0013636734,"teacher_disagreement_score":0.0074893944,"about_ca_system_score_codex":0.00061713066,"about_ca_system_score_gemma":0.0006755173,"threshold_uncertainty_score":0.025054455},"labels":[],"label_agreement":null},{"id":"W1984405480","doi":"10.1016/j.disc.2012.07.029","title":"Locating a robber on a graph","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"Environment and Climate Change Canada","keywords":"Vertex (graph theory); Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.023369833768689657,"score_gpt":0.25447043938538544,"score_spread":0.2311006056166958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984405480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37400842,0.0004902266,0.5859928,0.0029100708,0.0001484373,0.00021966398,0.0010584927,0.00083665614,0.03433532],"genre_scores_gemma":[0.65396863,0.00046759917,0.3228131,0.00021056396,0.0000724355,0.00015454866,0.0010221616,0.00030157494,0.020989439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899966,0.00025136388,0.000042341224,0.00037602737,0.00014361205,0.00018693498],"domain_scores_gemma":[0.996709,0.0020909056,0.00035118294,0.00039302802,0.00016052435,0.0002952973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059454195,0.0011099846,0.0018053399,0.0019772903,0.0025756117,0.0026934543,0.0027092847,0.0044964645,0.009943124],"category_scores_gemma":[0.005404162,0.0010326575,0.00091278594,0.002027561,0.0024400463,0.0066357357,0.003394776,0.001717782,0.0016565371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094163197,0.0003985714,0.004851937,0.0008575063,0.00014160876,0.0012541516,0.0012527793,0.32800978,0.015875341,0.54140025,0.013666109,0.09135037],"study_design_scores_gemma":[0.000088587025,0.0001469533,0.0013230231,0.00010735994,0.00006240489,0.00056694215,0.0012411572,0.48417327,0.0075683245,0.4952214,0.009438681,0.000061882536],"about_ca_topic_score_codex":0.004023254,"about_ca_topic_score_gemma":0.004397035,"teacher_disagreement_score":0.009943124,"about_ca_system_score_codex":0.0013137682,"about_ca_system_score_gemma":0.000974403,"threshold_uncertainty_score":0.033263087},"labels":[],"label_agreement":null},{"id":"W1984640610","doi":"10.1016/s0012-365x(01)00450-2","title":"On Hedetniemi's conjecture and the colour template scheme","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Univerza v Mariboru; Sun Yat-sen University","keywords":"Mathematics; Conjecture; Scheme (mathematics); Combinatorics; Discrete mathematics; Arithmetic; Mathematical analysis","score_opus":0.01831893673306925,"score_gpt":0.22702301616141307,"score_spread":0.20870407942834382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984640610","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56374234,0.0018674249,0.18695186,0.03178634,0.0015211747,0.00013782812,0.0013124893,0.00066447596,0.21201602],"genre_scores_gemma":[0.9501672,0.0009216183,0.020672556,0.0013853956,0.000590815,0.00007871198,0.00064472185,0.00012561955,0.025413338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858093,0.00028996696,0.00007032636,0.00040323017,0.00032622702,0.000329391],"domain_scores_gemma":[0.9941175,0.00282281,0.0004534372,0.001697202,0.0004730048,0.00043612745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022397235,0.00057508016,0.0015428786,0.0014939408,0.00295033,0.004087895,0.00190797,0.0035637314,0.013665509],"category_scores_gemma":[0.0131515125,0.00062117283,0.0012082602,0.0026985595,0.006946512,0.014692363,0.0049271137,0.004725289,0.0014890685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059908783,0.000011442136,0.00033334614,0.000019940962,0.0000037567318,0.00004366457,0.00013810047,0.00093135895,0.00020549142,0.9938415,0.0018192574,0.0025920933],"study_design_scores_gemma":[0.000014733064,0.000005674807,0.00017850427,0.000008680951,0.0000039190295,0.00003767742,0.00006614106,0.0029219135,0.00016773706,0.99386346,0.002722984,0.000008629676],"about_ca_topic_score_codex":0.0026259255,"about_ca_topic_score_gemma":0.001557413,"teacher_disagreement_score":0.013665509,"about_ca_system_score_codex":0.0021511384,"about_ca_system_score_gemma":0.0011920672,"threshold_uncertainty_score":0.04571563},"labels":[],"label_agreement":null},{"id":"W1985536357","doi":"10.1016/s0012-365x(00)00026-1","title":"Cyclic inequivalence of cascaded GMW-sequences","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Autocorrelation; Finite field; Discrete mathematics; Combinatorics; Integer (computer science); Statistics","score_opus":0.015459221939473657,"score_gpt":0.24904263574729807,"score_spread":0.2335834138078244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985536357","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81878406,0.00034970028,0.08412652,0.00057181454,0.00018579049,0.000066995206,0.00022394823,0.00019480074,0.095496364],"genre_scores_gemma":[0.97438204,0.00019829448,0.011399883,0.00020514723,0.00014602854,0.000064984495,0.00021303128,0.00005592086,0.013334769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935,0.0001218695,0.000034299126,0.00011676054,0.00019611155,0.00018098061],"domain_scores_gemma":[0.9985501,0.0006032641,0.00020675661,0.00021867693,0.00021472135,0.0002063697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005354558,0.00041225168,0.00038106297,0.0014003842,0.0009215109,0.0013074677,0.0008141435,0.0010182463,0.009408758],"category_scores_gemma":[0.0024998588,0.00029940304,0.00038338074,0.0008459497,0.0011523734,0.0019770495,0.0013909129,0.0014919704,0.00075507164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107309526,0.00003400493,0.00033097,0.000024366418,0.0000051971056,0.00015229506,0.0001412233,0.0017731827,0.006621484,0.9794819,0.0007120226,0.010616094],"study_design_scores_gemma":[0.00003449976,0.00011560596,0.0011163519,0.000025618589,0.000012133398,0.00039278052,0.00010064117,0.02755195,0.0061516226,0.9605347,0.003933897,0.000030216715],"about_ca_topic_score_codex":0.00038547776,"about_ca_topic_score_gemma":0.00047182536,"teacher_disagreement_score":0.009408758,"about_ca_system_score_codex":0.0007897425,"about_ca_system_score_gemma":0.0004191983,"threshold_uncertainty_score":0.031475484},"labels":[],"label_agreement":null},{"id":"W1985568077","doi":"10.1016/j.disc.2007.07.039","title":"Trees with depression three","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics; Depression (economics)","score_opus":0.023816710911365575,"score_gpt":0.2927496452322637,"score_spread":0.26893293432089815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985568077","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22334084,0.0016137541,0.13587847,0.0061537037,0.00080515596,0.00020939797,0.0023058672,0.0011085607,0.6285842],"genre_scores_gemma":[0.84311116,0.0005914247,0.03120415,0.0010026806,0.00021340098,0.00014026738,0.0011387568,0.00035658822,0.12224154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994099,0.000107765154,0.000026176443,0.00015572025,0.00015476519,0.00014565475],"domain_scores_gemma":[0.9984547,0.0003816216,0.00012993373,0.00031152216,0.00040024007,0.00032192108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036030053,0.00038065363,0.000881633,0.0014322154,0.0033333597,0.003910085,0.0009502378,0.0013747142,0.018691486],"category_scores_gemma":[0.0031164675,0.00042778515,0.00056983024,0.0014739177,0.002680207,0.003366838,0.002479165,0.0029055232,0.0056121196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003181305,0.000011769527,0.00018451453,0.000018182054,0.000004003769,0.00009862299,0.00024668273,0.00015184382,0.00067134725,0.98988146,0.002874854,0.005824908],"study_design_scores_gemma":[0.000015295971,0.000008512078,0.0002469808,0.000016609338,0.000012117744,0.00025054743,0.00026413813,0.00097106054,0.0006280898,0.96556985,0.032006145,0.00001062503],"about_ca_topic_score_codex":0.0017106168,"about_ca_topic_score_gemma":0.0023683682,"teacher_disagreement_score":0.018691486,"about_ca_system_score_codex":0.0013388648,"about_ca_system_score_gemma":0.00084750156,"threshold_uncertainty_score":0.06252921},"labels":[],"label_agreement":null},{"id":"W1985708755","doi":"10.1016/s0012-365x(00)00324-1","title":"Pushing the cycles out of multipartite tournaments","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Multipartite; Mathematics; Combinatorics; Tournament; Discrete mathematics","score_opus":0.01945680643809539,"score_gpt":0.24135492945844647,"score_spread":0.22189812302035108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985708755","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6574732,0.001207884,0.25855252,0.003214814,0.0004997843,0.000111179965,0.00016554364,0.0006017389,0.078173205],"genre_scores_gemma":[0.96315765,0.00039473074,0.023008984,0.00042036863,0.000096064025,0.00007408655,0.00009564307,0.00015821372,0.012594318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989932,0.00044365827,0.000030517847,0.00014863333,0.0001711102,0.00021283659],"domain_scores_gemma":[0.9940287,0.0031875065,0.0004035125,0.00086653634,0.00052171707,0.0009920851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012941739,0.00047518752,0.0010006707,0.0010546221,0.0025928125,0.0043295734,0.0014298529,0.0014084425,0.010055444],"category_scores_gemma":[0.012216721,0.00079002633,0.00071584375,0.0009191079,0.0019570012,0.0035785306,0.0029552642,0.0023674548,0.00077486254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041203346,0.000101436235,0.0012312261,0.00008974231,0.000056703168,0.00018528674,0.00045048253,0.043807063,0.0045602554,0.9094751,0.006407566,0.03322309],"study_design_scores_gemma":[0.00007094371,0.00007734186,0.0004617613,0.000042011437,0.000027162883,0.00009900565,0.0002996904,0.1836078,0.0014324357,0.8064717,0.007385306,0.000024834097],"about_ca_topic_score_codex":0.0017312898,"about_ca_topic_score_gemma":0.0021260374,"teacher_disagreement_score":0.010055444,"about_ca_system_score_codex":0.000951391,"about_ca_system_score_gemma":0.00067816133,"threshold_uncertainty_score":0.033638835},"labels":[],"label_agreement":null},{"id":"W1985793060","doi":"10.1016/j.disc.2006.08.010","title":"Retractions onto series-parallel posets","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Partially ordered set; Mathematics; Combinatorics; Homomorphism; Star product; Series (stratigraphy); Discrete mathematics; Algebraic number","score_opus":0.02578994077376497,"score_gpt":0.3219776912850309,"score_spread":0.29618775051126595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985793060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3220354,0.001126115,0.46546197,0.003192423,0.0026573145,0.0003580653,0.0012454328,0.0031703624,0.20075297],"genre_scores_gemma":[0.7948699,0.0019579602,0.06473671,0.0008136392,0.0014609809,0.00039618192,0.00151552,0.0015905161,0.1326586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988218,0.00019320237,0.000096007374,0.00030315245,0.00038103043,0.00020480168],"domain_scores_gemma":[0.99765104,0.00084776303,0.00032858786,0.00038718,0.0003752305,0.00041018252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009557729,0.0015411223,0.00078564946,0.0030344792,0.0019761971,0.003733653,0.001081604,0.0010295557,0.021569237],"category_scores_gemma":[0.004402355,0.00077479676,0.0017683476,0.002222193,0.0022156157,0.0067326827,0.003908928,0.004114552,0.0029710536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008178557,0.000068432026,0.00017296594,0.000067627545,0.000016825657,0.00024200787,0.00045983397,0.001756004,0.0025625217,0.9754421,0.0032194804,0.015910363],"study_design_scores_gemma":[0.000029858391,0.000043676588,0.00014370281,0.000014013685,0.000015605541,0.00030417534,0.00018235898,0.0030598855,0.0017651719,0.9850787,0.009348256,0.000014655449],"about_ca_topic_score_codex":0.0005109561,"about_ca_topic_score_gemma":0.0006091647,"teacher_disagreement_score":0.021569237,"about_ca_system_score_codex":0.00095430604,"about_ca_system_score_gemma":0.0006256477,"threshold_uncertainty_score":0.07215625},"labels":[],"label_agreement":null},{"id":"W1986412636","doi":"10.1016/j.disc.2008.02.029","title":"Posets of annular non-crossing partitions of types B and D","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; American Institute of Mathematics","keywords":"Partially ordered set; Bijection; Mathematics; Combinatorics; Lattice (music); Isomorphism (crystallography); Type (biology); Order type; Order (exchange); Discrete mathematics; Crystal structure; Crystallography; Physics","score_opus":0.039926061150106204,"score_gpt":0.3149453847569901,"score_spread":0.27501932360688386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986412636","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.610129,0.0016553665,0.18598104,0.0020029647,0.0009891576,0.00026512094,0.0018365757,0.000985774,0.19615503],"genre_scores_gemma":[0.94256544,0.0006893295,0.021049662,0.0004739988,0.00031350422,0.0002596571,0.0015491776,0.00024258277,0.032856677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812907,0.00043449708,0.0001431571,0.000458554,0.00033254625,0.0005021301],"domain_scores_gemma":[0.99698573,0.0013291929,0.0003869506,0.00025761305,0.00028949825,0.00075101125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014895025,0.0013867947,0.0011282079,0.003796273,0.0045224125,0.010581221,0.0014413492,0.0015774928,0.015113912],"category_scores_gemma":[0.003065025,0.0014070275,0.0013993065,0.0026599462,0.0044002403,0.009228651,0.004837509,0.0031263104,0.0020081038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001453826,0.000046055582,0.000623643,0.000055153283,0.000011480266,0.00030574875,0.0010534348,0.00050824194,0.0012538788,0.99154913,0.0014226295,0.0030250847],"study_design_scores_gemma":[0.000061741,0.00005786681,0.0009780972,0.000053878164,0.00004122202,0.00081144733,0.001684658,0.0027088001,0.0018905612,0.97847384,0.0131961685,0.000041671796],"about_ca_topic_score_codex":0.0010850746,"about_ca_topic_score_gemma":0.0008158,"teacher_disagreement_score":0.015113912,"about_ca_system_score_codex":0.0014382716,"about_ca_system_score_gemma":0.0006402584,"threshold_uncertainty_score":0.05056107},"labels":[],"label_agreement":null},{"id":"W1986692294","doi":"10.1016/s0012-365x(02)00570-8","title":"Construction of new extremal self-dual codes","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Dual (grammatical number); Combinatorics; Discrete mathematics","score_opus":0.017297621776683324,"score_gpt":0.2378547598035444,"score_spread":0.22055713802686108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986692294","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58678293,0.0007367268,0.30532536,0.0015088439,0.0010727985,0.00021283903,0.00033178108,0.00080086803,0.103227854],"genre_scores_gemma":[0.85762817,0.00046124408,0.11217017,0.0005295479,0.00027200984,0.0001784141,0.0003690975,0.00029210272,0.028099176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948883,0.00011823488,0.00002881801,0.000084249616,0.00017907466,0.00010073133],"domain_scores_gemma":[0.9990515,0.00022099006,0.00010456058,0.0002158027,0.00017742273,0.00022963031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055764004,0.00047433766,0.00061838736,0.0019010955,0.0011939916,0.0016882377,0.00082646555,0.0010478726,0.004340329],"category_scores_gemma":[0.0017766434,0.0005061786,0.00068909815,0.00071667414,0.0012885727,0.0015434567,0.0026554517,0.001997895,0.0009641144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009125072,0.000047838206,0.00031677904,0.00005509616,0.000013395468,0.0001621935,0.0001694833,0.0016737247,0.0065429998,0.97565484,0.0012962851,0.013976074],"study_design_scores_gemma":[0.00010218387,0.00011393413,0.00044258492,0.000053163018,0.000036590467,0.0010226216,0.00013429268,0.035368618,0.016351689,0.9311912,0.015116432,0.00006679555],"about_ca_topic_score_codex":0.0000824124,"about_ca_topic_score_gemma":0.00014184244,"teacher_disagreement_score":0.004340329,"about_ca_system_score_codex":0.00054855295,"about_ca_system_score_gemma":0.0004709501,"threshold_uncertainty_score":0.014519811},"labels":[],"label_agreement":null},{"id":"W1987220346","doi":"10.1016/j.disc.2007.05.009","title":"Cyclic hamiltonian cycle systems of the complete graph minus a 1-factor","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Centre International de Recherche sur le Cancer","keywords":"Mathematics; Hamiltonian path; Combinatorics; Graph; Discrete mathematics","score_opus":0.012819830166623363,"score_gpt":0.21155990504484762,"score_spread":0.19874007487822426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987220346","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8208136,0.0011103551,0.07694426,0.0010509387,0.00031861803,0.00012301285,0.0007175082,0.00023506912,0.098686695],"genre_scores_gemma":[0.96930444,0.00033250317,0.01159419,0.00019918424,0.00013862072,0.00007498922,0.00035519165,0.00005633578,0.017944474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976224,0.00005898461,0.000009357559,0.000053537904,0.000053171043,0.000062651634],"domain_scores_gemma":[0.99947923,0.00014804908,0.000117956464,0.00006704082,0.00008195578,0.00010583184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018448423,0.0003934497,0.00040423535,0.0010297108,0.0009105916,0.0010746092,0.00062311505,0.00082874857,0.009326388],"category_scores_gemma":[0.0010432652,0.00024196232,0.00038084597,0.0006738616,0.0009455479,0.0010856848,0.0006918355,0.00069885055,0.00054001826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055919183,0.00002535178,0.00023659154,0.000042355783,0.000010996837,0.00013452928,0.00014795554,0.0057862923,0.0028798047,0.9826103,0.0020405515,0.0060294233],"study_design_scores_gemma":[0.000033786393,0.000039711587,0.00047610005,0.000014395086,0.000008832506,0.00012238973,0.00010465235,0.028754659,0.0011829454,0.96564406,0.0035963217,0.000022185674],"about_ca_topic_score_codex":0.0020426237,"about_ca_topic_score_gemma":0.002200091,"teacher_disagreement_score":0.009326388,"about_ca_system_score_codex":0.0008020985,"about_ca_system_score_gemma":0.00056336756,"threshold_uncertainty_score":0.031199932},"labels":[],"label_agreement":null},{"id":"W1987260656","doi":"10.1016/s0012-365x(03)00285-1","title":"Existence of incomplete resolvable minimum coverings of pairs by triples","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Order (exchange); Discrete mathematics","score_opus":0.011479590207855652,"score_gpt":0.2011635292465455,"score_spread":0.18968393903868985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987260656","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7850548,0.0006185454,0.19276491,0.0005230362,0.000043841213,0.0000798936,0.0014041442,0.00041810266,0.01909269],"genre_scores_gemma":[0.91461545,0.0004464569,0.07809862,0.00014679055,0.000053236916,0.00014312033,0.0021842408,0.00018975303,0.0041223564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985936,0.0003610759,0.0000865286,0.00030632995,0.00033194516,0.00032050212],"domain_scores_gemma":[0.9894756,0.006899455,0.0010364072,0.001490858,0.0005304011,0.000567265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009589859,0.00075447105,0.0016212118,0.0014510612,0.0018956782,0.003260484,0.0015284743,0.001508917,0.004618025],"category_scores_gemma":[0.0070045013,0.0014829244,0.0015255234,0.002008946,0.0014120425,0.004480132,0.00227459,0.0023459676,0.0007244601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012006989,0.00027807913,0.0064917025,0.00085939845,0.00030940498,0.0010236293,0.0034297213,0.07252983,0.028387161,0.8075447,0.007920038,0.070025705],"study_design_scores_gemma":[0.000107851854,0.00013346254,0.0019353136,0.00012981234,0.000116435855,0.0010150864,0.0010035652,0.08540961,0.01532789,0.8880203,0.0067456285,0.00005509069],"about_ca_topic_score_codex":0.00055185996,"about_ca_topic_score_gemma":0.00080466113,"teacher_disagreement_score":0.004618025,"about_ca_system_score_codex":0.0009410407,"about_ca_system_score_gemma":0.00063661,"threshold_uncertainty_score":0.015448809},"labels":[],"label_agreement":null},{"id":"W1988719430","doi":"10.1016/s0012-365x(01)00133-9","title":"On the recognition of de Bruijn graphs and their induced subgraphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"De Bruijn sequence; Combinatorics; De Bruijn graph; Mathematics; Cograph; Discrete mathematics; Induced subgraph; Graph; Pathwidth; Line graph","score_opus":0.0384573941709699,"score_gpt":0.23659130619966753,"score_spread":0.19813391202869762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988719430","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43753833,0.0015307426,0.5019536,0.00287468,0.00030040677,0.00014673448,0.0006877409,0.0009838186,0.05398402],"genre_scores_gemma":[0.88810843,0.0011764114,0.090561084,0.0004909338,0.0002750823,0.000093765004,0.0020251675,0.00027340767,0.016995784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919754,0.000203734,0.000055814762,0.00020083957,0.00018603627,0.00015601653],"domain_scores_gemma":[0.994574,0.0036640917,0.00047787005,0.00063690275,0.00039418176,0.00025287463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006080258,0.0004964898,0.0006895363,0.0010913538,0.0009594991,0.0027085312,0.0010304261,0.001342443,0.0043018423],"category_scores_gemma":[0.006271655,0.0004071607,0.00060159934,0.0015302765,0.0015328754,0.0043380586,0.0013857723,0.0014413958,0.00091190357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051747164,0.00023614385,0.0024877016,0.00024573677,0.00004057854,0.00036378897,0.00093013165,0.04994553,0.016153352,0.79128784,0.009112306,0.1286794],"study_design_scores_gemma":[0.000018942046,0.000041256215,0.0007309771,0.000027621507,0.000012212935,0.0002071386,0.00018093192,0.10447022,0.0047141383,0.8848854,0.004687683,0.000023482928],"about_ca_topic_score_codex":0.0012915714,"about_ca_topic_score_gemma":0.001352275,"teacher_disagreement_score":0.0043018423,"about_ca_system_score_codex":0.0007036143,"about_ca_system_score_gemma":0.00042979067,"threshold_uncertainty_score":0.014391124},"labels":[],"label_agreement":null},{"id":"W1989439931","doi":"10.1016/j.disc.2006.03.055","title":"On some probabilistic approximations for AES-like s-boxes","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Queen's University; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Affine transformation; Block cipher; S-box; Algebraic number; Discrete mathematics; Simple (philosophy); Block size; Key schedule; Transformation (genetics); Cryptanalysis; Combinatorics; Cryptography; Differential cryptanalysis; Algorithm; Pure mathematics; Computer science; Key (lock)","score_opus":0.01881262860321052,"score_gpt":0.2796773462501362,"score_spread":0.26086471764692565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989439931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08487432,0.0014934596,0.8791755,0.0033252954,0.00033081401,0.00014203676,0.00035017048,0.00044266792,0.029865747],"genre_scores_gemma":[0.7721034,0.0021220625,0.20226415,0.001135352,0.00059296034,0.00034543293,0.00055618427,0.0002720433,0.020608421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958054,0.0013795707,0.00024100568,0.0005390109,0.0014402838,0.0005946831],"domain_scores_gemma":[0.9887727,0.007679645,0.00066971837,0.001675204,0.00079181546,0.00041092554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044625825,0.0013577685,0.0021472506,0.00146186,0.0023017982,0.004490663,0.0025760063,0.002833353,0.0077655823],"category_scores_gemma":[0.02674606,0.0011286271,0.002404813,0.0020502352,0.004821304,0.0086675,0.0049418784,0.005880578,0.0011791544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002309028,0.00003126438,0.00030238807,0.000074103176,0.000028084016,0.000062649364,0.00020416568,0.03866777,0.0006259221,0.949851,0.0016748811,0.008246991],"study_design_scores_gemma":[0.000034875768,0.000033523418,0.00010886808,0.00004721738,0.00002248622,0.00007304842,0.00006000152,0.16405155,0.0006309027,0.8328116,0.0020995992,0.000026274918],"about_ca_topic_score_codex":0.0022529487,"about_ca_topic_score_gemma":0.002263721,"teacher_disagreement_score":0.0077655823,"about_ca_system_score_codex":0.0039436794,"about_ca_system_score_gemma":0.0023392576,"threshold_uncertainty_score":0.028613567},"labels":[],"label_agreement":null},{"id":"W1989905036","doi":"10.1016/j.disc.2005.09.030","title":"List homomorphisms of graphs with bounded degrees","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Homomorphism; Mathematics; Bounded function; Combinatorics; Discrete mathematics; Contrast (vision); Upper and lower bounds; Degree (music); Graph homomorphism; Computational complexity theory; Graph; Computer science; Algorithm; Line graph; Artificial intelligence","score_opus":0.01541211956355663,"score_gpt":0.25741590942436116,"score_spread":0.24200378986080454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989905036","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6052959,0.0011816059,0.33834323,0.0023327132,0.00030769123,0.00015351613,0.0011649575,0.0023489806,0.048871424],"genre_scores_gemma":[0.9197196,0.00090218295,0.04622143,0.00076158065,0.00039686606,0.00025430668,0.0011902831,0.0006330396,0.02992071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998285,0.00049257715,0.00010724219,0.0003960249,0.00034306114,0.00037608444],"domain_scores_gemma":[0.9881827,0.0073168,0.0010011786,0.0009839776,0.0009560897,0.0015591973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014853198,0.00078893994,0.0009092201,0.0037348277,0.0026674797,0.004529739,0.002374563,0.001412267,0.008729715],"category_scores_gemma":[0.009004522,0.00097423454,0.0011181495,0.0025376168,0.002246143,0.010567183,0.0037962007,0.0028827144,0.00158803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002398478,0.00008502495,0.00069074944,0.00011008031,0.000017637154,0.00020219218,0.0011601617,0.0015405656,0.0031996316,0.9779335,0.0019384477,0.012882275],"study_design_scores_gemma":[0.000046513596,0.000036504134,0.00041935724,0.000027635377,0.000030823492,0.00020087064,0.00034988322,0.0067919423,0.0024062088,0.9860698,0.0035877035,0.000032700602],"about_ca_topic_score_codex":0.001020598,"about_ca_topic_score_gemma":0.0009930928,"teacher_disagreement_score":0.008729715,"about_ca_system_score_codex":0.0017175179,"about_ca_system_score_gemma":0.00079642405,"threshold_uncertainty_score":0.029203832},"labels":[],"label_agreement":null},{"id":"W1990200258","doi":"10.1016/j.disc.2008.12.016","title":"On the Hamilton connectivity of generalized Petersen graphs","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.07031854197623454,"score_gpt":0.3387111453334389,"score_spread":0.26839260335720433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990200258","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8637909,0.0010622771,0.039902203,0.0023247828,0.00012780068,0.00006084474,0.00041939935,0.000121239056,0.09219055],"genre_scores_gemma":[0.9864861,0.0009808074,0.0048690923,0.0002334964,0.00018897306,0.000043058582,0.00032344516,0.000038519654,0.0068364507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997093,0.00008553224,0.000009494352,0.000063300286,0.000077575045,0.00005476314],"domain_scores_gemma":[0.99790037,0.001227272,0.0003367351,0.00014175299,0.00016910318,0.00022470877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033289485,0.00045415768,0.0006174581,0.0019338451,0.0014572109,0.0016198063,0.0008284023,0.0012018078,0.007614765],"category_scores_gemma":[0.0029174085,0.0004983969,0.00040350808,0.0015859748,0.0025247086,0.0033578342,0.0014486733,0.0015073057,0.00036411057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044414475,0.000016261865,0.0006148215,0.000054073113,0.000012248239,0.00014475988,0.00036365722,0.0042089196,0.0008730695,0.98696405,0.0015290551,0.005174718],"study_design_scores_gemma":[0.000013841119,0.000010096148,0.000716408,0.000012778073,0.0000073543497,0.0000637539,0.00017121299,0.008181583,0.00015228128,0.9895583,0.0011046553,0.000007845144],"about_ca_topic_score_codex":0.0029182325,"about_ca_topic_score_gemma":0.0036992235,"teacher_disagreement_score":0.007614765,"about_ca_system_score_codex":0.0008014953,"about_ca_system_score_gemma":0.00038898224,"threshold_uncertainty_score":0.025473893},"labels":[],"label_agreement":null},{"id":"W1990363179","doi":"10.1016/s0012-365x(03)00294-2","title":"On the extension of a partial metric to a tree metric","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Combinatorics; Extension (predicate logic); Metric (unit); Tree (set theory); Discrete mathematics; Polynomial; Simple (philosophy); Focus (optics); Set (abstract data type); Metric space; Computer science","score_opus":0.030633271315895584,"score_gpt":0.2725350720012243,"score_spread":0.2419018006853287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990363179","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040546663,0.0025371972,0.9377918,0.0016055709,0.0003235694,0.000052587482,0.00018860163,0.00015867072,0.016795354],"genre_scores_gemma":[0.5304499,0.008667391,0.43686196,0.0011777532,0.0015760439,0.00028774742,0.00075355143,0.00037247938,0.019853108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980975,0.00078478735,0.00014900681,0.00023355302,0.00060659344,0.00012861467],"domain_scores_gemma":[0.9903706,0.0057288376,0.0005880823,0.001391714,0.0014134787,0.0005074379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027501031,0.0007671052,0.0010524096,0.00224467,0.0011059174,0.0019683598,0.0012687976,0.0012941733,0.003126147],"category_scores_gemma":[0.017377889,0.0004198942,0.00096090935,0.0032528222,0.0027179462,0.007936781,0.0039716247,0.0026502674,0.00061721454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057937137,0.00001591525,0.0003541196,0.000072839095,0.000015076634,0.000115793366,0.00019096196,0.015755761,0.0012415205,0.93410766,0.0023101761,0.045762207],"study_design_scores_gemma":[0.000011148304,0.00009277633,0.0003175946,0.000042009273,0.000017973165,0.0002894187,0.000053927193,0.10958203,0.0007480708,0.8732221,0.015596257,0.000026718102],"about_ca_topic_score_codex":0.0012959309,"about_ca_topic_score_gemma":0.0010439204,"teacher_disagreement_score":0.003126147,"about_ca_system_score_codex":0.0009876875,"about_ca_system_score_gemma":0.0008107183,"threshold_uncertainty_score":0.01454407},"labels":[],"label_agreement":null},{"id":"W1990421674","doi":"10.1016/j.disc.2013.03.024","title":"Non-uniqueness of minimal superpermutations","year":2013,"lang":"fr","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Guelph","keywords":"Uniqueness; Mathematics; Substring; Combinatorics; String (physics); Discrete mathematics; Computer science; Data structure; Mathematical analysis","score_opus":0.022879062862262132,"score_gpt":0.25911542624361955,"score_spread":0.23623636338135742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990421674","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71098006,0.0007019694,0.22101349,0.002755478,0.00037710217,0.0000831242,0.00043514936,0.0006207901,0.06303287],"genre_scores_gemma":[0.9677022,0.0002114587,0.021342797,0.0005457496,0.00020563784,0.00007950586,0.00029619955,0.0002829182,0.009333471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972428,0.00073865877,0.00019123981,0.0005673432,0.0006874775,0.00057240424],"domain_scores_gemma":[0.9806553,0.012187998,0.001095392,0.0031100593,0.0017699962,0.0011811588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027062704,0.00062394823,0.0015790835,0.0017809193,0.0035384358,0.003658188,0.002473336,0.0026416767,0.008507545],"category_scores_gemma":[0.02172511,0.0010335511,0.0016330633,0.0014380072,0.0047622253,0.00858853,0.0055731796,0.0052280333,0.0010726051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013646745,0.000035927293,0.000518038,0.00005856197,0.000016587812,0.0001634054,0.00024334175,0.0013878974,0.0015859947,0.99025667,0.001065965,0.004531252],"study_design_scores_gemma":[0.000012012738,0.000011956711,0.00010994558,0.00000912089,0.00000803848,0.00011684464,0.0000644805,0.00415965,0.00095516816,0.99407554,0.0004675241,0.000009693974],"about_ca_topic_score_codex":0.0003074765,"about_ca_topic_score_gemma":0.00040038984,"teacher_disagreement_score":0.008507545,"about_ca_system_score_codex":0.001052383,"about_ca_system_score_gemma":0.0014087101,"threshold_uncertainty_score":0.028460562},"labels":[],"label_agreement":null},{"id":"W1991586960","doi":"10.1016/j.disc.2010.04.014","title":"A conjecture on critical graphs and connections to the persistence of associated primes","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Mathematics; Monomial ideal; Combinatorics; Conjecture; Discrete mathematics; Simple graph; Chromatic scale; Monomial; Graph; Polynomial; Polynomial ring","score_opus":0.04009475174220571,"score_gpt":0.3327001114994608,"score_spread":0.2926053597572551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991586960","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75383013,0.0031033307,0.074591585,0.029044423,0.0010742077,0.00006379942,0.0005099334,0.00047546814,0.13730708],"genre_scores_gemma":[0.98240364,0.0008389958,0.005244149,0.0011126661,0.0009754702,0.00003989093,0.00020971835,0.000075181524,0.009100233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993492,0.00018710436,0.000026935924,0.00021443237,0.000102460035,0.00011994589],"domain_scores_gemma":[0.993568,0.0038477809,0.00071825227,0.00076196017,0.00044752978,0.0006566209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014775215,0.0005349975,0.00109215,0.0022767696,0.0032510308,0.0046937587,0.001538462,0.0029942691,0.010598687],"category_scores_gemma":[0.010060876,0.00063600845,0.0007840684,0.0021472874,0.008149809,0.014130031,0.0032413232,0.0042698174,0.0006000083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024576819,0.000010368015,0.00022549226,0.00002314665,0.0000025800277,0.00003836398,0.00020551207,0.00028155232,0.0001507642,0.9966827,0.0010960612,0.001258932],"study_design_scores_gemma":[0.000011120271,0.0000042822694,0.00011385474,0.0000065387167,0.0000025933625,0.000038081354,0.00007409885,0.0006813756,0.00007104913,0.9981072,0.000885611,0.000004244008],"about_ca_topic_score_codex":0.0010445422,"about_ca_topic_score_gemma":0.0007478174,"teacher_disagreement_score":0.010598687,"about_ca_system_score_codex":0.0013548351,"about_ca_system_score_gemma":0.00071492745,"threshold_uncertainty_score":0.03545612},"labels":[],"label_agreement":null},{"id":"W1992055650","doi":"10.1016/j.disc.2013.07.011","title":"Corrigendum to “Velocity polytopes of periodic graphs and a no-go theorem for digital physics” [Discrete Mathematics 313 (2013) 1289–1301]","year":2013,"lang":"en","type":"erratum","venue":"Discrete Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Polytope; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.02133920632146357,"score_gpt":0.26101839544759203,"score_spread":0.23967918912612846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992055650","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042494992,0.0046892613,0.004849007,0.07295571,0.88377213,0.00006842683,0.0014070219,0.0006494024,0.03118406],"genre_scores_gemma":[0.026671886,0.016060585,0.01552868,0.094629355,0.2714258,0.00040746076,0.0045246826,0.0021493891,0.56860214],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99672794,0.00054772216,0.00035546895,0.0006242257,0.0014619832,0.00028261592],"domain_scores_gemma":[0.99235755,0.0017416622,0.00032742528,0.00071665103,0.004475835,0.00038085485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021750024,0.0021301736,0.002723568,0.0045865974,0.0039260928,0.0034904943,0.004625141,0.0051274616,0.097237386],"category_scores_gemma":[0.02056917,0.001046805,0.0024871754,0.0030840554,0.0026024042,0.0042950544,0.0023861716,0.006535273,0.03058202],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021065955,0.000008979615,0.000036639853,0.00012247855,0.000013776617,0.00006878541,0.00001796025,0.00012932588,0.00006064146,0.008991626,0.9842285,0.0063002803],"study_design_scores_gemma":[0.000051142797,0.000044769193,0.0011649553,0.00020656831,0.00007970475,0.0003179427,0.000083816085,0.0019302656,0.0005678481,0.04844876,0.94700956,0.000094705814],"about_ca_topic_score_codex":0.019051857,"about_ca_topic_score_gemma":0.027256526,"teacher_disagreement_score":0.097237386,"about_ca_system_score_codex":0.005372655,"about_ca_system_score_gemma":0.0030947735,"threshold_uncertainty_score":0.32529145},"labels":[],"label_agreement":null},{"id":"W1992400796","doi":"10.1016/s0012-365x(01)00054-1","title":"On the divisibility of graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Agence Nationale pour la Gestion des Déchets Radioactifs","keywords":"Mathematics; Combinatorics; Divisibility rule; Perfect graph; Perfect graph theorem; Conjecture; Trivially perfect graph; Induced subgraph; Split graph; Discrete mathematics; Graph; Clique number; Vertex (graph theory); Partition (number theory); Cograph; Chromatic scale; Line graph; Pathwidth","score_opus":0.04652455214468322,"score_gpt":0.2935728521492843,"score_spread":0.2470483000046011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992400796","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5770765,0.008713726,0.15997864,0.024333134,0.0013410763,0.000121194396,0.000792625,0.00038845427,0.22725467],"genre_scores_gemma":[0.92765963,0.006371717,0.02381886,0.0018892426,0.0024007584,0.00014766712,0.0006571322,0.00037507506,0.036679987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986143,0.0005192542,0.00006237414,0.00033388464,0.00028473002,0.00018544424],"domain_scores_gemma":[0.9785242,0.016019514,0.0012662819,0.0019254799,0.0010626098,0.0012020456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024632988,0.0010619593,0.0016975544,0.0039924337,0.0029291096,0.0034554983,0.002679646,0.0022821624,0.010148517],"category_scores_gemma":[0.017039932,0.0011209053,0.0013111987,0.0028625818,0.0114348,0.014803409,0.0053661,0.00858142,0.0008785077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007387633,0.000024418021,0.00031965,0.00008637347,0.000011571982,0.0000647066,0.00049094163,0.0018665614,0.0004274831,0.9887293,0.0017294441,0.0061756424],"study_design_scores_gemma":[0.0000073605006,0.000006804728,0.000093530005,0.000011277058,0.0000028031866,0.000032419266,0.000040538194,0.0011948891,0.000059574108,0.9974076,0.0011391863,0.0000040057294],"about_ca_topic_score_codex":0.0009616136,"about_ca_topic_score_gemma":0.0006738067,"teacher_disagreement_score":0.010148517,"about_ca_system_score_codex":0.0020211586,"about_ca_system_score_gemma":0.00053923624,"threshold_uncertainty_score":0.03395021},"labels":[],"label_agreement":null},{"id":"W1992795105","doi":"10.1016/j.disc.2004.10.016","title":"The set of values of b for which there exist block designs with b blocks","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of Alberta","funders":"","keywords":"Mathematics; Block (permutation group theory); Combinatorics; Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.020589966131387954,"score_gpt":0.24154454317375756,"score_spread":0.22095457704236962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992795105","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6369485,0.0029212672,0.24690121,0.002583675,0.00019922081,0.00058754056,0.005317056,0.0025381306,0.10200338],"genre_scores_gemma":[0.91869617,0.0016350895,0.06555946,0.0005318021,0.00011369779,0.00095404126,0.0020064681,0.0002582374,0.010245066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99763155,0.00073497155,0.00014855876,0.0003224982,0.000635618,0.0005267122],"domain_scores_gemma":[0.9914636,0.004799219,0.0012959176,0.00083387777,0.0009636018,0.0006436528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001735141,0.001590651,0.0016385035,0.0032168436,0.0015433141,0.0041626035,0.0009938949,0.0019755512,0.007793696],"category_scores_gemma":[0.009867073,0.0007480031,0.0006773837,0.0013072871,0.0020553959,0.0025791395,0.0019264055,0.0012888935,0.0024500077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006487551,0.0011974508,0.008062024,0.002129439,0.0005291958,0.0015593392,0.0015811033,0.035873648,0.100151196,0.6058533,0.02516394,0.21141174],"study_design_scores_gemma":[0.0013759556,0.0021996726,0.007495463,0.0010206284,0.0003917111,0.0032118824,0.0011643133,0.15878128,0.08029069,0.69751364,0.046238106,0.0003166503],"about_ca_topic_score_codex":0.0005291579,"about_ca_topic_score_gemma":0.00036922656,"teacher_disagreement_score":0.007793696,"about_ca_system_score_codex":0.00072223734,"about_ca_system_score_gemma":0.0013546054,"threshold_uncertainty_score":0.026072502},"labels":[],"label_agreement":null},{"id":"W1993089254","doi":"10.1016/s0012-365x(03)00138-9","title":"The Petersen graph is not 3-edge-colorable—a new proof","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences; Simon Fraser University","funders":"","keywords":"Petersen graph; Mathematics; Combinatorics; Graph; Combinatorial proof; Discrete mathematics; Edge coloring; Enhanced Data Rates for GSM Evolution; Line graph; Voltage graph; Computer science; Graph power","score_opus":0.03119521382550538,"score_gpt":0.2955282700129855,"score_spread":0.2643330561874801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993089254","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23674093,0.003443812,0.3452028,0.031304922,0.0047477605,0.00040241782,0.0019967442,0.001037393,0.37512317],"genre_scores_gemma":[0.85250306,0.0055359164,0.09383684,0.006841409,0.0024025778,0.00032249923,0.0023728732,0.0005810633,0.035603803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915636,0.000104923885,0.000042504853,0.00027653226,0.00024728363,0.00017245571],"domain_scores_gemma":[0.9960949,0.0021787013,0.00031700925,0.00040726658,0.00059459254,0.00040752845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011305101,0.0017487463,0.0012694219,0.002177095,0.0025732217,0.0025896663,0.0026643923,0.0021233207,0.01423882],"category_scores_gemma":[0.0043093488,0.0012356655,0.002721635,0.0018930177,0.0057155383,0.010955102,0.0057078856,0.010121178,0.0013351999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001385196,0.00010362841,0.0010550619,0.00031487536,0.00007729632,0.00069707114,0.0003555868,0.0015953766,0.0030990057,0.96773225,0.011366977,0.013464516],"study_design_scores_gemma":[0.00005564571,0.00004875225,0.0011639445,0.000053003405,0.000085596235,0.0007649119,0.00027988385,0.0054441895,0.0019624732,0.9683975,0.021693652,0.000050488878],"about_ca_topic_score_codex":0.002344553,"about_ca_topic_score_gemma":0.002944569,"teacher_disagreement_score":0.01423882,"about_ca_system_score_codex":0.0014693043,"about_ca_system_score_gemma":0.00087921653,"threshold_uncertainty_score":0.047633648},"labels":[],"label_agreement":null},{"id":"W1993218841","doi":"10.1016/s0012-365x(00)00419-2","title":"Directed packing and covering designs with block size four","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Combinatorics; Block size; Block (permutation group theory); Packing problems; Discrete mathematics; Computer science; Key (lock)","score_opus":0.01629517972808663,"score_gpt":0.200881071769452,"score_spread":0.18458589204136536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993218841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21059652,0.0010502129,0.7450262,0.00056166574,0.0001553846,0.00012208798,0.00023832808,0.00045119406,0.041798443],"genre_scores_gemma":[0.7862225,0.0009709949,0.19521515,0.000404928,0.00014116256,0.00029988575,0.00030781908,0.00012438688,0.016313197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989254,0.0004007038,0.00005322421,0.00015565485,0.000284024,0.00018100208],"domain_scores_gemma":[0.99710506,0.0015075756,0.00037189422,0.00058931304,0.0002531239,0.00017297013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008862929,0.0008048974,0.00065907394,0.0009447473,0.0007035224,0.0014478258,0.00071140117,0.0012200344,0.004089666],"category_scores_gemma":[0.0043669096,0.0007093279,0.00047842402,0.0016512249,0.0009043873,0.0015396505,0.0010886198,0.00088074344,0.0007987022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045865297,0.00012321695,0.0011034742,0.00020563761,0.000062654115,0.0003259951,0.00028343708,0.101542085,0.017798454,0.7742022,0.0047266395,0.099167585],"study_design_scores_gemma":[0.00010976723,0.00030995643,0.00065832364,0.00007512651,0.00006245301,0.00061422965,0.000114089584,0.34295756,0.013183643,0.6272544,0.0146134775,0.000047000955],"about_ca_topic_score_codex":0.00064339675,"about_ca_topic_score_gemma":0.0006885395,"teacher_disagreement_score":0.004089666,"about_ca_system_score_codex":0.0008016461,"about_ca_system_score_gemma":0.0005846981,"threshold_uncertainty_score":0.013681233},"labels":[],"label_agreement":null},{"id":"W1993237896","doi":"10.1016/j.disc.2008.05.038","title":"The circular chromatic number of hypergraphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chromatic scale; Mathematics; Generalization; Combinatorics; Mathematical proof; Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.023709070813125177,"score_gpt":0.29308402407486295,"score_spread":0.26937495326173777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993237896","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8094718,0.0015111611,0.06614706,0.0033765996,0.00037464694,0.000073504016,0.001312405,0.0004591161,0.11727375],"genre_scores_gemma":[0.9771854,0.0009473982,0.009440144,0.00026474384,0.00035409752,0.00008387341,0.0005851565,0.00012834034,0.0110107735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928147,0.00017356916,0.000030765925,0.00020378456,0.00015995858,0.00015049119],"domain_scores_gemma":[0.99242765,0.0041339374,0.0010783043,0.0007185172,0.0006723421,0.0009692636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010039753,0.0004346042,0.00052462035,0.003487114,0.0021620607,0.0047219335,0.0014241794,0.0012840042,0.01005758],"category_scores_gemma":[0.006964412,0.00053513696,0.00035451577,0.003911671,0.0044336407,0.004744049,0.0013663169,0.0016400121,0.0008003295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035988961,0.000034094282,0.0033036354,0.0001174544,0.000022531056,0.00006377814,0.00043841373,0.008810526,0.0033975248,0.9620934,0.006666412,0.014692446],"study_design_scores_gemma":[0.000060836832,0.00004282055,0.0035462703,0.000055221095,0.000038313872,0.00019340358,0.00034353312,0.03346798,0.0024500755,0.95070356,0.009053642,0.000044256863],"about_ca_topic_score_codex":0.003574221,"about_ca_topic_score_gemma":0.0029109989,"teacher_disagreement_score":0.01005758,"about_ca_system_score_codex":0.0028908509,"about_ca_system_score_gemma":0.0012994987,"threshold_uncertainty_score":0.033645928},"labels":[],"label_agreement":null},{"id":"W1993350312","doi":"10.1016/j.disc.2012.12.003","title":"Efficient domination in circulant graphs","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Circulant matrix; Mathematics; Circulant graph; Combinatorics; Wreath product; Dominating set; Discrete mathematics; Graph; Line graph; Product (mathematics); Voltage graph; Vertex (graph theory)","score_opus":0.016434020257279764,"score_gpt":0.27905689023469377,"score_spread":0.262622869977414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993350312","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57748306,0.00077332486,0.3510209,0.0015761631,0.00014907145,0.00022867878,0.0005854545,0.0008229536,0.06736041],"genre_scores_gemma":[0.9261071,0.00046033738,0.04891713,0.00034009662,0.00014503635,0.00017969991,0.0005360535,0.00035286593,0.02296163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853396,0.00044808746,0.00005073892,0.00022435066,0.00037526255,0.00036758027],"domain_scores_gemma":[0.99072015,0.0060200994,0.0005361825,0.001302975,0.00069422345,0.00072640984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011248072,0.0006567705,0.0011512109,0.0012480298,0.0021162492,0.0031152274,0.0019929819,0.001191734,0.006934782],"category_scores_gemma":[0.008320247,0.00065221894,0.00063598633,0.0018482491,0.0016732544,0.0031289032,0.0020887165,0.0017746792,0.0007764813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023334498,0.00018986597,0.0012880011,0.00020034632,0.000043821652,0.00026885935,0.0005965949,0.036045887,0.01199526,0.8935374,0.010085308,0.045515366],"study_design_scores_gemma":[0.00008745853,0.000035620076,0.00046169452,0.000026133948,0.000030222925,0.00019568486,0.00013486149,0.16024493,0.0039396277,0.8297033,0.005117579,0.000022895414],"about_ca_topic_score_codex":0.0025910705,"about_ca_topic_score_gemma":0.0059441538,"teacher_disagreement_score":0.006934782,"about_ca_system_score_codex":0.0017231748,"about_ca_system_score_gemma":0.001483844,"threshold_uncertainty_score":0.0231992},"labels":[],"label_agreement":null},{"id":"W1993587964","doi":"10.1016/j.disc.2009.12.007","title":"Domination of generalized Cartesian products","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation","keywords":"Mathematics; Cartesian product; Combinatorics; Discrete mathematics; Cartesian coordinate system; Algebra over a field; Pure mathematics; Geometry","score_opus":0.017179675835678223,"score_gpt":0.29458408373626477,"score_spread":0.27740440790058657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993587964","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80645794,0.00097564136,0.10540641,0.0009925102,0.00014925134,0.000049230024,0.00033568792,0.0001991644,0.085434176],"genre_scores_gemma":[0.9687872,0.00046046003,0.010626375,0.00019888724,0.00015590842,0.000060089886,0.0002708227,0.00011340253,0.019326983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985864,0.00034158665,0.000070228634,0.00034386443,0.0003778327,0.00028003132],"domain_scores_gemma":[0.9943342,0.0031252948,0.0005248167,0.00062296423,0.00080702716,0.0005857009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012117294,0.00042026662,0.0011356041,0.0018918585,0.0021695907,0.0037258337,0.0010833364,0.00074382866,0.00642728],"category_scores_gemma":[0.0045667533,0.00070530374,0.0008927934,0.0021707243,0.0036657508,0.0045582075,0.002596759,0.001871792,0.00048578723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054375374,0.0000110666515,0.00040039804,0.000024564266,0.00001149006,0.00007197345,0.0004929935,0.00061357365,0.00065952743,0.99358726,0.000608055,0.0034647132],"study_design_scores_gemma":[0.000025855876,0.000014050223,0.00047823635,0.000009674081,0.000017080223,0.000184625,0.0001521631,0.0032329496,0.0005497764,0.9926045,0.0027189709,0.0000121233525],"about_ca_topic_score_codex":0.001588498,"about_ca_topic_score_gemma":0.0015335295,"teacher_disagreement_score":0.00642728,"about_ca_system_score_codex":0.0013313853,"about_ca_system_score_gemma":0.0006527319,"threshold_uncertainty_score":0.021501422},"labels":[],"label_agreement":null},{"id":"W1993648632","doi":"10.1016/j.disc.2007.04.017","title":"The existence of (p,q)-extended Rosa sequences","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of Winnipeg","funders":"","keywords":"Mathematics; Combinatorics; Sequence (biology); Integer (computer science); Integer sequence; Discrete mathematics; Generating function; Computer science; Genetics","score_opus":0.011905023200997749,"score_gpt":0.23612706196625494,"score_spread":0.22422203876525718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993648632","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6159071,0.000933824,0.3187275,0.0012014959,0.00020409958,0.00007679617,0.00031706123,0.00029157533,0.062340565],"genre_scores_gemma":[0.94426197,0.00038132002,0.03824229,0.00018728166,0.00009869201,0.00008379253,0.00022538878,0.00005823001,0.016461005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994879,0.00011535299,0.000031893065,0.00013625075,0.0001128584,0.000115729614],"domain_scores_gemma":[0.99667335,0.0016053476,0.00047702223,0.00023555473,0.000539884,0.000468802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007258547,0.0006503078,0.0005228105,0.0013686371,0.0012925281,0.0021438336,0.0008177325,0.0010708485,0.0045761704],"category_scores_gemma":[0.0039599636,0.00045786708,0.0005098201,0.0007729288,0.0015671343,0.002514875,0.0017078527,0.0017455925,0.0007617325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015950456,0.000023686855,0.00041890267,0.00004782317,0.000010639433,0.00015949953,0.00029661605,0.0026815971,0.009130952,0.9779011,0.0005418285,0.008627867],"study_design_scores_gemma":[0.00006440631,0.0001007699,0.00069103524,0.000042695814,0.000019220153,0.0003899724,0.00029477788,0.03422731,0.0070497054,0.9511479,0.0059320023,0.000040209],"about_ca_topic_score_codex":0.00048803573,"about_ca_topic_score_gemma":0.00041780437,"teacher_disagreement_score":0.0045761704,"about_ca_system_score_codex":0.0007083484,"about_ca_system_score_gemma":0.0005820858,"threshold_uncertainty_score":0.015308857},"labels":[],"label_agreement":null},{"id":"W1994013009","doi":"10.1016/j.disc.2010.05.022","title":"On a construction of graphs with high chromatic capacity and large girth","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Combinatorics; Mathematics; Chromatic scale; Integer (computer science); Graph; Discrete mathematics; Girth (graph theory); Edge coloring; Enhanced Data Rates for GSM Evolution; Graph power; Computer science; Line graph","score_opus":0.006859558722335785,"score_gpt":0.1984460313042129,"score_spread":0.1915864725818771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994013009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29433566,0.0008293904,0.6335426,0.0048879674,0.00024427974,0.00019108095,0.0006028789,0.0011968213,0.064169295],"genre_scores_gemma":[0.59618586,0.0008296716,0.38629368,0.0008513623,0.0001731473,0.0002163978,0.0007912053,0.00062270847,0.014035924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938834,0.0002282956,0.000023090883,0.00014048329,0.000118236414,0.00010161665],"domain_scores_gemma":[0.9944963,0.003288208,0.00031098595,0.0011174964,0.00026282767,0.0005242138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097064994,0.000809032,0.00081939594,0.0016543217,0.0022493459,0.002366672,0.0017424522,0.0017346911,0.006071295],"category_scores_gemma":[0.0049426993,0.0012002245,0.0011924283,0.001901424,0.0035340758,0.0041560777,0.0053621056,0.0032453372,0.0009169382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009131764,0.000071023096,0.00073422375,0.000111835645,0.000014405966,0.00010642751,0.00035059472,0.0104556065,0.0061329613,0.96354145,0.0046285014,0.013761716],"study_design_scores_gemma":[0.00006677233,0.00004870324,0.0005800556,0.00004459953,0.000032290933,0.00018209117,0.00016724385,0.04013461,0.0030194395,0.948195,0.0074893525,0.000039898474],"about_ca_topic_score_codex":0.0010801515,"about_ca_topic_score_gemma":0.0023469352,"teacher_disagreement_score":0.006071295,"about_ca_system_score_codex":0.0016337032,"about_ca_system_score_gemma":0.00088003755,"threshold_uncertainty_score":0.020310521},"labels":[],"label_agreement":null},{"id":"W1994156427","doi":"10.1016/j.disc.2009.04.002","title":"Research problems on Gray codes and universal cycles","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Gray code; Gray (unit); Mathematics; De Bruijn sequence; Discrete mathematics; Combinatorics; Algorithm","score_opus":0.039846901217051485,"score_gpt":0.30825031101059897,"score_spread":0.2684034097935475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994156427","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27946204,0.065813266,0.25013047,0.073994905,0.0048464485,0.00013873307,0.0019801655,0.0004792505,0.3231547],"genre_scores_gemma":[0.81943417,0.039155956,0.033508644,0.0058573005,0.008511982,0.00025310199,0.0013595066,0.00036863683,0.09155071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903667,0.00029558808,0.000042132444,0.0002738816,0.00019418316,0.00015756971],"domain_scores_gemma":[0.99507326,0.0034816642,0.0003222927,0.00043229817,0.00041958274,0.00027085235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012845608,0.0012454665,0.0016042709,0.0035691098,0.0030951577,0.0042894725,0.0018604455,0.0030512419,0.0137717],"category_scores_gemma":[0.008117388,0.00085743895,0.0011276535,0.0070753032,0.0069418885,0.01159921,0.0031902576,0.0054270383,0.001507168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001082486,0.0000065903314,0.000057997713,0.000042098054,0.000003734295,0.00001132386,0.00007880102,0.00052786595,0.000055362285,0.99245363,0.002253223,0.0044985707],"study_design_scores_gemma":[0.0000039853558,0.0000028294462,0.000030925454,0.000011659658,0.0000026876203,0.000015773832,0.000030641924,0.0005626871,0.00004139653,0.99578923,0.0035047312,0.0000034356538],"about_ca_topic_score_codex":0.002324874,"about_ca_topic_score_gemma":0.0015134094,"teacher_disagreement_score":0.0137717,"about_ca_system_score_codex":0.003725004,"about_ca_system_score_gemma":0.0017153273,"threshold_uncertainty_score":0.046070993},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011533567343500301,"score_gpt":0.24152224109198725,"score_spread":0.22998867374848694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994268719","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66092616,0.0023404872,0.15681925,0.0076121176,0.0010127793,0.00012261474,0.00060848147,0.00030488582,0.17025317],"genre_scores_gemma":[0.9486635,0.001657924,0.011525177,0.0007987978,0.00092093414,0.00009620673,0.00037061915,0.00012812042,0.035838854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989409,0.00027126432,0.000045314013,0.00015283827,0.00032219765,0.0002674079],"domain_scores_gemma":[0.9961733,0.0020482372,0.0005247209,0.00039079532,0.00041991464,0.00044294313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013772137,0.001173118,0.0010512057,0.0037008794,0.00298231,0.0031081364,0.000983744,0.0017580597,0.0055738376],"category_scores_gemma":[0.004876408,0.00075570226,0.0009670993,0.0028386253,0.0044634384,0.0062891394,0.0039894106,0.0035172713,0.00079409714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039719183,0.000013793901,0.00011344839,0.000017835931,0.0000029608373,0.00006128766,0.00014615488,0.0005766414,0.00023984202,0.9967602,0.00053163496,0.0014963981],"study_design_scores_gemma":[0.000013013565,0.000013296483,0.00007434701,0.000014974408,0.0000053513404,0.00010847291,0.000047234582,0.0021525847,0.00030181522,0.9959287,0.0013312222,0.000008900797],"about_ca_topic_score_codex":0.0007674189,"about_ca_topic_score_gemma":0.0005977021,"teacher_disagreement_score":0.0055738376,"about_ca_system_score_codex":0.0019480814,"about_ca_system_score_gemma":0.0010586915,"threshold_uncertainty_score":0.01864636},"labels":[],"label_agreement":null},{"id":"W1994563618","doi":"10.1016/j.disc.2014.12.023","title":"Threefold triple systems with nonsingular <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math>","year":2015,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Invertible matrix; Mathematics; Combinatorics; Discrete mathematics; Pure mathematics","score_opus":0.017982152610338732,"score_gpt":0.22790358011279457,"score_spread":0.20992142750245585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994563618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3266673,0.001171194,0.43718675,0.0026836589,0.0014987087,0.00020114183,0.0016050157,0.0015554966,0.22743066],"genre_scores_gemma":[0.8904595,0.00052431965,0.034931116,0.00045963138,0.00039507658,0.00013981249,0.0012265841,0.0003186088,0.07154534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993387,0.00011268927,0.000042348,0.000108113214,0.0002274654,0.00017072087],"domain_scores_gemma":[0.9987147,0.00021113567,0.00019262699,0.00017957327,0.0004279024,0.0002740749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056257076,0.00050953374,0.00061336457,0.0017792576,0.0014389285,0.0034887632,0.00055008417,0.0010947358,0.024841288],"category_scores_gemma":[0.0018059562,0.00033901192,0.0005952031,0.00080255605,0.0013974207,0.002853165,0.0021112775,0.0016643306,0.004410088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060408467,0.000025450905,0.0004046168,0.00004006629,0.000011819663,0.00025845948,0.00018331593,0.0026369148,0.0020704244,0.98057884,0.0056305304,0.008099096],"study_design_scores_gemma":[0.000039698494,0.00007697259,0.00068718207,0.000039791816,0.000016044798,0.00047200578,0.00046835517,0.032936614,0.0045595514,0.94232213,0.018328365,0.000053420066],"about_ca_topic_score_codex":0.0017102755,"about_ca_topic_score_gemma":0.0020198277,"teacher_disagreement_score":0.024841288,"about_ca_system_score_codex":0.0013025189,"about_ca_system_score_gemma":0.00091033144,"threshold_uncertainty_score":0.083102345},"labels":[],"label_agreement":null},{"id":"W1994872708","doi":"10.1016/j.disc.2008.08.007","title":"Some topological properties of star graphs: The surface area and volume","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Star (game theory); Combinatorics; Graph; Star network; Discrete mathematics; Topological graph theory; A* search algorithm; Surface (topology); Topology (electrical circuits); Line graph; Voltage graph; Network topology; Computer science; Geometry; Mathematical analysis","score_opus":0.04434381256212042,"score_gpt":0.2259252630297574,"score_spread":0.181581450467637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994872708","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6616796,0.008462307,0.26385772,0.0039028039,0.00036263527,0.00005588578,0.00080614793,0.00041055845,0.060462426],"genre_scores_gemma":[0.98119855,0.002877954,0.011043241,0.00011589757,0.000893045,0.000049635735,0.00027992448,0.00015509459,0.0033865778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995764,0.00013743361,0.000028445078,0.00008690276,0.0001246704,0.000046197612],"domain_scores_gemma":[0.99445385,0.003460855,0.000830043,0.00033983323,0.00051076827,0.0004045839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010043201,0.000721327,0.0008316114,0.0034056196,0.00067449413,0.0028417232,0.0009915725,0.0009617383,0.0035024881],"category_scores_gemma":[0.007048024,0.0004123716,0.0006486557,0.0029969693,0.0032936605,0.0067645623,0.0011521439,0.0014177887,0.0004324202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000675362,0.000025765661,0.0018496988,0.00014623729,0.000028881665,0.00010699081,0.00035097366,0.018487267,0.003131185,0.9495673,0.0018916058,0.024346525],"study_design_scores_gemma":[0.00001077442,0.000034935565,0.0010404183,0.000019605712,0.000020447776,0.00023251794,0.00016357107,0.04040247,0.0011986978,0.95396256,0.0028955766,0.000018386922],"about_ca_topic_score_codex":0.00040259078,"about_ca_topic_score_gemma":0.0003082102,"teacher_disagreement_score":0.0035024881,"about_ca_system_score_codex":0.0007423759,"about_ca_system_score_gemma":0.00030391043,"threshold_uncertainty_score":0.011716962},"labels":[],"label_agreement":null},{"id":"W1994928089","doi":"10.1016/s0012-365x(03)00094-3","title":"A permutation group determined by an ordered set","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Permutation group; Combinatorics; Involution (esoterism); Symmetric group; Distributive lattice; Permutation (music); Primitive permutation group; Cyclic permutation; Finite group; Alternating group; Partial permutation; Discrete mathematics; Derangement; Group (periodic table); Lattice (music); Distributive property; Pure mathematics","score_opus":0.019251208069037167,"score_gpt":0.27033289119287995,"score_spread":0.25108168312384277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994928089","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43185228,0.0005626281,0.3843709,0.0015899347,0.001567362,0.00029592655,0.0009427295,0.0011928628,0.17762533],"genre_scores_gemma":[0.83747923,0.0004860186,0.07103791,0.00045251867,0.0005057123,0.0002775989,0.0010041276,0.0002852926,0.08847164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990176,0.00019246926,0.00006177667,0.0002644038,0.00025176205,0.00021194124],"domain_scores_gemma":[0.9990951,0.00030767982,0.00012072009,0.00019492091,0.00012481626,0.00015672749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050160347,0.00069123314,0.0006785457,0.0016729111,0.0020764107,0.0030438993,0.0007460752,0.0010358735,0.010140171],"category_scores_gemma":[0.0011499209,0.0003977885,0.000991444,0.0014447304,0.002522715,0.0027554557,0.0012653285,0.0012474688,0.002987515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012334395,0.0000406668,0.00021241148,0.000037073052,0.000016165155,0.00034317424,0.00031482478,0.0005101501,0.005586089,0.9799341,0.0013953847,0.011486625],"study_design_scores_gemma":[0.00006378763,0.00010135568,0.0002954313,0.000017389113,0.000024058776,0.00062272453,0.00020601135,0.0027431622,0.007406761,0.96665233,0.021827288,0.00003963396],"about_ca_topic_score_codex":0.00055012794,"about_ca_topic_score_gemma":0.00034823938,"teacher_disagreement_score":0.010140171,"about_ca_system_score_codex":0.0006687205,"about_ca_system_score_gemma":0.0010551955,"threshold_uncertainty_score":0.033922255},"labels":[],"label_agreement":null},{"id":"W1994937623","doi":"10.1016/j.disc.2006.11.035","title":"Perfect dexagon triple systems","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.009309574290791578,"score_gpt":0.21490568765407242,"score_spread":0.20559611336328085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994937623","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45938882,0.00076058926,0.19141072,0.0014958954,0.0008384126,0.00014102935,0.0011056366,0.00068088656,0.34417796],"genre_scores_gemma":[0.93313867,0.00027878993,0.016177272,0.00039581492,0.00010654621,0.00006857225,0.0006009405,0.00009788388,0.049135353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963355,0.000060278908,0.000018321596,0.00007852193,0.000095155716,0.00011409194],"domain_scores_gemma":[0.9993864,0.0001084238,0.000075603646,0.00013529822,0.00013805465,0.00015614726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024390587,0.00037481778,0.00062369794,0.0010034416,0.0018511262,0.0022423398,0.00056171534,0.0009904461,0.018972564],"category_scores_gemma":[0.0009397818,0.00029926348,0.00035885838,0.00066655525,0.0011132541,0.0023065447,0.0019478209,0.0013626984,0.0019180457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005075729,0.00001406077,0.00013107735,0.000019538693,0.0000053897643,0.00007473037,0.00008841674,0.0013844635,0.0012673021,0.9898185,0.0020286553,0.0051171444],"study_design_scores_gemma":[0.00002634384,0.000040530394,0.00019998619,0.000017117301,0.000007864379,0.00015424287,0.00026702933,0.011541686,0.0021191018,0.97436136,0.011247583,0.000017097138],"about_ca_topic_score_codex":0.00075877924,"about_ca_topic_score_gemma":0.0008838157,"teacher_disagreement_score":0.018972564,"about_ca_system_score_codex":0.00062248233,"about_ca_system_score_gemma":0.00047489096,"threshold_uncertainty_score":0.06346959},"labels":[],"label_agreement":null},{"id":"W1995612970","doi":"10.1016/s0012-365x(02)00260-1","title":"On cop-win graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Calgary; Université de Montréal","funders":"","keywords":"Chordal graph; Mathematics; Combinatorics; Discrete mathematics; Indifference graph; Graph","score_opus":0.034749443931359224,"score_gpt":0.290733015575863,"score_spread":0.2559835716445038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995612970","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4362088,0.001456853,0.20872952,0.007521042,0.0011214204,0.00033387713,0.0011494296,0.00094907876,0.3425299],"genre_scores_gemma":[0.8602639,0.001534823,0.02799954,0.0015271184,0.0006890013,0.0003277877,0.0013374394,0.0008531057,0.105467185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989231,0.00023100711,0.00003620306,0.00023011398,0.00024653983,0.00033297937],"domain_scores_gemma":[0.9963793,0.0013860684,0.00051845703,0.0005161876,0.00038880014,0.00081122055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007950561,0.0013123044,0.0017840271,0.0031021188,0.0051990906,0.0046626767,0.0022388052,0.002125943,0.022787873],"category_scores_gemma":[0.005360405,0.0011865015,0.001313177,0.0033952922,0.0030722911,0.008804456,0.005118605,0.0048507676,0.002495506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046934085,0.000025859097,0.00019111934,0.000042658845,0.000009160255,0.00006965621,0.00020421408,0.0008494209,0.00031434014,0.9887334,0.004302761,0.005210614],"study_design_scores_gemma":[0.000012494741,0.0000056152708,0.00010328916,0.000012331002,0.000009272207,0.000050883704,0.00009949993,0.002811192,0.00014506633,0.99407285,0.0026723063,0.00000522113],"about_ca_topic_score_codex":0.002748257,"about_ca_topic_score_gemma":0.0035378844,"teacher_disagreement_score":0.022787873,"about_ca_system_score_codex":0.001954236,"about_ca_system_score_gemma":0.0010293998,"threshold_uncertainty_score":0.07623303},"labels":[],"label_agreement":null},{"id":"W1995620335","doi":"10.1016/j.disc.2007.03.047","title":"The circular chromatic index of Goldberg snarks","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Chromatic scale; Index (typography); Edge coloring; Discrete mathematics; Graph; Computer science","score_opus":0.02154246218723333,"score_gpt":0.31200599455678596,"score_spread":0.29046353236955263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995620335","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8035543,0.0006402849,0.018822026,0.0015019091,0.00026660363,0.000037721675,0.00041616717,0.00033543634,0.17442547],"genre_scores_gemma":[0.9891452,0.00027022246,0.0022839205,0.00017005065,0.00013578466,0.000029337725,0.00019680429,0.00008334394,0.0076853153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995882,0.00009617914,0.000018822262,0.00007240373,0.000107262225,0.0001171386],"domain_scores_gemma":[0.9979887,0.0008329823,0.00033890584,0.0002668538,0.00022804872,0.00034443988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064172334,0.000327172,0.00050641387,0.002297924,0.0018850312,0.0035915985,0.0009004204,0.0009889441,0.007962888],"category_scores_gemma":[0.0034961961,0.00033388077,0.00028808656,0.0018698855,0.0025709816,0.003011457,0.0013839944,0.0011436995,0.0007782525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015386759,0.00001805469,0.0010404636,0.000028531183,0.000006527549,0.000052806154,0.00018128718,0.0028242408,0.0015539001,0.98555505,0.0031476712,0.0054375757],"study_design_scores_gemma":[0.000034413355,0.000024924735,0.0014153045,0.000019779709,0.000015411697,0.000108558736,0.00021595474,0.012623312,0.0012289861,0.9804278,0.0038637093,0.000021807786],"about_ca_topic_score_codex":0.0023755457,"about_ca_topic_score_gemma":0.002204124,"teacher_disagreement_score":0.007962888,"about_ca_system_score_codex":0.0018832127,"about_ca_system_score_gemma":0.00083022774,"threshold_uncertainty_score":0.026638508},"labels":[],"label_agreement":null},{"id":"W1996070164","doi":"10.1016/s0012-365x(01)00355-7","title":"Minimizing algebraic connectivity over connected graphs with fixed girth","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Discrete mathematics; Graph; Algebraic number; Connectivity; Girth (graph theory)","score_opus":0.03866746471566069,"score_gpt":0.27142935720184197,"score_spread":0.2327618924861813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996070164","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87955195,0.00045140932,0.09036449,0.0012291454,0.00007765867,0.000069889844,0.0002831211,0.00028644668,0.027685896],"genre_scores_gemma":[0.96513367,0.0005155885,0.02533933,0.00016211276,0.00014519907,0.000114730545,0.00033905328,0.0002057487,0.008044497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949145,0.00014802109,0.000018970439,0.00013146874,0.000114262126,0.00009581116],"domain_scores_gemma":[0.9963288,0.002121728,0.000568826,0.0002479657,0.00027457223,0.00045816385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054073986,0.0013013082,0.001162561,0.0018990347,0.0013575818,0.002441975,0.0024850115,0.0017850787,0.005001392],"category_scores_gemma":[0.005555828,0.0008888566,0.00056364684,0.0019879113,0.001931359,0.0046948614,0.002680231,0.0019615504,0.00036930045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001247481,0.00005756256,0.0011631395,0.00019449425,0.00003741897,0.00016212971,0.00035632143,0.035526942,0.00452585,0.94101715,0.0024536718,0.014380612],"study_design_scores_gemma":[0.00003101357,0.00005974528,0.00067076733,0.000024090403,0.00003419518,0.0002454785,0.00020820918,0.051194858,0.0017600326,0.9441937,0.0015617708,0.000016005682],"about_ca_topic_score_codex":0.00074614276,"about_ca_topic_score_gemma":0.0013452395,"teacher_disagreement_score":0.005001392,"about_ca_system_score_codex":0.0011365272,"about_ca_system_score_gemma":0.0003778945,"threshold_uncertainty_score":0.016731322},"labels":[],"label_agreement":null},{"id":"W1996888602","doi":"10.1016/j.disc.2011.05.037","title":"Decomposition tree of a lexicographic product of binary structures","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Lexicographical order; Binary number; Mathematics; Arithmetic","score_opus":0.040228358571186555,"score_gpt":0.31151545552536747,"score_spread":0.2712870969541809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996888602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40820554,0.0008785083,0.49646762,0.0011312864,0.00024594602,0.00031017003,0.0053163012,0.001346526,0.08609808],"genre_scores_gemma":[0.4908205,0.00085771875,0.4442154,0.000329528,0.00009841271,0.00020761022,0.009260393,0.0006818621,0.053528603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997235,0.000042443608,0.000024261812,0.000058340378,0.000089557376,0.000061861414],"domain_scores_gemma":[0.99931455,0.00021940816,0.00007865161,0.00008145354,0.00019562397,0.00011039944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020474612,0.00032901682,0.0005130224,0.0014289722,0.0008811934,0.001900863,0.00045797904,0.0005605192,0.013224073],"category_scores_gemma":[0.00090707204,0.0004481592,0.00058540044,0.001702682,0.0005915843,0.0016671736,0.0007538627,0.0010484633,0.0029745053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004923098,0.00022484869,0.0021967047,0.0006967384,0.000073663236,0.0015277758,0.001337056,0.0049328967,0.05610533,0.78313977,0.020145016,0.129128],"study_design_scores_gemma":[0.000082509294,0.00024735642,0.0033588891,0.00018621811,0.00013103355,0.0023609004,0.0009192212,0.03737541,0.021571793,0.8667004,0.06699954,0.00006663974],"about_ca_topic_score_codex":0.0010097321,"about_ca_topic_score_gemma":0.001678579,"teacher_disagreement_score":0.013224073,"about_ca_system_score_codex":0.00053631037,"about_ca_system_score_gemma":0.00067431066,"threshold_uncertainty_score":0.044238925},"labels":[],"label_agreement":null},{"id":"W1997658699","doi":"10.1016/j.disc.2006.10.011","title":"The structure of well-covered graphs with no cycles of length 4","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Bounded function; Discrete mathematics; Equivalence relation; Graph; Vector space; Independent set","score_opus":0.010903874820202587,"score_gpt":0.2742881681302803,"score_spread":0.2633842933100777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997658699","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95864403,0.0005572725,0.020545103,0.0010008622,0.000037234113,0.000032677235,0.00084349676,0.00017873854,0.018160533],"genre_scores_gemma":[0.9782113,0.0005204754,0.010087072,0.0002590189,0.00010927521,0.00007098939,0.0014586608,0.000109668385,0.009173559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958163,0.00008938682,0.000018898509,0.00010371476,0.00010707715,0.0000992465],"domain_scores_gemma":[0.9970059,0.0012521506,0.000648396,0.00031262104,0.00031259182,0.00046843183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033763915,0.0005016826,0.0006298603,0.0023062814,0.0016275132,0.002724164,0.0012443447,0.0013296454,0.004946335],"category_scores_gemma":[0.0025635678,0.0009330169,0.00047956823,0.0016136381,0.0015667984,0.004278489,0.0011904264,0.0010587928,0.0006267742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004781246,0.00008888958,0.0040264814,0.00018771982,0.00005160755,0.00047977697,0.001685965,0.006722602,0.013635131,0.9521812,0.006441339,0.014021117],"study_design_scores_gemma":[0.000060938637,0.00007288158,0.0035924874,0.000039377148,0.000046412846,0.000496148,0.000528136,0.021634711,0.0034031237,0.96379286,0.006297392,0.00003562148],"about_ca_topic_score_codex":0.0009647875,"about_ca_topic_score_gemma":0.0011378748,"teacher_disagreement_score":0.004946335,"about_ca_system_score_codex":0.000833977,"about_ca_system_score_gemma":0.000502574,"threshold_uncertainty_score":0.016547084},"labels":[],"label_agreement":null},{"id":"W1997887073","doi":"10.1016/j.disc.2006.06.025","title":"On a conjecture about the Randić index","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal; Polytechnique Montréal","funders":"","keywords":"Conjecture; Mathematics; Graph; Combinatorics; Index (typography); Order (exchange); Discrete mathematics; Computer science","score_opus":0.018549852329118384,"score_gpt":0.2867706539220379,"score_spread":0.2682208015929195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997887073","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25144553,0.005216401,0.09569121,0.061104678,0.0043091555,0.00008211506,0.00086915446,0.0008271428,0.5804546],"genre_scores_gemma":[0.9197176,0.0023477825,0.023878941,0.00648046,0.005217284,0.00015325473,0.000713771,0.00043993114,0.041051075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982419,0.0004639761,0.00008055748,0.00055267516,0.00040372036,0.00025713863],"domain_scores_gemma":[0.99019086,0.006102366,0.0007928686,0.0014695893,0.0007648832,0.0006793443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025900246,0.00069302204,0.0018424331,0.0028687962,0.0036171044,0.0054656086,0.0022103123,0.003323167,0.015634503],"category_scores_gemma":[0.018218676,0.00056688214,0.0009973557,0.0026939334,0.008466605,0.01344426,0.003909903,0.006553111,0.0022939339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040350358,0.000010635379,0.00018812311,0.000022847858,0.0000034879233,0.000017001057,0.0000959825,0.0002641915,0.00012002184,0.99287874,0.0036212434,0.0027373175],"study_design_scores_gemma":[0.000014721428,0.0000069856687,0.00013740323,0.000013599561,0.000003858095,0.000036636127,0.00003505271,0.00078984414,0.00009042606,0.9955154,0.0033485964,0.0000075173775],"about_ca_topic_score_codex":0.0012086303,"about_ca_topic_score_gemma":0.0008958926,"teacher_disagreement_score":0.015634503,"about_ca_system_score_codex":0.002123534,"about_ca_system_score_gemma":0.00082435255,"threshold_uncertainty_score":0.05230266},"labels":[],"label_agreement":null},{"id":"W1998044937","doi":"10.1016/s0012-365x(00)00181-3","title":"The ultimate categorical matching in a graph","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Categorical variable; Factor-critical graph; Matching (statistics); Graph; Edge-transitive graph; Discrete mathematics; Graph power; Line graph; Statistics","score_opus":0.02454482641561275,"score_gpt":0.3128628851969006,"score_spread":0.28831805878128786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998044937","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44584763,0.0015725491,0.30733094,0.014265501,0.00095793186,0.00014365163,0.0011144483,0.0009509441,0.2278164],"genre_scores_gemma":[0.93950844,0.0004983083,0.030978631,0.0012340925,0.0004428653,0.000095686955,0.0005493444,0.00019304852,0.026499683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832445,0.0004962923,0.00009354556,0.00047181768,0.0003266565,0.00028714622],"domain_scores_gemma":[0.9976299,0.0009926996,0.00021791879,0.00038940247,0.00033598696,0.00043415927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013705877,0.0003998949,0.0010322998,0.0025860646,0.004056187,0.005157423,0.0018795666,0.0028411828,0.008630736],"category_scores_gemma":[0.0048654317,0.0006415506,0.0012026179,0.0026704092,0.005409088,0.012818239,0.0043765525,0.0039061606,0.0012210901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012881253,0.000007340895,0.00009005124,0.000011616806,0.0000018930106,0.000017027369,0.00010395987,0.00012826476,0.00014307386,0.99757916,0.0004280729,0.001476693],"study_design_scores_gemma":[0.000004713226,0.000004248315,0.000059335947,0.0000046315954,0.0000037771636,0.000032138636,0.000060364117,0.00061604904,0.00012880896,0.99761,0.0014716128,0.000004421623],"about_ca_topic_score_codex":0.00150597,"about_ca_topic_score_gemma":0.0013718349,"teacher_disagreement_score":0.008630736,"about_ca_system_score_codex":0.0017432028,"about_ca_system_score_gemma":0.0009872881,"threshold_uncertainty_score":0.028872669},"labels":[],"label_agreement":null},{"id":"W1998140754","doi":"10.1016/s0012-365x(99)00206-x","title":"Variable neighborhood search for extremal graphs: 1 The AutoGraphiX system","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":209,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal; Polytechnique Montréal","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Variable neighborhood search; Combinatorics; Variable (mathematics); Combinatorial optimization; Discrete mathematics; Metaheuristic; Mathematical optimization","score_opus":0.024019720620125168,"score_gpt":0.28211261587146697,"score_spread":0.2580928952513418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998140754","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47415972,0.0021446105,0.48986408,0.0025753703,0.00016956036,0.0000935097,0.0004796521,0.0004216674,0.030091805],"genre_scores_gemma":[0.9354504,0.0006907402,0.05086321,0.00027362313,0.0001526608,0.00008853346,0.0003218207,0.00012473532,0.012034373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942505,0.0002677588,0.000013640385,0.00011805451,0.000082858554,0.00009273905],"domain_scores_gemma":[0.9970023,0.0019794833,0.00030266287,0.00023192712,0.00021236521,0.00027113166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001005891,0.0004163746,0.0015873936,0.0011066092,0.0013711537,0.0017121118,0.0018503317,0.0020758368,0.0059142136],"category_scores_gemma":[0.0066949436,0.00049460656,0.0006620444,0.0009744796,0.0016293995,0.0027212882,0.0022455875,0.0016905796,0.00036778513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020837132,0.00009094322,0.0014253856,0.0001541068,0.00007880671,0.00014877474,0.00018482114,0.24263568,0.0012938051,0.72974175,0.006324615,0.01771299],"study_design_scores_gemma":[0.000042702333,0.000037512815,0.00030889956,0.000013917982,0.000014522434,0.00005644621,0.000048109658,0.70450133,0.00023317675,0.29367253,0.0010520954,0.000018721319],"about_ca_topic_score_codex":0.0028985334,"about_ca_topic_score_gemma":0.0033830132,"teacher_disagreement_score":0.0059142136,"about_ca_system_score_codex":0.0011567572,"about_ca_system_score_gemma":0.00084476155,"threshold_uncertainty_score":0.019784987},"labels":[],"label_agreement":null},{"id":"W1999074957","doi":"10.1016/j.disc.2011.01.013","title":"On Roussel–Rubio-type lemmas and their consequences","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"EGIDE; Agence Nationale de la Recherche; Engineering and Physical Sciences Research Council; Ministère de l'Europe et des Affaires Étrangères; Providence Health Care","keywords":"Mathematics; Type (biology); Combinatorics; Discrete mathematics","score_opus":0.09734350068430835,"score_gpt":0.31419659697815056,"score_spread":0.2168530962938422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999074957","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16579907,0.014029539,0.26607704,0.029137127,0.0043050474,0.00013532751,0.0009501266,0.00077379675,0.5187929],"genre_scores_gemma":[0.8565305,0.010445419,0.053053558,0.0063636512,0.0037588107,0.00027935626,0.0010068759,0.00069476786,0.06786703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976659,0.00096209784,0.00014016415,0.00044526617,0.00045304262,0.00033359075],"domain_scores_gemma":[0.9921828,0.0049389955,0.00062761566,0.00058295956,0.000977385,0.0006903124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044543026,0.0018008128,0.0023113955,0.0055604614,0.0048139542,0.0044871196,0.002390058,0.0033822302,0.01603962],"category_scores_gemma":[0.014918369,0.0012560292,0.0025653436,0.005146581,0.007755346,0.017728167,0.0083125625,0.009827777,0.003136183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040355353,0.000021843929,0.00011486647,0.000040182345,0.000010739287,0.000096629534,0.00019896551,0.00015707168,0.00020600719,0.99475807,0.0021866106,0.0021685779],"study_design_scores_gemma":[0.000019130002,0.0000118778735,0.00018103057,0.000021255266,0.00001422428,0.00012203561,0.00009220363,0.0009079986,0.00016078987,0.9948468,0.0036072421,0.0000154755],"about_ca_topic_score_codex":0.0019333381,"about_ca_topic_score_gemma":0.0015754512,"teacher_disagreement_score":0.01603962,"about_ca_system_score_codex":0.002282171,"about_ca_system_score_gemma":0.0008807812,"threshold_uncertainty_score":0.05365783},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007775992139421603,"score_gpt":0.19697964970249354,"score_spread":0.18920365756307195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999323173","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63205826,0.0023190822,0.294158,0.0017773644,0.00030388538,0.00007028198,0.00016534257,0.0003552367,0.06879259],"genre_scores_gemma":[0.9625317,0.0009960672,0.022646436,0.00024220896,0.00014413595,0.00004588004,0.000083890496,0.000042589563,0.013267129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99984884,0.000041369265,0.0000062740387,0.000031515985,0.000036965874,0.000034957586],"domain_scores_gemma":[0.9993119,0.00034160216,0.00008958029,0.000072209565,0.000070358925,0.00011426742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027399138,0.00024179902,0.00041849873,0.0008329493,0.00092809036,0.0014153746,0.0004954037,0.0009141662,0.0035695576],"category_scores_gemma":[0.0015714285,0.00026972668,0.0002905498,0.0008704288,0.001135543,0.0017138192,0.0009315109,0.0009371468,0.00030144234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007260645,0.000029211009,0.00029306873,0.000032161603,0.0000108234335,0.00009803821,0.00015205685,0.009538389,0.0031522224,0.97036797,0.0014304424,0.014822902],"study_design_scores_gemma":[0.000015786525,0.000014334973,0.0001935692,0.0000063350008,0.0000061133974,0.00008799956,0.00007515782,0.033372097,0.0005863144,0.96340066,0.0022357027,0.000005913582],"about_ca_topic_score_codex":0.0005516412,"about_ca_topic_score_gemma":0.0005971939,"teacher_disagreement_score":0.0035695576,"about_ca_system_score_codex":0.00048521085,"about_ca_system_score_gemma":0.00029044427,"threshold_uncertainty_score":0.011941314},"labels":[],"label_agreement":null},{"id":"W1999565878","doi":"10.1016/j.disc.2008.04.023","title":"Achieving maximum chromatic index in multigraphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Multigraph; Upper and lower bounds; Edge coloring; Bipartite graph; Multiplicity (mathematics); Discrete mathematics; Graph","score_opus":0.02820827059957298,"score_gpt":0.28811301385298915,"score_spread":0.25990474325341617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999565878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43263575,0.0015250097,0.44206458,0.0032554567,0.0002216613,0.00017693242,0.0012526558,0.0027062462,0.11616168],"genre_scores_gemma":[0.8567168,0.000704172,0.1304727,0.0006769535,0.00017269995,0.0001506527,0.00066071434,0.00063845114,0.009806828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987746,0.0002837764,0.000041934694,0.00028686036,0.0003046591,0.00030818506],"domain_scores_gemma":[0.99467576,0.0030120392,0.00037520519,0.0009778189,0.00031433481,0.0006449104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015394196,0.0013015821,0.0014179912,0.0018647113,0.0022464658,0.0036474369,0.0024162428,0.0014588187,0.006314224],"category_scores_gemma":[0.005580494,0.0008922925,0.0007747639,0.0026955134,0.0019210568,0.0055639194,0.0042237164,0.0027917097,0.0011607031],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000955885,0.00029210077,0.0024516543,0.000610307,0.00010940447,0.00023370291,0.00083700934,0.074645266,0.03250319,0.79538226,0.018875625,0.07310359],"study_design_scores_gemma":[0.00007309247,0.00008943418,0.0006563027,0.000058622612,0.000051187126,0.00014837996,0.00016781516,0.10487893,0.009686816,0.87952983,0.004632769,0.000026851296],"about_ca_topic_score_codex":0.0010592903,"about_ca_topic_score_gemma":0.0033156876,"teacher_disagreement_score":0.006314224,"about_ca_system_score_codex":0.0029292223,"about_ca_system_score_gemma":0.0012248491,"threshold_uncertainty_score":0.021253109},"labels":[],"label_agreement":null},{"id":"W2000440641","doi":"10.1016/j.disc.2003.10.024","title":"Absorbing sets in arc-coloured tournaments","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Université de Montréal","funders":"","keywords":"Tournament; Mathematics; Vertex (graph theory); Monochromatic color; Combinatorics; Arc (geometry); Path (computing); Section (typography); Discrete mathematics; Graph; Geometry; Computer science","score_opus":0.027925092144595185,"score_gpt":0.3189830667795664,"score_spread":0.2910579746349712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000440641","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.725018,0.00064485875,0.21481988,0.0011872333,0.00020884267,0.00012393619,0.00049043226,0.00053278706,0.056974005],"genre_scores_gemma":[0.9612313,0.00040223432,0.021680737,0.00025977707,0.00016565905,0.00019590888,0.00062004273,0.00015361278,0.015290618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974137,0.000760931,0.0001685856,0.00047416013,0.0005619868,0.0006206112],"domain_scores_gemma":[0.9851864,0.010104545,0.0012780793,0.00082017074,0.00078648695,0.0018242231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002340972,0.0009015271,0.0019536882,0.0026961595,0.0042364225,0.010731755,0.0029910423,0.0026135524,0.011243109],"category_scores_gemma":[0.010576804,0.0017853072,0.001938443,0.0031192757,0.0038118132,0.0052987626,0.003164876,0.0037783182,0.00097417383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004058385,0.00019876524,0.001537726,0.000113414055,0.000085585176,0.0003083993,0.00090897013,0.012875487,0.002607506,0.97007465,0.0026565674,0.00822704],"study_design_scores_gemma":[0.0001451085,0.000054519838,0.0006189186,0.000027828833,0.000063317624,0.00018316077,0.00019566788,0.042839352,0.0007891644,0.95321643,0.0018411016,0.000025404737],"about_ca_topic_score_codex":0.0020513837,"about_ca_topic_score_gemma":0.0021806601,"teacher_disagreement_score":0.011243109,"about_ca_system_score_codex":0.0021663865,"about_ca_system_score_gemma":0.00089451426,"threshold_uncertainty_score":0.03761196},"labels":[],"label_agreement":null},{"id":"W2000477684","doi":"10.1016/j.disc.2010.04.001","title":"Corrigendum to “<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mrow><mml:mo>(</mml:mo><mml:mi>p</mml:mi><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>-total labelling of graphs” [Discrete Math. 308 (2008) 496–513]","year":2010,"lang":"lv","type":"erratum","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of the Fraser Valley","funders":"","keywords":"Scroll; Algorithm; Mathematics; Computer science; Discrete mathematics; Theology; Philosophy","score_opus":0.019285442878727937,"score_gpt":0.23935867092090632,"score_spread":0.22007322804217838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000477684","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00097630755,0.005831826,0.020948239,0.08524965,0.6578345,0.00015593623,0.009233962,0.0051140226,0.2146556],"genre_scores_gemma":[0.016755821,0.008627106,0.016739657,0.023140542,0.05909481,0.00025020825,0.012393404,0.0050528254,0.85794556],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99863356,0.00026905665,0.00011788612,0.00021531533,0.0006586293,0.00010548334],"domain_scores_gemma":[0.99430335,0.0016649641,0.00021988273,0.00054619875,0.002957834,0.0003078497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013948977,0.0020006162,0.0016439541,0.003672938,0.002314201,0.003332991,0.002691265,0.0024339661,0.2773517],"category_scores_gemma":[0.014105952,0.0009868508,0.0012883093,0.0031429825,0.0015948866,0.003335315,0.001323306,0.004752847,0.13004906],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014565778,0.000007764577,0.000022487593,0.0000734969,0.000005185229,0.000029812965,0.000016646416,0.00006638726,0.000052956213,0.003292516,0.9910731,0.0053452346],"study_design_scores_gemma":[0.000026892896,0.000033882523,0.00079689577,0.0001727062,0.000029583145,0.00023805608,0.00007917283,0.00097600796,0.00049895386,0.017356712,0.9797468,0.000044209308],"about_ca_topic_score_codex":0.013014976,"about_ca_topic_score_gemma":0.018909167,"teacher_disagreement_score":0.2773517,"about_ca_system_score_codex":0.004234739,"about_ca_system_score_gemma":0.0016577021,"threshold_uncertainty_score":0.9278339},"labels":[],"label_agreement":null},{"id":"W2000525347","doi":"10.1016/j.disc.2006.07.013","title":"Research problems from the 5th Slovenian Conference (Bled, 2003)","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.0639297673745002,"score_gpt":0.30603513295104606,"score_spread":0.24210536557654588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000525347","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019764813,0.33943444,0.06691597,0.124244854,0.09485319,0.00014557413,0.0052324436,0.0010437513,0.34836486],"genre_scores_gemma":[0.20235376,0.13194145,0.060833726,0.0065470766,0.03080641,0.00035844668,0.011430211,0.0014269089,0.5543021],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843687,0.00038066934,0.0001136661,0.000436797,0.00042855905,0.00020340076],"domain_scores_gemma":[0.99862814,0.00043119607,0.000057683377,0.00019265254,0.00040001882,0.0002903036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019291228,0.0014716388,0.0017232226,0.0023084339,0.0016946807,0.005870921,0.001044183,0.0015610311,0.03645355],"category_scores_gemma":[0.0031203304,0.0006282865,0.001345043,0.0034251884,0.0016443189,0.0024423595,0.0022466541,0.0030227294,0.008225266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024841665,0.000085695734,0.00057658716,0.0007707882,0.00009721756,0.00013358558,0.00027400232,0.003867147,0.00062642345,0.11729015,0.66454375,0.21148631],"study_design_scores_gemma":[0.000058138085,0.000060880786,0.0020749008,0.000555859,0.00008854344,0.0002845112,0.00021201186,0.0051006787,0.0010004784,0.10578944,0.88473994,0.000034571585],"about_ca_topic_score_codex":0.0063202945,"about_ca_topic_score_gemma":0.009147511,"teacher_disagreement_score":0.03645355,"about_ca_system_score_codex":0.0067586373,"about_ca_system_score_gemma":0.0033347604,"threshold_uncertainty_score":0.121949255},"labels":[],"label_agreement":null},{"id":"W2000536858","doi":"10.1016/s0012-365x(00)00270-3","title":"A derivation of an affine plane of order 4 from a triangle-free 3-colored K16","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Mathematics; Colored; Affine transformation; Combinatorics; Plane (geometry); Affine plane (incidence geometry); Order (exchange); Set (abstract data type); Discrete mathematics; Pure mathematics; Geometry; Computer science","score_opus":0.011191066028033032,"score_gpt":0.2082213218269116,"score_spread":0.1970302557988786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000536858","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24016696,0.0004952285,0.31382123,0.0013589689,0.0012460792,0.00019089245,0.00061142177,0.00062117877,0.44148797],"genre_scores_gemma":[0.75356555,0.0005940958,0.14192615,0.0005052779,0.00013657128,0.00007599278,0.00040003489,0.00078714883,0.10200917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99981457,0.000025598236,0.0000073095853,0.000033814038,0.0000722915,0.000046458368],"domain_scores_gemma":[0.99987805,0.000024332461,0.000015616262,0.000021795593,0.000037460784,0.000022785975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014894767,0.00058531814,0.0004898284,0.0006855403,0.0015042775,0.001513648,0.0009188526,0.0009216281,0.012304652],"category_scores_gemma":[0.0005534748,0.00042884017,0.0008438625,0.0004763776,0.0013636663,0.0013226885,0.0012557954,0.0016379195,0.0033321513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023561526,0.000016201524,0.00007962343,0.00002940992,0.000006335623,0.0004384329,0.00021929434,0.0013457687,0.0044201254,0.9861351,0.0014496822,0.005836299],"study_design_scores_gemma":[0.000040666964,0.000053379303,0.00030165736,0.00003690001,0.000017882368,0.00078648597,0.00024586957,0.008599268,0.006921502,0.920141,0.0628199,0.00003547682],"about_ca_topic_score_codex":0.0030878773,"about_ca_topic_score_gemma":0.0030378914,"teacher_disagreement_score":0.012304652,"about_ca_system_score_codex":0.0010732419,"about_ca_system_score_gemma":0.0006130236,"threshold_uncertainty_score":0.041163206},"labels":[],"label_agreement":null},{"id":"W2000564617","doi":"10.1016/j.disc.2007.07.103","title":"Small proper double blocking sets in Galois planes of prime order","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Blocking (statistics); Prime (order theory); Discrete mathematics; Disjoint sets; Blocking set; Disjoint union (topology); Set (abstract data type); Line (geometry); Order (exchange); Projective space; Pure mathematics; Geometry; Projective test; Collineation; Computer science","score_opus":0.12055054838878872,"score_gpt":0.3578941166804534,"score_spread":0.2373435682916647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000564617","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8579984,0.0009581412,0.08060299,0.00096032844,0.0001376034,0.00007668927,0.0003087714,0.00043747952,0.058519688],"genre_scores_gemma":[0.9795461,0.00041590762,0.009072023,0.00013838323,0.00008576324,0.000113060305,0.00025268353,0.00011722523,0.010258767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989164,0.00021267617,0.00006552164,0.00021402963,0.00029153674,0.00029993634],"domain_scores_gemma":[0.99685776,0.001554937,0.00044092193,0.00039790125,0.00017855235,0.0005699444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011295435,0.001198275,0.0019401098,0.0024400929,0.004207279,0.00721972,0.0012711901,0.0011234113,0.0064682956],"category_scores_gemma":[0.0028717467,0.0015393785,0.0010369148,0.0021671515,0.0061089383,0.007150632,0.0036541254,0.0036317587,0.00086256955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018434615,0.000026313819,0.00044863668,0.00003388726,0.000014719371,0.00008681379,0.00051266974,0.00093660585,0.00165365,0.9941327,0.00038220076,0.0015874151],"study_design_scores_gemma":[0.00010221756,0.00004742686,0.0004729653,0.000026224616,0.00004641069,0.00017731091,0.0004653523,0.0035316788,0.0026648801,0.98939544,0.0030477743,0.000022360278],"about_ca_topic_score_codex":0.0015521707,"about_ca_topic_score_gemma":0.0015243043,"teacher_disagreement_score":0.00721972,"about_ca_system_score_codex":0.0020110742,"about_ca_system_score_gemma":0.000702337,"threshold_uncertainty_score":0.021638632},"labels":[],"label_agreement":null},{"id":"W2001078369","doi":"10.1016/j.disc.2014.07.005","title":"Pairs of orthogonal countable ordinals","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Countable set; Mathematics; Combinatorics; Constant (computer programming); Identity (music); Set (abstract data type); Discrete mathematics; Order (exchange); Pure mathematics; Computer science; Physics","score_opus":0.016721744230815138,"score_gpt":0.24130662422666968,"score_spread":0.22458487999585455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001078369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.267392,0.0014909585,0.6187436,0.0018393592,0.0008365553,0.00020464513,0.0009057422,0.00058401254,0.10800309],"genre_scores_gemma":[0.82244337,0.0007683437,0.146791,0.00041610943,0.00027468213,0.00045410293,0.0010431119,0.00018350795,0.027625838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99613094,0.0013810756,0.00039592842,0.0005996791,0.0010323549,0.00045998857],"domain_scores_gemma":[0.9941381,0.0027896862,0.00063931255,0.0006490214,0.0011083786,0.0006753636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002554928,0.0008393955,0.0010837147,0.004520518,0.0024741301,0.0072496664,0.0010878552,0.0012858056,0.008122891],"category_scores_gemma":[0.010200197,0.00092873257,0.0013693352,0.00259752,0.0034055403,0.008343331,0.004817517,0.0024205395,0.0011115967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045404104,0.0000137053685,0.00033684706,0.000031218704,0.00001647118,0.000102919454,0.00020838637,0.00016863912,0.00063735095,0.99313486,0.00045199736,0.004852289],"study_design_scores_gemma":[0.000021023456,0.00002943175,0.00042000363,0.00003387774,0.000028908851,0.00032375436,0.00034327278,0.002100646,0.0011025787,0.98538405,0.010182099,0.000030216432],"about_ca_topic_score_codex":0.0003561443,"about_ca_topic_score_gemma":0.0003936341,"teacher_disagreement_score":0.008122891,"about_ca_system_score_codex":0.0010759081,"about_ca_system_score_gemma":0.00066920824,"threshold_uncertainty_score":0.027173758},"labels":[],"label_agreement":null},{"id":"W2001348807","doi":"10.1016/j.disc.2013.07.006","title":"On the determinant of bipartite graphs","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Bipartite graph; Mathematics; Edge-transitive graph; Discrete mathematics; Voltage graph; Factor-critical graph; Line graph; Graph; Vertex-transitive graph","score_opus":0.03599603487478095,"score_gpt":0.2908238086192669,"score_spread":0.25482777374448595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001348807","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48844492,0.005362589,0.31819212,0.009553277,0.001896168,0.00008667834,0.00072141463,0.0006375897,0.17510521],"genre_scores_gemma":[0.9541112,0.0024558564,0.013772356,0.0009039538,0.001509171,0.000080035854,0.0004279219,0.00036557726,0.026373785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893504,0.0004482221,0.000032847824,0.00016896611,0.0002512589,0.00016359634],"domain_scores_gemma":[0.9934615,0.0038479427,0.0005268673,0.0004651983,0.0007887048,0.00090972456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012663956,0.0009018591,0.0015573654,0.002777761,0.0012024054,0.0025241973,0.0014689071,0.0016458961,0.008933073],"category_scores_gemma":[0.008946842,0.0005883821,0.00063497334,0.001827775,0.004541248,0.0041645984,0.00222162,0.002629382,0.0011802679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031610693,0.00003101635,0.0003433395,0.00004997139,0.000008085259,0.000064035616,0.00015056906,0.0031595847,0.0005382537,0.98681414,0.004000065,0.0048093474],"study_design_scores_gemma":[0.000009114994,0.000009237967,0.0002706427,0.00001590061,0.0000045474876,0.00006750561,0.000048889866,0.018308591,0.00012544903,0.9795247,0.0016041053,0.000011478793],"about_ca_topic_score_codex":0.0020742577,"about_ca_topic_score_gemma":0.0020118686,"teacher_disagreement_score":0.008933073,"about_ca_system_score_codex":0.0014421977,"about_ca_system_score_gemma":0.0007757572,"threshold_uncertainty_score":0.0298841},"labels":[],"label_agreement":null},{"id":"W2001705063","doi":"10.1016/j.disc.2003.11.033","title":"Pancyclic BIBD block-intersection graphs","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Intersection (aeronautics); Combinatorics; Block (permutation group theory); Discrete mathematics","score_opus":0.007389320496746208,"score_gpt":0.2008945973059468,"score_spread":0.1935052768092006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001705063","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4654821,0.00097106374,0.1832245,0.0025023948,0.000289806,0.00023875592,0.0032125611,0.0011227545,0.3429561],"genre_scores_gemma":[0.91340315,0.00066764967,0.041662734,0.0007712172,0.0001222625,0.00020809376,0.001842113,0.00021420831,0.04110853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999329,0.0001439761,0.000029318633,0.00009543904,0.00022966736,0.00017267083],"domain_scores_gemma":[0.99772996,0.00068034034,0.00032916715,0.0004514138,0.00046648245,0.00034260756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043104065,0.000384215,0.0008095256,0.0017225221,0.0020039484,0.0018710757,0.0012112054,0.0009942757,0.019175142],"category_scores_gemma":[0.0021135542,0.0004780771,0.00033946408,0.0022136096,0.0008690572,0.0023589144,0.0015728703,0.0018121747,0.0023656208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027599663,0.000048974878,0.00039630308,0.000099324476,0.000017666924,0.00013188508,0.00015168967,0.004573979,0.004451204,0.9663489,0.0088624135,0.014641724],"study_design_scores_gemma":[0.00008658113,0.00007417855,0.00072545634,0.000042246887,0.000030229767,0.0003846522,0.00016790241,0.04327682,0.0041076667,0.93323004,0.017846301,0.000027853988],"about_ca_topic_score_codex":0.0011330012,"about_ca_topic_score_gemma":0.0017585852,"teacher_disagreement_score":0.019175142,"about_ca_system_score_codex":0.00091506355,"about_ca_system_score_gemma":0.0006779307,"threshold_uncertainty_score":0.064147234},"labels":[],"label_agreement":null},{"id":"W2002806015","doi":"10.1016/s0012-365x(99)00406-9","title":"Enumeration of planar two-face maps","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Combinatorics; Antipodal point; Enumeration; Vertex (graph theory); Humanities; Geometry; Art; Graph","score_opus":0.025036320994012477,"score_gpt":0.3005751101780053,"score_spread":0.2755387891839928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002806015","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7025795,0.00069353933,0.16085558,0.00094443216,0.00017775656,0.000089632056,0.000593545,0.00045766088,0.13360839],"genre_scores_gemma":[0.9086009,0.0006202282,0.054299977,0.00020172611,0.000079517646,0.00010022575,0.0009878747,0.00010723028,0.03500236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966073,0.000058008838,0.000020156072,0.0000449056,0.0001251312,0.000091150076],"domain_scores_gemma":[0.9992848,0.00031231772,0.000067125846,0.00008429069,0.00014631519,0.00010524977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001919577,0.00048202634,0.0005664668,0.0015364914,0.0010144699,0.00238966,0.0008736506,0.0008762889,0.008036392],"category_scores_gemma":[0.0017769886,0.0002747238,0.0003752284,0.0013446439,0.00078832754,0.0018778213,0.0017776001,0.0012149024,0.0011521626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017030578,0.000085418076,0.0010101891,0.00017400793,0.000014207295,0.00024854817,0.00042591573,0.006122959,0.006748587,0.8931853,0.0050568837,0.08675774],"study_design_scores_gemma":[0.000030778592,0.000054453212,0.001215915,0.00004850703,0.000021682703,0.00060346164,0.00039599577,0.032538332,0.006292615,0.94225734,0.016512016,0.000028842927],"about_ca_topic_score_codex":0.0007025891,"about_ca_topic_score_gemma":0.0007200351,"teacher_disagreement_score":0.008036392,"about_ca_system_score_codex":0.0006321827,"about_ca_system_score_gemma":0.00038295213,"threshold_uncertainty_score":0.026884437},"labels":[],"label_agreement":null},{"id":"W2002933371","doi":"10.1016/j.disc.2007.11.038","title":"Gray codes for column-convex polyominoes and a new class of distributive lattices","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Polyomino; Mathematics; Combinatorics; Distributive property; Hypercube; Regular polygon; Discrete mathematics; Distributive lattice; Closeness; Lattice (music); Pure mathematics","score_opus":0.06019449949469485,"score_gpt":0.32309253422045353,"score_spread":0.2628980347257587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002933371","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54858595,0.0012377491,0.32265568,0.0023518228,0.00053873425,0.00013262383,0.0010630589,0.00044455822,0.122989826],"genre_scores_gemma":[0.9241017,0.00058643223,0.048349623,0.00053813355,0.00045415954,0.00014731457,0.0004932053,0.00013556896,0.025193824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992003,0.00013654098,0.00003623435,0.00014903351,0.00032042502,0.00015755523],"domain_scores_gemma":[0.9980496,0.0007753845,0.0002455226,0.0002852412,0.00028594062,0.00035824074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006391707,0.00043281156,0.0007933419,0.0014960363,0.0017400458,0.0038793802,0.00097156176,0.0007766493,0.005426526],"category_scores_gemma":[0.0028420691,0.00037399182,0.00055147905,0.0014827662,0.003465348,0.0027155227,0.0015745882,0.0021131258,0.00053982734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021028533,0.000009503937,0.00011364307,0.000009724593,0.0000026347268,0.00003119494,0.00005538907,0.00075563515,0.00035119994,0.9947877,0.0007547345,0.0031076204],"study_design_scores_gemma":[0.000014385645,0.000009002675,0.00011327149,0.000006660123,0.0000028561797,0.00007749916,0.00003666024,0.0075898794,0.00041807783,0.9892266,0.0024943838,0.000010817583],"about_ca_topic_score_codex":0.0011521599,"about_ca_topic_score_gemma":0.0014663655,"teacher_disagreement_score":0.005426526,"about_ca_system_score_codex":0.0014422057,"about_ca_system_score_gemma":0.0010751652,"threshold_uncertainty_score":0.018153548},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019255804216648024,"score_gpt":0.2429960172408542,"score_spread":0.22374021302420619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003367147","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002422397,0.00036114696,0.26855785,0.0066555184,0.0013032941,0.0002673129,0.09349537,0.09818438,0.5287527],"genre_scores_gemma":[0.045947596,0.0016301868,0.22067617,0.002945776,0.0007043448,0.00066229474,0.15784658,0.08924015,0.48034695],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950457,0.000104886305,0.00004785851,0.00009387639,0.00019166312,0.000056998615],"domain_scores_gemma":[0.9982729,0.0005075005,0.00011070978,0.00046530282,0.00050658,0.00013704629],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00068963814,0.0010287826,0.0007968886,0.001903937,0.0009434879,0.004605981,0.0022908517,0.0014514213,0.44504252],"category_scores_gemma":[0.0039696614,0.0008891743,0.00073824206,0.0032595838,0.00068858673,0.0053520165,0.0020210855,0.0027767415,0.3194176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059946688,0.000026449505,0.00015019903,0.00020036576,0.000007148067,0.00003954077,0.00011847878,0.00042722933,0.0013061104,0.07012647,0.87822735,0.04931059],"study_design_scores_gemma":[0.000027570139,0.000009249894,0.00036105537,0.000057020738,0.0000055467217,0.00010912618,0.00006400976,0.0026584761,0.003801919,0.047108926,0.9457686,0.00002858127],"about_ca_topic_score_codex":0.00600731,"about_ca_topic_score_gemma":0.008347805,"teacher_disagreement_score":0.44504252,"about_ca_system_score_codex":0.002346203,"about_ca_system_score_gemma":0.0012088543,"threshold_uncertainty_score":0.7915795},"labels":[],"label_agreement":null},{"id":"W2003983076","doi":"10.1016/j.disc.2009.03.022","title":"A non-commutative generalization 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>-Schur functions","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; York University","funders":"","keywords":"Mathematics; Generalization; Commutative property; Morse code; Discrete mathematics; Combinatorics; Algebra over a field; Pure mathematics; Mathematical analysis; Computer science","score_opus":0.022137433859481824,"score_gpt":0.2780651951637209,"score_spread":0.2559277613042391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003983076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02622424,0.0017639594,0.6499982,0.0018190502,0.0038283712,0.00015944641,0.001607034,0.0019965074,0.31260318],"genre_scores_gemma":[0.5041838,0.0023662164,0.23387635,0.0026945865,0.0041919295,0.00033364914,0.002572019,0.0024774643,0.24730398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986364,0.0002942369,0.00010541586,0.0004752478,0.00034138781,0.00014732659],"domain_scores_gemma":[0.9985898,0.00039590694,0.0000958252,0.0004096365,0.00037116648,0.00013763765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015084896,0.00089265,0.0006091032,0.0016324634,0.0018386153,0.002458364,0.0016273042,0.0006146834,0.034424864],"category_scores_gemma":[0.002514686,0.0004154821,0.0013109647,0.0011395926,0.0018226495,0.005941255,0.00198871,0.0023652832,0.011813054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033582324,0.000031746622,0.00008080433,0.0000726585,0.000008649875,0.00013292026,0.00024595528,0.00033738397,0.0016132203,0.96769375,0.012740392,0.017009065],"study_design_scores_gemma":[0.000022038234,0.000050381692,0.00040414877,0.000030153882,0.000021232763,0.0006814732,0.00009260798,0.0056816516,0.0049143666,0.8652504,0.12280361,0.000047982667],"about_ca_topic_score_codex":0.001403028,"about_ca_topic_score_gemma":0.0018600543,"teacher_disagreement_score":0.034424864,"about_ca_system_score_codex":0.00084146525,"about_ca_system_score_gemma":0.0008472722,"threshold_uncertainty_score":0.11516267},"labels":[],"label_agreement":null},{"id":"W2004306511","doi":"10.1016/j.disc.2004.04.024","title":"Relational structures having finitely many full-cardinality restrictions","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Cardinality (data modeling); Mathematics; Isomorphism (crystallography); Class (philosophy); Construct (python library); Cardinal number (linguistics); Combinatorics; Discrete mathematics; Computer science","score_opus":0.07608432136565828,"score_gpt":0.3396243388228705,"score_spread":0.26354001745721223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004306511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40586007,0.0016965532,0.44998395,0.0043259384,0.00035021707,0.00014865187,0.0036568013,0.0020564653,0.13192134],"genre_scores_gemma":[0.9305392,0.0006768005,0.05124881,0.00042226675,0.0004003716,0.0001571986,0.00181158,0.00018173274,0.014562098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99410075,0.0013544112,0.00069174805,0.0013890507,0.001511775,0.0009522932],"domain_scores_gemma":[0.97405946,0.01366904,0.001760514,0.0073533673,0.001718058,0.0014394791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003829965,0.00094821694,0.0019089682,0.002101194,0.0040374715,0.0075270883,0.0033120103,0.0020358786,0.010818954],"category_scores_gemma":[0.0141418595,0.0018858257,0.0019415518,0.0029148296,0.0067517497,0.027927358,0.0069803055,0.006429836,0.002022442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008817185,0.000048019927,0.00042283232,0.000056603698,0.000026826374,0.00017202254,0.0003642089,0.00057845225,0.0014976263,0.991118,0.0006844295,0.004942817],"study_design_scores_gemma":[0.000019012037,0.000016510352,0.0003101686,0.000021327589,0.000037806272,0.0004353441,0.00021959058,0.0019690327,0.002333784,0.9904495,0.0041577644,0.000030195995],"about_ca_topic_score_codex":0.00048673025,"about_ca_topic_score_gemma":0.0006362279,"teacher_disagreement_score":0.010818954,"about_ca_system_score_codex":0.0016210945,"about_ca_system_score_gemma":0.0010475821,"threshold_uncertainty_score":0.036193013},"labels":[],"label_agreement":null},{"id":"W2004911149","doi":"10.1016/j.disc.2006.03.036","title":"Building blocks for the variety of absolute retracts","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Thompson Rivers University","funders":"","keywords":"Mathematics; Variety (cybernetics); Absolute (philosophy); Combinatorics; Discrete mathematics; Statistics","score_opus":0.023892377948431385,"score_gpt":0.30585175003877385,"score_spread":0.28195937209034244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004911149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30516985,0.0027347347,0.40173152,0.0032927357,0.00082066463,0.00012578203,0.0008301246,0.0018661671,0.2834285],"genre_scores_gemma":[0.9079424,0.0008248154,0.046049107,0.0006855328,0.00043460072,0.0001330631,0.0006325316,0.0005955504,0.0427025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989041,0.00020300012,0.00007904761,0.0002986622,0.00033368575,0.00018145572],"domain_scores_gemma":[0.9986519,0.0005643279,0.00014051089,0.00026496826,0.00017130919,0.00020698861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011484841,0.0007493197,0.0008644126,0.0029110129,0.0024544145,0.0038597705,0.0016117694,0.0013520586,0.017743172],"category_scores_gemma":[0.002875239,0.0007109159,0.0012596695,0.0015786603,0.0039017643,0.007976509,0.0036787956,0.0043628397,0.0029201547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011099096,0.000006346985,0.0000581789,0.000011720019,0.0000028850857,0.000033768545,0.0001215179,0.00015009767,0.00023970698,0.9957943,0.00045285735,0.0031176582],"study_design_scores_gemma":[0.000008823136,0.000013057159,0.00011577212,0.000010247177,0.000006387178,0.000084253326,0.00006646877,0.0010133517,0.0003815188,0.9937994,0.004491831,0.00000901154],"about_ca_topic_score_codex":0.0005892771,"about_ca_topic_score_gemma":0.00055660645,"teacher_disagreement_score":0.017743172,"about_ca_system_score_codex":0.0012180709,"about_ca_system_score_gemma":0.00043364946,"threshold_uncertainty_score":0.05935681},"labels":[],"label_agreement":null},{"id":"W2005291561","doi":"10.1016/j.disc.2008.05.050","title":"Secure domination critical graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Dominating set; Discrete mathematics; Graph; Vertex (graph theory)","score_opus":0.029806303907930015,"score_gpt":0.3212700661383915,"score_spread":0.29146376223046144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005291561","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45394817,0.0010015143,0.4109427,0.011315579,0.00051877345,0.00056189497,0.0015685998,0.002202552,0.11794022],"genre_scores_gemma":[0.9690782,0.00024832727,0.012121993,0.0005586517,0.00011907557,0.00012928428,0.00040102497,0.00014438627,0.017199095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981273,0.0003675031,0.00007658776,0.00035844013,0.0006505708,0.00041952447],"domain_scores_gemma":[0.9905376,0.0044032596,0.0006534991,0.0026949297,0.0010051631,0.00070568855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014715763,0.00066099904,0.00077631185,0.0010792048,0.0019211363,0.0029523463,0.0011852623,0.0011108821,0.010739006],"category_scores_gemma":[0.008580901,0.00045838306,0.00045720456,0.00095212506,0.0022670375,0.0059618317,0.0047808206,0.0032105658,0.0016328612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045958106,0.00006903561,0.000661384,0.00009538942,0.00002761489,0.000113609225,0.00036203032,0.0064057005,0.005490303,0.9503767,0.00919875,0.026739942],"study_design_scores_gemma":[0.00005838304,0.00003486513,0.0001377786,0.000022725435,0.00002222722,0.00009922939,0.000104211314,0.018413039,0.0047307787,0.96880496,0.0075579328,0.000013846704],"about_ca_topic_score_codex":0.0006734485,"about_ca_topic_score_gemma":0.0011203032,"teacher_disagreement_score":0.010739006,"about_ca_system_score_codex":0.0020260746,"about_ca_system_score_gemma":0.0016739283,"threshold_uncertainty_score":0.035925508},"labels":[],"label_agreement":null},{"id":"W2005448597","doi":"10.1016/j.disc.2005.02.023","title":"On a new class of productive regular Hadamard matrices","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Hadamard transform; Prime power; Corollary; Combinatorics; Hadamard matrix; Order (exchange); Class (philosophy); Integer (computer science); Prime (order theory); Hadamard's inequality; Hadamard's maximal determinant problem; Discrete mathematics; Matrix (chemical analysis); Computer science","score_opus":0.006219342849004023,"score_gpt":0.19458562041908972,"score_spread":0.1883662775700857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005448597","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32905096,0.0020222561,0.5247333,0.0018881786,0.0008255523,0.00011750614,0.0004415476,0.00047923828,0.14044145],"genre_scores_gemma":[0.91148144,0.0012774628,0.051175658,0.0005634474,0.00090164004,0.00011060069,0.00028761025,0.00016130935,0.03404087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992748,0.00017583669,0.00003268043,0.00015388407,0.00022595497,0.00013686602],"domain_scores_gemma":[0.99783957,0.0009002455,0.00027533786,0.00035827293,0.00032616517,0.00030036515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007388311,0.0008164163,0.0008908742,0.0018743317,0.0017489842,0.0032239992,0.0011153924,0.0012905083,0.0057389634],"category_scores_gemma":[0.0035973063,0.0004299298,0.00077012175,0.0014804553,0.0024317398,0.0029675725,0.0014055764,0.0016551986,0.0007570018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018312332,0.000009924579,0.0000921542,0.000014399761,0.0000042834986,0.00007084061,0.000076246535,0.0010091767,0.0007834228,0.99458295,0.0007350507,0.0026033304],"study_design_scores_gemma":[0.00001361473,0.00001961342,0.00010108943,0.000010769758,0.0000044924113,0.00019935601,0.000047222773,0.015323411,0.00054438674,0.9807947,0.0029263152,0.000014966782],"about_ca_topic_score_codex":0.000813472,"about_ca_topic_score_gemma":0.00064057426,"teacher_disagreement_score":0.0057389634,"about_ca_system_score_codex":0.00089252845,"about_ca_system_score_gemma":0.00062914996,"threshold_uncertainty_score":0.019198775},"labels":[],"label_agreement":null},{"id":"W2005620597","doi":"10.1016/j.disc.2006.09.042","title":"Reachability problems in edge-colored digraphs","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Digraph; Mathematics; Reachability; Tournament; Vertex (graph theory); Colored; Monochromatic color; Discrete mathematics; Arc (geometry); Graph; Geometry; Physics","score_opus":0.02504517896934749,"score_gpt":0.3048842009482493,"score_spread":0.2798390219789018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005620597","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34810945,0.0016278053,0.6021798,0.004037122,0.00023332014,0.00044082192,0.0022234877,0.00084427686,0.040303938],"genre_scores_gemma":[0.82892036,0.0017457844,0.14236946,0.00076372846,0.000201324,0.0003133409,0.0028176662,0.00027333,0.022595033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820447,0.0005527616,0.000114972725,0.00049613795,0.00028156894,0.0003500917],"domain_scores_gemma":[0.986445,0.011420878,0.0005536516,0.00041020298,0.0005052642,0.00066504214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018531926,0.00133798,0.0016360757,0.001894164,0.0026117195,0.005143184,0.0030896477,0.0034064292,0.0073462436],"category_scores_gemma":[0.011431711,0.0015729511,0.0021677755,0.0032131227,0.0029624274,0.007696259,0.003214638,0.0037999952,0.00059695577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043004504,0.00032448303,0.0015417545,0.0007586165,0.00017857438,0.0007037094,0.0010152766,0.22247809,0.0027099825,0.73421806,0.006680819,0.028960677],"study_design_scores_gemma":[0.000098446246,0.00003409116,0.00026106279,0.00006231664,0.000070945716,0.00011290481,0.00029432526,0.15126926,0.0013774878,0.84439003,0.0020028322,0.00002621329],"about_ca_topic_score_codex":0.009384399,"about_ca_topic_score_gemma":0.00966273,"teacher_disagreement_score":0.009384399,"about_ca_system_score_codex":0.0036397683,"about_ca_system_score_gemma":0.0022486525,"threshold_uncertainty_score":0.026408494},"labels":[],"label_agreement":null},{"id":"W2005654899","doi":"10.1016/s0012-365x(03)00061-x","title":"Properties of the descent algebras of type D","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Descent (aeronautics); Type (biology); Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics","score_opus":0.056674891401938494,"score_gpt":0.2861594209379431,"score_spread":0.22948452953600462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005654899","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77769434,0.000730412,0.09135116,0.0011780604,0.0003939868,0.00008449555,0.00091535115,0.00030214567,0.12735002],"genre_scores_gemma":[0.9714526,0.00030941045,0.009840924,0.000282118,0.0002486287,0.00005090816,0.00066404516,0.000061029754,0.017090244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993692,0.00015108814,0.000056964218,0.00011116025,0.00016924215,0.00014237585],"domain_scores_gemma":[0.99797434,0.00057750905,0.0003314556,0.00018230955,0.00044774963,0.00048663147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010288341,0.00039673722,0.00072998146,0.002079279,0.002523879,0.0028530688,0.0009179565,0.00062934245,0.005794758],"category_scores_gemma":[0.002492646,0.00036304787,0.0007765723,0.0014389539,0.002475292,0.0032083017,0.001304437,0.0014475149,0.00078051694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063323,0.000027365293,0.0010785811,0.000020121981,0.0000062970666,0.00007530851,0.00016116226,0.00019873212,0.0011910328,0.9940593,0.0007254391,0.0023933146],"study_design_scores_gemma":[0.00002822167,0.000036411377,0.0011356181,0.000012382371,0.000010577052,0.00034733533,0.00015735666,0.002514002,0.0014306316,0.9889508,0.0053524124,0.000024263329],"about_ca_topic_score_codex":0.0011222819,"about_ca_topic_score_gemma":0.0007942367,"teacher_disagreement_score":0.005794758,"about_ca_system_score_codex":0.0010080208,"about_ca_system_score_gemma":0.0007364377,"threshold_uncertainty_score":0.019385397},"labels":[],"label_agreement":null},{"id":"W2006169827","doi":"10.1016/j.disc.2003.12.014","title":"The k-fractal of a simplicial complex","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; Dalhousie University","funders":"","keywords":"Mathematics; Fractal; Mandelbrot set; Simplicial complex; Julia set; Combinatorics; Polynomial; Function (biology); Discrete mathematics; Set (abstract data type); Complex quadratic polynomial; Mathematical analysis","score_opus":0.047204029777975075,"score_gpt":0.33046176431079033,"score_spread":0.2832577345328153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006169827","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76808083,0.0045446777,0.10378926,0.004862435,0.00082785095,0.00006889917,0.00083284575,0.00034379025,0.11664943],"genre_scores_gemma":[0.9751111,0.0009354653,0.014769337,0.0002558493,0.00034992272,0.00003272239,0.00022109122,0.0000699175,0.008254602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995577,0.000089937224,0.000030666703,0.000098966244,0.00014486583,0.00007792509],"domain_scores_gemma":[0.998628,0.00046410246,0.00022698585,0.00019023054,0.0001751283,0.00031550613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005414426,0.00052239606,0.00067328836,0.0025043087,0.001635177,0.004240278,0.0007622278,0.0017998591,0.0032593126],"category_scores_gemma":[0.0025219903,0.00042494436,0.00051742187,0.0010258885,0.004140351,0.0033799869,0.0017715524,0.0016506243,0.0005015217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019548426,0.000006041468,0.00022754658,0.00003408162,0.0000068616723,0.000100399935,0.00026029372,0.0017111105,0.0012624941,0.9937231,0.0006855789,0.0019628822],"study_design_scores_gemma":[0.000012276846,0.000013668072,0.00062808563,0.000021651607,0.0000060199677,0.00035518795,0.0001256691,0.011016409,0.00033705993,0.981026,0.0064330646,0.00002495674],"about_ca_topic_score_codex":0.0010908367,"about_ca_topic_score_gemma":0.00064032373,"teacher_disagreement_score":0.004240278,"about_ca_system_score_codex":0.0011588609,"about_ca_system_score_gemma":0.00042270106,"threshold_uncertainty_score":0.010903478},"labels":[],"label_agreement":null},{"id":"W2006258407","doi":"10.1016/j.disc.2005.12.027","title":"Un des “problèmes plaisans et délectables” de Claude Berge","year":2006,"lang":"fr","type":"article","venue":"Discrete Mathematics","topic":"History and Theory of Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; McGill University; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Combinatorics; Humanities; Philosophy","score_opus":0.022005566195245557,"score_gpt":0.2752520917819775,"score_spread":0.25324652558673194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006258407","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055152986,0.118793026,0.16721267,0.2684166,0.012595206,0.00009769338,0.00084966206,0.00044808752,0.37643406],"genre_scores_gemma":[0.6434908,0.054758698,0.05121988,0.017469434,0.010648378,0.00044451826,0.00093107554,0.0006138114,0.2204234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99638474,0.0016156831,0.000115003735,0.0006400665,0.0008856312,0.00035891111],"domain_scores_gemma":[0.99635565,0.0026939737,0.00012988469,0.00020114613,0.0004346514,0.00018465602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034634662,0.0019359924,0.0018157831,0.0023046625,0.0049765995,0.008541007,0.0016789793,0.006925006,0.008832344],"category_scores_gemma":[0.014999508,0.0010703304,0.0018190702,0.0025988778,0.016326483,0.0147736035,0.0041379686,0.016741902,0.0020581696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023939769,0.000009752792,0.00004586336,0.00007513987,0.000007985499,0.000086745415,0.00040690502,0.0008068442,0.00010377919,0.98614407,0.008834668,0.0034542412],"study_design_scores_gemma":[0.000046292782,0.0000110671635,0.00018226173,0.00009397055,0.000008566423,0.00019437217,0.0003521341,0.0017276877,0.0002585414,0.8578562,0.13922964,0.00003920295],"about_ca_topic_score_codex":0.021496896,"about_ca_topic_score_gemma":0.0077609364,"teacher_disagreement_score":0.021496896,"about_ca_system_score_codex":0.007688899,"about_ca_system_score_gemma":0.0029330254,"threshold_uncertainty_score":0.055787086},"labels":[],"label_agreement":null},{"id":"W2006528126","doi":"10.1016/j.disc.2007.11.062","title":"Factor-critical property in 3-dominating-critical graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Combinatorics; Mathematics; Dominating set; Vertex (graph theory); Discrete mathematics; Conjecture; Neighbourhood (mathematics); Graph","score_opus":0.05002103674915585,"score_gpt":0.33888864272112684,"score_spread":0.288867605971971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006528126","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86602265,0.00082528347,0.08096264,0.0014051739,0.000115711686,0.00014843937,0.00081648194,0.00031624857,0.049387377],"genre_scores_gemma":[0.9822029,0.00047270572,0.010791245,0.000269011,0.00008218531,0.00006596342,0.00056082837,0.0000900337,0.0054650824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961025,0.000055397893,0.000019649242,0.00012984885,0.000080229285,0.0001046413],"domain_scores_gemma":[0.99665654,0.001588943,0.0003987599,0.00024586264,0.00046091314,0.0006490666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005637731,0.00072388974,0.00082780025,0.0020417133,0.0022872037,0.0025632435,0.0010253789,0.0009311589,0.006782408],"category_scores_gemma":[0.0035560522,0.00059884146,0.00068734784,0.0015928122,0.002305111,0.0031443916,0.0013557367,0.001366645,0.000640173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005471634,0.000093799055,0.004559076,0.00033576612,0.00005818015,0.00073767174,0.0016658151,0.0070331017,0.018331084,0.9422962,0.006703357,0.017638795],"study_design_scores_gemma":[0.00011695328,0.00006411005,0.001888854,0.000054772678,0.000075111886,0.0007306249,0.000732881,0.01428153,0.008227055,0.9668549,0.0069395592,0.00003373179],"about_ca_topic_score_codex":0.0026008983,"about_ca_topic_score_gemma":0.002436496,"teacher_disagreement_score":0.006782408,"about_ca_system_score_codex":0.0013504454,"about_ca_system_score_gemma":0.00072092423,"threshold_uncertainty_score":0.022689402},"labels":[],"label_agreement":null},{"id":"W2006836809","doi":"10.1016/j.disc.2003.11.006","title":"The largest non-integer real zero of chromatic polynomials of graphs with fixed order","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Chromatic scale; Integer (computer science); Discrete mathematics; Graph; Vertex (graph theory); Chromatic polynomial; Windmill graph; Order (exchange); Voltage graph; Line graph","score_opus":0.01586986971397748,"score_gpt":0.28015439506926204,"score_spread":0.26428452535528457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006836809","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.931302,0.0007586338,0.04064411,0.002080251,0.00030017924,0.000037839447,0.0005213519,0.00030750214,0.02404803],"genre_scores_gemma":[0.9907197,0.00031369756,0.0041595055,0.00009806183,0.00018243838,0.000026963968,0.0001953733,0.00008962414,0.004214543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933064,0.00014804797,0.000023224839,0.00021259944,0.00011212278,0.00017344102],"domain_scores_gemma":[0.99262035,0.004359416,0.0010087764,0.0004963569,0.00050803175,0.0010071605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00115743,0.0012772084,0.000668437,0.003660902,0.0017632631,0.004695091,0.0020386076,0.0014868029,0.0054351855],"category_scores_gemma":[0.009738008,0.000631423,0.0005029433,0.0017265956,0.006873839,0.004671792,0.001301778,0.002661076,0.00062477775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006993873,0.00010387669,0.0030019316,0.00027924712,0.000035150802,0.00027858053,0.0008863011,0.008716804,0.016588956,0.94770616,0.003386318,0.018317351],"study_design_scores_gemma":[0.00008341673,0.000078115336,0.0027224752,0.000082893726,0.00004444308,0.00035324,0.00045914768,0.019930786,0.006203586,0.9674187,0.0025268793,0.00009636266],"about_ca_topic_score_codex":0.0017960808,"about_ca_topic_score_gemma":0.0019280683,"teacher_disagreement_score":0.0054351855,"about_ca_system_score_codex":0.0022810227,"about_ca_system_score_gemma":0.0011295505,"threshold_uncertainty_score":0.018182576},"labels":[],"label_agreement":null},{"id":"W2006938312","doi":"10.1016/j.disc.2005.03.024","title":"Brian Alspach and his work","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Lethbridge","funders":"","keywords":"Mathematics; Work (physics); Discrete mathematics; Mathematical economics; Calculus (dental); Engineering; Medicine","score_opus":0.02155731934103933,"score_gpt":0.2930603300607516,"score_spread":0.2715030107197123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006938312","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00696951,0.029487371,0.05570668,0.37788236,0.055882335,0.0000557552,0.00048187788,0.0007602971,0.4727738],"genre_scores_gemma":[0.122735746,0.021822255,0.022875585,0.038827766,0.019452505,0.000073304334,0.00052292534,0.00090596545,0.77278394],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9949064,0.0015176666,0.00010898225,0.0008031531,0.0023898324,0.00027391763],"domain_scores_gemma":[0.9905723,0.0030566128,0.00031776304,0.0010788246,0.0035185793,0.0014559557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024869803,0.00062512443,0.0005968204,0.0017403805,0.0033410583,0.0045970418,0.0011156528,0.0021187249,0.043427393],"category_scores_gemma":[0.014793773,0.00044210214,0.00030466352,0.0018852387,0.0033151805,0.0056977705,0.0025187295,0.0042854357,0.016370345],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003935,0.00003848379,0.00041082985,0.000092738206,0.0000146819375,0.00013605165,0.000618011,0.00034170385,0.00033706648,0.36273646,0.56636566,0.06886891],"study_design_scores_gemma":[0.000009131717,0.0000061306805,0.00014581153,0.0000691524,0.000007214117,0.00023781741,0.00036555235,0.00036246606,0.00078638725,0.15489441,0.8430882,0.000027685726],"about_ca_topic_score_codex":0.0031668819,"about_ca_topic_score_gemma":0.003945746,"teacher_disagreement_score":0.043427393,"about_ca_system_score_codex":0.0032910034,"about_ca_system_score_gemma":0.0016272638,"threshold_uncertainty_score":0.14527905},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"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","score_opus":0.04802399937323873,"score_gpt":0.25012380704321985,"score_spread":0.20209980766998112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007327392","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076851244,0.00017559275,0.98917913,0.00013597502,0.00003722036,0.00005113336,0.0000767919,0.0001357677,0.0025233072],"genre_scores_gemma":[0.1177648,0.0002720196,0.87884206,0.00011269862,0.00006258879,0.00012506942,0.0003023234,0.00010926916,0.0024091224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99740016,0.0010351384,0.00018031924,0.000385457,0.0008153824,0.00018344258],"domain_scores_gemma":[0.9972357,0.0013999873,0.00012757281,0.00059289904,0.00045567533,0.00018821469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025253575,0.0007588421,0.0014510273,0.0029838856,0.0018680327,0.0052745445,0.0020517255,0.0010803441,0.0036869731],"category_scores_gemma":[0.0061135376,0.0009177388,0.00281377,0.0028991688,0.0031499984,0.005811413,0.0043296167,0.0031443408,0.0010602464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076077624,0.000042929576,0.00030121036,0.00015868085,0.000063364954,0.000078192235,0.00069952814,0.014403859,0.0027146344,0.92151976,0.0014492348,0.05849244],"study_design_scores_gemma":[0.000023675799,0.00005647349,0.00014294342,0.000045800232,0.000044887267,0.000109541055,0.00020620927,0.054486558,0.0026403863,0.9320377,0.01016918,0.00003663456],"about_ca_topic_score_codex":0.0011832026,"about_ca_topic_score_gemma":0.0014321656,"teacher_disagreement_score":0.0052745445,"about_ca_system_score_codex":0.0012482663,"about_ca_system_score_gemma":0.0009810199,"threshold_uncertainty_score":0.013355553},"labels":[],"label_agreement":null},{"id":"W2007802322","doi":"10.1016/j.disc.2006.04.015","title":"A combinatorial proof of a result of Gessel and Greene","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorial proof; Mathematics; Combinatorics; Combinatorial analysis; Discrete mathematics","score_opus":0.020513559344965203,"score_gpt":0.28810079763760044,"score_spread":0.26758723829263525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007802322","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061849702,0.011534826,0.39005852,0.04920236,0.008370381,0.00022187129,0.0017803273,0.0015052274,0.47547674],"genre_scores_gemma":[0.7126921,0.012135665,0.165178,0.017692922,0.0074250754,0.00057642313,0.002151728,0.0013013094,0.0808469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991078,0.00021917706,0.000056387536,0.00021875108,0.00027853245,0.0001193121],"domain_scores_gemma":[0.9960955,0.0023070166,0.00020856813,0.00043261476,0.00055115495,0.00040522643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013335027,0.0020881363,0.0019440444,0.0036152694,0.0032943224,0.0036072175,0.002486481,0.0024057261,0.019961147],"category_scores_gemma":[0.0073604165,0.0010421899,0.0027547088,0.0039837286,0.004874067,0.009449684,0.0077860192,0.0068031102,0.0035909791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040426607,0.00005292508,0.00021424501,0.00018009866,0.000035212022,0.00022339483,0.00022478179,0.0006637656,0.0011383459,0.9733439,0.015117957,0.00876492],"study_design_scores_gemma":[0.000027497577,0.000019052139,0.00032184325,0.000037064197,0.000036353722,0.00028546163,0.00006814958,0.0016318305,0.0004835445,0.9785645,0.018502928,0.000021832971],"about_ca_topic_score_codex":0.0013652068,"about_ca_topic_score_gemma":0.0012639264,"teacher_disagreement_score":0.019961147,"about_ca_system_score_codex":0.0017943486,"about_ca_system_score_gemma":0.0008404356,"threshold_uncertainty_score":0.06677669},"labels":[],"label_agreement":null},{"id":"W2008148950","doi":"10.1016/j.disc.2003.11.016","title":"Bicolouring Steiner systems S(2,4,v)","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Steiner system; Combinatorics; Block (permutation group theory); Discrete mathematics","score_opus":0.008656548377924686,"score_gpt":0.19543831530461134,"score_spread":0.18678176692668666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008148950","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7234562,0.00054178387,0.10622923,0.0010872284,0.00032677676,0.00025163894,0.0022123707,0.00080876367,0.16508602],"genre_scores_gemma":[0.9253375,0.00029028958,0.040062238,0.0002714949,0.00005313349,0.00010401118,0.001687465,0.0001353867,0.03205854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966633,0.00007210426,0.00002593378,0.00005738777,0.0000751094,0.000103172846],"domain_scores_gemma":[0.99936646,0.00017026823,0.00012831112,0.00012315014,0.000113410766,0.00009841991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002515024,0.0005060739,0.00054428383,0.0013926857,0.0014495475,0.001754278,0.0006225909,0.0009854847,0.015911827],"category_scores_gemma":[0.001023157,0.00030403215,0.00031060487,0.0015818501,0.0007404065,0.00089463743,0.00095296727,0.0010893549,0.0021748987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005565267,0.00009660426,0.0016529042,0.00023151844,0.00006455977,0.00078344543,0.00040677225,0.013283435,0.015622185,0.8918975,0.015003735,0.060400702],"study_design_scores_gemma":[0.00017404361,0.0002175315,0.0021173777,0.00008916278,0.000054523294,0.0012678093,0.0007206677,0.045515247,0.009725504,0.90797466,0.032093477,0.00004997755],"about_ca_topic_score_codex":0.0008801672,"about_ca_topic_score_gemma":0.002175671,"teacher_disagreement_score":0.015911827,"about_ca_system_score_codex":0.0006488341,"about_ca_system_score_gemma":0.0006190591,"threshold_uncertainty_score":0.053230345},"labels":[],"label_agreement":null},{"id":"W2008497326","doi":"10.1016/j.disc.2003.11.023","title":"Grooming in unidirectional rings: K4−e designs","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of the Fraser Valley","funders":"Army Research Office; Centre National de la Recherche Scientifique","keywords":"Multiplexer; Traffic grooming; Mathematics; Multiplexing; Graph; Topology (electrical circuits); Wavelength; Wavelength-division multiplexing; Combinatorics; Discrete mathematics; Telecommunications; Computer science; Optics; Physics","score_opus":0.01838417251832559,"score_gpt":0.23874658703483437,"score_spread":0.2203624145165088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008497326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21871215,0.00093164714,0.71491885,0.0012473887,0.00026116145,0.00025892403,0.00028040042,0.00052253465,0.06286699],"genre_scores_gemma":[0.7270968,0.00072519504,0.25395364,0.00048928196,0.000098930694,0.00030189904,0.00017153542,0.000107623346,0.017055199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989882,0.0003971819,0.000063564614,0.00014893795,0.00016311523,0.00023889016],"domain_scores_gemma":[0.9981844,0.0005562409,0.00027181424,0.00053725176,0.00026741595,0.00018299755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014785766,0.0006934422,0.0006331879,0.0009460688,0.0011671598,0.0021922742,0.001214306,0.0012945998,0.0077066887],"category_scores_gemma":[0.002999813,0.00045734074,0.0004576068,0.00077731156,0.0011434103,0.0026199901,0.0018711952,0.0009851885,0.0011968503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077434897,0.00023273,0.0005033161,0.00023506365,0.000050722418,0.00012247248,0.00020062465,0.02869507,0.014373032,0.8389467,0.004167962,0.111697964],"study_design_scores_gemma":[0.000282273,0.00032528702,0.0002686541,0.000109135966,0.00006193185,0.00033096428,0.00013828481,0.20364818,0.01292756,0.76759666,0.0142273335,0.00008378604],"about_ca_topic_score_codex":0.00021304087,"about_ca_topic_score_gemma":0.000637904,"teacher_disagreement_score":0.0077066887,"about_ca_system_score_codex":0.0007939303,"about_ca_system_score_gemma":0.0008386912,"threshold_uncertainty_score":0.025781512},"labels":[],"label_agreement":null},{"id":"W2009210880","doi":"10.1016/s0012-365x(01)00280-1","title":"On centroid branches of trees from certain families","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; York University","funders":"","keywords":"Mathematics; Centroid; Combinatorics; Tree (set theory); Discrete mathematics; Geometry","score_opus":0.039534289960439464,"score_gpt":0.2720989982179498,"score_spread":0.23256470825751036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009210880","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6560986,0.002213736,0.26024485,0.0020336772,0.00018336553,0.000097092394,0.0010226029,0.00037910012,0.07772694],"genre_scores_gemma":[0.8772429,0.0023356937,0.09185493,0.0005463257,0.00044620817,0.00017676012,0.0024207074,0.0005892055,0.024387188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990798,0.00025127112,0.000042804557,0.00018146011,0.00027763064,0.00016708155],"domain_scores_gemma":[0.992615,0.003994748,0.0010546753,0.00048316637,0.00082384615,0.0010286013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014197547,0.0005879312,0.0018656497,0.0035038765,0.0033201233,0.0038337437,0.0020558508,0.0022812192,0.010465401],"category_scores_gemma":[0.01140993,0.0008538549,0.0011828048,0.004635252,0.0028971515,0.006911355,0.0033367756,0.0042536114,0.0012924513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008127356,0.000017261073,0.0007118028,0.000061851904,0.000011185975,0.00017631531,0.00085968565,0.0019055088,0.0010426356,0.9865563,0.0017446829,0.0068315016],"study_design_scores_gemma":[0.000024594536,0.000015753656,0.0008268236,0.00003345938,0.00001098336,0.00020052667,0.00028427402,0.009971447,0.0003101464,0.985704,0.002606212,0.000011731668],"about_ca_topic_score_codex":0.0020579188,"about_ca_topic_score_gemma":0.0030070564,"teacher_disagreement_score":0.010465401,"about_ca_system_score_codex":0.0021267212,"about_ca_system_score_gemma":0.00062937674,"threshold_uncertainty_score":0.03501028},"labels":[],"label_agreement":null},{"id":"W2009261722","doi":"10.1016/s0012-365x(01)00369-7","title":"Total domination in complements of graphs containing no K4,4","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Discrete mathematics; Graph; Vertex (graph theory)","score_opus":0.03916226416454757,"score_gpt":0.3101956242073229,"score_spread":0.27103336004277534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009261722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92523694,0.0002899114,0.022244863,0.0004200629,0.00006216131,0.00006895225,0.00086873496,0.00015713253,0.050651167],"genre_scores_gemma":[0.9672308,0.0002961911,0.012298171,0.00017931862,0.000048570422,0.000113398215,0.0015282131,0.00016970393,0.01813563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987777,0.00022221253,0.000059470814,0.00023824106,0.0003100098,0.0003924202],"domain_scores_gemma":[0.9937803,0.00333915,0.00067071815,0.00040848902,0.0007798265,0.0010213486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011100058,0.0006113991,0.0010592197,0.002111836,0.004341279,0.005398529,0.001434527,0.0010939253,0.009224462],"category_scores_gemma":[0.004478677,0.0008854922,0.0012737444,0.0016563975,0.0028098016,0.0031717024,0.0021775642,0.0013126426,0.00072793075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017612939,0.00016870932,0.010020807,0.00043733476,0.0001820255,0.001339085,0.0032148676,0.0094749285,0.01793384,0.9267168,0.007914142,0.020836227],"study_design_scores_gemma":[0.00020777967,0.00013611911,0.0066508516,0.00019442772,0.0002908023,0.0018522027,0.0028175032,0.035109214,0.01549505,0.9215685,0.015576694,0.00010076854],"about_ca_topic_score_codex":0.005653675,"about_ca_topic_score_gemma":0.008227459,"teacher_disagreement_score":0.009224462,"about_ca_system_score_codex":0.0015694915,"about_ca_system_score_gemma":0.0017126268,"threshold_uncertainty_score":0.030858934},"labels":[],"label_agreement":null},{"id":"W2009319947","doi":"10.1016/s0012-365x(01)00108-x","title":"On the existence of a point subset with a specified number of interior points","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Combinatorics; Integer (computer science); Convex hull; Point (geometry); Boundary (topology); Plane (geometry); Set (abstract data type); Finite set; Interior point method; Regular polygon; Discrete mathematics; Geometry; Mathematical analysis; Algorithm","score_opus":0.027464334030066536,"score_gpt":0.26784157861687574,"score_spread":0.2403772445868092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009319947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15267737,0.00045490667,0.8261158,0.0013394884,0.00008290674,0.00016615691,0.00034359057,0.00019089703,0.018628929],"genre_scores_gemma":[0.6999457,0.0014564188,0.28592914,0.00034098423,0.00018867718,0.00055517006,0.0010194394,0.0003782596,0.010186247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983663,0.00055064156,0.00012745705,0.0003010506,0.00046782952,0.00018669285],"domain_scores_gemma":[0.971467,0.02273024,0.0012501779,0.0017168517,0.0019060627,0.00092964625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040555643,0.0009922406,0.0021441702,0.002270206,0.0016247899,0.0029001571,0.0020856506,0.0032163404,0.007178921],"category_scores_gemma":[0.029199496,0.0010806898,0.0014528414,0.0017340158,0.004856364,0.006121664,0.006218006,0.0030443738,0.0010985516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021318495,0.00022686658,0.005440983,0.0008738228,0.00009807321,0.0010958484,0.0013352063,0.17646621,0.02705191,0.7098553,0.004530755,0.07089316],"study_design_scores_gemma":[0.00013631902,0.0003767218,0.0013970227,0.00037409773,0.00008102966,0.00088154,0.0007866951,0.5722776,0.019680716,0.39864734,0.0052744863,0.00008643234],"about_ca_topic_score_codex":0.0004516065,"about_ca_topic_score_gemma":0.0003912827,"teacher_disagreement_score":0.007178921,"about_ca_system_score_codex":0.0009175429,"about_ca_system_score_gemma":0.00085835694,"threshold_uncertainty_score":0.024015903},"labels":[],"label_agreement":null},{"id":"W2010841183","doi":"10.1016/j.disc.2006.11.050","title":"Directed complete bipartite graph decompositions: Indirect constructions","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Science Foundation","keywords":"Mathematics; Bipartite graph; Combinatorics; Complete bipartite graph; Discrete mathematics; Graph","score_opus":0.014052312043487284,"score_gpt":0.22950789611474717,"score_spread":0.2154555840712599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010841183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03398963,0.00038420805,0.8953534,0.00072938146,0.00014633848,0.00014353884,0.00041878287,0.0002559552,0.06857877],"genre_scores_gemma":[0.40066847,0.0012949308,0.54448795,0.00075372757,0.00026334246,0.00076274533,0.001593953,0.0005174312,0.049657624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988997,0.00046845234,0.000047823167,0.00022101632,0.00022548491,0.00013744185],"domain_scores_gemma":[0.99751484,0.0010730262,0.0002181448,0.0005842732,0.00033723706,0.0002725799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013948713,0.00097168534,0.00062507077,0.0016757182,0.0015623628,0.0030414404,0.0012985367,0.0011159404,0.011545768],"category_scores_gemma":[0.004001283,0.00083035836,0.0011859264,0.0018554237,0.0016693368,0.0042759706,0.0029012605,0.003483441,0.0020455536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016461196,0.000021989481,0.00007043865,0.000040252984,0.000006330809,0.00003520957,0.00013148846,0.0012474807,0.0006134966,0.98779815,0.0018412261,0.008177536],"study_design_scores_gemma":[0.000013558821,0.000010458038,0.00007541681,0.00003588321,0.0000162332,0.00010076987,0.000082570084,0.011995627,0.0007792464,0.97935915,0.0075229076,0.000008077377],"about_ca_topic_score_codex":0.00044134422,"about_ca_topic_score_gemma":0.0009971561,"teacher_disagreement_score":0.011545768,"about_ca_system_score_codex":0.0008640305,"about_ca_system_score_gemma":0.00066257745,"threshold_uncertainty_score":0.038624465},"labels":[],"label_agreement":null},{"id":"W2011118188","doi":"10.1016/j.disc.2013.02.010","title":"Velocity polytopes of periodic graphs and a no-go theorem for digital physics","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Noncommutative and Quantum Gravity Theories","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Mathematics; Polytope; Voltage graph; Line graph; Cubic graph; Combinatorics; Discrete mathematics; Graph property; Graph; Null graph; Lattice graph","score_opus":0.011388718656372334,"score_gpt":0.2503750808837458,"score_spread":0.2389863622273735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011118188","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39668968,0.0021792685,0.34065568,0.0052599814,0.0009261577,0.00013466283,0.0008962694,0.00046425773,0.252794],"genre_scores_gemma":[0.9242026,0.0013140377,0.02720534,0.00081203686,0.0007865691,0.0002283293,0.00070875825,0.00026657814,0.04447568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994531,0.00011353455,0.000023403745,0.00012865286,0.00014367861,0.0001376798],"domain_scores_gemma":[0.9979685,0.0009509303,0.00025635553,0.00021873075,0.00018438783,0.00042103438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077065034,0.00080488354,0.0011096479,0.0028231738,0.0036378165,0.0032370845,0.0018522745,0.0016853798,0.012397258],"category_scores_gemma":[0.003640365,0.00076341775,0.0012834864,0.0016043251,0.005072538,0.0073156175,0.002723954,0.0046634157,0.000942106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055729297,0.000005945765,0.000028849967,0.0000068196878,0.0000014101918,0.000012665526,0.00003250458,0.00034912908,0.000063662614,0.99856853,0.0003374354,0.0005874621],"study_design_scores_gemma":[0.000007363196,0.00000413723,0.000067195295,0.000005239364,0.0000022771492,0.000017728295,0.000028656514,0.002910063,0.00004753957,0.99607193,0.00083316123,0.0000047419194],"about_ca_topic_score_codex":0.0021200841,"about_ca_topic_score_gemma":0.0017466914,"teacher_disagreement_score":0.012397258,"about_ca_system_score_codex":0.0012640763,"about_ca_system_score_gemma":0.00084524415,"threshold_uncertainty_score":0.04147297},"labels":[],"label_agreement":null},{"id":"W2011532710","doi":"10.1016/j.disc.2003.05.002","title":"Almost self-complementary circulant graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Combinatorics; Circulant matrix; Dihedral group; Complement (music); Circulant graph; Automorphism group; Discrete mathematics; Cayley graph; Automorphism; Modulo; Greatest common divisor; Cyclic group; Prime (order theory); Graph; Group (periodic table); Voltage graph; Line graph; Abelian group","score_opus":0.06763896134045058,"score_gpt":0.3405880699501184,"score_spread":0.2729491086096678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011532710","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7013989,0.00059038243,0.1172568,0.0018491709,0.0004859761,0.00008655083,0.00042607577,0.0003806098,0.17752549],"genre_scores_gemma":[0.9632116,0.00043080765,0.014132141,0.0007130505,0.00041926053,0.00006852557,0.00038478352,0.00010074519,0.020539068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995153,0.00012082743,0.000012588286,0.00008949621,0.00016555237,0.00009622239],"domain_scores_gemma":[0.99752814,0.0009547648,0.00029596366,0.00029290273,0.00043821594,0.00048997416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048912154,0.0004724951,0.0006737563,0.0020167448,0.0017969203,0.0022119253,0.00078114495,0.0011019601,0.006286267],"category_scores_gemma":[0.0027757487,0.00036270847,0.00046007868,0.0011995061,0.0020523954,0.0023423813,0.0013632118,0.0015176097,0.00057710137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001352666,0.0000103923785,0.000085504165,0.00000952028,0.0000034673901,0.000039061262,0.000052278217,0.00035642643,0.0005330108,0.9967456,0.00075764593,0.0013935443],"study_design_scores_gemma":[0.000013233536,0.000008232256,0.00018432239,0.0000052028236,0.0000057226803,0.00011270421,0.000046602352,0.0035781034,0.000382955,0.99408036,0.0015758398,0.0000067662004],"about_ca_topic_score_codex":0.0009854429,"about_ca_topic_score_gemma":0.0012747821,"teacher_disagreement_score":0.006286267,"about_ca_system_score_codex":0.00087639043,"about_ca_system_score_gemma":0.00071945786,"threshold_uncertainty_score":0.021029651},"labels":[],"label_agreement":null},{"id":"W2011663983","doi":"10.1016/s0012-365x(00)00127-8","title":"On constructible graphs, infinite bridged graphs and weakly cop-win graphs","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Combinatorics; Mathematics; Cartesian product; Vertex (graph theory); Induced subgraph; Retract; Graph; Discrete mathematics; Bipartite graph; Pure mathematics","score_opus":0.016283508460044168,"score_gpt":0.2735630802026106,"score_spread":0.25727957174256644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011663983","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46551648,0.002947299,0.32717124,0.0069797803,0.00040200655,0.00015812363,0.0006351627,0.00033190317,0.195858],"genre_scores_gemma":[0.91563237,0.003068748,0.04009464,0.0012385114,0.0005178231,0.0002624988,0.00117302,0.00025296607,0.037759397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917114,0.00024862803,0.00003921069,0.0001871549,0.00016196398,0.00019195344],"domain_scores_gemma":[0.9966433,0.0019548677,0.00036839893,0.00033831893,0.0002728864,0.00042222807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010795057,0.0011605031,0.0013082089,0.0027143774,0.0035187653,0.0036756457,0.0019884412,0.0020408148,0.008243455],"category_scores_gemma":[0.0048510134,0.0008622388,0.0012901912,0.003801584,0.0059572924,0.009782222,0.0040374487,0.0049687712,0.00079192425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018871104,0.000017935035,0.00017759312,0.000033554672,0.000005295366,0.000049082024,0.00025389766,0.0013087086,0.0002683666,0.9941895,0.0008413498,0.0028359105],"study_design_scores_gemma":[0.0000050299836,0.0000046859836,0.00009439458,0.000011425825,0.000004336022,0.000020400501,0.00009530865,0.0019874687,0.00007191386,0.99667203,0.0010291616,0.0000038468147],"about_ca_topic_score_codex":0.0031552403,"about_ca_topic_score_gemma":0.0037888954,"teacher_disagreement_score":0.008243455,"about_ca_system_score_codex":0.002498921,"about_ca_system_score_gemma":0.0008991431,"threshold_uncertainty_score":0.027577043},"labels":[],"label_agreement":null},{"id":"W2011692663","doi":"10.1016/j.disc.2006.06.033","title":"Resolvable balanced incomplete block designs with subdesigns of block size 4","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Beijing Institute For Brain Disorders","keywords":"Mathematics; Block size; Combinatorics; Block (permutation group theory); Discrete mathematics; Pairwise comparison; Statistics; Computer science","score_opus":0.016187533241745405,"score_gpt":0.2196362729728939,"score_spread":0.2034487397311485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011692663","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1310333,0.0003102323,0.8478807,0.00031190668,0.0000905872,0.00022357944,0.0006657811,0.0006645758,0.01881933],"genre_scores_gemma":[0.6451252,0.0003297573,0.342565,0.00028680963,0.000074598676,0.00047491185,0.00073274196,0.00012842452,0.010282648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790394,0.000799812,0.00015959752,0.00030437292,0.0005446029,0.00028767748],"domain_scores_gemma":[0.9940105,0.0022004629,0.00086011173,0.0017191124,0.00097431085,0.00023546776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019766393,0.0010644434,0.0012280698,0.00087987276,0.0006251402,0.0015585879,0.0011568266,0.001101535,0.006023379],"category_scores_gemma":[0.004993264,0.00070240267,0.0006217625,0.0009805873,0.00072918425,0.0015374325,0.0011330837,0.0010039844,0.0013821714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027154726,0.00031252854,0.0017216788,0.00041817728,0.0002033792,0.00036828828,0.00027712563,0.17609677,0.08912946,0.5481803,0.005862373,0.17471445],"study_design_scores_gemma":[0.00076761754,0.0014832226,0.00087796774,0.00017127619,0.00019235385,0.00050166895,0.000120722485,0.5964036,0.06654027,0.3153939,0.01744192,0.00010541016],"about_ca_topic_score_codex":0.00075062294,"about_ca_topic_score_gemma":0.0017342279,"teacher_disagreement_score":0.006023379,"about_ca_system_score_codex":0.00079307065,"about_ca_system_score_gemma":0.0016047851,"threshold_uncertainty_score":0.020150185},"labels":[],"label_agreement":null},{"id":"W2011992755","doi":"10.1016/j.disc.2008.07.003","title":"Super-simple balanced incomplete block designs with block size 4 and index 5","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada; Beijing Institute For Brain Disorders; National Natural Science Foundation of China","keywords":"Simple (philosophy); Mathematics; Intersection (aeronautics); Block (permutation group theory); Block size; Combinatorics; Discrete mathematics; Block design; Algorithm; Computer science","score_opus":0.015937151067999592,"score_gpt":0.20201873383249255,"score_spread":0.18608158276449296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011992755","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12996703,0.0005116329,0.82143945,0.00038685897,0.00019964678,0.00026282345,0.00073442556,0.00062074803,0.045877386],"genre_scores_gemma":[0.7251325,0.00047141145,0.26044303,0.00038682856,0.00013199807,0.00037922472,0.00051015225,0.00009342754,0.012451406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988531,0.00042548298,0.00008353747,0.00016473264,0.00031532903,0.00015775197],"domain_scores_gemma":[0.99736315,0.00080792455,0.00043640155,0.0006510487,0.00056889764,0.00017267138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013003468,0.00084054563,0.00092824595,0.0008255344,0.0005655419,0.0011821144,0.00076281023,0.00074318494,0.008184255],"category_scores_gemma":[0.0031149446,0.00043278988,0.0004863321,0.00093297067,0.0004833185,0.0012204394,0.0007901031,0.000527409,0.0017830993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002486468,0.0002716654,0.0027173834,0.00064223376,0.00029957586,0.00044731528,0.00022614293,0.079968445,0.15077429,0.5731892,0.008711796,0.18026556],"study_design_scores_gemma":[0.0007399073,0.0021137856,0.0023886154,0.00023934824,0.00046081695,0.0013741141,0.00012157396,0.45423076,0.06605016,0.43436506,0.037770692,0.00014528465],"about_ca_topic_score_codex":0.00047743408,"about_ca_topic_score_gemma":0.0015170758,"teacher_disagreement_score":0.008184255,"about_ca_system_score_codex":0.00056515686,"about_ca_system_score_gemma":0.000891224,"threshold_uncertainty_score":0.027379036},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023071604099321547,"score_gpt":0.26147787488091195,"score_spread":0.2384062707815904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012220350","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014260714,0.0044518346,0.091182,0.12409237,0.06770604,0.0003957105,0.019185644,0.015252441,0.6763079],"genre_scores_gemma":[0.014084829,0.0066632186,0.06869866,0.026624981,0.017641714,0.00046892153,0.014543826,0.012786884,0.8384869],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989519,0.0002716326,0.00010645292,0.00012823466,0.00044495918,0.0000967178],"domain_scores_gemma":[0.99535865,0.0022007737,0.0001345875,0.00040144307,0.0015568852,0.00034774537],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016436114,0.0014661206,0.001076147,0.0018763114,0.0017346919,0.0037077973,0.0022297725,0.0021207076,0.34682992],"category_scores_gemma":[0.007070913,0.0008986583,0.0013905222,0.0027056076,0.001051892,0.0066437996,0.0017119022,0.004604167,0.20253763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024922341,0.00002244392,0.000029162831,0.0000550974,0.0000027474475,0.000032678578,0.000039249502,0.000106586966,0.00022658998,0.011580349,0.9781737,0.009706474],"study_design_scores_gemma":[0.000014237957,0.000015461155,0.00027939258,0.00006105578,0.0000030009915,0.000054607313,0.0000394758,0.00035074676,0.00037895664,0.011716233,0.9870613,0.000025564928],"about_ca_topic_score_codex":0.016384471,"about_ca_topic_score_gemma":0.036184277,"teacher_disagreement_score":0.34682992,"about_ca_system_score_codex":0.0027740519,"about_ca_system_score_gemma":0.0017685681,"threshold_uncertainty_score":0.93166786},"labels":[],"label_agreement":null},{"id":"W2013162935","doi":"10.1016/s0012-365x(99)00282-4","title":"Nordhaus–Gaddum results for CO-irredundance in graphs","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Luonnontieteiden ja Tekniikan Tutkimuksen Toimikunta; Natural Sciences and Engineering Research Council of Canada; University of South Africa","keywords":"Mathematics; Combinatorics; Graph; Complement (music); Bounded function; Vertex (graph theory); Discrete mathematics","score_opus":0.04400181210309842,"score_gpt":0.34426928153598696,"score_spread":0.3002674694328885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013162935","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3318035,0.0130082,0.25579137,0.014891349,0.0022080494,0.00014803495,0.00096203375,0.0007669918,0.38042048],"genre_scores_gemma":[0.9169248,0.005678711,0.031482622,0.00288266,0.002071001,0.00017310397,0.0005352535,0.00037747665,0.03987434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998793,0.00027172148,0.00007250099,0.0003750309,0.0002539386,0.00023373716],"domain_scores_gemma":[0.99194145,0.005112223,0.0005996863,0.00079252024,0.0006925378,0.000861588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018602951,0.001618193,0.0036234513,0.008412158,0.0064176586,0.003466837,0.0028480673,0.003079116,0.0088951755],"category_scores_gemma":[0.00945966,0.001224133,0.0030142127,0.0062179705,0.008790436,0.015636865,0.005672457,0.010126396,0.001051907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020923331,0.0000141259425,0.00014395318,0.000072482224,0.000011552988,0.00005792912,0.00025585646,0.0004177266,0.0002322357,0.99547666,0.0011422113,0.0021543715],"study_design_scores_gemma":[0.0000062446106,0.0000062073823,0.00012454978,0.000013695636,0.000012691713,0.00007398081,0.000056573997,0.00081496564,0.0001271868,0.99721694,0.0015382691,0.000008706771],"about_ca_topic_score_codex":0.0023723645,"about_ca_topic_score_gemma":0.0022217194,"teacher_disagreement_score":0.0088951755,"about_ca_system_score_codex":0.0025568414,"about_ca_system_score_gemma":0.00089448015,"threshold_uncertainty_score":0.02975738},"labels":[],"label_agreement":null},{"id":"W2013368271","doi":"10.1016/j.disc.2004.04.022","title":"Small cones of m-hemimetrics","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Combinatorics; Set (abstract data type); Cone (formal languages); Discrete mathematics; Algorithm; Computer science","score_opus":0.03727717459418168,"score_gpt":0.2542964972022554,"score_spread":0.21701932260807372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013368271","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53871703,0.0010119122,0.3945767,0.0015599139,0.00028801663,0.0001066569,0.0007662471,0.00051258237,0.062460892],"genre_scores_gemma":[0.95192987,0.00035415732,0.032341234,0.00024556526,0.00019190798,0.000059266396,0.00048427747,0.00014046984,0.014253246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992669,0.0001678386,0.000045390618,0.0001722887,0.00023630152,0.00011126521],"domain_scores_gemma":[0.99727637,0.0009766269,0.00035561502,0.00024261618,0.00052782934,0.00062093924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086648413,0.0007470844,0.0006992422,0.0020588965,0.0011717533,0.003261975,0.0009025245,0.00062791386,0.0058076424],"category_scores_gemma":[0.0039880523,0.00050121895,0.00056949357,0.0010144433,0.0027072423,0.003200429,0.002226266,0.0022571266,0.00056366296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065745844,0.00002050899,0.00052239303,0.000027585731,0.000007956897,0.00013816536,0.00016939276,0.0008717135,0.0019596813,0.9900355,0.0011100189,0.0050713303],"study_design_scores_gemma":[0.000021349602,0.000037555794,0.00092746457,0.000016813618,0.000009963621,0.00029124608,0.00021109135,0.014915254,0.0015011083,0.9786936,0.0033564076,0.000018165765],"about_ca_topic_score_codex":0.0007920612,"about_ca_topic_score_gemma":0.00064537453,"teacher_disagreement_score":0.0058076424,"about_ca_system_score_codex":0.00064475887,"about_ca_system_score_gemma":0.00035263167,"threshold_uncertainty_score":0.019428492},"labels":[],"label_agreement":null},{"id":"W2013391382","doi":"10.1016/j.disc.2008.12.022","title":"Variable neighborhood search for extremal graphs. 23. On the Randić index and the chromatic number","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Simple graph; Chromatic scale; Connectivity; Edge coloring; Discrete mathematics; Graph power; Line graph","score_opus":0.018016093211178613,"score_gpt":0.24976792240660425,"score_spread":0.23175182919542564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013391382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26006913,0.015353071,0.57441163,0.013374626,0.0011392819,0.00021647799,0.0012384456,0.0007383778,0.133459],"genre_scores_gemma":[0.77790105,0.003931334,0.18914549,0.0016423995,0.00068866526,0.0002467004,0.0008719237,0.00045044237,0.025122028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994585,0.00021031749,0.000018787327,0.000113298185,0.00010729169,0.00009177625],"domain_scores_gemma":[0.99735427,0.001947739,0.00016678375,0.00020747428,0.00016793162,0.00015581904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013942702,0.00050518155,0.001240933,0.0015876286,0.0018824942,0.0017226967,0.0016176971,0.001511735,0.008627245],"category_scores_gemma":[0.009195258,0.0005152475,0.0005826409,0.0018431173,0.00211001,0.0041165077,0.0018276533,0.0018625914,0.0007828574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003871834,0.00009829672,0.0018772393,0.0002897485,0.00007874018,0.000080610065,0.00019291372,0.089973256,0.0013486592,0.8119971,0.024747128,0.068929195],"study_design_scores_gemma":[0.00012133594,0.00007600268,0.00079300464,0.000081597864,0.000048911235,0.00007821265,0.00009797974,0.16230221,0.00095957355,0.8262645,0.009141112,0.000035479177],"about_ca_topic_score_codex":0.00312209,"about_ca_topic_score_gemma":0.008244512,"teacher_disagreement_score":0.008627245,"about_ca_system_score_codex":0.0021150603,"about_ca_system_score_gemma":0.0009204329,"threshold_uncertainty_score":0.028860986},"labels":[],"label_agreement":null},{"id":"W2013441256","doi":"10.1016/j.disc.2011.02.017","title":"Helly theorems for 3-Steiner and 3-monophonic convexity in graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Steiner tree problem; Discrete mathematics; Graph","score_opus":0.04527375080292364,"score_gpt":0.2889499057836746,"score_spread":0.24367615498075093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013441256","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48859704,0.0021317827,0.34133998,0.011156558,0.0005615557,0.00018378133,0.0014383354,0.00039946652,0.15419157],"genre_scores_gemma":[0.92753375,0.0019377208,0.040451717,0.0016627668,0.0008202056,0.000361749,0.0008207753,0.00027622408,0.026135007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990398,0.00025808543,0.000058954523,0.00018933362,0.00025687486,0.00019683452],"domain_scores_gemma":[0.9931772,0.0047991327,0.00049362704,0.0004862448,0.00039880208,0.0006451053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018534333,0.0010022498,0.0015687189,0.0031965203,0.0034950636,0.004176824,0.0020151562,0.0018129263,0.010217629],"category_scores_gemma":[0.006162873,0.0011285992,0.0022856677,0.0026371276,0.0058932947,0.009767379,0.0046680192,0.007841356,0.0007834783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003456399,0.000015524098,0.00029963706,0.000037382604,0.000013474419,0.000058887526,0.00023705751,0.001539094,0.00033013715,0.9932152,0.0015829538,0.0026361963],"study_design_scores_gemma":[0.000014075923,0.000006811808,0.0002531559,0.000006694852,0.000010409614,0.00003926783,0.000064417385,0.003113041,0.0001821017,0.9953166,0.0009854526,0.000007974762],"about_ca_topic_score_codex":0.002218101,"about_ca_topic_score_gemma":0.0027385629,"teacher_disagreement_score":0.010217629,"about_ca_system_score_codex":0.0026795352,"about_ca_system_score_gemma":0.0010785105,"threshold_uncertainty_score":0.034181416},"labels":[],"label_agreement":null},{"id":"W2013713597","doi":"10.1016/s0012-365x(99)00355-6","title":"On hamiltonian connectedness of K1,4-free graphs","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Social connectedness; Pancyclic graph; Discrete mathematics; Graph; Hamiltonian (control theory); Connectivity; Pathwidth; Line graph","score_opus":0.017383883880047038,"score_gpt":0.28031229433020755,"score_spread":0.2629284104501605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013713597","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92975533,0.0009297645,0.018699935,0.0015436935,0.00009441121,0.000051662322,0.0005855113,0.00010528917,0.048234247],"genre_scores_gemma":[0.986212,0.000773602,0.004826534,0.00033286205,0.00012990365,0.00007099861,0.00064011285,0.00006920224,0.0069446666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994684,0.00012490434,0.00002838586,0.00016314897,0.00009514209,0.00012007054],"domain_scores_gemma":[0.9942358,0.0038361773,0.00081652624,0.00026400393,0.000281855,0.0005656212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006420895,0.0006914625,0.00075163116,0.0029656445,0.002318757,0.0028351585,0.0018194858,0.0015497073,0.01174868],"category_scores_gemma":[0.0048972564,0.000775343,0.0006323782,0.0029254465,0.0030103219,0.0044870595,0.0019686879,0.0016990959,0.0005537843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031385748,0.00011096423,0.003822892,0.00030271732,0.000053450265,0.00048157133,0.0021282146,0.008582224,0.004698275,0.96088,0.004276466,0.01434947],"study_design_scores_gemma":[0.00005103768,0.000028464834,0.0025266642,0.000051506795,0.000033319255,0.00018813058,0.0005666774,0.009477689,0.00073440064,0.98473465,0.0015844149,0.000022998429],"about_ca_topic_score_codex":0.0020006571,"about_ca_topic_score_gemma":0.002783915,"teacher_disagreement_score":0.01174868,"about_ca_system_score_codex":0.0012677315,"about_ca_system_score_gemma":0.0005153008,"threshold_uncertainty_score":0.039303243},"labels":[],"label_agreement":null},{"id":"W2013957545","doi":"10.1016/j.disc.2011.02.008","title":"Extending precolourings of circular cliques","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Conjecture; Clique number; Chromatic scale; Clique; Graph; Discrete mathematics","score_opus":0.05201806543424768,"score_gpt":0.305140009474376,"score_spread":0.2531219440401283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013957545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2914748,0.0006091124,0.6037153,0.00089838036,0.0004759589,0.00021048081,0.00081690174,0.0015548711,0.10024423],"genre_scores_gemma":[0.78655547,0.00057587447,0.17724712,0.00040951424,0.0005105428,0.00011429696,0.0009806728,0.0010260498,0.032580458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907744,0.00019297925,0.000050486215,0.00029236366,0.0002040529,0.00018271936],"domain_scores_gemma":[0.99279344,0.0030130239,0.00041298315,0.0025505384,0.0006719059,0.00055814354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010386766,0.0004814739,0.0006283581,0.0011969745,0.0016760349,0.0016772513,0.0016091105,0.00067453634,0.011146378],"category_scores_gemma":[0.006413531,0.0006222243,0.0011078465,0.001288137,0.0022799303,0.0042605707,0.0025658794,0.0022566465,0.0012472811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025328994,0.00008860012,0.0006503415,0.00014457126,0.000020527867,0.00016784304,0.00066606264,0.008640589,0.005985504,0.9181267,0.004767775,0.06048814],"study_design_scores_gemma":[0.000040157127,0.00007408997,0.0004676195,0.000036002148,0.00003022539,0.0001600493,0.00015397927,0.029544495,0.004080706,0.94275504,0.022632387,0.000025262134],"about_ca_topic_score_codex":0.0016433883,"about_ca_topic_score_gemma":0.0024601559,"teacher_disagreement_score":0.011146378,"about_ca_system_score_codex":0.0007130023,"about_ca_system_score_gemma":0.0005374047,"threshold_uncertainty_score":0.03728831},"labels":[],"label_agreement":null},{"id":"W2013977006","doi":"10.1016/s0012-365x(99)00374-x","title":"Cyclically resolvable cyclic Steiner triple systems of order 21 and 39","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Beijing Institute For Brain Disorders","keywords":"Mathematics; Steiner system; Combinatorics; Order (exchange); Discrete mathematics","score_opus":0.007023607796388143,"score_gpt":0.19988096601752797,"score_spread":0.19285735822113984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013977006","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7680273,0.0006483614,0.10117879,0.0012275398,0.00030531123,0.0002150049,0.002163763,0.00056614686,0.12566769],"genre_scores_gemma":[0.95154524,0.0003492399,0.026785724,0.00025034847,0.00008111085,0.00011245437,0.0014468912,0.00012043257,0.019308515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915016,0.00015565053,0.000055192722,0.00012214121,0.0002666891,0.0002501576],"domain_scores_gemma":[0.99808866,0.00070495036,0.00037306888,0.0003141567,0.00029087765,0.00022816511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042736778,0.0006314327,0.0010726062,0.0015340442,0.0025025073,0.0026724762,0.00091670494,0.0013467445,0.013342594],"category_scores_gemma":[0.0017759452,0.0006165472,0.0007076676,0.0022781075,0.0014901373,0.0017285749,0.0016662063,0.0020524012,0.0014907888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002662075,0.000070136164,0.00049990485,0.00013078965,0.00003560876,0.00062930654,0.00064574543,0.0082740085,0.009243695,0.9598023,0.0053917896,0.015010502],"study_design_scores_gemma":[0.00009499574,0.00014584785,0.0005763736,0.000052920506,0.00003843878,0.0006576288,0.00064740947,0.02220121,0.009209248,0.9550517,0.011257755,0.00006649681],"about_ca_topic_score_codex":0.0015089113,"about_ca_topic_score_gemma":0.0024625878,"teacher_disagreement_score":0.013342594,"about_ca_system_score_codex":0.00149006,"about_ca_system_score_gemma":0.0016948615,"threshold_uncertainty_score":0.044635415},"labels":[],"label_agreement":null},{"id":"W2014599857","doi":"10.1016/j.disc.2009.11.001","title":"Super-simple, pan-orientable and pan-decomposable GDDs with block size 4","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"Beijing Institute For Brain Disorders","keywords":"Mathematics; Combinatorics; Simple (philosophy); Block (permutation group theory); Block size; Graph; Type (biology); Discrete mathematics; Simple graph; Computer science; Biology; Key (lock)","score_opus":0.005352589684274519,"score_gpt":0.20006041606032907,"score_spread":0.19470782637605455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014599857","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67669654,0.00042075984,0.23796062,0.00051095267,0.00013994303,0.00015310237,0.00089204445,0.00084317604,0.08238281],"genre_scores_gemma":[0.9179886,0.0003040617,0.058949906,0.00020244002,0.000050859326,0.00011266817,0.0006131358,0.00017677552,0.021601634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997255,0.000043261054,0.000020425878,0.000067108784,0.000078489546,0.000065123146],"domain_scores_gemma":[0.99922967,0.0002307336,0.00012141321,0.00014990287,0.00009942845,0.00016889494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021469196,0.00046879193,0.0005272995,0.0007046443,0.00052747363,0.0009604938,0.0004972367,0.00044347267,0.0058632535],"category_scores_gemma":[0.0009893347,0.0003354667,0.0003592262,0.00053077657,0.00085012696,0.0013643542,0.001098618,0.00093466643,0.000759207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005470446,0.000106846644,0.00112067,0.00024124465,0.000035666413,0.0009060325,0.00038314634,0.010313715,0.0614523,0.8790342,0.004718139,0.04114097],"study_design_scores_gemma":[0.0003338334,0.00033954222,0.0024485714,0.0000750192,0.00010456985,0.001384827,0.00036935465,0.080243915,0.043100998,0.84130746,0.030224439,0.00006747199],"about_ca_topic_score_codex":0.0006172186,"about_ca_topic_score_gemma":0.0010402595,"teacher_disagreement_score":0.0058632535,"about_ca_system_score_codex":0.00043281936,"about_ca_system_score_gemma":0.00040761702,"threshold_uncertainty_score":0.019614518},"labels":[],"label_agreement":null},{"id":"W2015153338","doi":"10.1016/j.disc.2011.06.016","title":"The adaptable choosability number grows with the choosability number","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Multigraph; Integer (computer science); Colored; Infinity; Discrete mathematics; Graph; Computer science","score_opus":0.034086144093716846,"score_gpt":0.2841479216427549,"score_spread":0.250061777549038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015153338","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6879053,0.0013509032,0.24866897,0.0036441807,0.0005772561,0.00011694309,0.0013777299,0.002932902,0.05342592],"genre_scores_gemma":[0.9684446,0.00083889166,0.019918185,0.00032641576,0.00024125355,0.00016692448,0.00055178354,0.0005093339,0.009002505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877876,0.00021518116,0.00005688199,0.00041620716,0.00032559846,0.00020729839],"domain_scores_gemma":[0.9812757,0.012683761,0.0011028291,0.0027494752,0.0009027721,0.001285338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011516667,0.00069569075,0.0010800522,0.0014928309,0.0007807111,0.0020652942,0.0020006543,0.0017557248,0.011529954],"category_scores_gemma":[0.015283948,0.00066942093,0.00076451054,0.0011683027,0.0018178333,0.005861525,0.0017398463,0.0034124337,0.0017378994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011008186,0.00052789506,0.01717031,0.0009283483,0.00021019312,0.0011073722,0.0005250425,0.12235816,0.13570997,0.576713,0.012093873,0.13155505],"study_design_scores_gemma":[0.000098653116,0.0002162665,0.0128145255,0.00008797952,0.00013561209,0.0012932122,0.0002202829,0.41478738,0.028313298,0.53143656,0.010453281,0.00014286685],"about_ca_topic_score_codex":0.00046616455,"about_ca_topic_score_gemma":0.0004885843,"teacher_disagreement_score":0.011529954,"about_ca_system_score_codex":0.0009229915,"about_ca_system_score_gemma":0.000688613,"threshold_uncertainty_score":0.038571537},"labels":[],"label_agreement":null},{"id":"W2015241707","doi":"10.1016/j.disc.2009.08.020","title":"Quarter-regular biembeddings of Latin squares","year":2009,"lang":"es","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Australian Mathematical Sciences Institute","keywords":"Latin square; Mathematics; Combinatorics; Quarter (Canadian coin); Least-squares function approximation; Symmetry (geometry); Discrete mathematics; Statistics; Geometry; Geography","score_opus":0.00905420544041423,"score_gpt":0.22745417199221818,"score_spread":0.21839996655180394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015241707","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6865393,0.00060718023,0.169111,0.0013723637,0.00067434664,0.00008315843,0.00037019377,0.0006375726,0.14060488],"genre_scores_gemma":[0.9000528,0.0004897612,0.037623983,0.00062928157,0.00032943,0.000088130655,0.0003453312,0.0004578125,0.059983484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996141,0.000104275816,0.000021854521,0.00008648528,0.000105282044,0.000067932684],"domain_scores_gemma":[0.9989453,0.00029834599,0.00017710228,0.00022853415,0.00015218489,0.00019859576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032305345,0.0005089273,0.00047665514,0.0011796695,0.0008518123,0.0016015482,0.0006574249,0.000763984,0.0113736],"category_scores_gemma":[0.0020619044,0.00045791615,0.0003258503,0.0006069202,0.0013646927,0.001708626,0.0015657559,0.0014543772,0.0019244627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012363061,0.000033708402,0.00034248005,0.000040199502,0.00001311755,0.00016972434,0.00026335748,0.00300319,0.008272458,0.9719885,0.0023392828,0.013410228],"study_design_scores_gemma":[0.000026550317,0.000051147363,0.00039906817,0.000016584368,0.000008728578,0.00024803012,0.00021513604,0.016679032,0.0030118783,0.97147894,0.007844436,0.000020424877],"about_ca_topic_score_codex":0.0004040884,"about_ca_topic_score_gemma":0.00040603805,"teacher_disagreement_score":0.0113736,"about_ca_system_score_codex":0.00043610632,"about_ca_system_score_gemma":0.00025462572,"threshold_uncertainty_score":0.038048506},"labels":[],"label_agreement":null},{"id":"W2015485247","doi":"10.1016/j.disc.2014.10.018","title":"Digraph functors which admit both left and right adjoints","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Homotopy and Cohomology in Algebraic Topology","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Mathematics; Homomorphism; Functor; Adjoint functors; Digraph; Existential quantification; Derived functor; Connection (principal bundle); Functor category; Discrete mathematics; Combinatorics; Pure mathematics","score_opus":0.016183054048012756,"score_gpt":0.27194128721581134,"score_spread":0.2557582331677986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015485247","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27061102,0.0024688381,0.44861737,0.0028965408,0.0017142992,0.00011448395,0.0007245116,0.0014500013,0.27140293],"genre_scores_gemma":[0.89804125,0.0011313077,0.036345344,0.0010976696,0.00042705957,0.00010224319,0.0005375333,0.00020348579,0.062114112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922156,0.00011076237,0.000050463317,0.0002247084,0.00019789017,0.00019454071],"domain_scores_gemma":[0.9987534,0.0004806096,0.00010549409,0.00018717429,0.00020396008,0.00026931384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009124811,0.0008041717,0.00072405295,0.0028946192,0.0025950132,0.0042934213,0.0008205096,0.0020872063,0.008065211],"category_scores_gemma":[0.0018163216,0.00062127376,0.0009345159,0.0015911737,0.003593635,0.008220416,0.004737936,0.0034360639,0.0013030005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013673254,0.00002360475,0.00013488765,0.000014882546,0.0000036250392,0.00008647592,0.00017848659,0.00005834375,0.000727333,0.99444383,0.0004902185,0.0038247574],"study_design_scores_gemma":[0.000020188489,0.000019719937,0.00023641987,0.000012453042,0.000018087732,0.00031896433,0.00022231313,0.0012180367,0.0017292551,0.9860742,0.010113016,0.00001737118],"about_ca_topic_score_codex":0.0005993899,"about_ca_topic_score_gemma":0.00091005175,"teacher_disagreement_score":0.008065211,"about_ca_system_score_codex":0.0008811934,"about_ca_system_score_gemma":0.00058777793,"threshold_uncertainty_score":0.026980877},"labels":[],"label_agreement":null},{"id":"W2015635736","doi":"10.1016/s0012-365x(01)00073-5","title":"Homomorphisms to powers of digraphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Bishop's University","funders":"","keywords":"Homomorphism; Digraph; Mathematics; Combinatorics; Chromatic scale; Discrete mathematics; Homomorphic encryption; Path (computing); Polynomial; Power (physics); Computer science; Encryption","score_opus":0.029800373251303396,"score_gpt":0.2820215675189948,"score_spread":0.2522211942676914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015635736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30392084,0.002111721,0.47117752,0.003052371,0.0012246714,0.0002730527,0.00094148534,0.0013634666,0.21593495],"genre_scores_gemma":[0.87804425,0.0020617102,0.059065495,0.0008664034,0.0010034959,0.00025379536,0.0005980233,0.0005620551,0.057544835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985207,0.00046622707,0.00011383881,0.00039415024,0.00026818115,0.00023695701],"domain_scores_gemma":[0.994558,0.0029564663,0.00042202626,0.0007325018,0.00043614762,0.0008947726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013323792,0.0008140889,0.00083327043,0.0031167634,0.0016002998,0.0032529398,0.0013158745,0.00077299366,0.012318636],"category_scores_gemma":[0.0057556443,0.0009696586,0.0013139779,0.0020596618,0.0037198882,0.008952962,0.003553078,0.003388846,0.0018464124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035287183,0.000036352394,0.00014450452,0.000044725643,0.000009962828,0.000117320786,0.00048032394,0.00046353083,0.00064675993,0.9883286,0.0012996604,0.008392895],"study_design_scores_gemma":[0.000014591538,0.000011582068,0.00008765433,0.0000096638805,0.0000073587535,0.00010855135,0.00007937281,0.0009773867,0.0003216899,0.99359494,0.004780958,0.000006256536],"about_ca_topic_score_codex":0.000493347,"about_ca_topic_score_gemma":0.0005836886,"teacher_disagreement_score":0.012318636,"about_ca_system_score_codex":0.0011434915,"about_ca_system_score_gemma":0.0003952203,"threshold_uncertainty_score":0.041209936},"labels":[],"label_agreement":null},{"id":"W2015733148","doi":"10.1016/j.disc.2011.09.007","title":"Spanning trees with specified differences in Cayley graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada; Ontario Ministry of Research, Innovation and Science; Fonds Québécois de la Recherche sur la Nature et les Technologies; Carleton University","keywords":"Mathematics; Combinatorics; Multiset; Cayley graph; Spanning tree; Discrete mathematics; Finite group; Graph; Group (periodic table)","score_opus":0.03176362460817492,"score_gpt":0.1924164574428819,"score_spread":0.160652832834707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015733148","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7126341,0.0003858224,0.2597879,0.0006681565,0.00010441966,0.00006774962,0.00038202302,0.00029407704,0.025675831],"genre_scores_gemma":[0.95725006,0.00021648686,0.033911616,0.00018954651,0.00006167934,0.000065018685,0.00035940425,0.00008138047,0.007864783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993368,0.00020821905,0.000038986844,0.00011824711,0.00018821126,0.0001095042],"domain_scores_gemma":[0.9953643,0.002614447,0.0005592154,0.0004156691,0.00057193334,0.0004743642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074763066,0.00036184263,0.0006001493,0.0011356084,0.00093306263,0.0016822994,0.001319088,0.0011477519,0.0031024346],"category_scores_gemma":[0.0067670653,0.00054054044,0.0004062709,0.001056491,0.0012333808,0.0025532064,0.0011204942,0.002011277,0.00040273624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006484257,0.000031820575,0.00062129623,0.00003415937,0.0000093440685,0.00015467337,0.00022164053,0.011953784,0.0026562088,0.97633106,0.0008628835,0.00705831],"study_design_scores_gemma":[0.000023526683,0.000024858018,0.0003253419,0.000011299547,0.000007634885,0.00012938566,0.000098032426,0.045216758,0.0010833478,0.95146704,0.0016012331,0.000011579736],"about_ca_topic_score_codex":0.0011495113,"about_ca_topic_score_gemma":0.0021310435,"teacher_disagreement_score":0.0031024346,"about_ca_system_score_codex":0.0010099977,"about_ca_system_score_gemma":0.0007135539,"threshold_uncertainty_score":0.010378659},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simon Fraser University","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.04098667798335974,"score_gpt":0.3005052482776257,"score_spread":0.25951857029426595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015741724","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2364756,0.012980961,0.25093126,0.010467609,0.0022911916,0.00007680018,0.0003219169,0.00037388553,0.48608077],"genre_scores_gemma":[0.9032874,0.00550344,0.02888943,0.0017839324,0.0031471183,0.00012910149,0.0002473498,0.00023038458,0.056781862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986093,0.00052307337,0.000089677436,0.00022328747,0.00033446169,0.00022014105],"domain_scores_gemma":[0.99711585,0.0015628439,0.00031127656,0.00026357625,0.0003974012,0.00034907964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003053775,0.001911781,0.00153841,0.004784345,0.004046638,0.006393314,0.0017964485,0.0020054365,0.007284525],"category_scores_gemma":[0.0063474816,0.0009629026,0.0016230512,0.0040512644,0.010726107,0.013668248,0.0041882913,0.0054108966,0.0014656235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006831731,0.0000063049133,0.00004317585,0.000012036024,0.000002729563,0.000031386513,0.00016376887,0.00012210142,0.00008303147,0.9980411,0.00035204337,0.001135416],"study_design_scores_gemma":[0.0000029577168,0.0000023206753,0.000028252232,0.000005256042,0.0000021486126,0.000025976935,0.000029968383,0.00026403446,0.00003042325,0.99867296,0.0009325354,0.0000032435748],"about_ca_topic_score_codex":0.0013255721,"about_ca_topic_score_gemma":0.0011415259,"teacher_disagreement_score":0.007284525,"about_ca_system_score_codex":0.0028251708,"about_ca_system_score_gemma":0.0007840329,"threshold_uncertainty_score":0.02436918},"labels":[],"label_agreement":null},{"id":"W2015784652","doi":"10.1016/j.disc.2009.05.007","title":"The firefighter problem for cubic graphs","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; McGill University","funders":"","keywords":"Combinatorics; Mathematics; Degree (music); Vertex (graph theory); Graph; Discrete mathematics; Time complexity","score_opus":0.02183635650630993,"score_gpt":0.30538479815737224,"score_spread":0.2835484416510623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015784652","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51715714,0.003064744,0.3092707,0.022111647,0.0010830498,0.0005818178,0.0032927976,0.00078732404,0.14265081],"genre_scores_gemma":[0.78683436,0.0032091553,0.11504591,0.0014617539,0.0007256344,0.0003247284,0.0037605106,0.00051309454,0.08812491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991003,0.00022845322,0.000027694468,0.00020714317,0.00013408484,0.0003022735],"domain_scores_gemma":[0.99686545,0.0018863133,0.00024250026,0.0003214712,0.00019019202,0.0004940503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00121996,0.00093809585,0.0017511761,0.000904645,0.0034191862,0.0034465312,0.0036279163,0.0047933925,0.02336435],"category_scores_gemma":[0.008272689,0.00090450404,0.001314575,0.0017352691,0.0024818482,0.006566482,0.0028399755,0.004750664,0.0018273471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011235558,0.00052982214,0.0020105976,0.0008556183,0.000094525945,0.00071459904,0.00094833254,0.1179171,0.0021978905,0.6807911,0.107949205,0.08486775],"study_design_scores_gemma":[0.00023657492,0.000089364185,0.0006224769,0.0001067678,0.00004159571,0.0003225668,0.0010659175,0.14203134,0.0013477809,0.8346056,0.019492323,0.000037827554],"about_ca_topic_score_codex":0.012606808,"about_ca_topic_score_gemma":0.010669731,"teacher_disagreement_score":0.02336435,"about_ca_system_score_codex":0.0024361196,"about_ca_system_score_gemma":0.0023383896,"threshold_uncertainty_score":0.07816148},"labels":[],"label_agreement":null},{"id":"W2015958023","doi":"10.1016/s0012-365x(03)00260-7","title":"Balanced incomplete block designs with block size 9: part II","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Block (permutation group theory); Mathematics; Combinatorics; Block size; Discrete mathematics; Computer science","score_opus":0.01522455422241352,"score_gpt":0.2042299911895437,"score_spread":0.18900543696713018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015958023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041663535,0.0014456396,0.92788374,0.00024701122,0.00017237602,0.00031405225,0.00080996647,0.0003002274,0.027163373],"genre_scores_gemma":[0.6031614,0.0024351217,0.36776504,0.00043271587,0.00034770957,0.00088736066,0.0012367789,0.00020229467,0.023531603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872917,0.00043629762,0.00006583265,0.00019574145,0.00040008905,0.00017295932],"domain_scores_gemma":[0.9981128,0.0006573561,0.0003232534,0.0004986598,0.00033522918,0.00007269149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010927962,0.00077699864,0.0007065672,0.0006542706,0.00041578876,0.0013118709,0.0006291101,0.0007733112,0.009160105],"category_scores_gemma":[0.0026735743,0.00041259965,0.0004158726,0.0010726986,0.0006056236,0.0012101763,0.000567854,0.00061946246,0.0021869475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011035402,0.00024602184,0.0013105514,0.0006365849,0.00012682442,0.00023543525,0.00021864739,0.11107997,0.075850345,0.5509494,0.012136275,0.24610648],"study_design_scores_gemma":[0.00037180076,0.0013661275,0.0020118968,0.00034129698,0.0002833549,0.0010380677,0.00012798948,0.45653823,0.06728916,0.3921091,0.07840075,0.00012223865],"about_ca_topic_score_codex":0.0005899289,"about_ca_topic_score_gemma":0.0011719323,"teacher_disagreement_score":0.009160105,"about_ca_system_score_codex":0.00073970086,"about_ca_system_score_gemma":0.00092015404,"threshold_uncertainty_score":0.030643582},"labels":[],"label_agreement":null},{"id":"W2016420891","doi":"10.1016/j.disc.2013.01.005","title":"The abelian complexity of the paperfolding word","year":2013,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Word (group theory); Abelian group; Linguistics; Computer science; Mathematics; Pure mathematics; Philosophy","score_opus":0.03825754995801239,"score_gpt":0.26032372811973836,"score_spread":0.22206617816172597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016420891","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69790155,0.0024951266,0.09568413,0.009668052,0.0008875851,0.00006329564,0.0008457632,0.00031761796,0.19213681],"genre_scores_gemma":[0.97801745,0.0005646627,0.005635945,0.00038715545,0.0009221466,0.000053342603,0.00029170784,0.00008124201,0.014046509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984876,0.00040942937,0.00011099145,0.00032534555,0.00043035898,0.00023630128],"domain_scores_gemma":[0.99542964,0.0028461725,0.0005069638,0.00047925368,0.00034105737,0.0003969373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083088863,0.00053748075,0.00089873536,0.002256666,0.0018776229,0.0058440925,0.0010286694,0.001552558,0.012364344],"category_scores_gemma":[0.006097111,0.00044548823,0.00082680857,0.0019508194,0.00478765,0.013196332,0.0029102613,0.0023825897,0.0011887391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039365616,0.000012751668,0.00034534492,0.000026827896,0.000005048654,0.000073050105,0.00024387077,0.0006097043,0.00043226877,0.9941004,0.00092242274,0.00318898],"study_design_scores_gemma":[0.00000594306,0.000005790835,0.00016848596,0.0000055180653,0.0000032067771,0.000059980604,0.000057073863,0.0014290555,0.00025488826,0.9967758,0.001225796,0.0000084274725],"about_ca_topic_score_codex":0.0007816561,"about_ca_topic_score_gemma":0.00040607265,"teacher_disagreement_score":0.012364344,"about_ca_system_score_codex":0.0013943432,"about_ca_system_score_gemma":0.00066727155,"threshold_uncertainty_score":0.04136288},"labels":[],"label_agreement":null},{"id":"W2016554949","doi":"10.1016/j.disc.2010.07.023","title":"Two refinements of the bound of Sauer, Perles and Shelah, and of Vapnik and Chervonenkis","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.005441214389066695,"score_gpt":0.20432793689826478,"score_spread":0.1988867225091981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016554949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0115414895,0.013019253,0.7819391,0.025907785,0.010554611,0.00040587253,0.001613516,0.0013213203,0.15369704],"genre_scores_gemma":[0.32587856,0.014430376,0.50836486,0.023736313,0.015543216,0.0019378316,0.0033310454,0.0035576094,0.10322025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97998834,0.0059451135,0.00091783784,0.0039805304,0.007228458,0.001939657],"domain_scores_gemma":[0.9469883,0.025953794,0.0014719815,0.0155725535,0.0077345045,0.0022788027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017572388,0.005585842,0.0062675974,0.009267426,0.007553773,0.010152187,0.011886336,0.008064215,0.022694357],"category_scores_gemma":[0.084756434,0.002178024,0.0067198128,0.01093428,0.0142597575,0.030989215,0.0219603,0.025574327,0.011827746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023324385,0.000103971746,0.00028591751,0.00037211456,0.0000695818,0.00012378489,0.0005185055,0.0017745966,0.0009347049,0.947146,0.025411155,0.023026358],"study_design_scores_gemma":[0.00007834372,0.00009979213,0.0004255108,0.00021047484,0.00012791208,0.00025063177,0.00017983184,0.018508993,0.0015738354,0.92837757,0.05003739,0.0001295872],"about_ca_topic_score_codex":0.007259444,"about_ca_topic_score_gemma":0.005730157,"teacher_disagreement_score":0.022694357,"about_ca_system_score_codex":0.0063512176,"about_ca_system_score_gemma":0.005653308,"threshold_uncertainty_score":0.09293276},"labels":[],"label_agreement":null},{"id":"W2016857938","doi":"10.1016/j.disc.2011.05.032","title":"Cycles in <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-traceable oriented graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"University of South Africa","keywords":"Combinatorics; Tournament; Digraph; Mathematics; Conjecture; Vertex (graph theory); Girth (graph theory); Order (exchange); Discrete mathematics; Graph","score_opus":0.025869409061803416,"score_gpt":0.2693643896109582,"score_spread":0.2434949805491548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016857938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013466315,0.0006971895,0.6179825,0.0025024316,0.0015569871,0.0004498021,0.061473567,0.05374988,0.24812128],"genre_scores_gemma":[0.16766652,0.0022659525,0.2989136,0.0020093797,0.00040817403,0.0010275609,0.11742755,0.03928576,0.3709955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995227,0.00007036813,0.00004927558,0.00011529651,0.00018042041,0.0000619024],"domain_scores_gemma":[0.9987293,0.00043228932,0.00010298152,0.00027517526,0.00038662346,0.00007370237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004058033,0.0007823891,0.00044840772,0.0017116341,0.000995837,0.003470331,0.0011186795,0.0008628096,0.10497823],"category_scores_gemma":[0.0030603718,0.00066004344,0.0006322827,0.002613469,0.00055138074,0.0037144402,0.0011719464,0.0015492818,0.029521106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021247071,0.00007502778,0.0006606379,0.0005342483,0.000024788538,0.0002932989,0.0008238356,0.0033616738,0.0053191893,0.53090364,0.34653184,0.11125938],"study_design_scores_gemma":[0.000036132184,0.0000147933915,0.00033828954,0.00012434572,0.000016941452,0.00013452623,0.0001285329,0.0060542524,0.009305155,0.13841712,0.8453934,0.000036565947],"about_ca_topic_score_codex":0.009049147,"about_ca_topic_score_gemma":0.010745899,"teacher_disagreement_score":0.10497823,"about_ca_system_score_codex":0.0013132566,"about_ca_system_score_gemma":0.0014235278,"threshold_uncertainty_score":0.35118717},"labels":[],"label_agreement":null},{"id":"W2016874427","doi":"10.1016/j.disc.2008.02.004","title":"Circle graphs and the cycle double cover conjecture","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Eulerian path; Graph; Cover (algebra); Discrete mathematics; Pure mathematics","score_opus":0.019056370746055845,"score_gpt":0.2714743867348818,"score_spread":0.25241801598882596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016874427","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6909776,0.0038597542,0.049926806,0.019320372,0.0007254716,0.000061307066,0.00071931427,0.0006064198,0.233803],"genre_scores_gemma":[0.9811132,0.0013283823,0.0033722273,0.0007592629,0.00055003574,0.00004353895,0.00045797927,0.000081634134,0.012293668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992656,0.0001820227,0.000019510846,0.00016998239,0.00019483783,0.00016798745],"domain_scores_gemma":[0.9959313,0.002580682,0.0003793729,0.00051397947,0.00023318797,0.00036154216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006994705,0.0004658987,0.0009884335,0.001595044,0.0026034652,0.0036277734,0.0009240518,0.0029380973,0.01241348],"category_scores_gemma":[0.0057419813,0.0005319534,0.00058083166,0.0023395158,0.0032423045,0.00583347,0.0026193224,0.0026540137,0.0013438106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015317019,0.000027876014,0.0007621576,0.00007342082,0.000010061555,0.00014213927,0.0003754671,0.0031384735,0.0005533803,0.9793633,0.0070858924,0.008314812],"study_design_scores_gemma":[0.000029466006,0.00000954842,0.00034108016,0.000016046857,0.000008892301,0.000079440855,0.00014754827,0.005036405,0.0004268384,0.9883239,0.0055711893,0.000009725201],"about_ca_topic_score_codex":0.0022385984,"about_ca_topic_score_gemma":0.0013355974,"teacher_disagreement_score":0.01241348,"about_ca_system_score_codex":0.001686171,"about_ca_system_score_gemma":0.00056469545,"threshold_uncertainty_score":0.04152721},"labels":[],"label_agreement":null},{"id":"W2017923854","doi":"10.1016/j.disc.2014.10.002","title":"Cycle-maximal triangle-free graphs","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Counterexample; Conjecture; Discrete mathematics; Homomorphism; Upper and lower bounds; Vertex (graph theory); Graph","score_opus":0.019972228845571226,"score_gpt":0.2811180102016201,"score_spread":0.2611457813560489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017923854","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.605459,0.0010488693,0.16662976,0.0024779642,0.00023757054,0.00020850454,0.0020768414,0.0007946578,0.2210668],"genre_scores_gemma":[0.92566454,0.0010020781,0.030989993,0.000626407,0.0001450835,0.00015070247,0.002350411,0.00023184762,0.03883895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995697,0.000060453287,0.000021484193,0.00011774921,0.00011736679,0.00011327946],"domain_scores_gemma":[0.99792624,0.0008737033,0.00024938292,0.00022847742,0.00028842123,0.00043380682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003504924,0.0006095815,0.0006579621,0.0012532042,0.0017297255,0.0018105342,0.0017051713,0.0008365911,0.01766662],"category_scores_gemma":[0.0026896005,0.00064731744,0.0005320634,0.0019525486,0.0011774477,0.00294717,0.0016976893,0.0015127157,0.0016826303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031780385,0.00009340797,0.0013527127,0.00028195145,0.000036259516,0.00032964975,0.0007231847,0.0036870693,0.008947949,0.94764376,0.009416783,0.027169496],"study_design_scores_gemma":[0.00007712538,0.000034403318,0.00094534626,0.000037811973,0.00003949042,0.00027005625,0.00030856687,0.007786808,0.0034457152,0.97757643,0.00946274,0.000015564245],"about_ca_topic_score_codex":0.0025698338,"about_ca_topic_score_gemma":0.003996448,"teacher_disagreement_score":0.01766662,"about_ca_system_score_codex":0.0009790242,"about_ca_system_score_gemma":0.00067014643,"threshold_uncertainty_score":0.059100688},"labels":[],"label_agreement":null},{"id":"W2018251139","doi":"10.1016/s0012-365x(00)00083-2","title":"Forbidden minors to graphs with small feedback sets","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Constructive; Treewidth; Pathwidth; Minor (academic); Vertex (graph theory); Discrete mathematics; Chordal graph; 1-planar graph; Constructive proof; Robertson–Seymour theorem; Maximal independent set; Clique-sum; Indifference graph; Graph; Line graph; Computer science","score_opus":0.03692080333076946,"score_gpt":0.29245304638469843,"score_spread":0.25553224305392896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018251139","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6587874,0.00070957263,0.29852504,0.0015594929,0.0004280548,0.00033883698,0.0008858407,0.0015389662,0.03722676],"genre_scores_gemma":[0.9293881,0.00043868157,0.045603186,0.00035685976,0.0003277094,0.00045213246,0.00070209533,0.00046687745,0.022264395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912864,0.00028696423,0.00004269681,0.00022096495,0.0001788226,0.00014199449],"domain_scores_gemma":[0.9937359,0.0034683396,0.0007904198,0.0006871331,0.0004791387,0.0008390121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006710335,0.0009767984,0.0009284862,0.0014885404,0.0019815124,0.0018975675,0.0015562115,0.0010821754,0.006348101],"category_scores_gemma":[0.0065175295,0.000941953,0.0010813881,0.00090798433,0.0018418771,0.002523142,0.0020720875,0.0025326237,0.0008167182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005853053,0.00020526786,0.0008408906,0.0002732577,0.000040525785,0.00037746763,0.0011180701,0.009738367,0.012486882,0.9479375,0.005449431,0.02094715],"study_design_scores_gemma":[0.00009990682,0.00009069411,0.00051179394,0.000027666421,0.000030439218,0.0003379021,0.00018486573,0.021793742,0.0032285892,0.9698266,0.0038466027,0.000021252188],"about_ca_topic_score_codex":0.0008231817,"about_ca_topic_score_gemma":0.0014667775,"teacher_disagreement_score":0.006348101,"about_ca_system_score_codex":0.0011251958,"about_ca_system_score_gemma":0.00072047167,"threshold_uncertainty_score":0.021236539},"labels":[],"label_agreement":null},{"id":"W2018911022","doi":"10.1016/j.disc.2006.01.009","title":"Improving probability bounds by optimization over subsets","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Pairwise comparison; Maximization; Mathematics; Event (particle physics); Combinatorics; Upper and lower bounds; Simple (philosophy); Set (abstract data type); Joint probability distribution; Discrete mathematics; Mathematical optimization; Computer science; Statistics","score_opus":0.011917030931404926,"score_gpt":0.2303138860464101,"score_spread":0.21839685511500517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018911022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005107896,0.0008863495,0.9905344,0.0005054368,0.00005697215,0.000019080258,0.000084567066,0.00024028917,0.0025650419],"genre_scores_gemma":[0.32315585,0.0032533177,0.6613019,0.0011592895,0.0008092218,0.0003650229,0.0010686207,0.0013626803,0.0075241476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99084365,0.005083817,0.00040875745,0.001272554,0.0018983182,0.0004929],"domain_scores_gemma":[0.9531537,0.038790848,0.0013119811,0.0046409825,0.0014732177,0.0006290928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010316704,0.0032453497,0.005861656,0.0031552403,0.0013447048,0.0038952536,0.004220559,0.0027776489,0.0063155317],"category_scores_gemma":[0.048546426,0.0027156402,0.0028945548,0.0042559486,0.0032608157,0.012350349,0.006904489,0.0076244385,0.0012118437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004467657,0.00019136957,0.0009479957,0.00043454382,0.00031124262,0.00008716209,0.0002728915,0.42011118,0.0019158971,0.46879297,0.008940244,0.09754779],"study_design_scores_gemma":[0.000024978337,0.00003708139,0.00014964666,0.000036915975,0.000045581583,0.000021477606,0.000014336646,0.5845842,0.00075972494,0.41255692,0.001754726,0.000014433609],"about_ca_topic_score_codex":0.0028430002,"about_ca_topic_score_gemma":0.0024190939,"teacher_disagreement_score":0.010316704,"about_ca_system_score_codex":0.0024527141,"about_ca_system_score_gemma":0.0016273351,"threshold_uncertainty_score":0.0545606},"labels":[],"label_agreement":null},{"id":"W2019436781","doi":"10.1016/j.disc.2014.03.024","title":"Elimination schemes and lattices","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Toronto Metropolitan University; Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Chordal graph; Induced subgraph; Vertex (graph theory); Distributive property; Discrete mathematics; Graph; Pure mathematics","score_opus":0.020247368989053133,"score_gpt":0.3001867631316433,"score_spread":0.27993939414259017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019436781","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16806945,0.029549975,0.18664105,0.03273362,0.0021064598,0.00011061364,0.0010587294,0.00051936775,0.5792108],"genre_scores_gemma":[0.8648842,0.008009954,0.02735089,0.0021372957,0.0019705498,0.00016439872,0.0006763238,0.00017772401,0.09462861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988433,0.0004400639,0.000062463456,0.00020443629,0.0002836531,0.00016597474],"domain_scores_gemma":[0.9982603,0.0009838258,0.00015616046,0.00025118524,0.0002148202,0.00013380458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001381003,0.0007863558,0.0010822038,0.0026221569,0.0040152636,0.0058430703,0.0012739004,0.0016591927,0.013553452],"category_scores_gemma":[0.0032607429,0.0008409847,0.00085266656,0.0042426726,0.008706296,0.011347578,0.003096279,0.0055243634,0.0017534323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005842047,0.0000043358878,0.000027144668,0.0000084911435,0.0000013017627,0.0000065334793,0.00010700324,0.000082359395,0.00003936564,0.9974656,0.00079794077,0.0014541583],"study_design_scores_gemma":[0.000004779786,0.0000015929648,0.000028501301,0.000004575302,0.0000016871129,0.000016957469,0.000040772495,0.00014022505,0.000034743367,0.9949537,0.0047699213,0.0000025919576],"about_ca_topic_score_codex":0.0016556445,"about_ca_topic_score_gemma":0.0014184383,"teacher_disagreement_score":0.013553452,"about_ca_system_score_codex":0.0027389978,"about_ca_system_score_gemma":0.0008416096,"threshold_uncertainty_score":0.045340776},"labels":[],"label_agreement":null},{"id":"W2019462839","doi":"10.1016/j.disc.2008.05.025","title":"Generating asymptotically optimal broadcasting schedules to minimize average waiting time","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Schedule; Asymptotically optimal algorithm; Scheduling (production processes); Mathematical optimization; Computer science; Broadcasting (networking); Block (permutation group theory); Mathematics; Heuristic; Algorithm; Combinatorics; Computer network","score_opus":0.01167587249279253,"score_gpt":0.21394774198053612,"score_spread":0.2022718694877436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019462839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16658616,0.0002855007,0.82096887,0.00069296826,0.00011453113,0.00022341115,0.00036838258,0.0008726853,0.009887504],"genre_scores_gemma":[0.8008813,0.00026455923,0.19201101,0.00015080845,0.00010410235,0.00038985905,0.00044899213,0.00033985163,0.0054094833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991855,0.00031791738,0.000026203332,0.00012940682,0.00017587145,0.00016507451],"domain_scores_gemma":[0.9942608,0.0044755517,0.00033645733,0.0002876001,0.00044440842,0.00019518188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014217144,0.00096073904,0.0012815845,0.0008739071,0.00050853955,0.00087577564,0.0014111445,0.0014207946,0.00444485],"category_scores_gemma":[0.009735966,0.00087934604,0.00065824186,0.0014298318,0.00075499795,0.00094023946,0.0009476456,0.0010369058,0.00051851274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022256102,0.00007340957,0.0004193833,0.00007625376,0.000026952379,0.000038979757,0.00008674146,0.9515347,0.0024942714,0.021334248,0.0021455802,0.021546856],"study_design_scores_gemma":[0.00006267934,0.000039423234,0.000095980766,0.0000049511773,0.000011573069,0.000010257132,0.000022027165,0.9852367,0.0005323332,0.013665331,0.00031347648,0.00000530843],"about_ca_topic_score_codex":0.0045937547,"about_ca_topic_score_gemma":0.0049338304,"teacher_disagreement_score":0.0045937547,"about_ca_system_score_codex":0.0020196722,"about_ca_system_score_gemma":0.003285554,"threshold_uncertainty_score":0.0148694515},"labels":[],"label_agreement":null},{"id":"W2019579600","doi":"10.1016/j.disc.2012.02.004","title":"Lexicographic products with high reconstruction numbers","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada; Thompson Rivers University","keywords":"Mathematics; Combinatorics; Lexicographical order; Vertex (graph theory); Discrete mathematics; Transitive relation; Isomorphism (crystallography); Graph","score_opus":0.02913461457382612,"score_gpt":0.2732950647848496,"score_spread":0.24416045021102348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019579600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2682386,0.0017220646,0.5412582,0.0042668097,0.00068127486,0.00012566111,0.000725951,0.001468228,0.18151323],"genre_scores_gemma":[0.7749612,0.0014501697,0.16188549,0.0009794206,0.0005321708,0.00016945391,0.00080505584,0.00114198,0.058075126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985123,0.0005106444,0.00007571696,0.0002443276,0.00044750847,0.00020945937],"domain_scores_gemma":[0.9940621,0.0035170605,0.00042405358,0.001029573,0.00052908267,0.00043810738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013691235,0.0008440659,0.0010526548,0.0022818637,0.0018265698,0.004481674,0.001036693,0.001669553,0.021026881],"category_scores_gemma":[0.008454436,0.0010339598,0.00076486904,0.0021289922,0.003713124,0.007053462,0.0034022988,0.0039660544,0.0036334102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005977088,0.000016113123,0.00013737362,0.000044543045,0.000004288181,0.0000663802,0.000108867316,0.00067181606,0.00059465,0.9895398,0.0013374484,0.0074188937],"study_design_scores_gemma":[0.000012928126,0.00001586536,0.00008330052,0.000014642013,0.0000067456017,0.00018910093,0.00006112305,0.003235026,0.0012568835,0.991347,0.0037665735,0.000010807861],"about_ca_topic_score_codex":0.0003357769,"about_ca_topic_score_gemma":0.00048898126,"teacher_disagreement_score":0.021026881,"about_ca_system_score_codex":0.0009050239,"about_ca_system_score_gemma":0.00055988063,"threshold_uncertainty_score":0.070341945},"labels":[],"label_agreement":null},{"id":"W2020320404","doi":"10.1016/j.disc.2010.05.028","title":"Maximum independent sets in 3- and 4-regular Hamiltonian graphs","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Combinatorics; Indifference graph; Maximal independent set; Hamiltonian path; Chordal graph; Hamiltonian path problem; Discrete mathematics; Hamiltonian (control theory); Pathwidth; Independent set; 1-planar graph; Planar graph; Graph; Line graph","score_opus":0.01348230672936073,"score_gpt":0.281595797223699,"score_spread":0.26811349049433825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020320404","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8559695,0.0014950966,0.06978468,0.0022225978,0.0001627939,0.00012445435,0.0012734763,0.0003154452,0.068651944],"genre_scores_gemma":[0.9593093,0.00055326044,0.025109144,0.00032559832,0.0001537811,0.00014865368,0.0008271118,0.00012195067,0.013451244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921954,0.00022638163,0.000044515415,0.00014596208,0.00019790034,0.00016570807],"domain_scores_gemma":[0.9945479,0.0037394909,0.00066246075,0.00032519278,0.00019916931,0.00052573305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008574226,0.00068082614,0.0012600968,0.0023292247,0.0025074314,0.0035025466,0.0020899423,0.0017101959,0.008055565],"category_scores_gemma":[0.00462414,0.0013230621,0.0013119577,0.0020612678,0.0023545218,0.0036937934,0.0018479765,0.002351193,0.0006055451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042267508,0.00018113683,0.0020983897,0.00024971695,0.00009920009,0.00039785038,0.000991905,0.018504465,0.005383216,0.95016474,0.005020365,0.016486509],"study_design_scores_gemma":[0.00008840349,0.000028318038,0.002157877,0.000034887697,0.00005617526,0.00020936971,0.000285806,0.034452114,0.0017063807,0.958998,0.001958786,0.000023946015],"about_ca_topic_score_codex":0.0011921517,"about_ca_topic_score_gemma":0.0025212972,"teacher_disagreement_score":0.008055565,"about_ca_system_score_codex":0.0013869981,"about_ca_system_score_gemma":0.0007053195,"threshold_uncertainty_score":0.026948571},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05757504967536323,"score_gpt":0.30013171817268813,"score_spread":0.2425566684973249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020519696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24010707,0.021694584,0.65246964,0.0044585075,0.001580201,0.00013911664,0.00095201883,0.0006048008,0.07799409],"genre_scores_gemma":[0.84312814,0.013354045,0.11230249,0.000713468,0.0018800085,0.00021142875,0.00076517736,0.00019029723,0.027454937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973863,0.00006644715,0.00001579636,0.00005315265,0.00009127427,0.000034606262],"domain_scores_gemma":[0.99752206,0.0010526967,0.00047358026,0.00015123289,0.0005917281,0.00020869082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047498103,0.00088702457,0.00064559415,0.0035197255,0.0010062965,0.0024631992,0.0006782189,0.0013110808,0.005597304],"category_scores_gemma":[0.0053649754,0.00034383652,0.0003056623,0.004188799,0.0015860881,0.0018504437,0.0009796694,0.001403989,0.0015033259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000765352,0.000038844344,0.0005830612,0.00013844203,0.000011564612,0.00014531089,0.0002404357,0.008464605,0.0024691604,0.9250364,0.0048115607,0.057984103],"study_design_scores_gemma":[0.00002849393,0.0000587046,0.0006247219,0.00005962406,0.0000137286725,0.00046315786,0.00012411608,0.07581829,0.0011089302,0.9073378,0.014318926,0.000043485154],"about_ca_topic_score_codex":0.0006839732,"about_ca_topic_score_gemma":0.0005043352,"teacher_disagreement_score":0.005597304,"about_ca_system_score_codex":0.00075288885,"about_ca_system_score_gemma":0.00066144776,"threshold_uncertainty_score":0.0187248},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; 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","score_opus":0.02510157427757449,"score_gpt":0.23450891319260106,"score_spread":0.20940733891502658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020661143","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5821571,0.004050715,0.25243196,0.0058823926,0.0012143756,0.00015309633,0.0007998188,0.001002126,0.15230836],"genre_scores_gemma":[0.96550316,0.00094481837,0.010287694,0.00046404244,0.0008419086,0.0000815996,0.0003091826,0.00015235266,0.021415232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985947,0.0003705457,0.00006750631,0.00033715536,0.00027890864,0.0003511943],"domain_scores_gemma":[0.99763525,0.0011153984,0.00019698075,0.0003179179,0.00022100302,0.0005135119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018459932,0.0018118911,0.0018031946,0.0042879595,0.003795404,0.0060681943,0.0012663503,0.0014959159,0.008502511],"category_scores_gemma":[0.0033742017,0.0009275126,0.0021591657,0.0028865093,0.006519181,0.0111668,0.0045642937,0.0051352438,0.0012160942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046714496,0.000020491132,0.00016684637,0.00002127019,0.000009737636,0.00004938252,0.00036223003,0.00022481951,0.00036133674,0.9956974,0.0004938937,0.0025458725],"study_design_scores_gemma":[0.000016066251,0.00002231808,0.00013646131,0.000008718051,0.000013351183,0.00008569643,0.0000784249,0.0006933786,0.00030612753,0.99632,0.002307583,0.000011835715],"about_ca_topic_score_codex":0.0010032017,"about_ca_topic_score_gemma":0.00076527154,"teacher_disagreement_score":0.008502511,"about_ca_system_score_codex":0.0028921089,"about_ca_system_score_gemma":0.0008745981,"threshold_uncertainty_score":0.028443754},"labels":[],"label_agreement":null},{"id":"W2020692437","doi":"10.1016/s0012-365x(02)00622-2","title":"Optimal linear rate 12 codes over F5 and F7","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Separable space; Discrete mathematics; Linear code; Minimum distance; Block code; Algorithm; Decoding methods; Mathematical analysis","score_opus":0.01614580043218577,"score_gpt":0.2490812867798957,"score_spread":0.2329354863477099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020692437","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44540408,0.006641141,0.38268936,0.00834157,0.0008091773,0.00043686244,0.0037347712,0.0021420077,0.1498009],"genre_scores_gemma":[0.8731193,0.0020226054,0.09776341,0.0009954815,0.00034944553,0.00032494217,0.001095645,0.00033226178,0.023996968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99652344,0.0010202393,0.00017855666,0.0003306387,0.00086016924,0.0010869384],"domain_scores_gemma":[0.9950955,0.0027188493,0.0005376639,0.00073265063,0.0006196422,0.00029570318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023879418,0.0014861228,0.0012718823,0.0014409869,0.0016796404,0.0028632637,0.0014083774,0.0021118543,0.011460139],"category_scores_gemma":[0.0075018248,0.0006081379,0.0007872423,0.0017095185,0.0018191393,0.0026392983,0.0028241528,0.0018909655,0.0024132035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022989481,0.00018370444,0.0010796477,0.00033503067,0.00009485784,0.0002445083,0.0004631119,0.047343772,0.009665613,0.7856429,0.016538115,0.13610981],"study_design_scores_gemma":[0.00047251562,0.00050048484,0.0009084863,0.00034974396,0.00013485369,0.0005185626,0.00034833327,0.1369913,0.020952145,0.8147846,0.023865394,0.00017363876],"about_ca_topic_score_codex":0.0021250856,"about_ca_topic_score_gemma":0.0028295293,"teacher_disagreement_score":0.011460139,"about_ca_system_score_codex":0.0029337048,"about_ca_system_score_gemma":0.0035686367,"threshold_uncertainty_score":0.038337946},"labels":[],"label_agreement":null},{"id":"W2022293262","doi":"10.1016/j.disc.2007.12.052","title":"The effect of redundancy on probability bounds","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Upper and lower bounds; Redundancy (engineering); Combinatorics; Event (particle physics); Discrete mathematics; Linear programming; Value (mathematics); Mathematical optimization; Statistics; Computer science","score_opus":0.1438625415616749,"score_gpt":0.4155693470029621,"score_spread":0.2717068054412872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022293262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20229775,0.0063630175,0.7570441,0.0047858404,0.00039471494,0.000080947306,0.0004387631,0.00052318844,0.028071675],"genre_scores_gemma":[0.9247878,0.001468966,0.07039531,0.0004801811,0.00051118626,0.00008649746,0.0001361136,0.00017995256,0.0019539422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9670807,0.021150427,0.0013408037,0.0025833996,0.006117823,0.0017268847],"domain_scores_gemma":[0.327299,0.62510073,0.010411882,0.02799581,0.00780439,0.0013880881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.036533,0.0015161999,0.003399012,0.0031045675,0.0013018877,0.0043199435,0.0032747127,0.0037616522,0.0055036023],"category_scores_gemma":[0.30188867,0.001863611,0.0016651693,0.0025925327,0.0048622442,0.01126618,0.0046907724,0.00404217,0.00056986115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019450667,0.00021679624,0.00548198,0.00076145947,0.00045302245,0.00080499385,0.000680734,0.44327122,0.002763754,0.4480018,0.0036846169,0.09193453],"study_design_scores_gemma":[0.00011707244,0.00030965643,0.0027281183,0.00019488727,0.00028793735,0.00046960998,0.000105478655,0.5514129,0.0024301936,0.4404688,0.0013763527,0.00009908605],"about_ca_topic_score_codex":0.0014442723,"about_ca_topic_score_gemma":0.00087897823,"teacher_disagreement_score":0.036533,"about_ca_system_score_codex":0.0016793165,"about_ca_system_score_gemma":0.001239986,"threshold_uncertainty_score":0.19320726},"labels":[],"label_agreement":null},{"id":"W2022480780","doi":"10.1016/j.disc.2012.12.018","title":"The bondage number of graphs on topological surfaces and Teschner’s conjecture","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Chordal graph; Pathwidth; Vertex (graph theory); 1-planar graph; Discrete mathematics; Indifference graph; Upper and lower bounds; Graph; Line graph","score_opus":0.01831219561700593,"score_gpt":0.3010492263508283,"score_spread":0.2827370307338224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022480780","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8332858,0.0012650741,0.034177184,0.008508512,0.00046323103,0.000045507088,0.0004255438,0.00029659102,0.12153259],"genre_scores_gemma":[0.9831198,0.0006529297,0.0052164462,0.00040094354,0.00040552157,0.000063190375,0.0002768346,0.000084232895,0.009780181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913615,0.00023007087,0.000036058842,0.0001966846,0.00020197273,0.00019905031],"domain_scores_gemma":[0.9955682,0.0022556847,0.0006596083,0.0005375301,0.00028352844,0.0006954458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014541231,0.0007806802,0.0014896245,0.0028566062,0.0032749244,0.0040736743,0.0018950178,0.0033869927,0.01213588],"category_scores_gemma":[0.007687407,0.0007479136,0.0009290737,0.0024357673,0.004990633,0.009541925,0.003024792,0.003962221,0.001084979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009456891,0.000023783792,0.0006606537,0.000034832883,0.000008263095,0.000050229046,0.00024071046,0.0018272967,0.00052966486,0.99193525,0.001825621,0.0027691857],"study_design_scores_gemma":[0.000019227038,0.000011819053,0.0003733782,0.000009534528,0.000006084635,0.00003451401,0.00008361281,0.0037440087,0.00020764788,0.9944166,0.0010835316,0.000010014308],"about_ca_topic_score_codex":0.0016835645,"about_ca_topic_score_gemma":0.001303913,"teacher_disagreement_score":0.01213588,"about_ca_system_score_codex":0.0019710953,"about_ca_system_score_gemma":0.00064291956,"threshold_uncertainty_score":0.04059863},"labels":[],"label_agreement":null},{"id":"W2022622575","doi":"10.1016/j.disc.2013.11.024","title":"Jeu-de-taquin promotion and a cyclic sieving phenomenon for semistandard hook tableaux","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bijection; Combinatorics; Hook; Bounded function; Mathematics; Young tableau; Set (abstract data type); Order (exchange); Word (group theory); Promotion (chess); Computer science; Geometry; Mathematical analysis","score_opus":0.032729299876964775,"score_gpt":0.3140085391917596,"score_spread":0.2812792393147948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022622575","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70663875,0.00087226985,0.11385325,0.002164052,0.00062268676,0.00008802164,0.00027835116,0.0010048836,0.17447773],"genre_scores_gemma":[0.95137423,0.00029482666,0.011337961,0.00038326316,0.00017715454,0.000068179805,0.00016351773,0.0002855376,0.03591533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992312,0.00014442956,0.00003826324,0.00013058232,0.00019726914,0.00025825578],"domain_scores_gemma":[0.998657,0.0004895579,0.0001473396,0.00024750628,0.00012789604,0.00033066823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009152444,0.0008402054,0.0013602258,0.0023992702,0.0031366302,0.0038798538,0.0013404749,0.0018322975,0.011656608],"category_scores_gemma":[0.0032963506,0.00078099314,0.0014233069,0.0018968397,0.0038495716,0.004051859,0.0035793483,0.0036751898,0.0014074127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004084676,0.00001552792,0.00019717019,0.000016064922,0.000004351689,0.00008735184,0.0002385127,0.00039889227,0.0007495236,0.99541324,0.0006438357,0.002194639],"study_design_scores_gemma":[0.000026351223,0.000026388669,0.0003878238,0.00001763439,0.000011720749,0.00015144354,0.000120338744,0.004859717,0.0008462675,0.99118716,0.0023388534,0.000026383863],"about_ca_topic_score_codex":0.0020576485,"about_ca_topic_score_gemma":0.0022507238,"teacher_disagreement_score":0.011656608,"about_ca_system_score_codex":0.0014593572,"about_ca_system_score_gemma":0.0008856509,"threshold_uncertainty_score":0.038995266},"labels":[],"label_agreement":null},{"id":"W2022623224","doi":"10.1016/s0012-365x(00)00213-2","title":"Hedetniemi's conjecture — a survey","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Conjecture; Mathematics; Combinatorics; Product (mathematics); Chromatic scale; Discrete mathematics; Geometry","score_opus":0.039637011896771324,"score_gpt":0.3202211428898492,"score_spread":0.2805841309930779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022623224","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04966358,0.450541,0.086902924,0.09117876,0.010646842,0.00013475666,0.0014248872,0.00045149686,0.30905586],"genre_scores_gemma":[0.44200155,0.39999303,0.054868925,0.014981228,0.0200842,0.00021693898,0.004066049,0.0003143976,0.06347357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987005,0.00020660719,0.000077996054,0.00046523605,0.0003532905,0.00019636293],"domain_scores_gemma":[0.99591833,0.0025455186,0.00018714773,0.00056820386,0.00054193754,0.00023884159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028972314,0.0010776324,0.0017522166,0.0031048495,0.0027240084,0.0040127793,0.0024902686,0.0029263562,0.010793672],"category_scores_gemma":[0.0063646166,0.0007965561,0.0008163354,0.0059161116,0.0047675623,0.01233692,0.0032714924,0.005304838,0.0028600811],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013543309,0.00017606455,0.0025277005,0.0011138855,0.00006066689,0.00019703634,0.00027648473,0.0027683142,0.0004453896,0.7380047,0.04867749,0.20561682],"study_design_scores_gemma":[0.000049610593,0.00007097829,0.001785738,0.00041360094,0.00003895362,0.0004737862,0.00043743223,0.0047870157,0.0009963177,0.70958,0.28131226,0.000054304342],"about_ca_topic_score_codex":0.0023870799,"about_ca_topic_score_gemma":0.0018653042,"teacher_disagreement_score":0.010793672,"about_ca_system_score_codex":0.0028709238,"about_ca_system_score_gemma":0.002019376,"threshold_uncertainty_score":0.036108494},"labels":[],"label_agreement":null},{"id":"W2022970434","doi":"10.1016/s0012-365x(03)00246-2","title":"Graph covers using t-colourable vertex sets","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Combinatorics; Mathematics; Edge cover; Vertex cover; Clique graph; Vertex (graph theory); Graph; Discrete mathematics; Simplex graph; Cover (algebra); Clique; Line graph; Graph power","score_opus":0.038138243317135084,"score_gpt":0.31519214250982835,"score_spread":0.2770538991926933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022970434","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56564504,0.0011487677,0.36598495,0.0011792708,0.0002875072,0.00020550562,0.00091410516,0.0016091818,0.06302561],"genre_scores_gemma":[0.90575117,0.000998293,0.075021595,0.0001885919,0.00015422412,0.00019133867,0.00061003456,0.00035206028,0.016732715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998885,0.00016046797,0.00006098762,0.00024235672,0.00032275898,0.00032847634],"domain_scores_gemma":[0.99620384,0.0022460665,0.0002822621,0.00064827764,0.0002275627,0.00039204178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005513458,0.0007041154,0.0009894246,0.0022693283,0.0016928181,0.00399426,0.0011935766,0.0013622722,0.008226896],"category_scores_gemma":[0.004195993,0.0009582333,0.0016251837,0.0025757083,0.0014806709,0.004491264,0.003152864,0.0014759122,0.0009277853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006962315,0.00011088225,0.0017197912,0.00032174712,0.000104379826,0.0008061403,0.00087608735,0.04472057,0.02067104,0.8694074,0.0054820073,0.05508374],"study_design_scores_gemma":[0.000105028885,0.00010203182,0.00125116,0.000083450606,0.00014480985,0.00081283855,0.00025704596,0.11879997,0.014446398,0.85283893,0.011113127,0.000045243585],"about_ca_topic_score_codex":0.0023682758,"about_ca_topic_score_gemma":0.0025196008,"teacher_disagreement_score":0.008226896,"about_ca_system_score_codex":0.0015415193,"about_ca_system_score_gemma":0.0006635,"threshold_uncertainty_score":0.02752173},"labels":[],"label_agreement":null},{"id":"W2024156610","doi":"10.1016/j.disc.2008.05.016","title":"On the complexity of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si15.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>H</mml:mi></mml:math>-colouring planar graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Planar graph; Scroll; Graph; Discrete mathematics; Planar; Algorithm; Computer science; Computer graphics (images); Theology","score_opus":0.040968302843498644,"score_gpt":0.2736410474955918,"score_spread":0.23267274465209317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024156610","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43924916,0.0061774477,0.2839231,0.04678773,0.0008963458,0.00050285814,0.012011111,0.0015643958,0.20888783],"genre_scores_gemma":[0.85459393,0.004344634,0.08622764,0.0024975343,0.0019299512,0.000599017,0.009113037,0.0012678567,0.039426353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945056,0.0016312009,0.00035899534,0.0010813805,0.0016371794,0.00078559574],"domain_scores_gemma":[0.92967665,0.06000892,0.0024955203,0.0037208044,0.0021245647,0.0019735976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030659589,0.0013352412,0.0022275639,0.0027244487,0.0032976577,0.011160625,0.0044292337,0.0033205952,0.03016667],"category_scores_gemma":[0.034350835,0.0013146462,0.002558313,0.004683207,0.005067775,0.023871036,0.0064827297,0.0072954674,0.0030984476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073499983,0.00022074845,0.0051883115,0.00093098334,0.00019566239,0.0003993799,0.0012089231,0.04859475,0.002074366,0.84870267,0.04744077,0.044308413],"study_design_scores_gemma":[0.00006705324,0.000030116084,0.0011879646,0.000059036392,0.00006584567,0.00021921864,0.0001975062,0.0455013,0.0006996936,0.9471737,0.004761273,0.000037160924],"about_ca_topic_score_codex":0.0067830896,"about_ca_topic_score_gemma":0.008064017,"teacher_disagreement_score":0.03016667,"about_ca_system_score_codex":0.006494746,"about_ca_system_score_gemma":0.0026750853,"threshold_uncertainty_score":0.10091752},"labels":[],"label_agreement":null},{"id":"W2024469085","doi":"10.1016/j.disc.2009.04.020","title":"Some bounds on the injective chromatic number of graphs","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Council","keywords":"Injective function; Chromatic scale; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.023747419379476255,"score_gpt":0.30682949604287385,"score_spread":0.2830820766633976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024469085","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41876936,0.01372396,0.22415686,0.0110581005,0.0008481138,0.0001238369,0.0014714955,0.0011394169,0.3287089],"genre_scores_gemma":[0.93850195,0.0054577524,0.028499717,0.0010136819,0.0011954606,0.0002628085,0.00091962167,0.00048067307,0.023668416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984559,0.00037000282,0.000067924484,0.0003765212,0.00042637152,0.00030329236],"domain_scores_gemma":[0.9765512,0.01825231,0.0009330084,0.0015661544,0.001023261,0.001673968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035803453,0.001877101,0.001271436,0.0063202465,0.0022940373,0.005641138,0.004310499,0.0018480214,0.012428185],"category_scores_gemma":[0.01895943,0.0011260846,0.001368742,0.0043072314,0.006841075,0.011037358,0.0047214157,0.006928034,0.0011810012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017967267,0.000074799995,0.0017177275,0.00020368416,0.000039903065,0.000078301324,0.0004396294,0.011161447,0.0022284426,0.9625849,0.004776075,0.01651547],"study_design_scores_gemma":[0.000021737747,0.000028760729,0.0013546433,0.00007621173,0.000047507914,0.0000777423,0.00011235856,0.022636212,0.0012748239,0.9706665,0.0036662063,0.000037270762],"about_ca_topic_score_codex":0.002248382,"about_ca_topic_score_gemma":0.0033080915,"teacher_disagreement_score":0.012428185,"about_ca_system_score_codex":0.004881953,"about_ca_system_score_gemma":0.0010705935,"threshold_uncertainty_score":0.041576445},"labels":[],"label_agreement":null},{"id":"W2024505149","doi":"10.1016/j.disc.2005.10.020","title":"On the orthogonal Latin squares polytope","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Polytope; Conjecture; Facet (psychology); Intersection (aeronautics); Rank (graph theory); Dimension (graph theory); Birkhoff polytope; Latin square; Class (philosophy); Euler's formula; Graph; Orthogonal array; Discrete mathematics; Statistics; Regular polygon; Computer science","score_opus":0.008075326840339818,"score_gpt":0.1871578789515727,"score_spread":0.1790825521112329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024505149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12532394,0.0026481736,0.57550675,0.0035978653,0.00096528104,0.00012282991,0.0009197267,0.00031906494,0.29059634],"genre_scores_gemma":[0.71116865,0.005135508,0.14800712,0.0016211973,0.0013418478,0.00038225006,0.0014735621,0.00075854064,0.1301114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991466,0.00028636988,0.000021737567,0.00014220439,0.00027110343,0.00013190757],"domain_scores_gemma":[0.99876297,0.0007121969,0.00013434388,0.00011216034,0.00015997578,0.00011841794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053511735,0.0009839536,0.0011312147,0.001331275,0.0013035311,0.0027859134,0.001018354,0.0012284805,0.01909852],"category_scores_gemma":[0.0030515115,0.0006323041,0.00068468176,0.0017727097,0.0022033302,0.002248013,0.0023509446,0.003212365,0.0030955062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042420535,0.00002265367,0.00012240397,0.00005650758,0.00001125137,0.000068760826,0.000065566506,0.021666441,0.00067031273,0.9577996,0.0069561615,0.0125179505],"study_design_scores_gemma":[0.0000204391,0.000023616953,0.00016153778,0.00003344934,0.0000055244886,0.00010191229,0.00008253627,0.06824552,0.0003500228,0.91822994,0.012729151,0.00001639142],"about_ca_topic_score_codex":0.001754982,"about_ca_topic_score_gemma":0.0013039277,"teacher_disagreement_score":0.01909852,"about_ca_system_score_codex":0.0009678026,"about_ca_system_score_gemma":0.0006608432,"threshold_uncertainty_score":0.063890934},"labels":[],"label_agreement":null},{"id":"W2024890934","doi":"10.1016/s0012-365x(01)00099-1","title":"On decomposing Kn−I into cycles of a fixed odd length","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Graph; Range (aeronautics); Discrete mathematics","score_opus":0.012571420230017167,"score_gpt":0.21364196119860224,"score_spread":0.20107054096858507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024890934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3664632,0.0026166954,0.4584926,0.0024409806,0.0008151129,0.00022619225,0.0005061108,0.0003908531,0.16804822],"genre_scores_gemma":[0.71854395,0.0041861576,0.1977861,0.0016966702,0.0006333883,0.00027183612,0.0011568277,0.0005312501,0.07519388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997923,0.000046987967,0.000007841215,0.000046163106,0.000046684636,0.00005999167],"domain_scores_gemma":[0.99919623,0.0003675167,0.00009912462,0.00014869728,0.000089494606,0.00009899095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044689435,0.001146994,0.0005452862,0.001378826,0.0010128351,0.0014691086,0.00079319003,0.0008686669,0.006669156],"category_scores_gemma":[0.0017593422,0.00031939507,0.00052415277,0.0017561335,0.001793086,0.00345206,0.0015177773,0.0014941464,0.00086680776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001847612,0.0000662726,0.00051272026,0.00016419233,0.000015256542,0.00015269096,0.00046043386,0.0104852095,0.0065201106,0.90919644,0.0070930645,0.06514888],"study_design_scores_gemma":[0.000011714308,0.000025957968,0.00034183968,0.000032964126,0.0000093786075,0.00008219835,0.00015852005,0.01425078,0.0013585759,0.97713566,0.0065784776,0.000013869438],"about_ca_topic_score_codex":0.001887757,"about_ca_topic_score_gemma":0.0031809954,"teacher_disagreement_score":0.006669156,"about_ca_system_score_codex":0.0009154846,"about_ca_system_score_gemma":0.0005496869,"threshold_uncertainty_score":0.022310555},"labels":[],"label_agreement":null},{"id":"W2026675463","doi":"10.1016/s0012-365x(02)00447-8","title":"Vertices contained in all or in no minimum total dominating set of a tree","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Dominating set; Vertex (graph theory); Graph; Tree (set theory); Discrete mathematics","score_opus":0.0440434861314269,"score_gpt":0.3371172881744353,"score_spread":0.2930738020430084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026675463","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83401984,0.00080613355,0.13745324,0.0014703854,0.00014630718,0.00015299441,0.0032683148,0.00024337474,0.022439444],"genre_scores_gemma":[0.83269924,0.0009466763,0.1481112,0.00028243792,0.00011255366,0.00015813716,0.0047393125,0.00016474743,0.012785721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993536,0.00009843911,0.000060646285,0.00023056577,0.00014857257,0.00010825927],"domain_scores_gemma":[0.99739516,0.0012563142,0.00025905983,0.0003361191,0.00032462686,0.00042867794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005517798,0.00066115876,0.0012692611,0.00095877075,0.001807499,0.0027374274,0.0012978492,0.0009367119,0.0027876534],"category_scores_gemma":[0.0022041395,0.0006005298,0.00090239337,0.0014566691,0.00084446016,0.0027576748,0.0011665323,0.0010629091,0.0005010561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004842066,0.0009053092,0.026425524,0.004232066,0.0011220434,0.0026720853,0.005480426,0.117329225,0.25910968,0.3841548,0.018268531,0.17545824],"study_design_scores_gemma":[0.0002713251,0.00073995657,0.013296802,0.00027147375,0.0013479204,0.0055141724,0.0032247533,0.17710678,0.08423113,0.67051446,0.043388747,0.000092523296],"about_ca_topic_score_codex":0.0008968825,"about_ca_topic_score_gemma":0.0017034602,"teacher_disagreement_score":0.0027876534,"about_ca_system_score_codex":0.00071763265,"about_ca_system_score_gemma":0.00080147735,"threshold_uncertainty_score":0.0093256235},"labels":[],"label_agreement":null},{"id":"W2027130206","doi":"10.1016/s0012-365x(99)00255-1","title":"Intersection of modules related to Macdonald's polynomials","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Conjecture; Macdonald polynomials; Combinatorics; Intersection (aeronautics); Partition (number theory); Polynomial; Symmetric function; Algebraic number; Tuple; Intersection homology; Discrete mathematics; Pure mathematics; Jacobi polynomials; Orthogonal polynomials; Cohomology","score_opus":0.020937533846628307,"score_gpt":0.312238805753857,"score_spread":0.29130127190722865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027130206","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8073354,0.0009560062,0.061850514,0.000950649,0.0003109147,0.00007091364,0.0003898272,0.00035063457,0.12778503],"genre_scores_gemma":[0.97135127,0.00042115213,0.008497226,0.00015257395,0.0003315284,0.00004729587,0.00040628368,0.00010632026,0.018686444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986987,0.0002577315,0.000063639345,0.00023391556,0.00040163196,0.00034426834],"domain_scores_gemma":[0.99794585,0.0005871285,0.0004508865,0.00018536075,0.00034884416,0.00048203245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012189988,0.0008462943,0.0011647869,0.004025058,0.0027428025,0.004430792,0.0016251605,0.0011527961,0.010841027],"category_scores_gemma":[0.0034142989,0.00063779246,0.0011766752,0.003022551,0.0032822762,0.006420764,0.003706485,0.0026229562,0.0011479072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056965502,0.000029550807,0.00040969736,0.000028606271,0.000011465791,0.00012315209,0.00034905953,0.00030208443,0.0008851991,0.9938222,0.0005765956,0.003405498],"study_design_scores_gemma":[0.000029176446,0.000037389524,0.0012056687,0.000020218724,0.000030324643,0.00041902042,0.00022085806,0.0030954229,0.001579869,0.98950726,0.0038234945,0.000031351054],"about_ca_topic_score_codex":0.0011657958,"about_ca_topic_score_gemma":0.00094018615,"teacher_disagreement_score":0.010841027,"about_ca_system_score_codex":0.0019343771,"about_ca_system_score_gemma":0.0009540007,"threshold_uncertainty_score":0.036266923},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; String (physics); Prefix; Order (exchange); Discrete mathematics; Ranking (information retrieval); Position (finance); Computer science; Artificial intelligence","score_opus":0.024482692655504124,"score_gpt":0.25503089231226334,"score_spread":0.2305481996567592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027483825","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029409666,0.00058447587,0.93982404,0.0013721914,0.0007241886,0.00021469207,0.0006205956,0.003799753,0.023450458],"genre_scores_gemma":[0.25721344,0.00042101232,0.71239513,0.00093829836,0.00033663595,0.00047306917,0.0011897631,0.0034110066,0.023621555],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99752766,0.0006658449,0.00018199992,0.00047033103,0.0009360913,0.0002180619],"domain_scores_gemma":[0.9953237,0.0012782041,0.00016545442,0.0023705396,0.00070395455,0.0001582081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014895606,0.0011526297,0.0010282736,0.0015672648,0.0016432069,0.0031654611,0.0015955353,0.0012886286,0.020701356],"category_scores_gemma":[0.011075,0.0008952275,0.0015466956,0.0010675326,0.002070282,0.004647851,0.004655037,0.002978184,0.0060418523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012693978,0.00018526785,0.001961223,0.0006853209,0.00025812673,0.0005919995,0.00084153976,0.021703484,0.036671087,0.33354875,0.039501473,0.5627824],"study_design_scores_gemma":[0.00020324341,0.00037032,0.0007233824,0.0002923115,0.00022619405,0.0017425222,0.00032845713,0.11516207,0.05200702,0.7333719,0.095430754,0.00014176207],"about_ca_topic_score_codex":0.0002672241,"about_ca_topic_score_gemma":0.0006544402,"teacher_disagreement_score":0.020701356,"about_ca_system_score_codex":0.00054300186,"about_ca_system_score_gemma":0.00088969636,"threshold_uncertainty_score":0.06925291},"labels":[],"label_agreement":null},{"id":"W2027568724","doi":"10.1016/j.disc.2008.05.033","title":"Sweeping graphs with large clique number","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Mathematics; Combinatorics; Clique; Enhanced Data Rates for GSM Evolution; Monotonic function; Clique number; Discrete mathematics; Upper and lower bounds; Clique-sum; Chordal graph; Graph; Computer science; 1-planar graph","score_opus":0.0245550563354613,"score_gpt":0.29721376348614753,"score_spread":0.27265870715068624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027568724","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77369076,0.000582566,0.17582288,0.0020042607,0.00010673377,0.00017681973,0.0013059847,0.00082766364,0.045482375],"genre_scores_gemma":[0.9172217,0.0004928243,0.062398806,0.0003354849,0.00015723021,0.00016510255,0.0013213471,0.00032559692,0.017581875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999353,0.00016040893,0.000023294633,0.0001803595,0.00014809561,0.00013480222],"domain_scores_gemma":[0.9885344,0.008081029,0.0008179655,0.0011458424,0.00040323733,0.0010174845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007027324,0.0005309795,0.0009569205,0.0018747947,0.0016901586,0.002076303,0.0014937709,0.0016315557,0.011955318],"category_scores_gemma":[0.007140994,0.0010230186,0.00076883123,0.0023391687,0.0014913965,0.003445796,0.0018380781,0.001997263,0.0007313319],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006849577,0.00024954093,0.005664793,0.0004050192,0.00016720504,0.0011613825,0.00074687746,0.06566279,0.022625513,0.84617025,0.012538502,0.043923087],"study_design_scores_gemma":[0.0001570869,0.00006706517,0.0031251176,0.000034106266,0.00007121357,0.00074327784,0.00034873732,0.16693258,0.00475243,0.8172266,0.0065099755,0.000031836655],"about_ca_topic_score_codex":0.0009808925,"about_ca_topic_score_gemma":0.001903309,"teacher_disagreement_score":0.011955318,"about_ca_system_score_codex":0.0006830902,"about_ca_system_score_gemma":0.0004539482,"threshold_uncertainty_score":0.039994538},"labels":[],"label_agreement":null},{"id":"W2027773173","doi":"10.1016/j.disc.2014.07.011","title":"Independent protection in graphs","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Asian Industrial and Economic Development","field":"Social Sciences","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Saint Mary's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Graph; Cardinality (data modeling); Discrete mathematics; Computer science","score_opus":0.037156462146025034,"score_gpt":0.2704268025110541,"score_spread":0.23327034036502908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027773173","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3809359,0.0032368372,0.29381123,0.019781927,0.0008996909,0.0001879435,0.0013204814,0.0006037267,0.29922232],"genre_scores_gemma":[0.9235293,0.0015017559,0.017322581,0.0013646423,0.00077146385,0.00016365426,0.000624402,0.00019977319,0.054522537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839455,0.00057810545,0.000049374496,0.000349383,0.00035830386,0.0002701615],"domain_scores_gemma":[0.98866165,0.0069032437,0.001194465,0.001454068,0.0007000581,0.0010864501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016875138,0.0009314127,0.0015654967,0.002674331,0.003075342,0.0036448662,0.0020950444,0.0024455716,0.013517543],"category_scores_gemma":[0.009866766,0.0007745606,0.0015589085,0.0030912948,0.0049029323,0.0076567787,0.0037265122,0.0059955795,0.0016195886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025583522,0.000016997648,0.0001289027,0.000029921208,0.000008476697,0.00003061284,0.00014963187,0.0014996881,0.00014393992,0.991755,0.0023182845,0.0038929975],"study_design_scores_gemma":[0.000010532997,0.000005038753,0.00008318294,0.000008225104,0.000006176672,0.000029931552,0.00002906374,0.0027842235,0.000084356165,0.99576616,0.0011895116,0.0000036494082],"about_ca_topic_score_codex":0.0012988243,"about_ca_topic_score_gemma":0.001037909,"teacher_disagreement_score":0.013517543,"about_ca_system_score_codex":0.0021110214,"about_ca_system_score_gemma":0.0011629886,"threshold_uncertainty_score":0.045220613},"labels":[],"label_agreement":null},{"id":"W2027879769","doi":"10.1016/j.disc.2007.08.059","title":"Equitable coloring planar graphs with large girth","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Mathematics; Combinatorics; Girth (graph theory); Edge coloring; Discrete mathematics; Planar graph; Graph coloring; Graph; Line graph; Graph power","score_opus":0.023172484547257583,"score_gpt":0.2980767138213042,"score_spread":0.2749042292740466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027879769","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59884715,0.00063886365,0.32183093,0.002494481,0.00021969812,0.00015693212,0.00073563197,0.0011310249,0.073945366],"genre_scores_gemma":[0.9076029,0.00060291623,0.07143916,0.0005917207,0.00018209488,0.00022911587,0.0008732843,0.0006480103,0.017830808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871814,0.00037497756,0.00005771961,0.0002543107,0.0003031071,0.0002917044],"domain_scores_gemma":[0.98954296,0.0058058742,0.00073925377,0.0023567695,0.0008716027,0.0006834451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092186785,0.0009020426,0.0012029192,0.0011466908,0.0019174517,0.0026613267,0.0021516576,0.0015724405,0.013048671],"category_scores_gemma":[0.008973921,0.0010629669,0.00059076364,0.0022138413,0.0016037128,0.0051135016,0.003673144,0.0028387224,0.0012407115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056165433,0.0002355824,0.0024120014,0.00033785758,0.000059125607,0.00043344157,0.0006507933,0.040162057,0.013634425,0.855968,0.009768718,0.07577628],"study_design_scores_gemma":[0.00009143192,0.000072311086,0.0008007219,0.000028132987,0.000056943856,0.00045246957,0.00030552532,0.044931307,0.0068039456,0.9395488,0.006885557,0.000022852837],"about_ca_topic_score_codex":0.00045111857,"about_ca_topic_score_gemma":0.001166304,"teacher_disagreement_score":0.013048671,"about_ca_system_score_codex":0.0012531099,"about_ca_system_score_gemma":0.0007066483,"threshold_uncertainty_score":0.043652177},"labels":[],"label_agreement":null},{"id":"W2027899079","doi":"10.1016/j.disc.2005.06.009","title":"Chromatic numbers and products","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Chromatic scale; Mathematics; Combinatorics; Discrete mathematics; Graph; Graph theory; Product (mathematics); Geometry","score_opus":0.02251451114500187,"score_gpt":0.2876285084972687,"score_spread":0.2651139973522668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027899079","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15142828,0.013480108,0.10991848,0.01420524,0.0016572253,0.00006535983,0.000660633,0.0003933081,0.7081914],"genre_scores_gemma":[0.8428547,0.0062588076,0.020680944,0.0015153371,0.0019510232,0.00016210495,0.00043045657,0.00020402226,0.12594262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992828,0.00017253346,0.000032495587,0.00022924252,0.00019901233,0.0000838673],"domain_scores_gemma":[0.9983961,0.00080352614,0.00016625758,0.00023251088,0.00023057938,0.00017109927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087395,0.000783817,0.00092760724,0.0032181463,0.0029544425,0.0058453283,0.0012965025,0.0016249631,0.01597598],"category_scores_gemma":[0.003179224,0.0007259252,0.0006291925,0.0040770364,0.008837556,0.014607075,0.0027525576,0.00483741,0.0014741094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024486708,0.0000022648035,0.000023569566,0.0000065115864,8.046493e-7,0.0000038414073,0.00007748464,0.000051244468,0.00003958763,0.99818736,0.0005799302,0.0010249466],"study_design_scores_gemma":[0.0000019626927,0.0000018202351,0.000051564675,0.00000423995,0.0000022123177,0.000022722767,0.00004251553,0.00019218183,0.000047661066,0.99448144,0.0051489053,0.0000026991097],"about_ca_topic_score_codex":0.0019637109,"about_ca_topic_score_gemma":0.0018042626,"teacher_disagreement_score":0.01597598,"about_ca_system_score_codex":0.0028710465,"about_ca_system_score_gemma":0.00079022057,"threshold_uncertainty_score":0.05344498},"labels":[],"label_agreement":null},{"id":"W2028246501","doi":"10.1016/s0012-365x(00)00311-3","title":"Ramsey properties of generalised irredundant sets in graphs","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.05613135934968266,"score_gpt":0.2956441910405573,"score_spread":0.23951283169087462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028246501","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8176751,0.0023094395,0.0927131,0.00213129,0.000119016506,0.00006540333,0.00037434834,0.00038881972,0.08422349],"genre_scores_gemma":[0.9854063,0.00066403777,0.007937402,0.00022852393,0.00012558782,0.00006108747,0.00014847734,0.00006776583,0.0053608315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986513,0.00042320747,0.00009877472,0.0002955031,0.00030523277,0.00022591975],"domain_scores_gemma":[0.9930269,0.0044353004,0.0007442553,0.0006495244,0.00048618,0.00065781723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002183241,0.00063806813,0.0013595737,0.003054565,0.0030135352,0.004737457,0.0018420069,0.0014520835,0.004837199],"category_scores_gemma":[0.0062695486,0.0010090331,0.0012786381,0.002302439,0.0067368075,0.010331624,0.0028343054,0.0033518346,0.00037917538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000414242,0.000015056428,0.00021036001,0.000039160255,0.0000076187885,0.000078671335,0.000785908,0.0005930184,0.0006642657,0.99559516,0.00025578978,0.0017134955],"study_design_scores_gemma":[0.000009420163,0.0000114602,0.00020019343,0.000014196525,0.000011137551,0.00011212253,0.00021630575,0.0016538075,0.00045914896,0.9964971,0.0008036607,0.0000114241675],"about_ca_topic_score_codex":0.0012242957,"about_ca_topic_score_gemma":0.0013529455,"teacher_disagreement_score":0.004837199,"about_ca_system_score_codex":0.0014880289,"about_ca_system_score_gemma":0.00048398375,"threshold_uncertainty_score":0.016182005},"labels":[],"label_agreement":null},{"id":"W2028544177","doi":"10.1016/j.disc.2009.08.013","title":"Absolute retracts and varieties generated by chordal graphs","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of the Fraser Valley","funders":"","keywords":"Mathematics; Chordal graph; Treewidth; Combinatorics; Discrete mathematics; Interval graph; Indifference graph; Pathwidth; Graph; 1-planar graph; Line graph","score_opus":0.013144400365500943,"score_gpt":0.27025405220967247,"score_spread":0.2571096518441715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028544177","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7788654,0.0021316805,0.089096084,0.0017835239,0.00051044853,0.00007366697,0.0003740372,0.00047157067,0.12669359],"genre_scores_gemma":[0.9670036,0.0005982897,0.006682745,0.00016982123,0.00025100823,0.000036469395,0.00026868173,0.00010690918,0.024882555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990834,0.00015878933,0.000050801227,0.00023197856,0.00028396354,0.00019109424],"domain_scores_gemma":[0.9982206,0.000764208,0.00024485117,0.00019671174,0.00017346677,0.00040006268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007713902,0.0006071615,0.0008446022,0.0027292038,0.0031177327,0.004209859,0.001495854,0.00090976176,0.008597044],"category_scores_gemma":[0.0028388817,0.0006399671,0.0008760402,0.002279058,0.004024475,0.006498538,0.0036835542,0.003333385,0.0008739762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051129125,0.000016113538,0.00027597582,0.000019979821,0.0000066538746,0.000107104985,0.000588498,0.000521442,0.00051452086,0.9943719,0.00043821378,0.003088393],"study_design_scores_gemma":[0.00002860343,0.000021958846,0.00045645447,0.000010976936,0.000013213238,0.00015026309,0.00039886168,0.0015608792,0.00046552246,0.9923361,0.004542699,0.000014488851],"about_ca_topic_score_codex":0.001416348,"about_ca_topic_score_gemma":0.0014551233,"teacher_disagreement_score":0.008597044,"about_ca_system_score_codex":0.0017921976,"about_ca_system_score_gemma":0.0004955456,"threshold_uncertainty_score":0.028759956},"labels":[],"label_agreement":null},{"id":"W2028659954","doi":"10.1016/j.disc.2012.05.010","title":"Shift graphs on precompact families of finite sets of natural numbers","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Fondo Nacional de Ciencia Tecnología e Innovación; Centre National de la Recherche Scientifique","keywords":"Mathematics; Combinatorics; Homomorphism; Discrete mathematics; Indifference graph; 1-planar graph; Pathwidth; Chordal graph; Maximal independent set; Chromatic scale; Natural number; Graph; Line graph","score_opus":0.028505839719055393,"score_gpt":0.3114435045596719,"score_spread":0.2829376648406165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028659954","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7058075,0.00092605443,0.24512626,0.0013972095,0.00018962962,0.00008475853,0.0005206911,0.00057333737,0.045374546],"genre_scores_gemma":[0.9513692,0.00052316743,0.03175754,0.0003151801,0.00013503872,0.00016665325,0.00047948488,0.00019412332,0.015059578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860865,0.00035595734,0.00007422826,0.00036919178,0.00037334795,0.00021862531],"domain_scores_gemma":[0.9945338,0.0031357813,0.0005386754,0.00055574754,0.0006386329,0.0005973157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012798042,0.00067723036,0.0008696727,0.0033727973,0.003469373,0.0032469742,0.0014800675,0.0012216509,0.005722821],"category_scores_gemma":[0.0053247223,0.00094289077,0.0011218035,0.0023789485,0.0043126117,0.0076775593,0.0028142917,0.0022576454,0.00050546956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026276686,0.000009626588,0.0002501286,0.000017067106,0.000005466776,0.0001316644,0.000424778,0.000604023,0.00050840434,0.99558276,0.00022785764,0.002212031],"study_design_scores_gemma":[0.000008641875,0.000009052843,0.00022265001,0.000010845658,0.000008121171,0.00012479177,0.00024169098,0.0024728784,0.00044547208,0.9951603,0.0012860538,0.000009527237],"about_ca_topic_score_codex":0.0021030286,"about_ca_topic_score_gemma":0.0024026714,"teacher_disagreement_score":0.005722821,"about_ca_system_score_codex":0.002329874,"about_ca_system_score_gemma":0.00077466574,"threshold_uncertainty_score":0.019144714},"labels":[],"label_agreement":null},{"id":"W2028666977","doi":"10.1016/j.disc.2009.11.002","title":"Balanced Cayley graphs and balanced planar graphs","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Combinatorics; Cayley graph; Chordal graph; Indifference graph; Discrete mathematics; Pathwidth; Clique-sum; Planar graph; 1-planar graph; Graph; Line graph","score_opus":0.016906704231970684,"score_gpt":0.28275048225219723,"score_spread":0.2658437780202266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028666977","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5561361,0.006539096,0.23825496,0.0047479616,0.0007274041,0.00014190732,0.0017330995,0.00054000923,0.19117945],"genre_scores_gemma":[0.9204467,0.0045395084,0.03324898,0.0008943277,0.00044385158,0.00011617173,0.0019123007,0.000115628245,0.03828254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972016,0.000052082683,0.000012345923,0.00008177362,0.0000716704,0.00006200391],"domain_scores_gemma":[0.99907315,0.0003088269,0.00022119241,0.0000959647,0.00015511013,0.00014579964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028212013,0.000622474,0.0004878457,0.0016649805,0.0011162929,0.0024028348,0.00077053916,0.0009059332,0.01076301],"category_scores_gemma":[0.0020455858,0.00048275723,0.00033177107,0.0028791202,0.0008586694,0.0031041896,0.0008732832,0.0015007635,0.0011603284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007811759,0.000024243333,0.00050317234,0.00006928687,0.000014432727,0.00010060301,0.00016795438,0.0026898507,0.0030326198,0.9672481,0.004470153,0.02160158],"study_design_scores_gemma":[0.000030114796,0.000012536272,0.0004189062,0.000014587195,0.000018960302,0.00009982466,0.00016258852,0.0052478258,0.00079716026,0.9827948,0.010393169,0.000009475246],"about_ca_topic_score_codex":0.0024602485,"about_ca_topic_score_gemma":0.0034977666,"teacher_disagreement_score":0.01076301,"about_ca_system_score_codex":0.0010121405,"about_ca_system_score_gemma":0.00043976182,"threshold_uncertainty_score":0.036005914},"labels":[],"label_agreement":null},{"id":"W2028813890","doi":"10.1016/j.disc.2004.12.005","title":"Disjoint paths in arborescences","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Digraph; Disjoint sets; Vertex (graph theory); Arc (geometry); Directed graph; Discrete mathematics; Tree (set theory); Graph","score_opus":0.021412973483374637,"score_gpt":0.30044547099507074,"score_spread":0.2790324975116961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028813890","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7670091,0.0013584606,0.15841158,0.0016897515,0.00018491411,0.00017107079,0.001372888,0.00045839415,0.069343925],"genre_scores_gemma":[0.86853844,0.0018137239,0.09132009,0.00043947157,0.00017444017,0.0003058876,0.0023660269,0.00029804328,0.034743886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993358,0.00013413346,0.000051771825,0.00020884967,0.0001622645,0.00010709605],"domain_scores_gemma":[0.9944563,0.0035436265,0.00063318596,0.00031633873,0.0004040412,0.00064656115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057427795,0.0007076036,0.0007741374,0.0024149113,0.0021097069,0.002790294,0.00127036,0.0013089542,0.012046751],"category_scores_gemma":[0.005509901,0.0010876594,0.0007716626,0.002859952,0.0018185126,0.0050224056,0.002522049,0.0024878273,0.0010589054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019682561,0.000081928396,0.0023056772,0.0003113611,0.00006310536,0.00075040926,0.001310505,0.005682498,0.0041989502,0.9530255,0.00429399,0.027779251],"study_design_scores_gemma":[0.000056540237,0.000036012512,0.0011748578,0.00006518313,0.000051787298,0.00066191435,0.0004857102,0.009842642,0.0010477466,0.97570634,0.010857073,0.0000142094505],"about_ca_topic_score_codex":0.0010605742,"about_ca_topic_score_gemma":0.002347916,"teacher_disagreement_score":0.012046751,"about_ca_system_score_codex":0.0009396332,"about_ca_system_score_gemma":0.000406983,"threshold_uncertainty_score":0.04030043},"labels":[],"label_agreement":null},{"id":"W2029352747","doi":"10.1016/j.disc.2007.12.088","title":"On the complexity of crossings in permutations","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Permutation (music); Minification; Discrete mathematics; Rank (graph theory); Complete bipartite graph; Monochromatic color; Graph; Mathematical optimization","score_opus":0.10620018999446688,"score_gpt":0.3393784880129924,"score_spread":0.23317829801852552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029352747","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76758116,0.0024556855,0.12792537,0.009480047,0.0003899892,0.00015719669,0.0018128384,0.00047092827,0.08972682],"genre_scores_gemma":[0.9642897,0.0016771957,0.019439999,0.00042987254,0.0005592678,0.00011567689,0.0011646854,0.00022463698,0.01209891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99674547,0.00084609416,0.00019384592,0.0005323602,0.0011420338,0.0005403161],"domain_scores_gemma":[0.9530837,0.038077805,0.0026597178,0.0031099417,0.0012975347,0.0017712876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026068785,0.0010577887,0.0021588616,0.0036823608,0.0027074188,0.008707531,0.0033836383,0.0035836077,0.01651454],"category_scores_gemma":[0.028606217,0.0011577306,0.0018224934,0.005691131,0.005555164,0.022534288,0.004660024,0.006013441,0.0010975223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038294843,0.00014042575,0.0037052515,0.00024107727,0.00005775716,0.00022148712,0.00068181596,0.037192676,0.0010443006,0.9288466,0.005627185,0.021858552],"study_design_scores_gemma":[0.00003269109,0.000024870258,0.0006477356,0.00002318048,0.000027206224,0.00014174802,0.00014206715,0.034525935,0.00029994184,0.96271956,0.0013930503,0.000021930186],"about_ca_topic_score_codex":0.0026097952,"about_ca_topic_score_gemma":0.0023143333,"teacher_disagreement_score":0.01651454,"about_ca_system_score_codex":0.0032405807,"about_ca_system_score_gemma":0.0017232889,"threshold_uncertainty_score":0.05524665},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01802210635800287,"score_gpt":0.25065760863665953,"score_spread":0.23263550227865668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030083434","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43777272,0.0017371761,0.36996448,0.002025846,0.00030514147,0.00008633759,0.00064963993,0.00047547626,0.18698326],"genre_scores_gemma":[0.9283039,0.0011660533,0.022500645,0.00034413277,0.00027511446,0.000108747685,0.0006745446,0.0002139892,0.04641291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943036,0.00009841203,0.000018338409,0.00010540373,0.00024979928,0.000097581105],"domain_scores_gemma":[0.99900764,0.00034751368,0.00010902972,0.00018711339,0.00016918706,0.00017948997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064460497,0.0006475056,0.00075780763,0.0018498974,0.0014532765,0.0015475765,0.00081707747,0.00085305993,0.009441488],"category_scores_gemma":[0.0024400789,0.00042123263,0.0007348753,0.0009919944,0.0015658455,0.002993445,0.0026804823,0.001780526,0.0007432983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034647113,0.000010991876,0.00022589676,0.000032560616,0.0000118003245,0.00009379841,0.00013771835,0.0029726746,0.00096428726,0.98626316,0.001678418,0.007574066],"study_design_scores_gemma":[0.000017196468,0.000021709184,0.00040936796,0.000016135371,0.000013901576,0.000283249,0.00009385152,0.016200172,0.0008523349,0.9739455,0.008135732,0.0000108409295],"about_ca_topic_score_codex":0.0005567083,"about_ca_topic_score_gemma":0.0005516504,"teacher_disagreement_score":0.009441488,"about_ca_system_score_codex":0.00095722225,"about_ca_system_score_gemma":0.00037132474,"threshold_uncertainty_score":0.03158492},"labels":[],"label_agreement":null},{"id":"W2030361986","doi":"10.1016/s0012-365x(01)00112-1","title":"On periodically-cyclic Gale 4-polytopes","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Polytope; Combinatorics; Mathematics; Integer (computer science); Discrete mathematics; Computer science","score_opus":0.008232989244292563,"score_gpt":0.20847555361806516,"score_spread":0.2002425643737726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030361986","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6326435,0.0011224684,0.20034844,0.0020714232,0.000644715,0.00018368663,0.000994031,0.00028684837,0.16170485],"genre_scores_gemma":[0.8898041,0.0011924274,0.029945923,0.00063997606,0.00040164654,0.00020045807,0.00074898644,0.00027498582,0.07679143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994281,0.00014993364,0.000016830028,0.00009914828,0.00015284473,0.00015314546],"domain_scores_gemma":[0.99866307,0.00059996423,0.00026213055,0.00011520208,0.00011960593,0.00023997262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040697036,0.0012291512,0.0011490346,0.0021503146,0.0018377955,0.002583617,0.0011245892,0.0016307296,0.01628719],"category_scores_gemma":[0.0018319809,0.0006883223,0.0008841357,0.0015348354,0.0025070428,0.001938752,0.00216335,0.0025551964,0.0015005586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010239952,0.000045800396,0.00018752462,0.00006209933,0.00001443348,0.00014777642,0.00018625436,0.018555077,0.0016767203,0.9705549,0.0026713302,0.0057956683],"study_design_scores_gemma":[0.00004655724,0.000051311967,0.0003669443,0.00003682763,0.000008323986,0.00013008741,0.00019441413,0.05175296,0.00077028055,0.9415,0.005112416,0.0000299205],"about_ca_topic_score_codex":0.0017874873,"about_ca_topic_score_gemma":0.0017853277,"teacher_disagreement_score":0.01628719,"about_ca_system_score_codex":0.0011989623,"about_ca_system_score_gemma":0.00049916067,"threshold_uncertainty_score":0.054486036},"labels":[],"label_agreement":null},{"id":"W2030620609","doi":"10.1016/s0012-365x(02)00469-7","title":"On the existence and application of incomplete nearly Kirkman triple systems with a hole of size 6 or 12","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Shanghai Jiao Tong University","keywords":"Mathematics; Combinatorics; Existential quantification; Order (exchange); Embedding; Triple system; Discrete mathematics; Steiner system; Pure mathematics; Computer science","score_opus":0.012984800326886172,"score_gpt":0.2039888512577339,"score_spread":0.1910040509308477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030620609","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66837287,0.0009953826,0.28311482,0.0007521617,0.00019556076,0.0000733425,0.00013031928,0.00014849611,0.04621717],"genre_scores_gemma":[0.970463,0.00029912207,0.025427125,0.00007736082,0.00003725196,0.000041817893,0.0000613832,0.000023883675,0.0035690456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963987,0.00008949755,0.000023428753,0.0000655828,0.00010334599,0.00007824241],"domain_scores_gemma":[0.9978771,0.0010675815,0.00030688534,0.00023331401,0.00028454317,0.0002305734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077224744,0.00025815036,0.00063066377,0.0009801992,0.0014620662,0.0013819839,0.0007167425,0.00095637183,0.0030045628],"category_scores_gemma":[0.004538126,0.00039045865,0.0004984318,0.00063072296,0.0018624204,0.002568817,0.0020253335,0.0010920101,0.00020123312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080642596,0.000020510362,0.0004507489,0.00004563669,0.000008313556,0.00013724939,0.00028526605,0.008942597,0.003478087,0.97992927,0.00041144222,0.006210157],"study_design_scores_gemma":[0.000021874068,0.00009386729,0.00047772596,0.00003955326,0.000017520711,0.0002864499,0.0004875273,0.16253942,0.004183342,0.8287072,0.0031084446,0.00003702547],"about_ca_topic_score_codex":0.0007385577,"about_ca_topic_score_gemma":0.00068144477,"teacher_disagreement_score":0.0030045628,"about_ca_system_score_codex":0.0006666435,"about_ca_system_score_gemma":0.00061971997,"threshold_uncertainty_score":0.01005125},"labels":[],"label_agreement":null},{"id":"W2032005618","doi":"10.1016/j.disc.2009.05.029","title":"Adaptable chromatic number of graph products","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Council","keywords":"Mathematics; Combinatorics; Chromatic scale; Conjecture; Hypergraph; Vertex (graph theory); Graph; Discrete mathematics; Critical graph; Graph power; Line graph","score_opus":0.02673794540202884,"score_gpt":0.30292517599615304,"score_spread":0.2761872305941242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032005618","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.817122,0.00051555654,0.10431158,0.0010259908,0.00018308099,0.000042034677,0.00032148557,0.0005358195,0.07594239],"genre_scores_gemma":[0.9782146,0.0002618247,0.009466936,0.00010816947,0.00012536145,0.00005307181,0.00017030662,0.00014220481,0.011457681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929976,0.00014168765,0.000025930378,0.00020204202,0.00021432647,0.0001162447],"domain_scores_gemma":[0.9958157,0.0019699535,0.0004939331,0.0006345645,0.000363226,0.0007226278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009228948,0.00057752116,0.0007082465,0.0022705442,0.0015237724,0.0030149894,0.0019149493,0.0011425143,0.008870416],"category_scores_gemma":[0.0047354205,0.0004968278,0.0005752364,0.0018061926,0.0035747595,0.0055644894,0.0022439898,0.0026888035,0.00059417856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006482476,0.000023769342,0.0005256217,0.000024780258,0.0000075989124,0.000045794503,0.0001988623,0.005027588,0.0015164868,0.9870459,0.0008053213,0.004713501],"study_design_scores_gemma":[0.000016205548,0.000017922208,0.00060927344,0.000008997202,0.000010388893,0.00007840486,0.00006905414,0.020791015,0.0008721394,0.9759041,0.0016032902,0.00001929996],"about_ca_topic_score_codex":0.0016220416,"about_ca_topic_score_gemma":0.0020957272,"teacher_disagreement_score":0.008870416,"about_ca_system_score_codex":0.0019979274,"about_ca_system_score_gemma":0.0006911561,"threshold_uncertainty_score":0.02967453},"labels":[],"label_agreement":null},{"id":"W2034251757","doi":"10.1016/j.disc.2008.01.038","title":"Maximal planar graphs of inscribable type and diagonal flips","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Diagonal; Combinatorics; Type (biology); Planar; Discrete mathematics; Chordal graph; Graph; Geometry; Computer science","score_opus":0.038431571477227956,"score_gpt":0.2788313624387978,"score_spread":0.24039979096156985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034251757","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7488152,0.00033365138,0.11932568,0.001166415,0.00020037532,0.00011048757,0.0014486501,0.0006604234,0.12793913],"genre_scores_gemma":[0.94760686,0.00034920644,0.022211371,0.00025206403,0.000078583325,0.000080536,0.0009969419,0.00018034522,0.028244078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996921,0.00004462779,0.000015071658,0.00007440622,0.00008045645,0.00009339781],"domain_scores_gemma":[0.99879265,0.00036922315,0.00024230611,0.00023162326,0.00014592924,0.00021814843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002687661,0.00048604846,0.0006244676,0.0010982701,0.001651654,0.0022677493,0.001260233,0.001148635,0.011607435],"category_scores_gemma":[0.0018267601,0.00070549396,0.00056284375,0.001299157,0.0018862403,0.002771577,0.0016688791,0.0020678786,0.0011325992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016327188,0.000038217553,0.00083098,0.00007186583,0.000010553688,0.00019599388,0.00021929476,0.0015535045,0.0037822954,0.9812859,0.0021080412,0.00974019],"study_design_scores_gemma":[0.000065079854,0.000032979766,0.0011266905,0.000032476823,0.00004198507,0.0003829489,0.00047304272,0.005465417,0.0049289293,0.9799637,0.007461906,0.000024871299],"about_ca_topic_score_codex":0.0009649424,"about_ca_topic_score_gemma":0.0015782439,"teacher_disagreement_score":0.011607435,"about_ca_system_score_codex":0.00074678793,"about_ca_system_score_gemma":0.0005017048,"threshold_uncertainty_score":0.038830757},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Univerza v Ljubljani","keywords":"Mathematics; Combinatorics; Generating function; Algorithm","score_opus":0.02481368113949652,"score_gpt":0.2568352382709909,"score_spread":0.2320215571314944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034438073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21433128,0.0011502978,0.69043654,0.004603399,0.00035809856,0.0005192659,0.0004625927,0.0013279085,0.08681072],"genre_scores_gemma":[0.8518338,0.0012231867,0.13261834,0.0008186315,0.0005391939,0.00056409324,0.00054486503,0.0004537531,0.011404122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958407,0.0012855348,0.00044562726,0.00056239916,0.0012983087,0.0005673858],"domain_scores_gemma":[0.9701948,0.018841598,0.0011460389,0.003641757,0.0050210063,0.0011548116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007881415,0.0007927087,0.0014482347,0.004863707,0.0029696783,0.00482321,0.0032633224,0.0035654467,0.008990105],"category_scores_gemma":[0.047019232,0.00046365912,0.0011514747,0.0039798915,0.0064835465,0.005273031,0.004504767,0.0036207943,0.002668577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029222586,0.000059273618,0.0028442685,0.00014062128,0.00003512077,0.00023491426,0.0003982778,0.012954535,0.005314789,0.94693166,0.002075759,0.028718479],"study_design_scores_gemma":[0.00009020725,0.00016685209,0.0012308575,0.00014265573,0.00004079717,0.00037554148,0.00022911356,0.10494001,0.010482052,0.87377536,0.008477256,0.00004934895],"about_ca_topic_score_codex":0.00096721994,"about_ca_topic_score_gemma":0.0005611281,"teacher_disagreement_score":0.008990105,"about_ca_system_score_codex":0.0013865987,"about_ca_system_score_gemma":0.0020285028,"threshold_uncertainty_score":0.04168141},"labels":[],"label_agreement":null},{"id":"W2034818478","doi":"10.1016/j.disc.2003.11.020","title":"Tight incomplete block designs","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Combinatorics; Mathematics; Block (permutation group theory); Automorphism; Prime power; Discrete mathematics; Element (criminal law); Upper and lower bounds; Automorphism group; Type (biology); Group (periodic table); Prime (order theory); Physics; Mathematical analysis","score_opus":0.019179472657135925,"score_gpt":0.2161653535992005,"score_spread":0.19698588094206457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034818478","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035709545,0.0004986208,0.9242455,0.00036762218,0.00014684288,0.00013261595,0.0004000164,0.0005153719,0.037983924],"genre_scores_gemma":[0.6501012,0.0010489904,0.3026842,0.0009156095,0.00024013435,0.00060564507,0.0009952134,0.00042055,0.04298845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966822,0.0011475587,0.00016167812,0.0005749238,0.0010387092,0.0003948681],"domain_scores_gemma":[0.9944963,0.0019037657,0.0005356811,0.0018743658,0.0008943272,0.0002955389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024426093,0.0011604395,0.001506944,0.0011246005,0.00097099453,0.0024975105,0.0011556878,0.0014948609,0.015548501],"category_scores_gemma":[0.008519935,0.0010290003,0.00070656143,0.0013826895,0.0013358868,0.003277567,0.002605831,0.0020999347,0.0031137026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026845804,0.000058026348,0.00025387396,0.00010821299,0.00003985682,0.000057234767,0.000106717125,0.030268101,0.006066475,0.9167381,0.0037160565,0.042318895],"study_design_scores_gemma":[0.000092358794,0.00021260977,0.00023513993,0.000074667216,0.000053543015,0.00013213028,0.00006151536,0.12741052,0.005498899,0.8507722,0.015422566,0.000033838984],"about_ca_topic_score_codex":0.0006480733,"about_ca_topic_score_gemma":0.0012647513,"teacher_disagreement_score":0.015548501,"about_ca_system_score_codex":0.0010622249,"about_ca_system_score_gemma":0.0015150959,"threshold_uncertainty_score":0.052014887},"labels":[],"label_agreement":null},{"id":"W2035387780","doi":"10.1016/j.disc.2008.01.026","title":"The existence of regular self-complementary 3-uniform hypergraphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Hypergraph; Mathematics; Combinatorics; Modulo; Vertex (graph theory); Discrete mathematics; Existential quantification; Set (abstract data type); Graph; Computer science","score_opus":0.07538995794446773,"score_gpt":0.32456908064244394,"score_spread":0.2491791226979762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035387780","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83229357,0.0005783262,0.08712513,0.0009316805,0.00008956829,0.00003224145,0.00037638305,0.00023837932,0.07833466],"genre_scores_gemma":[0.96652126,0.0004051664,0.018487832,0.00026652624,0.00010095599,0.000047854566,0.00033861623,0.00008763123,0.01374415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995964,0.000114220195,0.00001967676,0.000104195235,0.00008950202,0.00007599727],"domain_scores_gemma":[0.9965927,0.0020691166,0.00033846695,0.00026666283,0.00035773826,0.0003753168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060730474,0.00029869712,0.00058363023,0.0013074017,0.0013537239,0.0021876623,0.0008533177,0.0009245815,0.0054850667],"category_scores_gemma":[0.0034161329,0.0006718212,0.00055093557,0.0010570075,0.0018899946,0.0034364853,0.0017852368,0.0014828305,0.0004902338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005989402,0.0000123419495,0.000401397,0.000040396862,0.000010746069,0.00007364976,0.00026090673,0.0008485889,0.0020439099,0.99291366,0.00060805463,0.0027265544],"study_design_scores_gemma":[0.00002696275,0.000016722852,0.00075050804,0.000018822748,0.000017849765,0.00021191733,0.00020654191,0.006902955,0.00155335,0.98783433,0.0024461048,0.000013903691],"about_ca_topic_score_codex":0.0006306956,"about_ca_topic_score_gemma":0.0006455985,"teacher_disagreement_score":0.0054850667,"about_ca_system_score_codex":0.00093471847,"about_ca_system_score_gemma":0.0003610902,"threshold_uncertainty_score":0.01834935},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.06822045206016554,"score_gpt":0.34083261311603175,"score_spread":0.2726121610558662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035417355","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5579178,0.0017264719,0.36956564,0.007855683,0.00024751062,0.00018886688,0.001520742,0.0007064682,0.060270842],"genre_scores_gemma":[0.9733792,0.0007548458,0.010715715,0.00036075542,0.00011142671,0.00013369891,0.00048938853,0.00016713288,0.0138878375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985525,0.0004735643,0.000043099422,0.0003293512,0.00024097803,0.00036060298],"domain_scores_gemma":[0.9808559,0.013414471,0.0012577764,0.0010729432,0.0009614418,0.002437467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018574169,0.00087268645,0.0014416436,0.0020689317,0.0013755445,0.0044817613,0.0024120822,0.003398986,0.015574411],"category_scores_gemma":[0.018180378,0.0009229743,0.000939161,0.0015921481,0.0033352156,0.009202267,0.0025115365,0.0031453692,0.00097232347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023676304,0.00004975291,0.000865226,0.00014594884,0.000051007824,0.00012707227,0.0005297506,0.03185798,0.0028887664,0.95335716,0.0033480215,0.0065425234],"study_design_scores_gemma":[0.00008442819,0.00015927444,0.0011257328,0.000086330336,0.00007403348,0.00023084828,0.00046780627,0.21430081,0.0016483506,0.7776378,0.0041149314,0.000069682916],"about_ca_topic_score_codex":0.0036839372,"about_ca_topic_score_gemma":0.0019313,"teacher_disagreement_score":0.015574411,"about_ca_system_score_codex":0.0028116957,"about_ca_system_score_gemma":0.001623318,"threshold_uncertainty_score":0.05210167},"labels":[],"label_agreement":null},{"id":"W2036328331","doi":"10.1016/j.disc.2004.12.004","title":"Self-generating sets, integers with missing blocks, and substitutions","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Integer (computer science); Sequence (biology); Discrete mathematics; Integer sequence; Enumeration; Generating function; Computer science","score_opus":0.010716206607207889,"score_gpt":0.23314440528652391,"score_spread":0.222428198679316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036328331","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44021395,0.009736607,0.4348954,0.0050586616,0.001029106,0.00010348791,0.0005307266,0.0007221752,0.10770994],"genre_scores_gemma":[0.9240777,0.0017856205,0.054497965,0.0005136044,0.00045594043,0.00012694996,0.00037231517,0.00012238664,0.018047607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904317,0.00036129577,0.000092094975,0.00018240964,0.00020123066,0.000119823424],"domain_scores_gemma":[0.9959447,0.0027275898,0.0003941603,0.00052456546,0.00020827758,0.00020070876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015006391,0.0004806036,0.00071111077,0.0014332229,0.0016787844,0.0025076976,0.00097432884,0.0011892568,0.0036179675],"category_scores_gemma":[0.005677793,0.00052396295,0.000691942,0.0015941521,0.0044057146,0.005714885,0.0016893399,0.0017227142,0.0006812097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003785702,0.000016446793,0.00022315254,0.00003550956,0.000003488801,0.00006560516,0.00031279915,0.0007652004,0.00046035007,0.99033946,0.0007869685,0.0069532106],"study_design_scores_gemma":[0.000009009398,0.000009234245,0.00006343182,0.000010571315,0.0000061543265,0.00011318001,0.00007865204,0.001701274,0.00034053283,0.99508804,0.0025730948,0.000006815298],"about_ca_topic_score_codex":0.0005205557,"about_ca_topic_score_gemma":0.0006739175,"teacher_disagreement_score":0.0036179675,"about_ca_system_score_codex":0.0008349685,"about_ca_system_score_gemma":0.00060086016,"threshold_uncertainty_score":0.012103319},"labels":[],"label_agreement":null},{"id":"W2036371515","doi":"10.1016/s0012-365x(01)00273-4","title":"The stable set polytope and some operations on graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Polytope; Mathematics; Chordal graph; Independent set; Discrete mathematics; Indifference graph; Split graph; Set (abstract data type); Maximal independent set; Clique; 1-planar graph; Graph; Computer science","score_opus":0.03863547424493796,"score_gpt":0.29495089754384707,"score_spread":0.2563154232989091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036371515","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42775485,0.003545613,0.40469342,0.0060730963,0.00069587864,0.00016667116,0.0014083543,0.0003111761,0.15535085],"genre_scores_gemma":[0.885768,0.0031159143,0.06605876,0.0005458418,0.0010298582,0.00032400162,0.0011460835,0.00024112526,0.041770473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993585,0.0001353778,0.000038313752,0.0001640504,0.0001931744,0.00011044874],"domain_scores_gemma":[0.99872667,0.0006976301,0.00013237147,0.00011378588,0.00012362005,0.00020588444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064687955,0.0008058329,0.0013027691,0.0029777326,0.0033023579,0.0050890804,0.0015975412,0.0013680422,0.009673897],"category_scores_gemma":[0.0019729384,0.00071681454,0.0016845386,0.004811049,0.0043189204,0.008242028,0.002358479,0.004295972,0.00071258657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020323354,0.00001970649,0.00008227161,0.000025320964,0.0000064812484,0.00002968137,0.00013758508,0.0011542808,0.00026676242,0.9928027,0.0011237375,0.004331066],"study_design_scores_gemma":[0.0000100595435,0.0000135581195,0.00013009322,0.000007644203,0.0000071227073,0.000046824272,0.00011984647,0.0041564675,0.0002157823,0.9929618,0.0023225148,0.000008249477],"about_ca_topic_score_codex":0.0017065703,"about_ca_topic_score_gemma":0.0016264204,"teacher_disagreement_score":0.009673897,"about_ca_system_score_codex":0.0017137562,"about_ca_system_score_gemma":0.0007253727,"threshold_uncertainty_score":0.0323624},"labels":[],"label_agreement":null},{"id":"W2036553843","doi":"10.1016/j.disc.2010.03.033","title":"The complexity of colouring by locally semicomplete digraphs","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vancouver Island University; University of Victoria","funders":"","keywords":"Homomorphism; Mathematics; Discrete mathematics; Combinatorics; Polynomial","score_opus":0.03142701722840945,"score_gpt":0.2938779925286236,"score_spread":0.26245097530021416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036553843","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8337234,0.00087342336,0.124456145,0.00592657,0.00013964355,0.00012876386,0.00184357,0.00063533627,0.032273177],"genre_scores_gemma":[0.9737127,0.0006000113,0.016493917,0.0003617867,0.00019646212,0.00010616767,0.0011690959,0.00020373455,0.0071560573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960109,0.0011644972,0.00025094257,0.0007784923,0.0011071906,0.0006880717],"domain_scores_gemma":[0.9413835,0.047317673,0.0031920949,0.004367793,0.0013233697,0.0024155588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023334092,0.00095092476,0.002716074,0.0020830352,0.0029287487,0.009784374,0.003933843,0.0037860454,0.014107],"category_scores_gemma":[0.024272064,0.001741462,0.0023839048,0.0040148688,0.0057276255,0.017212808,0.0048464397,0.005603143,0.00087469775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005289897,0.00016496878,0.0032196187,0.00025735624,0.00009414297,0.00032265132,0.0010362935,0.065389104,0.0022057828,0.9084797,0.0041592787,0.014142202],"study_design_scores_gemma":[0.00007716718,0.000020853793,0.0004959904,0.000018639992,0.000034703913,0.000086120606,0.000119431,0.06017783,0.00055420876,0.9376449,0.0007436132,0.00002656404],"about_ca_topic_score_codex":0.0047069713,"about_ca_topic_score_gemma":0.0044644703,"teacher_disagreement_score":0.014107,"about_ca_system_score_codex":0.0047428743,"about_ca_system_score_gemma":0.0021413055,"threshold_uncertainty_score":0.047192574},"labels":[],"label_agreement":null},{"id":"W2036576396","doi":"10.1016/j.disc.2014.01.002","title":"Extremal words in morphic subshifts","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Word (group theory); Lexicographical order; Mathematics; Morphism; Closure (psychology); Combinatorics; Alphabet; Simple (philosophy); Binary number; Discrete mathematics; Arithmetic; Linguistics","score_opus":0.012280867258995631,"score_gpt":0.230111695002526,"score_spread":0.21783082774353038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036576396","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81939286,0.00088810443,0.13363013,0.0008706106,0.00025932293,0.00004406831,0.00027525052,0.00055388897,0.04408573],"genre_scores_gemma":[0.981979,0.00013477959,0.009222023,0.00008802469,0.00009372216,0.00002674673,0.000117010124,0.00009800534,0.008240652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991898,0.00016140573,0.000077405144,0.00020966785,0.00018595003,0.00017576825],"domain_scores_gemma":[0.9985234,0.00067961897,0.00022602896,0.00016300543,0.00019000284,0.00021791414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005818132,0.000522304,0.0008505166,0.0021028887,0.0018292852,0.0030568647,0.00075725355,0.0012297285,0.007007388],"category_scores_gemma":[0.002625401,0.0006242364,0.00071014906,0.0013428982,0.0029871191,0.0046228496,0.0021165381,0.0015724861,0.0006748703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007688641,0.0000138342675,0.00033457417,0.000028167105,0.0000068843374,0.000197104,0.00047002226,0.00071675854,0.001621846,0.9919647,0.0003877246,0.004181454],"study_design_scores_gemma":[0.00001669269,0.000023735869,0.0003533312,0.000011068943,0.000012273546,0.00020454136,0.00031602947,0.0034013235,0.0010881255,0.99282396,0.0017338792,0.0000150208925],"about_ca_topic_score_codex":0.00041637282,"about_ca_topic_score_gemma":0.0005723848,"teacher_disagreement_score":0.007007388,"about_ca_system_score_codex":0.0010174143,"about_ca_system_score_gemma":0.0002814152,"threshold_uncertainty_score":0.02344203},"labels":[],"label_agreement":null},{"id":"W2036867308","doi":"10.1016/j.disc.2006.06.050","title":"Power Hadamard matrices","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Hadamard transform; Combinatorics; Power (physics); Discrete mathematics; Mathematical analysis","score_opus":0.00612364456533038,"score_gpt":0.21358403106871565,"score_spread":0.20746038650338527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036867308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085939996,0.002001449,0.68608075,0.0028065273,0.0014307592,0.00011640724,0.00072372943,0.0006661302,0.22023426],"genre_scores_gemma":[0.8059969,0.0018822815,0.09866028,0.001325776,0.0011814297,0.0001547966,0.0004885947,0.00025073477,0.09005925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936384,0.00018349933,0.000027937578,0.00013342402,0.00021216032,0.000079072306],"domain_scores_gemma":[0.99809915,0.0006413819,0.00019585338,0.00048028055,0.00046087676,0.00012250817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005085313,0.00089119043,0.0006510743,0.0018980697,0.0008900224,0.002110966,0.00070077926,0.0012099849,0.017585456],"category_scores_gemma":[0.0033725214,0.00032227117,0.00040371082,0.0019337917,0.0015222585,0.0025384608,0.00086047465,0.0017313112,0.0034407468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043196087,0.00001624293,0.00009761134,0.00003199434,0.0000074804275,0.00010535195,0.00009344193,0.0023720565,0.002575238,0.97658473,0.0025937806,0.015478803],"study_design_scores_gemma":[0.000013847361,0.000025769614,0.00017675296,0.000019671834,0.000006442428,0.00029835387,0.00004989495,0.018128514,0.002883339,0.96652526,0.011844824,0.00002729284],"about_ca_topic_score_codex":0.00039572397,"about_ca_topic_score_gemma":0.0003306047,"teacher_disagreement_score":0.017585456,"about_ca_system_score_codex":0.00057491736,"about_ca_system_score_gemma":0.00045477762,"threshold_uncertainty_score":0.05882919},"labels":[],"label_agreement":null},{"id":"W2036902154","doi":"10.1016/s0012-365x(00)00402-7","title":"On chromatic roots of large subdivisions of graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Subdivision; Mathematics; Chromatic scale; Combinatorics; Chromatic polynomial; Graph; Discrete mathematics; Geography","score_opus":0.03589829816462702,"score_gpt":0.31512349734950185,"score_spread":0.2792251991848748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036902154","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86838347,0.0011466984,0.056731187,0.00177729,0.00025477435,0.00006179367,0.00025868532,0.00025465532,0.07113141],"genre_scores_gemma":[0.9643107,0.0008095747,0.012215036,0.0002152227,0.00021821847,0.00004186855,0.00031118025,0.00015880335,0.021719584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996196,0.00009161204,0.000011797162,0.00007083659,0.00009959293,0.000106455824],"domain_scores_gemma":[0.99730587,0.0016123382,0.00037834526,0.00019861085,0.00017075066,0.00033412167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005459761,0.0006798555,0.0010033246,0.0020953973,0.0018468555,0.0028881333,0.0014541585,0.0012256362,0.010442568],"category_scores_gemma":[0.005437552,0.00062201556,0.0006092234,0.0016898336,0.0037744113,0.0033951923,0.002304419,0.0031281356,0.0008843236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018101686,0.000052908043,0.0018265648,0.000083043364,0.000015086745,0.00014316758,0.00096897816,0.008250858,0.0033691265,0.9658811,0.0037508565,0.01547728],"study_design_scores_gemma":[0.000043310934,0.000026384201,0.0011118122,0.00002345024,0.000014047451,0.00008978361,0.00037569655,0.01394854,0.0005306013,0.9811705,0.002652398,0.000013441578],"about_ca_topic_score_codex":0.0038269751,"about_ca_topic_score_gemma":0.0063962284,"teacher_disagreement_score":0.010442568,"about_ca_system_score_codex":0.0018880464,"about_ca_system_score_gemma":0.00048559555,"threshold_uncertainty_score":0.034933805},"labels":[],"label_agreement":null},{"id":"W2037002007","doi":"10.1016/s0012-365x(00)00260-0","title":"Thomason's algorithm for finding a second hamiltonian circuit through a given edge in a cubic graph is exponential on Krawczyk's graphs","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Cubic graph; Corollary; Combinatorics; Discrete mathematics; Planar graph; Exponential function; Constructive; Hamiltonian path; Algorithm; Hamiltonian (control theory); Graph; Line graph; Voltage graph; Mathematical analysis; Computer science","score_opus":0.04762917201134028,"score_gpt":0.3176212309829411,"score_spread":0.26999205897160083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037002007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124455616,0.0005797027,0.75312984,0.0033964415,0.0004598399,0.0008935865,0.0015010654,0.009826693,0.10575722],"genre_scores_gemma":[0.37141356,0.00042542454,0.5602246,0.00068003655,0.00013829728,0.00050279393,0.0023885183,0.0020009882,0.06222568],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989919,0.0001044017,0.000055767312,0.00025902435,0.00035276156,0.00023618535],"domain_scores_gemma":[0.9980533,0.000797856,0.00008972183,0.00069816987,0.00022607105,0.00013493102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006457142,0.0013814837,0.0011084371,0.0015593999,0.0020238408,0.0026027062,0.0039093494,0.0017828819,0.028540174],"category_scores_gemma":[0.0030482712,0.0009810228,0.0020639356,0.002813112,0.0016183894,0.0054505467,0.002893963,0.0028757025,0.004202711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012980902,0.000487085,0.0016832807,0.00073719025,0.00019187083,0.00029462,0.00076581194,0.05893021,0.022333203,0.30349433,0.044677574,0.56510675],"study_design_scores_gemma":[0.0005503261,0.00028945357,0.0016174951,0.000082418686,0.0003746929,0.00046758645,0.0006226666,0.50378513,0.036905114,0.40977767,0.045399964,0.00012758136],"about_ca_topic_score_codex":0.011040919,"about_ca_topic_score_gemma":0.033694934,"teacher_disagreement_score":0.028540174,"about_ca_system_score_codex":0.0037783163,"about_ca_system_score_gemma":0.004688286,"threshold_uncertainty_score":0.09547639},"labels":[],"label_agreement":null},{"id":"W2037123085","doi":"10.1016/j.disc.2004.02.024","title":"A characterization of pancyclic complements of line graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Combinatorics; Characterization (materials science); Line (geometry); Pancyclic graph; Discrete mathematics; Graph; Chordal graph; 1-planar graph; Physics; Geometry","score_opus":0.044991997299765475,"score_gpt":0.324081271733818,"score_spread":0.2790892744340525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037123085","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6871216,0.00087175105,0.15767471,0.0018139117,0.00021443663,0.0001950253,0.0026652568,0.00039550578,0.14904782],"genre_scores_gemma":[0.9466206,0.00089554244,0.031558137,0.00043589284,0.00031132257,0.00015263938,0.0025450066,0.00020192911,0.017278884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992914,0.000119364646,0.000036779893,0.00018761332,0.00023648767,0.00012833258],"domain_scores_gemma":[0.9951368,0.0021403434,0.0008939624,0.00037755552,0.0008301363,0.0006211945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046771174,0.00064854196,0.0008342238,0.0029840174,0.0016905586,0.0037648645,0.0013923807,0.0010589337,0.01378482],"category_scores_gemma":[0.0041169673,0.00065885,0.000644428,0.0035096032,0.002194646,0.0045937067,0.0019680227,0.0025374661,0.0012791357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001889767,0.00006972634,0.0015418822,0.0001398507,0.000022276867,0.00033810982,0.00055448397,0.0025924854,0.0049368795,0.9656038,0.006433602,0.01757794],"study_design_scores_gemma":[0.00004211678,0.00011650674,0.0024180536,0.00008901119,0.000056696757,0.0014618158,0.0008152701,0.029043762,0.004502931,0.9348831,0.02652391,0.00004679234],"about_ca_topic_score_codex":0.0011398646,"about_ca_topic_score_gemma":0.0010496721,"teacher_disagreement_score":0.01378482,"about_ca_system_score_codex":0.0010512397,"about_ca_system_score_gemma":0.0005368712,"threshold_uncertainty_score":0.046114862},"labels":[],"label_agreement":null},{"id":"W2037418399","doi":"10.1016/s0012-365x(03)00081-5","title":"General constructions of c-Bhaskar Rao designs and the (c,λ) spectrum of a c-BRD(v,k,λ)","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"BGC Engineering (Canada)","funders":"","keywords":"Mathematics; Hadamard transform; Combinatorics; Order (exchange); Spectrum (functional analysis); Group (periodic table); Construct (python library); Series (stratigraphy); Discrete mathematics; Computer science; Mathematical analysis; Physics","score_opus":0.010786752776677944,"score_gpt":0.2004288778269069,"score_spread":0.18964212505022895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037418399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08760039,0.0010144945,0.7847565,0.0012005672,0.0003126744,0.00018797572,0.0003426895,0.00064906536,0.12393567],"genre_scores_gemma":[0.7203231,0.00089624146,0.25325733,0.00091406197,0.00024608357,0.00042729668,0.00029856386,0.00023247565,0.023404896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978319,0.0008053196,0.00014160911,0.00034934093,0.00050546415,0.00036653483],"domain_scores_gemma":[0.99698263,0.001199841,0.00037041155,0.00064689264,0.00049578334,0.000304342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019442525,0.0012012544,0.0007591752,0.0023424593,0.0018401833,0.0034819613,0.001435269,0.0026935376,0.007230285],"category_scores_gemma":[0.0048867087,0.0008337505,0.00095476676,0.0020105382,0.003142597,0.0020511397,0.0024862054,0.0026531958,0.0019821923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029365374,0.000007379691,0.000053093405,0.000020039985,0.0000034840448,0.000044773304,0.00008400408,0.0008529458,0.0018318588,0.99371743,0.00039968855,0.0029559163],"study_design_scores_gemma":[0.000036144884,0.00005437785,0.0001243497,0.000049379563,0.000011796642,0.00038550462,0.00007136405,0.013771256,0.0029099705,0.97521245,0.007327742,0.00004555849],"about_ca_topic_score_codex":0.0005405649,"about_ca_topic_score_gemma":0.0006204655,"teacher_disagreement_score":0.007230285,"about_ca_system_score_codex":0.0013220531,"about_ca_system_score_gemma":0.0010641022,"threshold_uncertainty_score":0.024187684},"labels":[],"label_agreement":null},{"id":"W2037821860","doi":"10.1016/s0012-365x(00)00247-8","title":"Characterization of Zm-well-covered graphs for some classes of graphs","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Mathematics; Combinatorics; Characterization (materials science); Discrete mathematics; Indifference graph; Chordal graph; Graph","score_opus":0.027794869945388264,"score_gpt":0.29900215391933355,"score_spread":0.2712072839739453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037821860","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8545688,0.0009805496,0.08664011,0.003240587,0.000093693234,0.00011542305,0.0019461162,0.00047763114,0.05193711],"genre_scores_gemma":[0.97251815,0.0007027082,0.0148702115,0.00040860745,0.00023433336,0.00013654238,0.0020430032,0.00014034245,0.008946098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915946,0.00011917612,0.000043407228,0.00027463507,0.00021813407,0.00018535429],"domain_scores_gemma":[0.99560153,0.0022613723,0.0007775028,0.00035272146,0.00036580238,0.00064103166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007203082,0.00083035836,0.00091818883,0.0040655746,0.0019754856,0.003957044,0.0016137863,0.0012819415,0.010060857],"category_scores_gemma":[0.0040286034,0.0008479265,0.0009610906,0.002926451,0.0017055033,0.0055180904,0.0017026115,0.002258192,0.00073767774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016681585,0.000088729255,0.00465529,0.00019543058,0.000054028988,0.0002842278,0.00091909827,0.0036618207,0.005692716,0.96399254,0.005357388,0.014932051],"study_design_scores_gemma":[0.000049384184,0.000060289614,0.0068495213,0.0000762452,0.000091144495,0.0011497184,0.0008106366,0.033208705,0.00409202,0.94228244,0.011281617,0.00004824563],"about_ca_topic_score_codex":0.0009166682,"about_ca_topic_score_gemma":0.0009956411,"teacher_disagreement_score":0.010060857,"about_ca_system_score_codex":0.001651166,"about_ca_system_score_gemma":0.00050165487,"threshold_uncertainty_score":0.033656895},"labels":[],"label_agreement":null},{"id":"W2037974267","doi":"10.1016/s0012-365x(00)00368-x","title":"The cyclic structure of unimodal permutations","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Disjoint sets; Noncommutative geometry; Class (philosophy); Permutation (music); Discrete mathematics; Pure mathematics; Computer science","score_opus":0.02397954122586825,"score_gpt":0.32028258861241693,"score_spread":0.29630304738654867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037974267","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54356766,0.0039633615,0.16389382,0.004390712,0.0011208062,0.00010880826,0.001000117,0.0003979149,0.28155681],"genre_scores_gemma":[0.9461212,0.0016174619,0.018184535,0.000873342,0.0010691821,0.00009793244,0.0005313226,0.000120957644,0.031383924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993622,0.00017502937,0.000028764362,0.000121172845,0.00017265615,0.00014026019],"domain_scores_gemma":[0.9977582,0.0010297932,0.00034004403,0.0003328522,0.00030560844,0.00023358542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005851921,0.00040496374,0.0005125776,0.0020834664,0.0017868384,0.0029401206,0.00081568735,0.0010144192,0.010853398],"category_scores_gemma":[0.0037968825,0.00042974504,0.00044693207,0.0025269696,0.0034427242,0.0032969115,0.0013990953,0.0017282416,0.0010575091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019026158,0.0000070447495,0.00009130099,0.000015803986,0.0000017750293,0.000033636356,0.0001084523,0.00043611994,0.00036506404,0.9920533,0.001085811,0.005782744],"study_design_scores_gemma":[0.0000036859985,0.0000054227035,0.0000856052,0.0000060545594,0.0000019003539,0.000039764847,0.000029386936,0.0010529202,0.00016477387,0.9959543,0.0026501773,0.0000060096545],"about_ca_topic_score_codex":0.0019207699,"about_ca_topic_score_gemma":0.0018293138,"teacher_disagreement_score":0.010853398,"about_ca_system_score_codex":0.0012262937,"about_ca_system_score_gemma":0.001136208,"threshold_uncertainty_score":0.03630829},"labels":[],"label_agreement":null},{"id":"W2038467436","doi":"10.1016/j.disc.2009.01.001","title":"Hamiltonian cycles in <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mi>c</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>-circulant digraphs","year":2009,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Computer science; Mathematics; Algorithm","score_opus":0.01930495299547091,"score_gpt":0.2547848728405514,"score_spread":0.2354799198450805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038467436","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026370622,0.0022579792,0.2705834,0.003318641,0.002087941,0.00045146406,0.0378399,0.010335569,0.6467545],"genre_scores_gemma":[0.26131496,0.0034317654,0.11189988,0.0017933632,0.000490659,0.00054281484,0.050396513,0.0055133635,0.5646167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99981123,0.000030283047,0.000010578368,0.000049399543,0.000060913968,0.000037602917],"domain_scores_gemma":[0.9995665,0.00013056275,0.00004117576,0.00007132101,0.00014228179,0.00004807649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015792745,0.00051044935,0.00039830475,0.0012752868,0.0009773783,0.0020236261,0.0007308191,0.00059331243,0.15654945],"category_scores_gemma":[0.0012897847,0.00039251594,0.00041329148,0.0019396454,0.0003708763,0.0016361644,0.00062512053,0.0008936879,0.036607128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008320005,0.00006961111,0.00034319385,0.0003749289,0.00002186437,0.0002552073,0.00030158897,0.0020401168,0.003800357,0.5998314,0.31805024,0.074828245],"study_design_scores_gemma":[0.0000498025,0.000025018688,0.0007513355,0.00009602047,0.000022284978,0.00035561487,0.00015207264,0.0070288545,0.005707659,0.26891026,0.71685535,0.000045745124],"about_ca_topic_score_codex":0.006174092,"about_ca_topic_score_gemma":0.009431236,"teacher_disagreement_score":0.15654945,"about_ca_system_score_codex":0.0012280208,"about_ca_system_score_gemma":0.00089894567,"threshold_uncertainty_score":0.52371013},"labels":[],"label_agreement":null},{"id":"W2038755312","doi":"10.1016/j.disc.2009.08.011","title":"Vertex-transitive self-complementary uniform hypergraphs of prime order","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Transitive relation; Vertex (graph theory); Prime (order theory); Discrete mathematics; Order (exchange); Graph","score_opus":0.035175078841656715,"score_gpt":0.3266885821138939,"score_spread":0.2915135032722372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038755312","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78448135,0.0004916577,0.101163074,0.0005814935,0.00014381106,0.00007507835,0.00075751025,0.00041126538,0.111894816],"genre_scores_gemma":[0.96645766,0.00040568179,0.012762155,0.0001737092,0.00012134954,0.000050732593,0.00045394423,0.00010993851,0.019464891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995303,0.00011576642,0.000023893966,0.00012299074,0.000109339744,0.00009761749],"domain_scores_gemma":[0.997299,0.0013981567,0.0002859704,0.0003392933,0.000271668,0.00040598257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004566871,0.00039351272,0.00079762825,0.001533049,0.002324938,0.0028743478,0.00069994025,0.0005789053,0.0064595775],"category_scores_gemma":[0.0022888004,0.00059116184,0.00048714844,0.0018753705,0.0018314795,0.004141279,0.0013334685,0.0012223322,0.00061421224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062125735,0.000016243697,0.00042480734,0.00003371455,0.0000101362275,0.000123338,0.00036349337,0.0005924426,0.0013023877,0.9928197,0.0006809341,0.0035706398],"study_design_scores_gemma":[0.000023776267,0.000018577184,0.0006137971,0.000012922618,0.000034389992,0.00023226632,0.00023655324,0.0030265576,0.0015502796,0.9908292,0.003410145,0.000011547461],"about_ca_topic_score_codex":0.0012029072,"about_ca_topic_score_gemma":0.0016103596,"teacher_disagreement_score":0.0064595775,"about_ca_system_score_codex":0.0009446636,"about_ca_system_score_gemma":0.00052097044,"threshold_uncertainty_score":0.021609366},"labels":[],"label_agreement":null},{"id":"W2040201663","doi":"10.1016/j.disc.2007.07.098","title":"Disjoint triangles and quadrilaterals in a graph","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Graph; Quadrilateral; Discrete mathematics; Simple graph; Order (exchange)","score_opus":0.009345719196038967,"score_gpt":0.21952165460769377,"score_spread":0.2101759354116548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040201663","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23799974,0.0015178216,0.6657806,0.0014851086,0.00044149774,0.00018621006,0.0008594515,0.00031744802,0.091412134],"genre_scores_gemma":[0.73097765,0.0013692451,0.22511658,0.0005166763,0.00021638267,0.0002807344,0.00092727883,0.00026809284,0.040327385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927586,0.00022449656,0.00004236772,0.00018721112,0.00018425964,0.00008575917],"domain_scores_gemma":[0.9977825,0.0012127324,0.0003430006,0.00023324497,0.0002509791,0.00017755954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038631083,0.00058204867,0.00072069,0.001797082,0.001106214,0.0018212134,0.0011948347,0.0012307198,0.010951517],"category_scores_gemma":[0.0028301198,0.0006358269,0.00043833215,0.0023579584,0.0018245261,0.0030095263,0.0016872268,0.0015648938,0.0012219457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007887945,0.000026702814,0.00044892004,0.0000939027,0.000011568942,0.00019675841,0.00037504596,0.009225801,0.0021941918,0.9655827,0.002037141,0.019728418],"study_design_scores_gemma":[0.000030309991,0.000029062812,0.00034670948,0.000034981,0.000013044385,0.00037491147,0.00041293746,0.039865095,0.0011270005,0.94273067,0.015022095,0.000013194498],"about_ca_topic_score_codex":0.0022093903,"about_ca_topic_score_gemma":0.0028490953,"teacher_disagreement_score":0.010951517,"about_ca_system_score_codex":0.00058686605,"about_ca_system_score_gemma":0.00030549074,"threshold_uncertainty_score":0.03663647},"labels":[],"label_agreement":null},{"id":"W2040241884","doi":"10.1016/j.disc.2007.10.002","title":"Open irredundance and maximum degree in graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University; University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Degree (music); Vertex (graph theory); Graph; Cardinality (data modeling); Discrete mathematics; Independent set; Computer science","score_opus":0.07577418455312727,"score_gpt":0.3270013896165228,"score_spread":0.2512272050633955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040241884","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8791969,0.0018410292,0.07712783,0.0037685547,0.0001476075,0.000042917083,0.000426051,0.00024128165,0.037207976],"genre_scores_gemma":[0.990743,0.00060218235,0.005032801,0.00014183928,0.00021780103,0.00003403782,0.00018258662,0.00004287751,0.003002878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872905,0.0003406843,0.00007268153,0.00031478485,0.00026331627,0.0002794419],"domain_scores_gemma":[0.982979,0.012197646,0.0015801449,0.00092974486,0.0007657732,0.0015476327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023305004,0.0007997711,0.0014986992,0.0031466328,0.0034372266,0.0043465877,0.0020246133,0.0014539971,0.0040217848],"category_scores_gemma":[0.011123771,0.0010138472,0.0009989543,0.0028140189,0.008545183,0.009384169,0.0028705115,0.003993306,0.00034746405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001769009,0.000058867205,0.0025975872,0.000116531955,0.000019691566,0.00015839384,0.0018449167,0.002668023,0.0017618831,0.9816243,0.0007781748,0.008194756],"study_design_scores_gemma":[0.000012921686,0.000011024692,0.00046936134,0.000010741948,0.000009356758,0.00007330275,0.00018040843,0.001505413,0.00035369635,0.99685764,0.0005081038,0.000008039288],"about_ca_topic_score_codex":0.0011223942,"about_ca_topic_score_gemma":0.001638296,"teacher_disagreement_score":0.0043465877,"about_ca_system_score_codex":0.001385321,"about_ca_system_score_gemma":0.0005627343,"threshold_uncertainty_score":0.013454258},"labels":[],"label_agreement":null},{"id":"W2040440669","doi":"10.1016/j.disc.2009.03.018","title":"All countable monoids embed into the monoid of the infinite random graph","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Monoid; Mathematics; Countable set; Syntactic monoid; Endomorphism; Free monoid; Combinatorics; Undecidable problem; Discrete mathematics; Graph; Decidability","score_opus":0.021322646506343676,"score_gpt":0.30491185600556237,"score_spread":0.2835892094992187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040440669","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49685344,0.0021502357,0.43619716,0.0033144255,0.00036859323,0.00013374725,0.0013737944,0.0010316846,0.05857702],"genre_scores_gemma":[0.9369073,0.0010575213,0.036103178,0.0007635376,0.00036296353,0.00019255094,0.0009265435,0.00018798237,0.023498403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998623,0.00037091665,0.00010302517,0.00043433107,0.0002980723,0.00017068895],"domain_scores_gemma":[0.9929027,0.0035237004,0.0009085897,0.0009881029,0.00092118885,0.00075570657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012288521,0.00079385354,0.0010008462,0.0031765548,0.002721899,0.0037730378,0.0010877216,0.0012478699,0.004369579],"category_scores_gemma":[0.0038134905,0.0008759337,0.0012585014,0.0013665259,0.0034290939,0.006685143,0.002680167,0.0021932912,0.0009883732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040472816,0.000016207254,0.00037537338,0.000029469153,0.000015338708,0.00008760807,0.00033568763,0.0002700998,0.00069830194,0.99461836,0.0004505632,0.0030625865],"study_design_scores_gemma":[0.000016839944,0.000030370958,0.00056079344,0.000018043276,0.000019284567,0.00021041693,0.00012300706,0.0031803385,0.0009599212,0.99037606,0.0044819606,0.000023034097],"about_ca_topic_score_codex":0.0015289867,"about_ca_topic_score_gemma":0.0013084082,"teacher_disagreement_score":0.004369579,"about_ca_system_score_codex":0.001110214,"about_ca_system_score_gemma":0.00093356724,"threshold_uncertainty_score":0.014617741},"labels":[],"label_agreement":null},{"id":"W2040487904","doi":"10.1016/j.disc.2009.04.009","title":"Generalizations of Świerczkowski’s lemma and the arity gap of finite functions","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Arity; Mathematics; Unary operation; Lemma (botany); Generalization; Discrete mathematics; Projection (relational algebra); Finite set; Characterization (materials science); Combinatorics; Set (abstract data type); Algorithm; Computer science; Mathematical analysis","score_opus":0.023876523985910506,"score_gpt":0.25396668351699736,"score_spread":0.23009015953108686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040487904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3267509,0.009478765,0.45312548,0.016369672,0.0022906803,0.0000840005,0.0010562558,0.0006230014,0.1902213],"genre_scores_gemma":[0.93689054,0.0034160567,0.033292692,0.0018380722,0.002480177,0.00012002293,0.00045537215,0.00033141795,0.02117555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802434,0.00039457038,0.00018906471,0.0005858362,0.00050166744,0.00030453943],"domain_scores_gemma":[0.9939312,0.003557902,0.0004001451,0.0011914524,0.0004798237,0.0004395126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037414883,0.0011027772,0.0019212454,0.00377214,0.002343817,0.0038201534,0.0026741566,0.0020436593,0.0074997908],"category_scores_gemma":[0.009930969,0.0010472578,0.0028952055,0.0035067762,0.009254739,0.026826773,0.006537887,0.008958362,0.000816882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002769203,0.000010786935,0.00017333271,0.000031501604,0.000009587749,0.000060344773,0.00019877129,0.00040433108,0.00033602,0.99576217,0.0005646804,0.0024207265],"study_design_scores_gemma":[0.00000696453,0.0000046221935,0.00012797199,0.0000053424988,0.0000062751496,0.000036403104,0.000024625182,0.00085858617,0.00010628724,0.9975836,0.0012300428,0.000009215616],"about_ca_topic_score_codex":0.0024638155,"about_ca_topic_score_gemma":0.0011410622,"teacher_disagreement_score":0.0074997908,"about_ca_system_score_codex":0.002545398,"about_ca_system_score_gemma":0.00096470886,"threshold_uncertainty_score":0.025089264},"labels":[],"label_agreement":null},{"id":"W2041190751","doi":"10.1016/j.disc.2010.06.035","title":"On the size of maximal chains and the number of pairwise disjoint maximal antichains","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Combinatorics; Disjoint sets; Integer (computer science); Pairwise comparison; Natural number; Maximal set; Enumeration; Discrete mathematics; Set (abstract data type); Statistics; Computer science","score_opus":0.01065944028338643,"score_gpt":0.2423140936012091,"score_spread":0.23165465331782267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041190751","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79650795,0.0038705815,0.14190686,0.0073564188,0.0003902641,0.00013625804,0.0025317902,0.00037470265,0.04692521],"genre_scores_gemma":[0.96336716,0.0016345836,0.027822454,0.00038955983,0.00070462044,0.0001784857,0.001161951,0.00018909466,0.004552143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952923,0.001518917,0.0003772065,0.0011548272,0.000996802,0.000660037],"domain_scores_gemma":[0.8318157,0.14299622,0.009272355,0.0052355765,0.0035656386,0.007114482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007437114,0.0011203986,0.0021856,0.004976392,0.002868357,0.0065947743,0.004390708,0.003042149,0.01154246],"category_scores_gemma":[0.046453245,0.0018559836,0.0014961212,0.0040229345,0.009834842,0.021277083,0.0036507729,0.0040421165,0.0006213884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013317984,0.00021048874,0.015619485,0.0004548467,0.00018774894,0.00032784836,0.0010168243,0.021013774,0.0065519917,0.92731947,0.004459684,0.02150596],"study_design_scores_gemma":[0.00012441282,0.00008817058,0.0035168766,0.00009285496,0.000106451946,0.0004399491,0.00034873356,0.0370257,0.0021756245,0.95402455,0.0019919418,0.00006478143],"about_ca_topic_score_codex":0.0011474447,"about_ca_topic_score_gemma":0.0015587972,"teacher_disagreement_score":0.01154246,"about_ca_system_score_codex":0.0024581733,"about_ca_system_score_gemma":0.0014478003,"threshold_uncertainty_score":0.039331675},"labels":[],"label_agreement":null},{"id":"W2041356670","doi":"10.1016/j.disc.2004.11.016","title":"Tandem-win graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Acadia University","funders":"","keywords":"Mathematics; Combinatorics; Tandem; Discrete mathematics; Characterization (materials science)","score_opus":0.031119267248758825,"score_gpt":0.2927926974345515,"score_spread":0.2616734301857927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041356670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2864601,0.0006244033,0.35746685,0.003939159,0.0003555465,0.00065914326,0.0033861662,0.0016529222,0.3454557],"genre_scores_gemma":[0.83087087,0.00061388995,0.05552257,0.000962333,0.00016491076,0.00044880479,0.0031970358,0.00045561165,0.10776393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990588,0.00022267671,0.00003803248,0.0002668372,0.00020460211,0.00020915829],"domain_scores_gemma":[0.9966001,0.0012581489,0.00040055564,0.00061319245,0.00047376432,0.0006541708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005862036,0.0009545844,0.0010545719,0.0015758519,0.0032192722,0.003195518,0.0018542318,0.0019894436,0.037994638],"category_scores_gemma":[0.0051490404,0.0006821654,0.0008776735,0.0019055624,0.0014475039,0.0055817408,0.0020146153,0.0027674737,0.0051428233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015374873,0.000104195926,0.00057240255,0.00010758921,0.000041890784,0.000221269,0.00021096891,0.004468527,0.0013099108,0.953586,0.015144221,0.024079336],"study_design_scores_gemma":[0.00003868709,0.000020879395,0.0002450008,0.000014895173,0.000025858777,0.00014772458,0.00013221492,0.009682774,0.0005443141,0.98047316,0.008664395,0.000010043471],"about_ca_topic_score_codex":0.0011864128,"about_ca_topic_score_gemma":0.0023723622,"teacher_disagreement_score":0.037994638,"about_ca_system_score_codex":0.0009919036,"about_ca_system_score_gemma":0.0013132859,"threshold_uncertainty_score":0.12710476},"labels":[],"label_agreement":null},{"id":"W2042269609","doi":"10.1016/j.disc.2004.05.003","title":"Tight bounds on maximal and maximum matchings","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Bounded function; Upper and lower bounds; Planar graph; Discrete mathematics; Graph; Class (philosophy); Degree (music); Computer science","score_opus":0.01734329773186264,"score_gpt":0.28195897687854693,"score_spread":0.26461567914668427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042269609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1612966,0.021846801,0.56750935,0.027868807,0.0016001167,0.0004744592,0.007836405,0.004339767,0.20722772],"genre_scores_gemma":[0.7987635,0.0121235745,0.13111036,0.0051195915,0.0045152777,0.0009646643,0.005775406,0.0032560807,0.038371596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9852771,0.00317545,0.0006759708,0.0029248092,0.0039940896,0.0039525223],"domain_scores_gemma":[0.87085557,0.10057786,0.0053874883,0.010896371,0.0042832294,0.007999386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013264155,0.0064377575,0.009555369,0.010631209,0.006363899,0.01740915,0.01592717,0.0072685387,0.03597095],"category_scores_gemma":[0.105882466,0.0068228566,0.0046717036,0.01629426,0.0100085605,0.049508348,0.018229863,0.017414501,0.0058210245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025434436,0.00047979408,0.0019039705,0.0012636901,0.00024701003,0.00017750892,0.00091689755,0.047097106,0.0033100517,0.8682785,0.028185217,0.045596845],"study_design_scores_gemma":[0.000104804014,0.000060111488,0.000560595,0.00013941462,0.00013844491,0.00011787028,0.00011614064,0.04067389,0.0011470105,0.95219076,0.0047101644,0.0000408239],"about_ca_topic_score_codex":0.0031885933,"about_ca_topic_score_gemma":0.0052214605,"teacher_disagreement_score":0.03597095,"about_ca_system_score_codex":0.009890309,"about_ca_system_score_gemma":0.004043132,"threshold_uncertainty_score":0.12033486},"labels":[],"label_agreement":null},{"id":"W2042880596","doi":"10.1016/s0012-365x(00)00075-3","title":"Stable 2-pairs and (X,Y)-intersection graphs","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Intersection (aeronautics); Discrete mathematics","score_opus":0.022613387874989576,"score_gpt":0.286789227492788,"score_spread":0.26417583961779845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042880596","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.675548,0.0013376378,0.1771453,0.0035557474,0.00039147877,0.00017896116,0.0012357379,0.00064412993,0.13996306],"genre_scores_gemma":[0.94034445,0.0007411145,0.032615382,0.0004707132,0.00015654233,0.00021860741,0.0011426153,0.00018903385,0.024121555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912757,0.0002376969,0.000048819165,0.0002120679,0.00016839875,0.00020543899],"domain_scores_gemma":[0.9980574,0.00079475367,0.00045073032,0.00015399195,0.0002544711,0.00028860715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079142366,0.00088327687,0.0009718428,0.002864875,0.005036768,0.0053339964,0.0014106749,0.0022633667,0.0136926845],"category_scores_gemma":[0.0025442154,0.0010746921,0.0010028258,0.0034998462,0.002686485,0.007845248,0.0033740492,0.0028143974,0.0017141781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104712155,0.000024324594,0.0006747389,0.000036961937,0.000014532443,0.00019449442,0.00044444704,0.000732689,0.00076953607,0.9905992,0.001688484,0.0047159763],"study_design_scores_gemma":[0.000032060725,0.000021895252,0.00043567608,0.000016654489,0.0000192217,0.0002464793,0.0004971626,0.0026397398,0.0012525704,0.9900267,0.004795649,0.000016223988],"about_ca_topic_score_codex":0.0012885869,"about_ca_topic_score_gemma":0.0012515653,"teacher_disagreement_score":0.0136926845,"about_ca_system_score_codex":0.001403211,"about_ca_system_score_gemma":0.0006082846,"threshold_uncertainty_score":0.045806587},"labels":[],"label_agreement":null},{"id":"W2043020651","doi":"10.1016/s0012-365x(03)00084-0","title":"On upper domination Ramsey numbers for graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Ramsey's theorem; Mathematics; Domination analysis; Graph; Independence number; Integer (computer science); Dominating set; Upper and lower bounds; Cardinality (data modeling); Discrete mathematics; Vertex (graph theory)","score_opus":0.020983167306812715,"score_gpt":0.3109859675149543,"score_spread":0.29000280020814156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043020651","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48047918,0.008601656,0.23370971,0.010601157,0.0008755241,0.0001538818,0.0011670138,0.0009724888,0.26343936],"genre_scores_gemma":[0.93058753,0.004021445,0.034967646,0.0015389605,0.0010879507,0.0002914456,0.0006945042,0.00027955812,0.026530974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982331,0.0004926904,0.00008176653,0.00033911024,0.00045030777,0.00040304358],"domain_scores_gemma":[0.9819318,0.014078929,0.00091097696,0.0010891171,0.00068501546,0.0013042685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004030835,0.0013184751,0.0017886168,0.004595892,0.0033866372,0.0052995095,0.0024304434,0.0017182963,0.0136022065],"category_scores_gemma":[0.015945604,0.0010239055,0.001048269,0.00434206,0.005235113,0.014286526,0.005066092,0.0068236734,0.0012300109],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019153592,0.000056846984,0.0006476432,0.00013422595,0.000013814397,0.000053182634,0.000605732,0.003556812,0.000957182,0.9747107,0.0039935084,0.015078785],"study_design_scores_gemma":[0.000018125353,0.000018179364,0.00037499232,0.000034370296,0.000011579777,0.00005253615,0.00010118152,0.005082288,0.0003038094,0.99141276,0.0025743307,0.000015763897],"about_ca_topic_score_codex":0.0015584016,"about_ca_topic_score_gemma":0.0025814774,"teacher_disagreement_score":0.0136022065,"about_ca_system_score_codex":0.0031451688,"about_ca_system_score_gemma":0.0010165423,"threshold_uncertainty_score":0.045503855},"labels":[],"label_agreement":null},{"id":"W2043278008","doi":"10.1016/j.disc.2013.08.020","title":"Recursive construction of non-cyclic pandiagonal Latin squares","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Orthogonality; Mathematics; Latin square; Integer (computer science); Construct (python library); Order (exchange); Least-squares function approximation; Cyclic group; Combinatorics; Discrete mathematics; Algorithm; Statistics; Computer science","score_opus":0.006462384230597858,"score_gpt":0.1989928853913748,"score_spread":0.19253050116077694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043278008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112648256,0.00031705803,0.81481004,0.0004720822,0.00026127158,0.00016296205,0.00017394849,0.00086142746,0.07029293],"genre_scores_gemma":[0.5438616,0.00035895273,0.420173,0.00036024355,0.00009532859,0.00027394912,0.00034724962,0.00051850785,0.034011032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937683,0.0002379134,0.000029931161,0.00012272348,0.00014590964,0.000086715794],"domain_scores_gemma":[0.99910694,0.00038741203,0.00005743053,0.00020528217,0.00016465323,0.000078346624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041020804,0.0004326956,0.0005581755,0.0007739769,0.00093413633,0.0014756782,0.0008734334,0.00058211305,0.009186278],"category_scores_gemma":[0.002007607,0.00039811913,0.0005394223,0.00074005907,0.0013979406,0.0012858626,0.0021266676,0.0011240698,0.0021194878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000650361,0.000037047976,0.00031516794,0.000078634126,0.0000130726075,0.0001757161,0.0002834923,0.005388467,0.012039182,0.94002414,0.0018113761,0.039768726],"study_design_scores_gemma":[0.00006915697,0.00011423239,0.0003920914,0.000058347756,0.000030487678,0.00046096806,0.00024394013,0.05977322,0.020737967,0.8774722,0.040601335,0.000045991615],"about_ca_topic_score_codex":0.00036814524,"about_ca_topic_score_gemma":0.0007912449,"teacher_disagreement_score":0.009186278,"about_ca_system_score_codex":0.00048269168,"about_ca_system_score_gemma":0.00065319426,"threshold_uncertainty_score":0.030731142},"labels":[],"label_agreement":null},{"id":"W2043963103","doi":"10.1016/j.disc.2004.12.010","title":"Completion of Laplacian integral graphs via edge addition","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Integrally closed; Mathematics; Combinatorics; Laplacian matrix; Algebraic connectivity; Resistance distance; Discrete mathematics; Integral graph; Laplace operator; Graph; Line graph; Graph power; Mathematical analysis","score_opus":0.03295297523356717,"score_gpt":0.3015378562735073,"score_spread":0.26858488103994016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043963103","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45522234,0.0005442587,0.39469776,0.0018436422,0.00045332668,0.00016232123,0.00064841704,0.0010877097,0.1453402],"genre_scores_gemma":[0.87661487,0.00090901187,0.058454186,0.00046983617,0.0005633447,0.0001123112,0.0007094254,0.00048653537,0.061680403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949646,0.00008437844,0.000018337243,0.00012617694,0.00017718851,0.00009741126],"domain_scores_gemma":[0.9985331,0.00038239552,0.00018455675,0.00015609371,0.00029628782,0.00044758097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050391257,0.0006144716,0.00075725757,0.0020168158,0.0011131751,0.0024597254,0.0012652146,0.0006452608,0.0104777645],"category_scores_gemma":[0.00236268,0.00042197635,0.0007423162,0.0012481182,0.0019473308,0.003774117,0.0020902886,0.0028120806,0.0011740291],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040063223,0.000049584272,0.00011237059,0.00003344804,0.0000049961077,0.00004531237,0.000223147,0.0012995993,0.0014122826,0.9843761,0.0019579164,0.010445174],"study_design_scores_gemma":[0.000016696984,0.000019363652,0.00021263496,0.0000066509633,0.0000072945604,0.00008308351,0.000093842886,0.0072293025,0.00079960894,0.98722583,0.0042941463,0.00001150721],"about_ca_topic_score_codex":0.0009566976,"about_ca_topic_score_gemma":0.0009321798,"teacher_disagreement_score":0.0104777645,"about_ca_system_score_codex":0.0008209011,"about_ca_system_score_gemma":0.0006123681,"threshold_uncertainty_score":0.035051584},"labels":[],"label_agreement":null},{"id":"W2044878800","doi":"10.1016/s0012-365x(99)00323-4","title":"On the girth of digraphs","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Combinatorics; Digraph; Mathematics; Conjecture; Girth (graph theory); Counterexample; Order (exchange); Discrete mathematics","score_opus":0.020229973716509912,"score_gpt":0.2800074361875158,"score_spread":0.25977746247100586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044878800","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7393777,0.0034230084,0.13828112,0.004863621,0.0005661475,0.000087679335,0.0012339117,0.00048771792,0.111679144],"genre_scores_gemma":[0.95339435,0.0032348745,0.02354716,0.0007082845,0.0007156992,0.00010963562,0.0008448905,0.00029645718,0.017148564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864596,0.00043329745,0.00005646989,0.00026042896,0.0003519362,0.00025204598],"domain_scores_gemma":[0.9858635,0.010484507,0.0008415199,0.00096757675,0.0006257433,0.0012172661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013584619,0.0010116088,0.0016959953,0.0046512475,0.0020756489,0.0034204586,0.002123452,0.0017409514,0.010218001],"category_scores_gemma":[0.0115082525,0.0012841014,0.00100951,0.0036350074,0.004555476,0.0065493244,0.0048831133,0.0043975213,0.0012416726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017309819,0.000049725215,0.0017020496,0.00015666898,0.000039305996,0.00014553356,0.00076078234,0.011921982,0.0015474741,0.95974654,0.004190703,0.019566078],"study_design_scores_gemma":[0.000016058124,0.000021509673,0.00044033726,0.000033443626,0.000015546058,0.00009686607,0.000102046,0.008111181,0.00025164062,0.98879236,0.0021075842,0.000011459556],"about_ca_topic_score_codex":0.0010522958,"about_ca_topic_score_gemma":0.0012035146,"teacher_disagreement_score":0.010218001,"about_ca_system_score_codex":0.0017081512,"about_ca_system_score_gemma":0.0005526635,"threshold_uncertainty_score":0.034182608},"labels":[],"label_agreement":null},{"id":"W2045160518","doi":"10.1016/s0012-365x(00)00302-2","title":"Steiner pentagon covering designs","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"","keywords":"Pentagon; Combinatorics; Mathematics; Path (computing); Graph; Order (exchange); Undirected graph; Discrete mathematics; Geometry; Computer science","score_opus":0.020964857172028985,"score_gpt":0.2246420895706413,"score_spread":0.20367723239861232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045160518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32497826,0.0006250354,0.5229843,0.0006027154,0.00024393451,0.00013231319,0.0007235196,0.0008638648,0.14884602],"genre_scores_gemma":[0.8339326,0.0007370178,0.13715042,0.00031235447,0.000079083846,0.00014477545,0.0009393983,0.00014332942,0.026560895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953985,0.00012934374,0.00002617101,0.00008312135,0.00013789687,0.000083633895],"domain_scores_gemma":[0.9994617,0.00013140556,0.00007118457,0.00017991112,0.00009803312,0.000057770736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022447329,0.0004741464,0.00050260994,0.00071195053,0.00056003936,0.0010484608,0.000476218,0.0008052725,0.009592486],"category_scores_gemma":[0.0009120778,0.00039641155,0.00046329602,0.0012608357,0.00036787614,0.00088600407,0.00095187745,0.0007523592,0.001859616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036035007,0.000085289,0.00093462615,0.00017240226,0.00007179869,0.00040126187,0.00022775074,0.04363969,0.026489511,0.79024464,0.0103326505,0.12704012],"study_design_scores_gemma":[0.00013907444,0.0004931696,0.0013589276,0.00009031811,0.00009329156,0.00138932,0.0002795587,0.23270816,0.028899243,0.68283725,0.051657878,0.000053751595],"about_ca_topic_score_codex":0.00027222364,"about_ca_topic_score_gemma":0.00038498838,"teacher_disagreement_score":0.009592486,"about_ca_system_score_codex":0.00042193892,"about_ca_system_score_gemma":0.000322677,"threshold_uncertainty_score":0.03209001},"labels":[],"label_agreement":null},{"id":"W2045251507","doi":"10.1016/j.disc.2009.01.018","title":"Vertex domination of generalized Petersen graphs","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Combinatorics; Dominating set; Vertex (graph theory); Mathematics; Domination analysis; Neighbourhood (mathematics); Modulo; Discrete mathematics; Graph","score_opus":0.01943357779614378,"score_gpt":0.30040339959807083,"score_spread":0.28096982180192703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045251507","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9516018,0.00026817247,0.018373325,0.00041946647,0.00003190331,0.00002781128,0.0001649925,0.00007724877,0.029035224],"genre_scores_gemma":[0.9916938,0.00020988968,0.0025442191,0.000058802147,0.000037931357,0.00002414651,0.00013439012,0.000025976078,0.005270747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994394,0.000121773046,0.000018964241,0.000106079526,0.00015542218,0.0001583213],"domain_scores_gemma":[0.9975936,0.0013234512,0.00034946442,0.00021364349,0.0001932661,0.00032648744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005440937,0.0003684133,0.0007363591,0.0016604055,0.0018132109,0.0025964293,0.00093221845,0.0007747251,0.004121226],"category_scores_gemma":[0.0031128428,0.00047464474,0.00051902304,0.0015805432,0.0017718223,0.0022427528,0.0016002716,0.0011590696,0.00024081844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023568766,0.00005005801,0.0028168417,0.00010645923,0.000050127568,0.00049586984,0.00089799287,0.013348358,0.006116419,0.961218,0.002183178,0.012481114],"study_design_scores_gemma":[0.0000532918,0.000027755046,0.0021008102,0.000020659523,0.00004201492,0.00038782036,0.00039414072,0.038604047,0.0024418295,0.9532592,0.0026466579,0.00002171837],"about_ca_topic_score_codex":0.0013232178,"about_ca_topic_score_gemma":0.0017905298,"teacher_disagreement_score":0.004121226,"about_ca_system_score_codex":0.0008781457,"about_ca_system_score_gemma":0.00047764665,"threshold_uncertainty_score":0.013786852},"labels":[],"label_agreement":null},{"id":"W2045324891","doi":"10.1016/j.disc.2004.10.012","title":"Isotone relations revisited","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Mathematics; Property (philosophy); Characterization (materials science); Fixed point; Product (mathematics); Discrete mathematics; Fixed-point theorem; Combinatorics; Epistemology","score_opus":0.011928744731955357,"score_gpt":0.24924527298086396,"score_spread":0.23731652824890861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045324891","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03616869,0.005593776,0.13583079,0.013709401,0.0019394708,0.00003611803,0.000306686,0.00026484623,0.8061502],"genre_scores_gemma":[0.7822503,0.0053374134,0.042656146,0.005085209,0.002160726,0.00013700953,0.0005620166,0.00036732343,0.16144386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984528,0.0003703335,0.0000859251,0.000381696,0.0005341287,0.0001750974],"domain_scores_gemma":[0.99723935,0.0014199651,0.00019238096,0.00065793935,0.00031787905,0.00017247336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015268794,0.00056875095,0.00092800014,0.0023314608,0.00398303,0.0034755692,0.0016696539,0.0017379606,0.027587023],"category_scores_gemma":[0.0050134086,0.00042176805,0.0010485636,0.003414109,0.0077292416,0.011553389,0.003598289,0.006827963,0.003044351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023161906,0.0000021532107,0.000015746897,0.000005850528,0.0000010519723,0.000007968366,0.00006551853,0.000029747525,0.000019027399,0.9976503,0.00074366765,0.0014566645],"study_design_scores_gemma":[0.0000023055652,0.0000020397365,0.000046565903,0.000007269108,0.0000020708562,0.000026257298,0.000053135722,0.00015406213,0.000050216244,0.9912777,0.008376134,0.0000023814869],"about_ca_topic_score_codex":0.0017660117,"about_ca_topic_score_gemma":0.0024821858,"teacher_disagreement_score":0.027587023,"about_ca_system_score_codex":0.0015887318,"about_ca_system_score_gemma":0.0009926028,"threshold_uncertainty_score":0.09228778},"labels":[],"label_agreement":null},{"id":"W2045836875","doi":"10.1016/j.disc.2013.02.021","title":"Hamilton paths in generalized Petersen graphs","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.021707420690217437,"score_gpt":0.2835553962889854,"score_spread":0.261847975598768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045836875","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79984933,0.00086508034,0.09263781,0.0017981845,0.00020459486,0.00016506128,0.0007316556,0.00036541896,0.10338284],"genre_scores_gemma":[0.9470869,0.001037017,0.021108327,0.0003403679,0.00011874506,0.00013236009,0.00049144396,0.000099549885,0.029585313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997322,0.00006487636,0.00001195891,0.00005065018,0.00007601042,0.00006434111],"domain_scores_gemma":[0.99928373,0.0003288969,0.00013345672,0.00006221473,0.0000703124,0.000121439705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028749203,0.0005207922,0.0004680264,0.0019675507,0.0017953243,0.001902916,0.000767604,0.00094425824,0.009342142],"category_scores_gemma":[0.0018087141,0.0005610703,0.0005479617,0.0019261983,0.0017237648,0.0027425233,0.0014767647,0.0014051407,0.00066886964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041544787,0.000015990583,0.00027429423,0.000042411077,0.000009633643,0.00011925886,0.0002353971,0.0025362808,0.00057321886,0.98802173,0.0013234921,0.0068066423],"study_design_scores_gemma":[0.000013940504,0.0000062989384,0.00017609185,0.0000071225163,0.0000057939956,0.000035332378,0.000085732536,0.0040043,0.00016390992,0.9942192,0.0012775493,0.000004702702],"about_ca_topic_score_codex":0.0026040012,"about_ca_topic_score_gemma":0.0042673065,"teacher_disagreement_score":0.009342142,"about_ca_system_score_codex":0.0009538788,"about_ca_system_score_gemma":0.00076429895,"threshold_uncertainty_score":0.031252563},"labels":[],"label_agreement":null},{"id":"W2046062574","doi":"10.1016/j.disc.2006.01.029","title":"Hex and combinatorics","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Combinatorics; Enumerative combinatorics; Extremal combinatorics; Algebraic combinatorics; Discrete mathematics","score_opus":0.017423255086028776,"score_gpt":0.2593164744615726,"score_spread":0.2418932193755438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046062574","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029401613,0.007681521,0.12003891,0.011167927,0.0019107875,0.00003567275,0.00049261766,0.00040000214,0.8288709],"genre_scores_gemma":[0.6667833,0.006200305,0.03445111,0.004000909,0.0017601681,0.000110069916,0.0005900623,0.00038146184,0.28572264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957854,0.00015250924,0.000022240567,0.00009988674,0.000097013464,0.000049819286],"domain_scores_gemma":[0.99940336,0.0002909063,0.00004055861,0.00012091349,0.00007666491,0.00006772846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003813339,0.00043151097,0.0006402456,0.00095624337,0.001642048,0.0042322404,0.00050255726,0.00071103213,0.031193782],"category_scores_gemma":[0.001417105,0.00026494192,0.0004330831,0.0013440421,0.0046334923,0.006036288,0.0017590574,0.0029255298,0.0043149563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004772442,0.000002493143,0.000026766367,0.000012718504,0.000001262483,0.000007210448,0.00004767363,0.00008137487,0.000031542426,0.9945957,0.0017458824,0.0034426071],"study_design_scores_gemma":[0.0000033232925,0.0000023966816,0.000036953235,0.000008968272,0.0000014647003,0.000025574309,0.000060737446,0.00023499448,0.00006503748,0.9760482,0.023510214,0.0000021269032],"about_ca_topic_score_codex":0.0010517556,"about_ca_topic_score_gemma":0.00087839476,"teacher_disagreement_score":0.031193782,"about_ca_system_score_codex":0.0014231299,"about_ca_system_score_gemma":0.0005973411,"threshold_uncertainty_score":0.10435361},"labels":[],"label_agreement":null},{"id":"W2046546000","doi":"10.1016/j.disc.2012.01.028","title":"Two results on the digraph chromatic number","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Mathematics; Combinatorics; Digraph; Girth (graph theory); Chromatic scale; Integer (computer science); Discrete mathematics; Graph; Computer science","score_opus":0.043220335193595145,"score_gpt":0.32276929236353363,"score_spread":0.2795489571699385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046546000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15718786,0.0066431984,0.4120282,0.018301336,0.002083009,0.00013965521,0.0012916639,0.00065371586,0.4016714],"genre_scores_gemma":[0.83785486,0.00495945,0.07987289,0.0036464217,0.0024396605,0.0002915984,0.0009947784,0.00051539653,0.06942487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989003,0.00021087508,0.00004040404,0.00038165174,0.0002706982,0.00019611134],"domain_scores_gemma":[0.988197,0.007600615,0.0006764905,0.0010938607,0.0008950436,0.0015369214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016623061,0.0010749082,0.0009621241,0.005277037,0.0026044336,0.003693783,0.0027394628,0.0020857987,0.015191216],"category_scores_gemma":[0.01081852,0.0006751241,0.0010792053,0.004704238,0.0063670087,0.009315745,0.003762887,0.005632874,0.001115579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036556336,0.000024149636,0.00037153534,0.00007263934,0.000005962105,0.000031764568,0.00019328196,0.0012997219,0.00052086794,0.9883456,0.0031262508,0.0059716348],"study_design_scores_gemma":[0.000021635919,0.000020583175,0.0006846741,0.000046043024,0.000020694657,0.00012156187,0.00013654151,0.006150166,0.00072639406,0.98061717,0.011428926,0.00002555176],"about_ca_topic_score_codex":0.0029713067,"about_ca_topic_score_gemma":0.0034958357,"teacher_disagreement_score":0.015191216,"about_ca_system_score_codex":0.0040038875,"about_ca_system_score_gemma":0.0015127057,"threshold_uncertainty_score":0.050819695},"labels":[],"label_agreement":null},{"id":"W2046755592","doi":"10.1016/j.disc.2008.05.031","title":"Brambles and independent packings in chordal graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Chordal graph; Mathematics; Split graph; Indifference graph; Treewidth; Discrete mathematics; Pathwidth; Disjoint sets; Maximal independent set; Interval graph; Independent set; Cograph; Graph; 1-planar graph; Line graph","score_opus":0.027302086804797048,"score_gpt":0.28550113844060665,"score_spread":0.2581990516358096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046755592","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.722846,0.0031260464,0.16133025,0.0025762042,0.0006356859,0.0001788189,0.00057800923,0.00046111975,0.10826788],"genre_scores_gemma":[0.9386962,0.0015206411,0.030238165,0.00044515784,0.00038978062,0.00018916195,0.0007185899,0.00019244982,0.027609894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991456,0.00015948706,0.00004613219,0.00017528525,0.00028407358,0.00018939287],"domain_scores_gemma":[0.9956281,0.0023217162,0.0006963193,0.0004685967,0.00026703093,0.0006182006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057431764,0.00084150734,0.0015270129,0.0030163154,0.0033439621,0.0049664024,0.0022377935,0.0021618025,0.01035536],"category_scores_gemma":[0.0073047383,0.001612236,0.0009901026,0.0038299465,0.0043554413,0.005965874,0.0032264707,0.0040807263,0.0014850766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015917406,0.000057694346,0.0006850253,0.00010965726,0.00002010811,0.00019122449,0.000833661,0.0038120747,0.0011706506,0.9774071,0.0028702598,0.012683398],"study_design_scores_gemma":[0.00003851253,0.0000195878,0.00043611779,0.000025057074,0.000014645854,0.00015636419,0.00032120434,0.007843696,0.0003272885,0.9879362,0.0028681157,0.000013175106],"about_ca_topic_score_codex":0.0018101361,"about_ca_topic_score_gemma":0.0025933897,"teacher_disagreement_score":0.01035536,"about_ca_system_score_codex":0.0010911177,"about_ca_system_score_gemma":0.00057738554,"threshold_uncertainty_score":0.0346421},"labels":[],"label_agreement":null},{"id":"W2047548144","doi":"10.1016/j.disc.2006.05.027","title":"Tamari lattices and noncrossing partitions in type B","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Bijection; Combinatorics; Mathematics; Lattice (music); Order (exchange); Type (biology); Discrete mathematics; Physics","score_opus":0.03473768432901951,"score_gpt":0.3265942049032501,"score_spread":0.29185652057423056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047548144","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78933775,0.00096865493,0.041219573,0.001592465,0.0007479298,0.00006054122,0.00038509915,0.00031331487,0.16537465],"genre_scores_gemma":[0.964226,0.00029225653,0.008299429,0.0002756838,0.00021220626,0.000053382977,0.00028472915,0.000072719056,0.026283618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949265,0.00012244695,0.000034154677,0.00007621423,0.00013020469,0.00014422632],"domain_scores_gemma":[0.99859315,0.0005387285,0.00025655836,0.0001652429,0.00013837697,0.00030799836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006223094,0.0004288439,0.000618304,0.0026341446,0.0038614701,0.0041603865,0.0009331884,0.0014194179,0.012305577],"category_scores_gemma":[0.001901901,0.0004745511,0.00062708976,0.0019322747,0.0028765134,0.0032229084,0.001593488,0.002120406,0.0012744671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116892974,0.00003040586,0.00062520406,0.000027433825,0.000006459431,0.00020861809,0.00034770728,0.00030679003,0.0010045836,0.9928966,0.0012401781,0.0031890972],"study_design_scores_gemma":[0.00004178177,0.000027906704,0.00081473176,0.000018994166,0.000013255588,0.000447533,0.0005896207,0.0016165377,0.0008838353,0.9911883,0.004340744,0.000016648288],"about_ca_topic_score_codex":0.0009061029,"about_ca_topic_score_gemma":0.0011190542,"teacher_disagreement_score":0.012305577,"about_ca_system_score_codex":0.000977912,"about_ca_system_score_gemma":0.0004932873,"threshold_uncertainty_score":0.041166306},"labels":[],"label_agreement":null},{"id":"W2047567341","doi":"10.1016/s0012-365x(99)00370-2","title":"Bipartite Ramsey numbers and Zarankiewicz numbers","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Ramsey's theorem; Combinatorics; Bipartite graph; Discrete mathematics; Ramsey theory; Graph","score_opus":0.020216719679944057,"score_gpt":0.2899892336094061,"score_spread":0.26977251392946205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047567341","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46904427,0.014458237,0.19286208,0.011493507,0.0010123769,0.00008026592,0.0006686375,0.0005001227,0.3098805],"genre_scores_gemma":[0.94480777,0.0038799755,0.021806795,0.0008941919,0.00092802476,0.00016392737,0.000256581,0.00007334978,0.027189331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923015,0.00028371747,0.000046177294,0.0001538185,0.00017859465,0.00010756302],"domain_scores_gemma":[0.9974975,0.001420846,0.00038459734,0.00017873953,0.00025669756,0.0002615546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012828894,0.0006510793,0.0010247641,0.0029466571,0.002730285,0.004289033,0.0011251143,0.0014778452,0.006924213],"category_scores_gemma":[0.0048090904,0.0006976457,0.00053561537,0.00349144,0.006164217,0.01151467,0.0023536594,0.0034566498,0.0008339476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073011174,0.0000038912785,0.000030451745,0.000011282974,0.0000010497764,0.000008133164,0.00007162957,0.000137711,0.00007603261,0.998384,0.0003483346,0.0009202268],"study_design_scores_gemma":[0.000004084868,0.0000026295882,0.0000441807,0.0000053320337,0.0000020993036,0.000023227014,0.000035488276,0.00053412194,0.0000589378,0.99784625,0.0014396855,0.000004028555],"about_ca_topic_score_codex":0.0010340697,"about_ca_topic_score_gemma":0.0011122879,"teacher_disagreement_score":0.006924213,"about_ca_system_score_codex":0.0015211427,"about_ca_system_score_gemma":0.0007051344,"threshold_uncertainty_score":0.023163795},"labels":[],"label_agreement":null},{"id":"W2047785497","doi":"10.1016/j.disc.2006.03.076","title":"The chromatic number and rank of the complements of the Kasami graphs","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Rank (graph theory); Counterexample; Chromatic scale; Conjecture; Discrete mathematics","score_opus":0.03315402156511491,"score_gpt":0.31832079128952084,"score_spread":0.2851667697244059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047785497","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95565414,0.0002147799,0.008355987,0.0007750559,0.000071512535,0.000021746951,0.00042510772,0.00007164087,0.034410104],"genre_scores_gemma":[0.99056923,0.00019838597,0.0028329305,0.000060706883,0.00009343559,0.000026293288,0.0003003783,0.000036873153,0.005881871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994085,0.00013540924,0.000023479264,0.00009764302,0.00017978545,0.00015521044],"domain_scores_gemma":[0.9951721,0.0022560111,0.0007874782,0.0003177245,0.0005632132,0.00090359844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010649342,0.00057905266,0.0005743254,0.0035307673,0.00244977,0.005276544,0.001382097,0.0010018474,0.009710476],"category_scores_gemma":[0.0049083065,0.00063610607,0.0005658781,0.001425598,0.0044816206,0.0033675455,0.001393136,0.001707644,0.0006143706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002954083,0.00003477507,0.0023775836,0.00005224141,0.000019209509,0.000098149016,0.00061238836,0.0036980857,0.0049971915,0.980755,0.0015815996,0.005478465],"study_design_scores_gemma":[0.00005542199,0.00007561214,0.0057547814,0.00004661662,0.00005100107,0.00028460522,0.0009863144,0.026959222,0.004959702,0.9573233,0.0034127296,0.000090603484],"about_ca_topic_score_codex":0.0041851443,"about_ca_topic_score_gemma":0.005660292,"teacher_disagreement_score":0.009710476,"about_ca_system_score_codex":0.0017243252,"about_ca_system_score_gemma":0.0013324629,"threshold_uncertainty_score":0.03248471},"labels":[],"label_agreement":null},{"id":"W2048219129","doi":"10.1016/j.disc.2005.11.003","title":"On almost self-complementary graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Combinatorics; Circulant matrix; Discrete mathematics; Cograph; Indifference graph; Chordal graph; Circulant graph; Pathwidth; Vertex (graph theory); Strongly regular graph; Complement (music); Graph; 1-planar graph; Line graph; Voltage graph","score_opus":0.05574125409828888,"score_gpt":0.3509366385757403,"score_spread":0.2951953844774514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048219129","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66080177,0.0013207729,0.12510441,0.004320805,0.000624072,0.00008094049,0.00049122743,0.00029279487,0.20696327],"genre_scores_gemma":[0.9509372,0.001123419,0.014554347,0.0009952651,0.0006532697,0.000075716176,0.0004958483,0.00013875285,0.031026151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993781,0.00017421781,0.000019351166,0.000111862486,0.00019836979,0.00011817331],"domain_scores_gemma":[0.9968707,0.0015929436,0.00036410042,0.00026588334,0.00035838378,0.0005479568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069113565,0.0008049652,0.0011020745,0.0032472569,0.0024006162,0.0025362931,0.0011050449,0.0014316454,0.00843041],"category_scores_gemma":[0.0029696203,0.00055038417,0.00092773896,0.0020712004,0.0040164306,0.0053104213,0.003172811,0.0024153683,0.00058742455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000906261,0.0000070952956,0.000059907365,0.000011508281,0.0000032856517,0.000029008623,0.00008111962,0.00026740835,0.00018270602,0.9980513,0.00036488066,0.00093257276],"study_design_scores_gemma":[0.0000058614046,0.0000043658947,0.000093860406,0.0000055983332,0.0000036483527,0.000052780822,0.000048277976,0.0012763012,0.00008231226,0.9976822,0.0007411807,0.0000034833315],"about_ca_topic_score_codex":0.0010360715,"about_ca_topic_score_gemma":0.001141285,"teacher_disagreement_score":0.00843041,"about_ca_system_score_codex":0.0012981904,"about_ca_system_score_gemma":0.00067080144,"threshold_uncertainty_score":0.028202593},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Combinatorics; Disjoint sets; Graph; Discrete mathematics","score_opus":0.021246706973682777,"score_gpt":0.22796406053922214,"score_spread":0.20671735356553936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048460015","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6651569,0.002931633,0.2994997,0.0030387444,0.00033820415,0.000046102232,0.001805839,0.00081515947,0.02636773],"genre_scores_gemma":[0.9792494,0.0021109232,0.013597539,0.0002077498,0.00053756183,0.00009009298,0.0008508129,0.00016046115,0.0031953503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991818,0.00023775244,0.000037254104,0.00028326927,0.00016941984,0.00009043915],"domain_scores_gemma":[0.9907505,0.0064423964,0.0010263727,0.0006080222,0.0006112798,0.00056138524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081368943,0.0006799278,0.0011922158,0.0029265622,0.00096560956,0.0025206555,0.0017375778,0.0014697795,0.0046922173],"category_scores_gemma":[0.010166778,0.0005209369,0.00056321186,0.0030387957,0.002019058,0.0057789916,0.0011441697,0.0012346021,0.00048476798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022946017,0.000070491405,0.0056195003,0.00044271688,0.00016574151,0.0004050651,0.00057701196,0.14051205,0.00814627,0.7906434,0.0074703842,0.045717888],"study_design_scores_gemma":[0.0000268195,0.000080753656,0.0033698191,0.00004392502,0.00008457416,0.00053935597,0.00014453067,0.21368645,0.0015267053,0.775949,0.004509504,0.00003851063],"about_ca_topic_score_codex":0.0010895925,"about_ca_topic_score_gemma":0.0008698592,"teacher_disagreement_score":0.0046922173,"about_ca_system_score_codex":0.00095543603,"about_ca_system_score_gemma":0.0004510732,"threshold_uncertainty_score":0.015697062},"labels":[],"label_agreement":null},{"id":"W2049191074","doi":"10.1016/j.disc.2008.02.010","title":"Representation of ideals of relational structures","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Countable set; Isomorphism (crystallography); Signature (topology); Ideal (ethics); Partially ordered set; Discrete mathematics; Binary relation; Combinatorics; Metric space; Set (abstract data type); Computer science","score_opus":0.08013886432723465,"score_gpt":0.35816533286285174,"score_spread":0.2780264685356171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049191074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18625723,0.0018317314,0.64873487,0.0029895194,0.0005827037,0.00013068659,0.00081025827,0.000929041,0.15773404],"genre_scores_gemma":[0.9093335,0.00065555813,0.06591271,0.00029015035,0.0004625191,0.00010351541,0.0006369559,0.00017952385,0.022425536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985398,0.00035958964,0.00010451291,0.0002603484,0.0004889766,0.0002467227],"domain_scores_gemma":[0.9979577,0.00070456596,0.00022977848,0.00028640608,0.00045207268,0.0003695316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002099776,0.00057632907,0.00077830773,0.002074088,0.0016318953,0.005446632,0.0014235922,0.00084077235,0.0077533284],"category_scores_gemma":[0.0028313946,0.0005673465,0.0011180291,0.0015642033,0.0038701002,0.008135722,0.0027471322,0.0030388318,0.001116188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013917675,0.00000853374,0.0000504545,0.000009905533,0.000002557379,0.00001628425,0.00023950601,0.00017219232,0.00024129127,0.99752563,0.00023958596,0.0014800673],"study_design_scores_gemma":[0.000010255442,0.000012643254,0.00007719896,0.000007761371,0.000007932882,0.00004797687,0.00012923055,0.0025242164,0.0004420387,0.99333364,0.0033996634,0.000007386274],"about_ca_topic_score_codex":0.0008507764,"about_ca_topic_score_gemma":0.00079546956,"teacher_disagreement_score":0.0077533284,"about_ca_system_score_codex":0.0016543478,"about_ca_system_score_gemma":0.000774237,"threshold_uncertainty_score":0.025937498},"labels":[],"label_agreement":null},{"id":"W2049216882","doi":"10.1016/j.disc.2009.05.019","title":"Hamiltonicity and restricted block-intersection graphs of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>t</mml:mi></mml:math>-designs","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Intersection graph; Intersection (aeronautics); Graph; Vertex (graph theory); Block (permutation group theory); Discrete mathematics; Line graph","score_opus":0.01453078966665457,"score_gpt":0.22596034589161323,"score_spread":0.21142955622495865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049216882","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6440013,0.00027319952,0.21710944,0.0006779937,0.00005150491,0.00021939736,0.0021274844,0.00042303116,0.13511668],"genre_scores_gemma":[0.93836933,0.0002006711,0.026084362,0.00017028656,0.000037949318,0.000219303,0.0015286226,0.00013171996,0.033257745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949884,0.00013807887,0.000023452898,0.0001097567,0.00011323071,0.00011668095],"domain_scores_gemma":[0.9976349,0.0011044827,0.00040061073,0.000257767,0.00039959463,0.00020255975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044543555,0.00027901932,0.00027519488,0.0009277879,0.000879667,0.0012245459,0.00065598387,0.00043240204,0.016459266],"category_scores_gemma":[0.0022807755,0.00037239303,0.00037899162,0.00072792865,0.000951217,0.0014501177,0.0007600316,0.00076654955,0.0013821832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016415626,0.00003972025,0.00074475224,0.000058380694,0.000016498501,0.00011064497,0.00025011203,0.005595153,0.003214482,0.9771243,0.002751567,0.0099303285],"study_design_scores_gemma":[0.00006571066,0.000057104462,0.0014406106,0.00002957104,0.000025437721,0.00019875685,0.00018422368,0.040648233,0.0042056506,0.9462644,0.0068558594,0.000024527973],"about_ca_topic_score_codex":0.002810506,"about_ca_topic_score_gemma":0.0044218996,"teacher_disagreement_score":0.016459266,"about_ca_system_score_codex":0.0008642771,"about_ca_system_score_gemma":0.00091698486,"threshold_uncertainty_score":0.055061698},"labels":[],"label_agreement":null},{"id":"W2049246407","doi":"10.1016/j.disc.2011.06.003","title":"Paley graphs have Hamilton decompositions","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Australian Research Council","keywords":"Mathematics; Combinatorics; Discrete mathematics; Chordal graph; Indifference graph; Graph","score_opus":0.020762865953767026,"score_gpt":0.20976294429888379,"score_spread":0.18900007834511676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049246407","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3707248,0.0010792858,0.34495956,0.0032012674,0.00066357333,0.00026064806,0.0009714164,0.0005801871,0.27755925],"genre_scores_gemma":[0.8163634,0.0012200762,0.06338013,0.0012131657,0.00034010902,0.0002511228,0.0008455615,0.00038978318,0.115996666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996138,0.000074164214,0.000014771183,0.00008615228,0.00010688063,0.00010426524],"domain_scores_gemma":[0.9987037,0.00046383697,0.0001895752,0.00017981687,0.00019916901,0.00026387192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003308901,0.0007121328,0.0007029327,0.0025159484,0.0021663876,0.0025748487,0.0007239735,0.001202634,0.022153068],"category_scores_gemma":[0.0018927229,0.00084867736,0.00092068635,0.0014049072,0.0020201884,0.0029691095,0.002091569,0.002870244,0.0018640716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026739372,0.0000149600555,0.000104556566,0.000025257725,0.000007072995,0.00006815042,0.0001485071,0.00066634314,0.0010383392,0.9919944,0.0015993111,0.00430627],"study_design_scores_gemma":[0.00001211873,0.00000969075,0.00021113794,0.000010478709,0.000006181849,0.000088871835,0.000110022076,0.0027815672,0.00045116362,0.99189115,0.0044194455,0.000008021282],"about_ca_topic_score_codex":0.0012144471,"about_ca_topic_score_gemma":0.002021805,"teacher_disagreement_score":0.022153068,"about_ca_system_score_codex":0.00076457503,"about_ca_system_score_gemma":0.0004983112,"threshold_uncertainty_score":0.074109435},"labels":[],"label_agreement":null},{"id":"W2049622061","doi":"10.1016/j.disc.2007.08.006","title":"Small maximally disjoint union-free families","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Disjoint sets; Disjoint union (topology); Combinatorics; Discrete mathematics","score_opus":0.03713383757873842,"score_gpt":0.27907554878819735,"score_spread":0.24194171120945893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049622061","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65986055,0.0020919335,0.21423447,0.0032137171,0.00016650514,0.00007667213,0.00063934736,0.00056083803,0.11915589],"genre_scores_gemma":[0.9666245,0.0007772094,0.018487448,0.00040771574,0.00018976242,0.0001712431,0.0004564164,0.000114104914,0.012771585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843293,0.00047548188,0.00008024545,0.00033332896,0.00047738978,0.00020059307],"domain_scores_gemma":[0.992675,0.0046861535,0.00052029506,0.00061146746,0.0006139918,0.0008929618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020957792,0.0007021289,0.0015233852,0.0023957312,0.0042122724,0.0035611906,0.0017229338,0.001274625,0.006494469],"category_scores_gemma":[0.00797552,0.00090204005,0.00093656336,0.0020104263,0.004399031,0.0082760155,0.0044848192,0.002656141,0.0004727841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006068009,0.000017299664,0.00035410537,0.00004236642,0.000015104166,0.00007026779,0.00033501894,0.0005346895,0.000620746,0.9945544,0.0007561823,0.0026390802],"study_design_scores_gemma":[0.000022670192,0.000008764343,0.00029491764,0.000017264312,0.000024193288,0.00016184166,0.00016559829,0.0027498356,0.00060647697,0.99390405,0.0020347068,0.000009663403],"about_ca_topic_score_codex":0.0007038007,"about_ca_topic_score_gemma":0.0010121881,"teacher_disagreement_score":0.006494469,"about_ca_system_score_codex":0.0016902046,"about_ca_system_score_gemma":0.000688018,"threshold_uncertainty_score":0.021726131},"labels":[],"label_agreement":null},{"id":"W2049916150","doi":"10.1016/j.disc.2010.01.002","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si37.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>G</mml:mi></mml:math>-parking functions, acyclic orientations and spanning trees","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Bijection; Mathematics; Graph; Combinatorics; Vertex (graph theory); Discrete mathematics; Function (biology)","score_opus":0.020716285225112926,"score_gpt":0.2785681418201496,"score_spread":0.2578518565950367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049916150","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025459488,0.0006333984,0.2698095,0.0060603595,0.0015753271,0.0002794302,0.12984286,0.074076556,0.51517653],"genre_scores_gemma":[0.047097415,0.0027232969,0.22488976,0.002769338,0.0011932104,0.0006618643,0.19507037,0.076989874,0.44860482],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960595,0.00007065629,0.000040348918,0.00006483094,0.0001791744,0.000039022052],"domain_scores_gemma":[0.9986608,0.00046058584,0.000097994074,0.0002773835,0.00039345495,0.000109795896],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005556298,0.0011896715,0.0009888818,0.0019987072,0.00074687373,0.004260854,0.0023719177,0.0014891267,0.53079885],"category_scores_gemma":[0.003371001,0.0007724378,0.0007883489,0.004138057,0.00064281846,0.005095354,0.0015467479,0.0020866233,0.31044003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057923662,0.000035380315,0.00015333855,0.00028960427,0.000007968664,0.000059389367,0.00010321649,0.0006112561,0.00132495,0.075229615,0.8704144,0.051712926],"study_design_scores_gemma":[0.00004317618,0.00001498409,0.0005576647,0.00007765756,0.000006463923,0.00020572427,0.00006559223,0.004060093,0.003547832,0.07270196,0.9186804,0.000038454393],"about_ca_topic_score_codex":0.0053084777,"about_ca_topic_score_gemma":0.007841627,"teacher_disagreement_score":0.53079885,"about_ca_system_score_codex":0.0016518027,"about_ca_system_score_gemma":0.001001323,"threshold_uncertainty_score":0.6692585},"labels":[],"label_agreement":null},{"id":"W2050718596","doi":"10.1016/s0012-365x(03)00196-1","title":"MGDD with block size 4 and its application to sampling designs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Mathematics; Block size; Block (permutation group theory); Block design; Sampling (signal processing); Combinatorics; Discrete mathematics; Computer science","score_opus":0.017915803458780806,"score_gpt":0.22782177702843118,"score_spread":0.20990597356965038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050718596","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03191747,0.0006060839,0.96229064,0.00034301658,0.00005791707,0.00006069877,0.00012005401,0.00046049547,0.004143623],"genre_scores_gemma":[0.4872094,0.0010590319,0.5051598,0.00025677725,0.00020920992,0.0002538497,0.00020516285,0.00011376352,0.005533014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989085,0.0005310439,0.00006346935,0.00011420257,0.00031179574,0.00007107261],"domain_scores_gemma":[0.9931716,0.005189251,0.00038135104,0.0007638952,0.00040934363,0.00008465154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016447823,0.00066204346,0.00094139,0.0013160093,0.0004484855,0.00085041,0.00069492246,0.001192718,0.0026519948],"category_scores_gemma":[0.010994261,0.00042395105,0.0006636084,0.0016247629,0.00091062725,0.0010604414,0.0007329772,0.00087826245,0.00039472288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049283745,0.00010157142,0.0013363995,0.00024106563,0.00006663739,0.00040659404,0.00027793756,0.3186288,0.009356846,0.4913417,0.0032424529,0.17450705],"study_design_scores_gemma":[0.000046024685,0.00010079701,0.0002337275,0.000036297304,0.000029050198,0.00022704841,0.000014200612,0.7931798,0.0030546645,0.19952957,0.0035300371,0.0000187019],"about_ca_topic_score_codex":0.0016552821,"about_ca_topic_score_gemma":0.0017742426,"teacher_disagreement_score":0.0026519948,"about_ca_system_score_codex":0.0010374879,"about_ca_system_score_gemma":0.0010721867,"threshold_uncertainty_score":0.008871794},"labels":[],"label_agreement":null},{"id":"W2050946959","doi":"10.1016/j.disc.2008.01.016","title":"Directed cyclic Hamiltonian cycle systems of the complete symmetric digraph","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Illinois State University","keywords":"Digraph; Mathematics; Combinatorics; Hamiltonian path; Hamiltonian (control theory); Vertex (graph theory); Directed graph; Prime (order theory); Discrete mathematics; Graph","score_opus":0.014615531942675482,"score_gpt":0.19341050584554423,"score_spread":0.17879497390286875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050946959","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7892161,0.00084226154,0.1260856,0.00074824074,0.00018671737,0.00014459944,0.0010378713,0.00016663242,0.08157191],"genre_scores_gemma":[0.9781845,0.00027280708,0.0090453755,0.0001252246,0.00004662917,0.000068898866,0.00036030117,0.000021174237,0.011875027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998416,0.000040154107,0.0000073238148,0.000035733632,0.000035714755,0.00003943439],"domain_scores_gemma":[0.9995353,0.00015344069,0.00009165141,0.00004156102,0.000083847866,0.00009416235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014158567,0.00030369352,0.00037436854,0.00082670414,0.0007065537,0.0009353265,0.00053660595,0.0005670454,0.0069444366],"category_scores_gemma":[0.0007785915,0.00021718029,0.00023651391,0.0006828135,0.00059402146,0.0006995318,0.0005496911,0.00051069685,0.00036795612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006357029,0.00004367001,0.0005486044,0.000078781035,0.000021345408,0.00026117958,0.00019522403,0.021051386,0.0042641377,0.96107364,0.0025631583,0.009835246],"study_design_scores_gemma":[0.000051575556,0.000049206043,0.00068558817,0.00001882213,0.000016137972,0.0001856119,0.00014062072,0.11052514,0.0013850563,0.88139397,0.005521616,0.000026632253],"about_ca_topic_score_codex":0.002091578,"about_ca_topic_score_gemma":0.002475411,"teacher_disagreement_score":0.0069444366,"about_ca_system_score_codex":0.00083051226,"about_ca_system_score_gemma":0.00059659226,"threshold_uncertainty_score":0.023231506},"labels":[],"label_agreement":null},{"id":"W2051187346","doi":"10.1016/j.disc.2013.03.011","title":"Determinants of grids, tori, cylinders and Möbius ladders","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Torus; Planar; Cylinder; Singularity; Grid; Combinatorics; Discrete mathematics; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.02793990506582787,"score_gpt":0.3053568767351376,"score_spread":0.27741697166930973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051187346","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7515962,0.0011587908,0.08589294,0.0019180062,0.0005889182,0.00008621703,0.00024415847,0.00047271582,0.15804201],"genre_scores_gemma":[0.96810573,0.0005335326,0.0062694484,0.00020120213,0.000266035,0.0000392472,0.00012411899,0.0001430328,0.024317687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995478,0.00009348858,0.000017151347,0.00006348786,0.00016059849,0.000117491654],"domain_scores_gemma":[0.99897397,0.00028389558,0.00017492702,0.0001013711,0.00015544242,0.00031042134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060095463,0.0005552174,0.0007200358,0.0023041866,0.001327966,0.0026777198,0.00086616876,0.0008615296,0.0076426365],"category_scores_gemma":[0.0027042017,0.0004004761,0.0004956193,0.0009903758,0.003207419,0.0021566849,0.0015872514,0.0013811733,0.0011014951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016996697,0.000011314426,0.000250517,0.00001393943,0.000002312857,0.000038777805,0.00014099313,0.000677341,0.00033687372,0.9950067,0.0008539791,0.0026503322],"study_design_scores_gemma":[0.000013495466,0.000012133099,0.0005593446,0.000010457011,0.0000041890457,0.00008831509,0.00012894797,0.0056473706,0.00026825594,0.9908913,0.002365095,0.000011079661],"about_ca_topic_score_codex":0.0030416038,"about_ca_topic_score_gemma":0.002865947,"teacher_disagreement_score":0.0076426365,"about_ca_system_score_codex":0.0012865842,"about_ca_system_score_gemma":0.0007669832,"threshold_uncertainty_score":0.025567114},"labels":[],"label_agreement":null},{"id":"W2051200764","doi":"10.1016/s0012-365x(03)00251-6","title":"The metamorphosis of λ-fold block designs with block size four into a maximum packing of λKn with 4-cycles","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Combinatorics; Disjoint sets; Mathematics; Partition (number theory); Block (permutation group theory); Metamorphosis; Block size; Block design; Fold (higher-order function); Discrete mathematics; Computer science; Biology; Key (lock)","score_opus":0.014499723671043461,"score_gpt":0.20286254224414088,"score_spread":0.18836281857309742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051200764","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8223238,0.00022407541,0.13217156,0.00027057255,0.000096298485,0.00006724442,0.00020765136,0.00042786775,0.044210892],"genre_scores_gemma":[0.8930515,0.00018199213,0.09005123,0.00015761076,0.000035290945,0.00011643475,0.00029500402,0.00015998684,0.01595104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961096,0.00009047566,0.000030357416,0.00006742337,0.000114962146,0.0000857916],"domain_scores_gemma":[0.99921644,0.00022246689,0.00014790277,0.00021656658,0.000089166206,0.00010739672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027821792,0.00023960505,0.0003702438,0.0005971939,0.0007826109,0.0010640656,0.00044733568,0.000734387,0.005057452],"category_scores_gemma":[0.0013443629,0.0006827807,0.0005292512,0.0005990078,0.00083214644,0.0012980989,0.00095607026,0.00070335215,0.00068008265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007260957,0.00013194502,0.00289829,0.00021812388,0.00005955889,0.0012472442,0.000961092,0.05600244,0.0897736,0.7803958,0.004320602,0.06326519],"study_design_scores_gemma":[0.00016940996,0.00060188223,0.0059440825,0.00013203252,0.000076815544,0.0020811118,0.00052076345,0.2228005,0.049788285,0.6889959,0.028803578,0.000085597065],"about_ca_topic_score_codex":0.0009336451,"about_ca_topic_score_gemma":0.0012781487,"teacher_disagreement_score":0.005057452,"about_ca_system_score_codex":0.00050222274,"about_ca_system_score_gemma":0.00040333808,"threshold_uncertainty_score":0.016918898},"labels":[],"label_agreement":null},{"id":"W2051202422","doi":"10.1016/j.disc.2007.12.061","title":"Volume requirements of 3D upward drawings","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Directed acyclic graph; Mathematics; Combinatorics; Directed graph; Volume (thermodynamics); Upper and lower bounds; Discrete mathematics; Grid; Line (geometry); Geometry; Mathematical analysis","score_opus":0.03419053521280606,"score_gpt":0.26760955334706366,"score_spread":0.23341901813425758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051202422","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6705584,0.00081394747,0.25545424,0.0008475879,0.000105240986,0.00013003612,0.002137689,0.0014261277,0.06852669],"genre_scores_gemma":[0.96600205,0.0003293127,0.025575396,0.00006488151,0.0000329014,0.00007635074,0.0015242986,0.00062334473,0.0057715075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832565,0.0003051213,0.000065124295,0.000099415454,0.00097122556,0.00023345207],"domain_scores_gemma":[0.9941486,0.004013659,0.00039234996,0.0004076737,0.00070293806,0.0003347676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005273075,0.00059554237,0.0008790838,0.0010727476,0.000493624,0.0016645074,0.0010590097,0.0010968476,0.013051472],"category_scores_gemma":[0.010335988,0.0005790708,0.00045973976,0.0013047035,0.00043848992,0.0016010313,0.0012452684,0.0005671354,0.00143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010849332,0.00019370255,0.0033876773,0.000555579,0.000030747116,0.0007246821,0.0004827265,0.67230046,0.09215693,0.09946697,0.008827893,0.12078768],"study_design_scores_gemma":[0.000067090295,0.00033233702,0.0038413263,0.000044123186,0.000027840248,0.00071781984,0.00033891018,0.8826327,0.057900198,0.04687199,0.007181773,0.000043937085],"about_ca_topic_score_codex":0.0016242889,"about_ca_topic_score_gemma":0.0018378629,"teacher_disagreement_score":0.013051472,"about_ca_system_score_codex":0.00058687583,"about_ca_system_score_gemma":0.00041743572,"threshold_uncertainty_score":0.043661535},"labels":[],"label_agreement":null},{"id":"W2051389005","doi":"10.1016/j.disc.2012.05.011","title":"A class of graphs with depression three","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Enhanced Data Rates for GSM Evolution; Graph; Discrete mathematics; Integer (computer science); Path (computing); Class (philosophy); Degree (music); Physics; Computer science","score_opus":0.027368966003536815,"score_gpt":0.28358906149630747,"score_spread":0.25622009549277064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051389005","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76347464,0.00083675,0.059934862,0.0039212042,0.0001898128,0.00014693342,0.0010935605,0.00051766855,0.16988458],"genre_scores_gemma":[0.9709627,0.0003287074,0.010000546,0.00042116278,0.000103404556,0.000081047154,0.00056422123,0.00006377694,0.017474452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996301,0.00006640403,0.000014923097,0.000114545954,0.00009148343,0.00008250814],"domain_scores_gemma":[0.9985637,0.0003972002,0.00022700048,0.00024263508,0.00019728331,0.00037219995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003856191,0.0006258669,0.00090290507,0.001693462,0.0032145171,0.0030808875,0.0014985171,0.0013074403,0.0058486434],"category_scores_gemma":[0.00196365,0.00038379178,0.00064713485,0.001395218,0.0025437362,0.0024119536,0.0014643827,0.0019538372,0.0007951008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047526537,0.000023725124,0.000551496,0.00002441366,0.000010036992,0.00020846823,0.00024574198,0.00037699973,0.0010048696,0.99228364,0.0014194414,0.0038036245],"study_design_scores_gemma":[0.00005137383,0.000016910477,0.0008531039,0.000017713883,0.000016226426,0.00047976684,0.0002493798,0.0035340216,0.0006110404,0.9865437,0.007611707,0.000015062207],"about_ca_topic_score_codex":0.0026101077,"about_ca_topic_score_gemma":0.0021405627,"teacher_disagreement_score":0.0058486434,"about_ca_system_score_codex":0.0012953004,"about_ca_system_score_gemma":0.00072603114,"threshold_uncertainty_score":0.019565642},"labels":[],"label_agreement":null},{"id":"W2051859441","doi":"10.1016/j.disc.2004.05.018","title":"On the order of the recurrence produced by the method of creative telescoping","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Telescoping series; Mathematics; Maple; Term (time); Order (exchange); Recurrence relation; Hypergeometric distribution; Algorithm; Algebra over a field; Combinatorics; Pure mathematics; Mathematical analysis; Botany","score_opus":0.013903059328247128,"score_gpt":0.2902473432465428,"score_spread":0.27634428391829563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051859441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24763207,0.0043198112,0.648241,0.0026497177,0.0015323622,0.00015209818,0.00032966444,0.0007623949,0.094380856],"genre_scores_gemma":[0.8969187,0.0017988823,0.06942513,0.00038939228,0.0006675132,0.00012594761,0.0002752219,0.00067977444,0.029719502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988331,0.00047483397,0.0000748147,0.00013324601,0.00032067654,0.0001633871],"domain_scores_gemma":[0.9907923,0.0052992455,0.0009785419,0.0010905608,0.0012442241,0.000595217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031104437,0.00080095325,0.001001634,0.0018047626,0.0012965612,0.0025297622,0.0012754459,0.0012065351,0.010702538],"category_scores_gemma":[0.019098941,0.00046618035,0.001030404,0.0008833829,0.0030007157,0.0029026126,0.0013475413,0.0027255337,0.0014427518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001917787,0.000029083052,0.00060800853,0.00013993948,0.000018128201,0.00018027767,0.00026522338,0.009812817,0.003875528,0.9683108,0.0023772984,0.014191132],"study_design_scores_gemma":[0.000068493835,0.0001335244,0.0007672478,0.00009027538,0.000051488503,0.00025402135,0.00012837182,0.18543558,0.005491133,0.8004306,0.0070716,0.00007769877],"about_ca_topic_score_codex":0.0012096829,"about_ca_topic_score_gemma":0.0016637215,"teacher_disagreement_score":0.010702538,"about_ca_system_score_codex":0.0010107572,"about_ca_system_score_gemma":0.0010201994,"threshold_uncertainty_score":0.035803616},"labels":[],"label_agreement":null},{"id":"W2051877440","doi":"10.1016/s0012-365x(01)00356-9","title":"Dyck paths and a bijection for multisets of hook numbers","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bijection; Mathematics; Skew; Combinatorics; Hook; Class (philosophy); Lattice (music); Path (computing); Discrete mathematics; Computer science","score_opus":0.05179768231474255,"score_gpt":0.31680320103733656,"score_spread":0.26500551872259404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051877440","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4689722,0.002109636,0.33038202,0.0026076776,0.0014874829,0.00018034205,0.00081239024,0.000808914,0.19263934],"genre_scores_gemma":[0.8397716,0.0013242181,0.08071846,0.0007998946,0.00037538586,0.00031199952,0.0007126776,0.00045410954,0.07553167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988152,0.00022215626,0.00009562023,0.00034460743,0.0002513661,0.00027109132],"domain_scores_gemma":[0.9981623,0.00076458394,0.00022877267,0.00025641025,0.00022381633,0.00036400295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009826935,0.0009475644,0.0009939963,0.0047850376,0.004921789,0.0056754975,0.0017185974,0.0020529453,0.012353017],"category_scores_gemma":[0.003225848,0.0011395676,0.0015421632,0.003216076,0.0037989013,0.0091574695,0.006446954,0.0050827926,0.0016652372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001546977,0.000010911977,0.00010051248,0.000019052182,0.000003852229,0.000053152566,0.00020258801,0.00016268471,0.00037134334,0.99589264,0.0004342781,0.0027334245],"study_design_scores_gemma":[0.000012176307,0.000016527922,0.00023460903,0.00002025528,0.000011489211,0.00014913183,0.00021676153,0.0010232043,0.0004152059,0.9923529,0.0055293227,0.00001838727],"about_ca_topic_score_codex":0.0009705218,"about_ca_topic_score_gemma":0.0011510421,"teacher_disagreement_score":0.012353017,"about_ca_system_score_codex":0.0018510654,"about_ca_system_score_gemma":0.0006775897,"threshold_uncertainty_score":0.041324914},"labels":[],"label_agreement":null},{"id":"W2051966902","doi":"10.1016/j.disc.2011.12.006","title":"Triple metamorphosis of twofold triple systems","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Triple system; Combinatorics; Mathematics; Metamorphosis; Zero (linguistics); Pairing; Discrete mathematics; Pure mathematics; Physics; Biology","score_opus":0.02683210484313919,"score_gpt":0.20368523395798685,"score_spread":0.17685312911484766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051966902","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4632705,0.00048056454,0.38368413,0.00102371,0.0007901698,0.00017552891,0.0003505538,0.0006060647,0.1496188],"genre_scores_gemma":[0.93869084,0.0002087619,0.033443518,0.00026562836,0.00012661361,0.00012630042,0.00029243875,0.0001545981,0.026691318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993358,0.00013443478,0.000043266962,0.00014179955,0.0001886098,0.00015614442],"domain_scores_gemma":[0.99902964,0.00020358655,0.00011450215,0.00016605826,0.00027900244,0.00020721604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046558125,0.00035005444,0.0005563606,0.0015830502,0.0017281545,0.0026629774,0.00049147184,0.0010607076,0.01054809],"category_scores_gemma":[0.001794505,0.00039504364,0.0007609436,0.000653392,0.0016448104,0.0024519674,0.0020246077,0.0019996036,0.0010014919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026297079,0.000013776877,0.00014176521,0.000013279857,0.0000045191923,0.00010559216,0.00016278218,0.00075333123,0.001647589,0.9934122,0.0005846992,0.0031341156],"study_design_scores_gemma":[0.000017859304,0.000033263652,0.00024041685,0.00001913498,0.0000074822556,0.00016856146,0.000256366,0.012309213,0.0022070224,0.97992665,0.0047968184,0.000017139195],"about_ca_topic_score_codex":0.00094711035,"about_ca_topic_score_gemma":0.00084150495,"teacher_disagreement_score":0.01054809,"about_ca_system_score_codex":0.0008612847,"about_ca_system_score_gemma":0.0006200922,"threshold_uncertainty_score":0.035286844},"labels":[],"label_agreement":null},{"id":"W2052201505","doi":"10.1016/s0012-365x(00)00388-5","title":"Colouring Steiner systems with specified block colour patterns","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni","keywords":"Mathematics; Combinatorics; Integer (computer science); Block (permutation group theory); Type (biology); Discrete mathematics; Steiner system; Computer science","score_opus":0.010682379561719704,"score_gpt":0.1909996477849388,"score_spread":0.18031726822321908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052201505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47558883,0.00028963186,0.4868029,0.00049054576,0.00010526931,0.00020630148,0.0008271781,0.0006213535,0.035067987],"genre_scores_gemma":[0.8047437,0.00038083337,0.17861916,0.00018243036,0.000038230402,0.00024282873,0.0008149253,0.00023557749,0.014742272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992193,0.00023046312,0.00006882553,0.00011087309,0.00020780678,0.00016263782],"domain_scores_gemma":[0.9972843,0.0012303704,0.0004180276,0.0005044689,0.0003436729,0.00021917257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006494271,0.00062132295,0.0009310512,0.00096650835,0.0008937061,0.0021424203,0.001036108,0.0014541197,0.006657686],"category_scores_gemma":[0.0032100405,0.00091075693,0.0006326112,0.0017530776,0.001073675,0.0022131274,0.001963225,0.0011437491,0.0012308699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007017388,0.00009796395,0.0013545256,0.00024349011,0.000074040356,0.0005446565,0.0004193986,0.11135197,0.035611905,0.81465703,0.004316274,0.030627035],"study_design_scores_gemma":[0.00018715046,0.00014172617,0.0006856519,0.000045264158,0.000051535437,0.00047510708,0.0002047323,0.272729,0.016231233,0.70389366,0.0053114183,0.000043447373],"about_ca_topic_score_codex":0.00092713314,"about_ca_topic_score_gemma":0.0016668774,"teacher_disagreement_score":0.006657686,"about_ca_system_score_codex":0.0011002288,"about_ca_system_score_gemma":0.00075550564,"threshold_uncertainty_score":0.02227217},"labels":[],"label_agreement":null},{"id":"W2052851790","doi":"10.1016/j.disc.2006.11.026","title":"On realizations of point determining graphs, and obstructions to full homomorphisms","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Graph homomorphism; Vertex (graph theory); Graph; Homomorphism; Discrete mathematics; Induced subgraph; Wheel graph; Graph power; Line graph","score_opus":0.022561029521324626,"score_gpt":0.30560892087986674,"score_spread":0.28304789135854214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052851790","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72836137,0.00095204316,0.13477768,0.0037233958,0.000307968,0.00015328826,0.0005561948,0.0007100389,0.1304581],"genre_scores_gemma":[0.96129143,0.000608847,0.016129304,0.00032851868,0.0003320075,0.00013935975,0.00048863725,0.000199873,0.020481952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998343,0.00046339468,0.00007703435,0.00033205876,0.0003891928,0.00039542202],"domain_scores_gemma":[0.9963625,0.0017581391,0.0003491121,0.00046509114,0.00029394455,0.0007711817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016363856,0.0007336896,0.0011275633,0.0023672364,0.004453345,0.0047452515,0.0014657896,0.0021372542,0.006381148],"category_scores_gemma":[0.0057853567,0.00094314956,0.0014920066,0.0018178653,0.006142236,0.008247206,0.0054496364,0.004640879,0.00068538915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014259905,0.0000115348585,0.000112426285,0.000009780866,0.0000020550945,0.000036364454,0.00025678956,0.00032700557,0.00015315456,0.99795496,0.00026994006,0.0008517245],"study_design_scores_gemma":[0.000012555478,0.000007658464,0.00015493976,0.0000050911044,0.0000046486293,0.00004880965,0.00015134107,0.0013230173,0.0001460143,0.9970796,0.0010577297,0.000008651609],"about_ca_topic_score_codex":0.002323818,"about_ca_topic_score_gemma":0.001905428,"teacher_disagreement_score":0.006381148,"about_ca_system_score_codex":0.0019449373,"about_ca_system_score_gemma":0.001064131,"threshold_uncertainty_score":0.021347106},"labels":[],"label_agreement":null},{"id":"W2052869910","doi":"10.1016/j.disc.2014.12.010","title":"Maximal bifix decoding","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Ministero dell’Istruzione, dell’Università e della Ricerca; Università degli Studi di Salerno; Agence Nationale de la Recherche","keywords":"Mathematics; Decoding methods; Generalization; Class (philosophy); Tree (set theory); Combinatorics; Discrete mathematics; Interval (graph theory); Natural number; Algorithm; Computer science; Artificial intelligence","score_opus":0.04140851047828288,"score_gpt":0.26999016780454593,"score_spread":0.22858165732626307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052869910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08077095,0.0011795209,0.5096571,0.006557751,0.0014597101,0.00017011346,0.0035700556,0.005239963,0.39139485],"genre_scores_gemma":[0.78279483,0.00093290344,0.10750387,0.0030309623,0.00095092965,0.00026971177,0.0046202247,0.0031636183,0.096733026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963213,0.0009100336,0.00022116453,0.0009274542,0.00079900253,0.00082103425],"domain_scores_gemma":[0.9931987,0.002890167,0.00023125547,0.0020514936,0.0012139475,0.0004144522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020231851,0.0012581587,0.0016571782,0.001985081,0.003865177,0.0061747185,0.001515489,0.0026906636,0.03247865],"category_scores_gemma":[0.011237904,0.0007485746,0.0013030972,0.0022124029,0.0028699096,0.009089988,0.005729505,0.0044958396,0.01166301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013500376,0.000029873141,0.0002470375,0.00006844653,0.0000104789815,0.000073714255,0.00019171713,0.0004905233,0.0016177477,0.9680017,0.00876357,0.020370232],"study_design_scores_gemma":[0.000012703246,0.000011532546,0.00008211698,0.00003041932,0.000013748026,0.00012352804,0.00007493197,0.004197224,0.0041956212,0.98210907,0.009132619,0.000016508002],"about_ca_topic_score_codex":0.0008406718,"about_ca_topic_score_gemma":0.0008765612,"teacher_disagreement_score":0.03247865,"about_ca_system_score_codex":0.0015687817,"about_ca_system_score_gemma":0.0024391783,"threshold_uncertainty_score":0.108651936},"labels":[],"label_agreement":null},{"id":"W2053756329","doi":"10.1016/j.disc.2008.08.013","title":"More on almost self-complementary graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Isomorphism (crystallography); Complement (music); Constructive proof; Automorphism; Discrete mathematics; Graph; Matching (statistics); Order (exchange); Existential quantification","score_opus":0.051814792430309294,"score_gpt":0.295176398150736,"score_spread":0.2433616057204267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053756329","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051420316,0.012812398,0.27130374,0.06187804,0.012304026,0.000071989634,0.0012404833,0.0004919341,0.5884771],"genre_scores_gemma":[0.54626936,0.018291945,0.081491955,0.042286202,0.015364535,0.00015834646,0.001565334,0.00091089995,0.29366148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953043,0.00015890751,0.000012199099,0.00009095776,0.0001527814,0.000054801087],"domain_scores_gemma":[0.9986946,0.0006564055,0.00006779412,0.00028921806,0.00020819163,0.00008388855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006997515,0.00080851803,0.00094595616,0.0018496582,0.0012464379,0.0013953163,0.0010968007,0.0017113904,0.023212958],"category_scores_gemma":[0.0024127525,0.00030601193,0.0010662046,0.0026286782,0.0018531962,0.0068961075,0.0013163792,0.0025234278,0.002557611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008458015,0.000019682193,0.000051916333,0.00006979713,0.000008791371,0.000044655128,0.0000740491,0.0013726731,0.000335659,0.9744105,0.015079891,0.0085240165],"study_design_scores_gemma":[0.00000436119,0.0000046638743,0.000056311088,0.000015762253,0.000004089737,0.00004115503,0.000024037268,0.0010937703,0.000095440795,0.9763315,0.022321794,0.000007100858],"about_ca_topic_score_codex":0.0015109752,"about_ca_topic_score_gemma":0.0016214139,"teacher_disagreement_score":0.023212958,"about_ca_system_score_codex":0.0011160324,"about_ca_system_score_gemma":0.00034380422,"threshold_uncertainty_score":0.07765514},"labels":[],"label_agreement":null},{"id":"W2053952882","doi":"10.1016/j.disc.2008.05.003","title":"Independence polynomials of circulants with an application to music","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics; Cardinality (data modeling); Complement (music); Independence (probability theory); Graph; Polynomial; Tutte polynomial; Voltage graph; Line graph","score_opus":0.04803095456035274,"score_gpt":0.31168601970545834,"score_spread":0.2636550651451056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053952882","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053934917,0.0017569724,0.88345253,0.0010438536,0.00057211285,0.00005875573,0.00025718255,0.00031671816,0.058606938],"genre_scores_gemma":[0.7193235,0.0037762455,0.24351522,0.0005583032,0.0039671734,0.00011778921,0.00038731474,0.00036223512,0.027992189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988667,0.0004305277,0.000043559827,0.00017895586,0.0003424898,0.00013784632],"domain_scores_gemma":[0.9955955,0.0026684338,0.00040449036,0.0004857971,0.0005342678,0.0003114746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013853804,0.0009593625,0.0009017289,0.0021160427,0.0014423996,0.002024098,0.0013356966,0.0011007494,0.005809286],"category_scores_gemma":[0.009235669,0.00059859664,0.0011348871,0.0035395205,0.0032332344,0.0026714685,0.0020086344,0.0032657462,0.001055298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052915493,0.000033212695,0.00017978241,0.000046857775,0.000012269258,0.000098477874,0.00015402716,0.0062122783,0.0015985505,0.9691702,0.002564566,0.01987693],"study_design_scores_gemma":[0.00001559369,0.000029115628,0.0003046284,0.00001612034,0.000016351558,0.00023493431,0.000044248307,0.07995219,0.0011918708,0.9110954,0.007062493,0.000037041144],"about_ca_topic_score_codex":0.0016053658,"about_ca_topic_score_gemma":0.0021720282,"teacher_disagreement_score":0.005809286,"about_ca_system_score_codex":0.0008039273,"about_ca_system_score_gemma":0.0009155505,"threshold_uncertainty_score":0.019433975},"labels":[],"label_agreement":null},{"id":"W2054087167","doi":"10.1016/s0012-365x(01)00042-5","title":"The Tutte polynomial for homeomorphism classes of graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Tutte polynomial; Mathematics; Combinatorics; Chromatic polynomial; Homeomorphism (graph theory); Discrete mathematics; Polynomial; Class (philosophy); Graph; Line graph; Computer science; Voltage graph; Artificial intelligence","score_opus":0.05471248833812317,"score_gpt":0.30077858165186755,"score_spread":0.24606609331374438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054087167","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.706453,0.002107994,0.19418164,0.0045980792,0.00041082842,0.00009872391,0.0008111376,0.00054362766,0.09079503],"genre_scores_gemma":[0.97235495,0.0014674958,0.010116542,0.00025040304,0.00051445316,0.00011427904,0.0004908609,0.0001890731,0.014501964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990268,0.00025108366,0.000033852808,0.00022302534,0.0002136016,0.00025169092],"domain_scores_gemma":[0.99540555,0.003043809,0.0004303911,0.00038812688,0.00025638798,0.0004757258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011816527,0.00083716377,0.0017183243,0.0035904518,0.0026721582,0.006134236,0.0017294234,0.0016627532,0.010003138],"category_scores_gemma":[0.0083194515,0.0008052062,0.0013449435,0.004191154,0.0056247846,0.00907429,0.0027897684,0.004666179,0.0009079475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051996532,0.000020138597,0.0003763882,0.000040116898,0.000009058611,0.000028960032,0.00033892292,0.0021706908,0.0003066595,0.9895047,0.0015793663,0.005572908],"study_design_scores_gemma":[0.000012150301,0.0000093341005,0.00024053158,0.000010786541,0.000009623373,0.000046563804,0.00008131908,0.007826814,0.00018867229,0.9900191,0.0015446625,0.000010425332],"about_ca_topic_score_codex":0.0044467705,"about_ca_topic_score_gemma":0.003683498,"teacher_disagreement_score":0.010003138,"about_ca_system_score_codex":0.0032616851,"about_ca_system_score_gemma":0.001047678,"threshold_uncertainty_score":0.033463895},"labels":[],"label_agreement":null},{"id":"W2054709282","doi":"10.1016/j.disc.2011.06.011","title":"Finite Sholander trees, trees, and their betweenness","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Canada Research Chairs","keywords":"Betweenness centrality; Mathematics; Tree (set theory); Intersection (aeronautics); Characterization (materials science); Combinatorics; Discrete mathematics; Order (exchange)","score_opus":0.056277129533041564,"score_gpt":0.2814007296774125,"score_spread":0.2251236001443709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054709282","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52924305,0.0053503793,0.31976944,0.0057518347,0.00032358285,0.000057228954,0.00074887864,0.0003247759,0.13843073],"genre_scores_gemma":[0.95662946,0.0012299287,0.025676465,0.00049616187,0.00027508324,0.000060221006,0.00048451673,0.0001092535,0.0150388805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887305,0.0003133571,0.0000794229,0.00031101107,0.00027007505,0.00015302713],"domain_scores_gemma":[0.9950088,0.003069638,0.0004953143,0.0005996574,0.00041774774,0.00040874814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014190179,0.0003625536,0.0008045515,0.0022994364,0.0028878273,0.003777699,0.0009489616,0.0013390867,0.006492359],"category_scores_gemma":[0.0063547306,0.00055801915,0.0008709141,0.0021416417,0.0051646554,0.009555842,0.0021331944,0.0026795452,0.0005926484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001102321,0.0000053196895,0.0001739373,0.000012928825,0.0000037878558,0.000018723165,0.00020446094,0.00030492467,0.00016486531,0.9969195,0.00028326528,0.0018972353],"study_design_scores_gemma":[0.000003962499,0.0000041316434,0.000106634056,0.0000057876136,0.0000040761042,0.00004560976,0.000074389274,0.0008067155,0.000074568765,0.9971765,0.0016938059,0.000003629825],"about_ca_topic_score_codex":0.0012120706,"about_ca_topic_score_gemma":0.0015561249,"teacher_disagreement_score":0.006492359,"about_ca_system_score_codex":0.0011683166,"about_ca_system_score_gemma":0.00059147744,"threshold_uncertainty_score":0.021719038},"labels":[],"label_agreement":null},{"id":"W2055586003","doi":"10.1016/j.disc.2008.11.001","title":"Hamming distance for conjugates","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hamming distance; Combinatorics; Mathematics; Alphabet; String (physics); Hamming code; Hamming graph; Binary number; Hamming bound; Conjugate; Discrete mathematics; Arithmetic; Algorithm; Block code","score_opus":0.02867343019447815,"score_gpt":0.2616710702256235,"score_spread":0.23299764003114537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055586003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12508377,0.0074725086,0.67026633,0.0064340034,0.002213343,0.00014610196,0.0012101742,0.00061740424,0.18655643],"genre_scores_gemma":[0.7585577,0.0058108317,0.121585056,0.0017395875,0.0020245705,0.00034175333,0.001391307,0.0005429359,0.10800627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864537,0.00031061473,0.00010326258,0.00034656748,0.0004720315,0.00012218514],"domain_scores_gemma":[0.99772996,0.0010480792,0.00023237945,0.000528846,0.00031602848,0.00014468025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009359586,0.0008106001,0.00093805796,0.003061175,0.0011026674,0.0034571143,0.000970318,0.0013228909,0.010750558],"category_scores_gemma":[0.00624821,0.00030108963,0.0005350742,0.0030174789,0.0020729464,0.006132623,0.0031641903,0.0028039587,0.003913569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005046139,0.000017978,0.0001401025,0.00004067188,0.000007706335,0.000044893273,0.00008343019,0.0012013004,0.00064808934,0.95665985,0.0032502147,0.037855193],"study_design_scores_gemma":[0.0000068976374,0.000026266598,0.00013527239,0.000023427388,0.0000065384916,0.00019802625,0.000036296955,0.0049367486,0.0012376931,0.9811421,0.0122383125,0.00001243836],"about_ca_topic_score_codex":0.00019240721,"about_ca_topic_score_gemma":0.00013723406,"teacher_disagreement_score":0.010750558,"about_ca_system_score_codex":0.0011759497,"about_ca_system_score_gemma":0.00057711016,"threshold_uncertainty_score":0.03596419},"labels":[],"label_agreement":null},{"id":"W2055714468","doi":"10.1016/j.disc.2004.02.026","title":"IC-Colorings and IC-Indices of graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Graph; Integer (computer science); Edge coloring; Discrete mathematics; Graph power; Computer science; Line graph","score_opus":0.011820432619405085,"score_gpt":0.23298965538140437,"score_spread":0.2211692227619993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055714468","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43043396,0.0041861543,0.359444,0.0070936508,0.0008669476,0.00017026514,0.0016936996,0.00067466777,0.19543655],"genre_scores_gemma":[0.8580073,0.002514012,0.11039887,0.0012989958,0.00086112705,0.00029806266,0.0015403744,0.0003804137,0.024700822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982712,0.00049615745,0.000108503795,0.00040060584,0.0003506382,0.00037285857],"domain_scores_gemma":[0.9877127,0.0064633377,0.001576909,0.0015699315,0.0011051506,0.001571999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017650528,0.0010674791,0.0016213183,0.002901862,0.0032704305,0.0067235217,0.003001268,0.002017626,0.007761917],"category_scores_gemma":[0.009045082,0.0011790993,0.0011304703,0.0051081795,0.00510151,0.009488716,0.002516865,0.0063197883,0.0009421989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048428024,0.000029525529,0.00046404597,0.00004501466,0.000005755884,0.000019269291,0.0001770498,0.002244548,0.00038925654,0.987542,0.0026730716,0.0063620154],"study_design_scores_gemma":[0.000012831833,0.0000072263438,0.00018940463,0.000017124708,0.00000649589,0.000043000182,0.00008644056,0.0059395027,0.0003003433,0.99059254,0.0027965629,0.000008618583],"about_ca_topic_score_codex":0.0024980844,"about_ca_topic_score_gemma":0.00248663,"teacher_disagreement_score":0.007761917,"about_ca_system_score_codex":0.0036714082,"about_ca_system_score_gemma":0.0015865217,"threshold_uncertainty_score":0.026638031},"labels":[],"label_agreement":null},{"id":"W2055751002","doi":"10.1016/j.disc.2014.03.015","title":"Recognition of prime graphs from a prime subgraph","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Université de Montréal","funders":"","keywords":"Combinatorics; Mathematics; Digraph; Prime (order theory); Vertex (graph theory); Graph; Discrete mathematics; Singleton","score_opus":0.025591788007199887,"score_gpt":0.27737762576300273,"score_spread":0.2517858377558028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055751002","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30794346,0.00047967065,0.6639799,0.0012959831,0.0002826068,0.00022131306,0.0018782213,0.003382809,0.02053606],"genre_scores_gemma":[0.7679127,0.000478419,0.21236002,0.00042163394,0.00021868532,0.00012426055,0.005923638,0.0007850274,0.011775642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995395,0.00007395967,0.00002760747,0.00019099432,0.00008965171,0.000078307334],"domain_scores_gemma":[0.99850696,0.0004726665,0.0001574722,0.00049728376,0.00021067004,0.0001548433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003199235,0.0005782427,0.00085846905,0.0010488004,0.0007354996,0.0020406186,0.00093676866,0.00093328493,0.0060204244],"category_scores_gemma":[0.0025933932,0.0004953369,0.0009359978,0.0010945027,0.0008633713,0.0034521287,0.0016349248,0.0018272498,0.0020501306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019468775,0.00046949156,0.011169178,0.0009425278,0.000120963065,0.0020443965,0.0020490459,0.03237253,0.123721875,0.45453703,0.03249324,0.33813277],"study_design_scores_gemma":[0.00006317331,0.00020147808,0.0036611005,0.00006606026,0.00009954351,0.001548266,0.00078553497,0.15167129,0.037793018,0.7760758,0.027963703,0.00007110276],"about_ca_topic_score_codex":0.0009753505,"about_ca_topic_score_gemma":0.0010819352,"teacher_disagreement_score":0.0060204244,"about_ca_system_score_codex":0.000419122,"about_ca_system_score_gemma":0.0004821998,"threshold_uncertainty_score":0.02014035},"labels":[],"label_agreement":null},{"id":"W2055996616","doi":"10.1016/s0012-365x(02)00864-6","title":"Homomorphisms and amalgamation","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Homomorphism; Discrete mathematics; Combinatorics; Countable set; Graph homomorphism; Homogeneous; Graph; Random regular graph; Class (philosophy); Line graph; Voltage graph; 1-planar graph; Computer science","score_opus":0.030106388836899423,"score_gpt":0.30582616568153176,"score_spread":0.27571977684463234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055996616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3241121,0.00709534,0.38875034,0.007905375,0.0030603628,0.0001391092,0.00043443253,0.0015375686,0.26696536],"genre_scores_gemma":[0.92275846,0.0012707151,0.03946246,0.00082386716,0.00096570654,0.0001231615,0.0002418857,0.00023420436,0.034119576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986319,0.0004200569,0.00009646044,0.00041398057,0.00022515072,0.00021250876],"domain_scores_gemma":[0.9985495,0.0006099311,0.0001340155,0.00029799037,0.0002177335,0.00019074949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001488466,0.00057880767,0.0009822208,0.0020718144,0.0038486412,0.003997414,0.0013147377,0.0012643015,0.008267605],"category_scores_gemma":[0.003078854,0.00062244554,0.0014380072,0.00190334,0.006013452,0.010938808,0.004842594,0.0036962477,0.0011812852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018071205,0.0000118034695,0.000056907324,0.000017851387,0.0000046221285,0.000032469743,0.00027597544,0.000070788614,0.00025841812,0.9948515,0.0005160234,0.0038855288],"study_design_scores_gemma":[0.000007800834,0.000010133313,0.000056790803,0.0000044306125,0.000007422413,0.00009209938,0.00011384833,0.00029353736,0.00030164002,0.99467397,0.004431585,0.000006735047],"about_ca_topic_score_codex":0.00049229775,"about_ca_topic_score_gemma":0.00030258743,"teacher_disagreement_score":0.008267605,"about_ca_system_score_codex":0.0011800448,"about_ca_system_score_gemma":0.00045735907,"threshold_uncertainty_score":0.027657926},"labels":[],"label_agreement":null},{"id":"W2056137755","doi":"10.1016/j.disc.2011.10.009","title":"Schröder quasigroups with a specified number of idempotents","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"Natural Sciences and Engineering Research Council of Canada; University Research Committee, Emory University; Mount Saint Vincent University; National Science Foundation","keywords":"Quasigroup; Mathematics; Idempotence; Combinatorics; Order (exchange); Commutative property; Discrete mathematics; Invariant (physics); Arithmetic; Variety (cybernetics)","score_opus":0.02227717268754375,"score_gpt":0.21127794351454662,"score_spread":0.18900077082700287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056137755","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42678648,0.00035198935,0.4012166,0.00203024,0.0011685197,0.0002557553,0.0005503499,0.0010142549,0.16662574],"genre_scores_gemma":[0.87983894,0.00027029548,0.06656062,0.0006980249,0.00048837205,0.00039546462,0.00035478472,0.0002892798,0.051104307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841547,0.00049453496,0.000119871096,0.00020712815,0.0003476941,0.0004153586],"domain_scores_gemma":[0.9972703,0.0012504675,0.0002094136,0.0005398137,0.0003496018,0.00038039792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022605162,0.0008773074,0.0008816406,0.00234808,0.0027587162,0.0032791141,0.0009516838,0.0019515668,0.010640327],"category_scores_gemma":[0.0031350623,0.000658249,0.0011000858,0.0009846231,0.002581303,0.0047136513,0.0023399978,0.0021132294,0.0020210769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000719795,0.000025651281,0.00008680191,0.000014665379,0.0000038880034,0.00007051598,0.00008513268,0.00038288682,0.002334996,0.9942205,0.0005583683,0.0021447332],"study_design_scores_gemma":[0.000060853657,0.00008312214,0.0001499012,0.000018174505,0.000011442354,0.0001754118,0.00010323026,0.006101856,0.006791521,0.98159057,0.004876622,0.00003736742],"about_ca_topic_score_codex":0.00017952215,"about_ca_topic_score_gemma":0.00036591865,"teacher_disagreement_score":0.010640327,"about_ca_system_score_codex":0.00091583846,"about_ca_system_score_gemma":0.00085679255,"threshold_uncertainty_score":0.035595417},"labels":[],"label_agreement":null},{"id":"W2056838769","doi":"10.1016/s0012-365x(03)00154-7","title":"Bipartite rainbow Ramsey numbers","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Rainbow; Bipartite graph; Combinatorics; Monochromatic color; Mathematics; Ramsey's theorem; Edge coloring; Discrete mathematics; Colored; Complete bipartite graph; Graph; Graph power; Line graph; Physics","score_opus":0.03297050843445634,"score_gpt":0.3058187435489176,"score_spread":0.2728482351144612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056838769","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5138979,0.0021755632,0.13206387,0.005829087,0.00036791,0.00007052805,0.00056481955,0.0007696461,0.3442607],"genre_scores_gemma":[0.9459149,0.00072094833,0.016236661,0.0005203104,0.00021844177,0.000089839785,0.00022999379,0.00008089935,0.035988055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950266,0.00016835902,0.00002264612,0.00011298337,0.00011919364,0.0000741953],"domain_scores_gemma":[0.998367,0.0008166835,0.00018742314,0.00020788927,0.00017890165,0.00024213312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096963556,0.00033085156,0.00060505094,0.0017171786,0.0018309052,0.002598297,0.00079072115,0.0008684497,0.010067137],"category_scores_gemma":[0.0036998806,0.000373555,0.00037518723,0.0014475088,0.0026478902,0.005687654,0.0019826584,0.0021378796,0.0009082772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001818733,0.0000068907066,0.000095239186,0.000013961261,0.0000017737906,0.00001275407,0.0000809501,0.00027887846,0.00021382332,0.99635786,0.0008888501,0.0020309081],"study_design_scores_gemma":[0.000007919289,0.0000043812784,0.00012914144,0.0000066073544,0.000004332874,0.000040035804,0.000042176976,0.0016305629,0.00017001665,0.9957775,0.0021822557,0.000005163869],"about_ca_topic_score_codex":0.0008773843,"about_ca_topic_score_gemma":0.0015512272,"teacher_disagreement_score":0.010067137,"about_ca_system_score_codex":0.001246743,"about_ca_system_score_gemma":0.00067693833,"threshold_uncertainty_score":0.033677936},"labels":[],"label_agreement":null},{"id":"W2057066268","doi":"10.1016/s0012-365x(01)00158-3","title":"A family of universal pseudo-homogeneous G-colourable graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Combinatorics; Countable set; Homogeneous; Discrete mathematics; Graph isomorphism; Graph; Line graph","score_opus":0.028750135858627665,"score_gpt":0.26149008944714447,"score_spread":0.2327399535885168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057066268","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82093817,0.0014840217,0.10237067,0.0012327835,0.00016203235,0.000107250155,0.0010017734,0.0007343596,0.071968846],"genre_scores_gemma":[0.9752363,0.0005852628,0.011861992,0.0002102119,0.000057463858,0.000078584235,0.0005817542,0.00009338297,0.011295036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995567,0.000069733724,0.000017408162,0.00015424416,0.0000880858,0.00011378903],"domain_scores_gemma":[0.99866974,0.0005198245,0.00015980151,0.00017419066,0.00015565123,0.00032087244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039757942,0.0006174372,0.0006170645,0.0014361639,0.0019300587,0.001836401,0.0009942558,0.0006723618,0.004216765],"category_scores_gemma":[0.0019043175,0.0004756944,0.0006456087,0.0014358656,0.0014113857,0.0015989222,0.001504357,0.0010828468,0.00029970778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018181374,0.000034505785,0.0016660626,0.00015171677,0.00003696071,0.0007496753,0.0008695698,0.0023633006,0.006160019,0.9704376,0.0028547614,0.0144940885],"study_design_scores_gemma":[0.00009593091,0.00008410852,0.0050596176,0.00007695844,0.000099726865,0.0022193547,0.00059985847,0.017258484,0.0060356227,0.94340944,0.02500689,0.000054058488],"about_ca_topic_score_codex":0.0011725667,"about_ca_topic_score_gemma":0.00093059224,"teacher_disagreement_score":0.004216765,"about_ca_system_score_codex":0.0011320993,"about_ca_system_score_gemma":0.0004885214,"threshold_uncertainty_score":0.014106452},"labels":[],"label_agreement":null},{"id":"W2057179567","doi":"10.1016/j.disc.2011.03.026","title":"Graphs with equal eternal vertex cover and eternal domination numbers","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex cover; Vertex (graph theory); Domination analysis; Cover (algebra); Graph; Discrete mathematics","score_opus":0.029087318685136275,"score_gpt":0.2742533542844277,"score_spread":0.24516603559929143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057179567","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7682256,0.0007113043,0.11709693,0.0021455176,0.00013311168,0.00008980412,0.0013708735,0.00033290885,0.10989394],"genre_scores_gemma":[0.9626986,0.0003970599,0.019752404,0.00031722954,0.00010676994,0.00012682362,0.0005813277,0.00008593028,0.015933866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983442,0.0003318407,0.000098188706,0.0003375908,0.00045534948,0.00043280478],"domain_scores_gemma":[0.99161035,0.0049894373,0.0009232652,0.00097359944,0.00072541006,0.000777982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012802674,0.00067862496,0.0010432026,0.0024533756,0.002139638,0.0038185313,0.0018261864,0.0012063414,0.010394189],"category_scores_gemma":[0.0076872585,0.0006894111,0.0006595571,0.0024786415,0.0032395257,0.0058473735,0.0025847799,0.0020886648,0.0007574293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040931764,0.00006353803,0.0015569741,0.00009913095,0.000034229157,0.00019740958,0.0003988329,0.005073835,0.0030420313,0.9737413,0.0020971028,0.013286217],"study_design_scores_gemma":[0.00008927843,0.00003010908,0.0015489325,0.00003617582,0.000049293514,0.0006361567,0.000231655,0.01521029,0.0029519317,0.97470677,0.0044783168,0.000031134423],"about_ca_topic_score_codex":0.001015109,"about_ca_topic_score_gemma":0.0013562797,"teacher_disagreement_score":0.010394189,"about_ca_system_score_codex":0.0014096266,"about_ca_system_score_gemma":0.0006250589,"threshold_uncertainty_score":0.03477204},"labels":[],"label_agreement":null},{"id":"W2058209797","doi":"10.1016/s0012-365x(02)00461-2","title":"Existence of self-orthogonal diagonal Latin squares with a missing subsquare","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Latin square; Diagonal; Combinatorics; Orthogonal array; Discrete mathematics; Statistics; Geometry; Taguchi methods","score_opus":0.010705066625756082,"score_gpt":0.20211905626375562,"score_spread":0.19141398963799955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058209797","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6293408,0.00044580377,0.28344667,0.0012917746,0.00040647262,0.0000764552,0.00032737333,0.00073696766,0.08392765],"genre_scores_gemma":[0.88433105,0.00022975804,0.093261056,0.0004504493,0.00019316224,0.000105580446,0.00036956902,0.00026087387,0.020798517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992574,0.00020309613,0.000040489238,0.00018872436,0.0001850981,0.00012510923],"domain_scores_gemma":[0.99536717,0.0021299548,0.00071209355,0.0005877512,0.00071396655,0.0004890683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056115026,0.0006484635,0.00063433487,0.0013302409,0.0013658194,0.0017679991,0.000948268,0.00134944,0.006554874],"category_scores_gemma":[0.0052751,0.0008055791,0.0004950051,0.0008575541,0.001804577,0.001917875,0.0019389939,0.0011900035,0.0014975609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021109804,0.0000620836,0.0010941,0.00010854256,0.000030163841,0.00034490845,0.00032599075,0.0037698208,0.021156756,0.95542353,0.0031144863,0.0143585345],"study_design_scores_gemma":[0.000098231176,0.00014977237,0.0010370043,0.00003649907,0.000029493955,0.001426874,0.00044575377,0.052119847,0.01883788,0.9186925,0.0070431167,0.00008291608],"about_ca_topic_score_codex":0.000267824,"about_ca_topic_score_gemma":0.00033795252,"teacher_disagreement_score":0.006554874,"about_ca_system_score_codex":0.00033127167,"about_ca_system_score_gemma":0.0005195363,"threshold_uncertainty_score":0.02192825},"labels":[],"label_agreement":null},{"id":"W2058216532","doi":"10.1016/j.disc.2007.12.002","title":"On a cycle partition problem","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Partition (number theory); Circumference; Vertex (graph theory); Discrete mathematics; Graph; Chordal graph; Pathwidth; Line graph","score_opus":0.029932927174198425,"score_gpt":0.29276310488968144,"score_spread":0.262830177715483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058216532","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4181418,0.0026978652,0.29649764,0.022937596,0.0011093911,0.00044759316,0.0015648556,0.00044014567,0.2561632],"genre_scores_gemma":[0.8131742,0.0032010435,0.082011364,0.0026186535,0.0013516359,0.0006096372,0.0034141382,0.0006573933,0.09296205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913067,0.0003000353,0.000028735194,0.00020967584,0.00017099996,0.00015984479],"domain_scores_gemma":[0.99606186,0.0027033759,0.00024285282,0.0003332924,0.00022249114,0.00043616106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010196203,0.0012504136,0.0019572824,0.0015224208,0.0027810442,0.004108825,0.0027141953,0.0043083504,0.028112397],"category_scores_gemma":[0.008865395,0.00091968424,0.001337394,0.003230509,0.0027826577,0.0084744105,0.0039160047,0.0049143117,0.001691659],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024884604,0.00015181652,0.0004401264,0.00020158797,0.000048194008,0.00014926626,0.00033258702,0.01758387,0.0007545127,0.93338645,0.023182198,0.023520663],"study_design_scores_gemma":[0.00005541705,0.000020335514,0.00016014,0.000032318934,0.000019096871,0.00005620467,0.00014418767,0.026257731,0.00018602023,0.9690372,0.0040228465,0.000008436094],"about_ca_topic_score_codex":0.0022109246,"about_ca_topic_score_gemma":0.0018603456,"teacher_disagreement_score":0.028112397,"about_ca_system_score_codex":0.0016256286,"about_ca_system_score_gemma":0.0010163342,"threshold_uncertainty_score":0.09404528},"labels":[],"label_agreement":null},{"id":"W2058470877","doi":"10.1016/s0012-365x(02)00346-1","title":"q-Enumeration of alternating sign matrices with exactly one −1","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Combinatorics; Mathematics; Enumeration; Sign (mathematics); Generating function","score_opus":0.0564142510595318,"score_gpt":0.2915754565951829,"score_spread":0.23516120553565112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058470877","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5579663,0.00037593083,0.30738693,0.0022350694,0.0007210002,0.000159213,0.0010997521,0.00085703435,0.12919872],"genre_scores_gemma":[0.8413009,0.00038457944,0.10830735,0.0012549093,0.00025705996,0.0002756415,0.0015726271,0.0004340997,0.046212796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983992,0.0005598193,0.00015088277,0.00023134309,0.00034341658,0.00031534422],"domain_scores_gemma":[0.9955177,0.0020820287,0.00045584416,0.00056966423,0.0008778774,0.0004969534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014199249,0.0010289291,0.0007787284,0.0014881677,0.0020426558,0.0037355195,0.0015953203,0.0018082019,0.010838655],"category_scores_gemma":[0.005298574,0.00072816317,0.00068776665,0.001803629,0.0022654494,0.004177018,0.0025191908,0.002400439,0.0030684287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035092505,0.00011341625,0.0009944043,0.00010388135,0.00001452779,0.0002377818,0.00026762456,0.0012818384,0.00700903,0.95870274,0.00560913,0.025314687],"study_design_scores_gemma":[0.000044193937,0.000047321697,0.00026442777,0.000029322218,0.000013825853,0.00034038024,0.00010440558,0.007700808,0.0029794774,0.9847494,0.0037008938,0.000025613495],"about_ca_topic_score_codex":0.00040896193,"about_ca_topic_score_gemma":0.0006581653,"teacher_disagreement_score":0.010838655,"about_ca_system_score_codex":0.0006916977,"about_ca_system_score_gemma":0.001253042,"threshold_uncertainty_score":0.036258936},"labels":[],"label_agreement":null},{"id":"W2058537654","doi":"10.1016/j.disc.2004.06.019","title":"On minimal prime extensions of a four-vertex graph in a prime graph","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Circulant graph; Neighbourhood (mathematics); Vertex (graph theory); Discrete mathematics; Graph; Prime (order theory); Complement graph; Graph power; Line graph","score_opus":0.030063820658872933,"score_gpt":0.29746555709682104,"score_spread":0.2674017364379481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058537654","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8121806,0.00048770066,0.08217791,0.0019304963,0.00028966132,0.00012162634,0.0004894771,0.00022890091,0.10209366],"genre_scores_gemma":[0.93380296,0.00056325505,0.039650705,0.00041841457,0.00026553485,0.00013027566,0.0007792967,0.00015060202,0.024238946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958783,0.0001314101,0.000017479306,0.00010640179,0.00007501194,0.00008176194],"domain_scores_gemma":[0.9986324,0.0005314229,0.00021869891,0.00012773626,0.00012937651,0.0003603185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069496216,0.0009356198,0.0011531162,0.0014138792,0.0026769522,0.0017594208,0.00152626,0.0010615607,0.005944472],"category_scores_gemma":[0.002074778,0.0005444117,0.0011988803,0.001311744,0.0022954394,0.0037752609,0.0022247212,0.003090879,0.00063118717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001582889,0.00004843134,0.00036330277,0.00007175033,0.00001258449,0.0003093435,0.0005141307,0.002806044,0.0017423215,0.9872384,0.0016914365,0.0050438754],"study_design_scores_gemma":[0.00002192519,0.000025636298,0.00033509216,0.000022476834,0.000017233882,0.00015523117,0.00017631649,0.0057630762,0.00053844793,0.990222,0.002711423,0.000011262005],"about_ca_topic_score_codex":0.001242757,"about_ca_topic_score_gemma":0.0019196941,"teacher_disagreement_score":0.005944472,"about_ca_system_score_codex":0.00091758615,"about_ca_system_score_gemma":0.0005211423,"threshold_uncertainty_score":0.019886196},"labels":[],"label_agreement":null},{"id":"W2058654435","doi":"10.1016/j.disc.2009.03.012","title":"The closure of the set of roots of strongly connected reliability polynomials is the entire complex plane","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Johnson and Johnson","keywords":"Digraph; Mathematics; Closure (psychology); Strongly connected component; Combinatorics; Plane (geometry); Arc (geometry); Reliability (semiconductor); Complex plane; Set (abstract data type); Discrete mathematics; Mathematical analysis; Geometry; Computer science","score_opus":0.03803243306271469,"score_gpt":0.3106649010428753,"score_spread":0.2726324679801606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058654435","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72913337,0.0008290126,0.24542838,0.0010564085,0.00006844564,0.000081171136,0.0014247227,0.000244008,0.02173446],"genre_scores_gemma":[0.9822828,0.0008432513,0.011776588,0.000079394726,0.00014575015,0.000099863944,0.0005777508,0.00007067617,0.004123795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989697,0.00022581771,0.000043924254,0.0003001667,0.00030285373,0.00015751783],"domain_scores_gemma":[0.99237,0.004437833,0.0014654314,0.0003721151,0.0007422615,0.0006123865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009861233,0.0011028266,0.0015674998,0.0022733794,0.00083706446,0.0041378075,0.0013134211,0.0009708424,0.00491758],"category_scores_gemma":[0.0074462504,0.00064179156,0.00058983336,0.0012346132,0.0032777605,0.0044589676,0.0016096614,0.0024338446,0.00068885257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039074977,0.000080281665,0.00131166,0.00021406729,0.00008397142,0.00030875352,0.0005413256,0.010711994,0.007976653,0.9588961,0.001680747,0.017803736],"study_design_scores_gemma":[0.00008961825,0.00010968347,0.0026685474,0.000056919587,0.00004243007,0.0006641251,0.0003497406,0.05487024,0.0031187206,0.9345899,0.0033901255,0.000050001756],"about_ca_topic_score_codex":0.0006276383,"about_ca_topic_score_gemma":0.0002188261,"teacher_disagreement_score":0.00491758,"about_ca_system_score_codex":0.00089435186,"about_ca_system_score_gemma":0.0005188944,"threshold_uncertainty_score":0.016451001},"labels":[],"label_agreement":null},{"id":"W2059685480","doi":"10.1016/j.disc.2004.02.022","title":"A generalization of the theorem of Lekkerkerker and Boland","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Mathematics; Generalization; Discrete mathematics; Combinatorics; Algebra over a field; Pure mathematics; Mathematical analysis","score_opus":0.015036969796973682,"score_gpt":0.2766363574825042,"score_spread":0.26159938768553054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059685480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013895952,0.004342235,0.88158655,0.004466783,0.0035340113,0.00009097366,0.0005001949,0.00048570833,0.0910976],"genre_scores_gemma":[0.47925153,0.01118499,0.3302444,0.0070344466,0.0075512514,0.00044472024,0.0010948064,0.0016783958,0.16151536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991672,0.00018253113,0.000041516087,0.00027225318,0.00025071812,0.00008568167],"domain_scores_gemma":[0.99868053,0.0005844145,0.00009409807,0.00024266995,0.00026781208,0.00013044315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014390567,0.0014721334,0.0016026474,0.002353907,0.0016200838,0.0019290413,0.00201847,0.0015880361,0.0109376535],"category_scores_gemma":[0.0044657737,0.0004955877,0.002112608,0.001643825,0.0027240496,0.0057965824,0.004280909,0.004542921,0.003340596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004275001,0.000044163822,0.00017995475,0.00022539568,0.00003265075,0.00012435144,0.0002250754,0.0038207376,0.002822167,0.95539457,0.009835555,0.02725266],"study_design_scores_gemma":[0.000015588801,0.000029651432,0.00022537634,0.000028845692,0.000023386167,0.00020558358,0.000042781052,0.026004188,0.00089027034,0.9453199,0.027189383,0.000025165804],"about_ca_topic_score_codex":0.0016057639,"about_ca_topic_score_gemma":0.001293719,"teacher_disagreement_score":0.0109376535,"about_ca_system_score_codex":0.0010672895,"about_ca_system_score_gemma":0.0008769359,"threshold_uncertainty_score":0.0365901},"labels":[],"label_agreement":null},{"id":"W2059892291","doi":"10.1016/s0012-365x(01)00102-9","title":"The level of nonmultiplicativity of graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Combinatorics; Multiplicative function; Discrete mathematics; Graph product; Cograph; Conjecture; Block graph; Graph; Split graph; 1-planar graph; Pathwidth; Indifference graph; Chordal graph; Line graph","score_opus":0.16044129254998377,"score_gpt":0.3319080170067017,"score_spread":0.17146672445671793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059892291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3433471,0.010046637,0.42484114,0.026325027,0.0015493626,0.000069268695,0.00052059686,0.00072243233,0.19257836],"genre_scores_gemma":[0.93127316,0.0022554912,0.047154807,0.001869644,0.0015572486,0.0001172851,0.0002566087,0.00021710062,0.015298629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950098,0.0018497992,0.00023242095,0.0010551238,0.0013098334,0.0005430204],"domain_scores_gemma":[0.97819865,0.013071605,0.0012243496,0.0047089923,0.0015173097,0.0012791818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004713629,0.0007128667,0.002065998,0.0029215447,0.004589248,0.010405035,0.003276273,0.0037972848,0.0078832675],"category_scores_gemma":[0.014088906,0.0014383642,0.0016135651,0.002733672,0.0133341225,0.019088151,0.004729184,0.008825371,0.0009806363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000079122865,0.000005572748,0.000075494856,0.000015291822,0.0000035328042,0.000018116589,0.00010015857,0.0002090528,0.00013656137,0.9980446,0.0003463123,0.0010374275],"study_design_scores_gemma":[0.0000020459165,0.0000027252172,0.00003718735,0.0000056257054,0.0000029347434,0.000025850568,0.000021332813,0.0008677584,0.000100626516,0.99801564,0.00091451127,0.0000037642408],"about_ca_topic_score_codex":0.0008659752,"about_ca_topic_score_gemma":0.00071188505,"teacher_disagreement_score":0.010405035,"about_ca_system_score_codex":0.0028327508,"about_ca_system_score_gemma":0.0012329639,"threshold_uncertainty_score":0.026372194},"labels":[],"label_agreement":null},{"id":"W2060176530","doi":"10.1016/j.disc.2007.12.053","title":"Claw-free graphs are not universal fixers","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.035678591440143834,"score_gpt":0.27477813120168937,"score_spread":0.23909953976154552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060176530","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63661784,0.0025738713,0.19539799,0.0036312393,0.0007126191,0.00030677396,0.001416243,0.0036268681,0.15571654],"genre_scores_gemma":[0.9312517,0.0008154143,0.025170544,0.00095420546,0.00018823372,0.00027755406,0.0011997154,0.0009086287,0.039233916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997603,0.0002047233,0.00010553117,0.0009350636,0.00037902646,0.000772698],"domain_scores_gemma":[0.98971844,0.00473221,0.0009127421,0.0024775565,0.0010226414,0.0011363891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019747391,0.0015892067,0.0024084237,0.0045937044,0.0065068123,0.0071786526,0.0029813573,0.003923407,0.0189415],"category_scores_gemma":[0.009562312,0.0028512,0.002434734,0.0031658572,0.0077125505,0.019574191,0.008163446,0.006675625,0.0026076995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013721341,0.00004182877,0.0008177785,0.000121643316,0.000063217536,0.00016390454,0.0006522552,0.00064067205,0.0017939534,0.9859211,0.0022992752,0.007347086],"study_design_scores_gemma":[0.000048352016,0.000021306776,0.0004015914,0.000051151066,0.00008126799,0.00024325785,0.0004446356,0.0012044812,0.0022489037,0.98943007,0.005785635,0.00003933635],"about_ca_topic_score_codex":0.0021102761,"about_ca_topic_score_gemma":0.0028054737,"teacher_disagreement_score":0.0189415,"about_ca_system_score_codex":0.0026167426,"about_ca_system_score_gemma":0.0012389348,"threshold_uncertainty_score":0.06336558},"labels":[],"label_agreement":null},{"id":"W2060988680","doi":"10.1016/j.disc.2008.01.029","title":"Multiple partitions, lattice paths and a Burge–Bressoud-type correspondence","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Bijection; Mathematics; Combinatorics; Partition (number theory); Constructive; Lattice (music); Type (biology); Discrete mathematics; Physics","score_opus":0.07364891201867933,"score_gpt":0.32467019932149493,"score_spread":0.2510212873028156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060988680","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41634557,0.003052346,0.270718,0.009961652,0.0015118344,0.00012224745,0.00038263347,0.00039696987,0.29750878],"genre_scores_gemma":[0.8833771,0.0010181944,0.05102792,0.0009309939,0.0006712281,0.0001219666,0.00021482515,0.00017248784,0.062465254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929357,0.0001863091,0.000024513061,0.00012674705,0.00022540975,0.00014344008],"domain_scores_gemma":[0.9990195,0.0003273541,0.00014194459,0.00013567561,0.00014371176,0.00023177908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009710089,0.0005812387,0.0008352701,0.0018803307,0.0035119692,0.0041960827,0.0013001988,0.0026134332,0.011816333],"category_scores_gemma":[0.002681289,0.00057699054,0.00069249514,0.0013818488,0.0047255917,0.006332977,0.002609708,0.0037293897,0.0014014917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012181142,0.0000048945717,0.000026374775,0.0000051162174,0.0000012255335,0.000019582263,0.00005415558,0.0002002634,0.00012923827,0.9982476,0.00041742064,0.0008819548],"study_design_scores_gemma":[0.000009425261,0.000003224343,0.000028968956,0.000003497235,9.977656e-7,0.00003782035,0.000036246125,0.0013664243,0.000078750214,0.9973521,0.0010787633,0.000003796698],"about_ca_topic_score_codex":0.0009857237,"about_ca_topic_score_gemma":0.0010029685,"teacher_disagreement_score":0.011816333,"about_ca_system_score_codex":0.0015706351,"about_ca_system_score_gemma":0.0009921753,"threshold_uncertainty_score":0.039529562},"labels":[],"label_agreement":null},{"id":"W2062166560","doi":"10.1016/j.disc.2012.08.013","title":"Quasigroups satisfying Stein’s third law with a specified number of idempotents","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"","keywords":"Mathematics; Idempotence; Combinatorics; Order (exchange); Block (permutation group theory); Type (biology); Discrete mathematics; Block size; Arithmetic","score_opus":0.014594174514120125,"score_gpt":0.22851908390816383,"score_spread":0.2139249093940437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062166560","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5330342,0.00021828848,0.38750538,0.0012706489,0.00055911194,0.00014827798,0.00023088821,0.000592361,0.07644078],"genre_scores_gemma":[0.9326329,0.00017588085,0.040001504,0.00042821927,0.00026559268,0.00018670477,0.00025537948,0.00021846412,0.025835318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798167,0.0004035828,0.00016015675,0.00028324462,0.0005535157,0.0006178042],"domain_scores_gemma":[0.9954016,0.0021192126,0.0004843865,0.0008232367,0.00052865746,0.0006429103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026903078,0.00088740874,0.001243712,0.0025723162,0.0029537908,0.00406196,0.0011348601,0.0019291524,0.00669229],"category_scores_gemma":[0.0046781707,0.00084815023,0.0017012415,0.0012299166,0.0043237624,0.005963918,0.0034086313,0.0025018037,0.0011956572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009972602,0.000031061514,0.00023895418,0.00001692852,0.000008826346,0.000118833625,0.00016252795,0.00047588695,0.0029732005,0.99266887,0.0004271482,0.002778124],"study_design_scores_gemma":[0.00007306435,0.0000957258,0.00030050092,0.000015047486,0.000016491684,0.00024201254,0.00019876716,0.0056029414,0.00569219,0.9847068,0.003024697,0.000031801137],"about_ca_topic_score_codex":0.00036483275,"about_ca_topic_score_gemma":0.00050253666,"teacher_disagreement_score":0.00669229,"about_ca_system_score_codex":0.0012139538,"about_ca_system_score_gemma":0.001134959,"threshold_uncertainty_score":0.022387922},"labels":[],"label_agreement":null},{"id":"W2062277114","doi":"10.1016/s0012-365x(02)00806-3","title":"Changing upper irredundance by edge addition","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of South Africa; National Research Foundation","keywords":"Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Vertex (graph theory); Graph; Discrete mathematics; Computer science","score_opus":0.01799772471379416,"score_gpt":0.2838632688220105,"score_spread":0.26586554410821633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062277114","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47207433,0.0008435726,0.2672488,0.0029926903,0.0017764295,0.000080212674,0.0003821204,0.0029606465,0.25164112],"genre_scores_gemma":[0.92071533,0.0005845424,0.04379968,0.0011149461,0.00046139862,0.00006228866,0.00025334343,0.0016206534,0.03138776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984359,0.00027587576,0.00007852373,0.00040608348,0.0003619357,0.00044158247],"domain_scores_gemma":[0.9933339,0.0028400584,0.00040250624,0.002037553,0.00059710507,0.0007890541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013481207,0.0011082608,0.0012542605,0.0023912007,0.0030832933,0.0037008915,0.0023730563,0.0018172459,0.028168987],"category_scores_gemma":[0.01107332,0.00088138774,0.001473435,0.0017090124,0.0032114738,0.009422531,0.004109098,0.004397469,0.0026904664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034803202,0.00014424653,0.0004364155,0.000090859314,0.000017272556,0.00023325534,0.00029591707,0.0035731692,0.010861786,0.95102507,0.00359057,0.029383557],"study_design_scores_gemma":[0.000021973474,0.00004355061,0.00023658025,0.000021692595,0.000020282334,0.00016575182,0.000112115966,0.009116168,0.0064671123,0.9788261,0.00494094,0.000027805962],"about_ca_topic_score_codex":0.0007630428,"about_ca_topic_score_gemma":0.0009938754,"teacher_disagreement_score":0.028168987,"about_ca_system_score_codex":0.001005778,"about_ca_system_score_gemma":0.00054327026,"threshold_uncertainty_score":0.094234586},"labels":[],"label_agreement":null},{"id":"W2062741368","doi":"10.1016/j.disc.2004.04.036","title":"Ovals and hyperovals in nets","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Corollary; Combinatorics; Order (exchange); Integer (computer science); Net (polyhedron); Latin square; Set (abstract data type); Discrete mathematics; Finite set; Geometry; Computer science","score_opus":0.007665902235596891,"score_gpt":0.2060537377521739,"score_spread":0.19838783551657702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062741368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24669239,0.0024614178,0.6413616,0.0025908973,0.00078172167,0.00013045211,0.0006070566,0.0006258937,0.104748584],"genre_scores_gemma":[0.8292576,0.0019932436,0.11857936,0.0005158017,0.0004663597,0.000161483,0.00051892345,0.0002583951,0.04824881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999302,0.0002542949,0.000055996123,0.00014068875,0.00012601352,0.00012100181],"domain_scores_gemma":[0.99686795,0.001675256,0.00036894117,0.00021998005,0.0003158383,0.0005519434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011356998,0.0005857395,0.0007710654,0.0023962178,0.0023741426,0.0049273223,0.00077681657,0.0010930935,0.008412412],"category_scores_gemma":[0.004290293,0.0007375804,0.00070379034,0.0021003515,0.0034912277,0.0058860946,0.0024275444,0.0018550607,0.00092115405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031341704,0.000007686213,0.00020019046,0.000024093255,0.0000032427622,0.000059032172,0.00014255824,0.0015902256,0.000267477,0.9927563,0.0007105871,0.0042072837],"study_design_scores_gemma":[0.000010830917,0.00000953378,0.00010670217,0.000026600957,0.000008541666,0.00007428914,0.00018318882,0.0064773965,0.00036639298,0.9863485,0.0063805566,0.000007417633],"about_ca_topic_score_codex":0.001943372,"about_ca_topic_score_gemma":0.0027608566,"teacher_disagreement_score":0.008412412,"about_ca_system_score_codex":0.00140534,"about_ca_system_score_gemma":0.00058931357,"threshold_uncertainty_score":0.028142333},"labels":[],"label_agreement":null},{"id":"W2062888049","doi":"10.1016/s0012-365x(02)00609-x","title":"Maximal arcs in Steiner systems S(2,4,v)","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Combinatorics; Arc (geometry); Steiner system; Block (permutation group theory); Discrete mathematics; Point (geometry); Set (abstract data type); Zero (linguistics); Construct (python library); Geometry; Computer science","score_opus":0.009829290237370867,"score_gpt":0.19804312760531687,"score_spread":0.188213837367946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062888049","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83319765,0.00047404447,0.10173081,0.00096719124,0.000086098255,0.00010196036,0.0012599006,0.00046663522,0.06171569],"genre_scores_gemma":[0.9565739,0.00023659445,0.029560126,0.00011657071,0.000026347352,0.00006860123,0.0008056184,0.00008762407,0.0125246225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995153,0.00014879699,0.000039778064,0.00008869353,0.00009229988,0.000115055554],"domain_scores_gemma":[0.99864167,0.0007116712,0.00024704073,0.00010161125,0.00011506214,0.0001828528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043425593,0.00049580645,0.0005513171,0.0013871461,0.0018794618,0.0024384463,0.0006188157,0.0011661696,0.0098641245],"category_scores_gemma":[0.0022890465,0.00060958375,0.0004449191,0.0018988756,0.0011753628,0.0018229072,0.001202968,0.0010436091,0.00095785275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004856131,0.00007587717,0.0030953188,0.00024714033,0.000071078524,0.00065060536,0.0008798338,0.034629878,0.007949732,0.91537046,0.00782889,0.028715631],"study_design_scores_gemma":[0.00008449499,0.000087794644,0.0017437361,0.00005993198,0.000048237325,0.0006007779,0.0007616587,0.05323834,0.005337336,0.93051124,0.0074995263,0.00002701743],"about_ca_topic_score_codex":0.00111306,"about_ca_topic_score_gemma":0.00225062,"teacher_disagreement_score":0.0098641245,"about_ca_system_score_codex":0.0010040044,"about_ca_system_score_gemma":0.00078060065,"threshold_uncertainty_score":0.0329988},"labels":[],"label_agreement":null},{"id":"W2063519616","doi":"10.1016/j.disc.2011.06.033","title":"How to play Reverse Hex","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Educational Games and Gamification","field":"Psychology","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Mathematics; Combinatorics; Discrete mathematics; Arithmetic","score_opus":0.06746740577934818,"score_gpt":0.3244433510782647,"score_spread":0.25697594529891654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063519616","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029233892,0.00007635945,0.70906025,0.0012794312,0.00071804866,0.0008826378,0.0014904282,0.011171817,0.24608712],"genre_scores_gemma":[0.21879211,0.00017620731,0.58514297,0.0006167843,0.000035144465,0.0012049533,0.0017950097,0.0021680042,0.19006886],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971527,0.00005970858,0.000018269473,0.00006091887,0.0000835741,0.00006226006],"domain_scores_gemma":[0.99960893,0.00012141934,0.000013085867,0.000095003226,0.000106748186,0.000054735603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038915212,0.0009777262,0.00049039087,0.0002588444,0.00056588487,0.0013503496,0.0007885668,0.00093600096,0.11722504],"category_scores_gemma":[0.0017520398,0.00037187914,0.0005350857,0.00014461367,0.00059969985,0.0019619965,0.0014882145,0.0008844092,0.029747168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019178184,0.00047249853,0.0021917375,0.0006227154,0.00005661961,0.0006977487,0.0015777696,0.01448609,0.033906873,0.20435715,0.09815,0.64156294],"study_design_scores_gemma":[0.0006701813,0.0004143972,0.0015794047,0.00039353073,0.000076033626,0.0009729451,0.0021230846,0.1841461,0.05475568,0.18356381,0.57115394,0.00015083358],"about_ca_topic_score_codex":0.0018031552,"about_ca_topic_score_gemma":0.0027079827,"teacher_disagreement_score":0.11722504,"about_ca_system_score_codex":0.00023776447,"about_ca_system_score_gemma":0.00070188806,"threshold_uncertainty_score":0.39215684},"labels":[],"label_agreement":null},{"id":"W2063549704","doi":"10.1016/s0012-365x(99)00144-2","title":"Exponents of 2-regular digraphs","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Digraph; Combinatorics; Mathematics; Vertex (graph theory); Conjecture; Exponent; Integer (computer science); Discrete mathematics; Graph","score_opus":0.05237147473006117,"score_gpt":0.33351579602623466,"score_spread":0.2811443212961735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063549704","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.855101,0.0012289806,0.04547552,0.002057281,0.0004969951,0.000090588714,0.0005789291,0.00036793493,0.09460272],"genre_scores_gemma":[0.9720625,0.0006057513,0.00570027,0.00028543457,0.00037709536,0.00006985828,0.00031151265,0.000106900756,0.020480681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943453,0.00013121137,0.00004222688,0.00011236621,0.0001385077,0.00014114958],"domain_scores_gemma":[0.9970349,0.001608419,0.00038338744,0.00015415301,0.00021114755,0.0006079295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080406485,0.0009919533,0.0011825743,0.0035137301,0.001986817,0.0040432145,0.00091126165,0.0008848183,0.008331475],"category_scores_gemma":[0.003648305,0.0007865836,0.0006631077,0.0015356905,0.002610793,0.0051132296,0.0021712966,0.0024156545,0.00088252476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012089731,0.00003525295,0.00051805633,0.000053528165,0.000011822073,0.00033593926,0.0005603467,0.00077007007,0.0015168859,0.9913259,0.0012765252,0.003474762],"study_design_scores_gemma":[0.000087090804,0.000037398004,0.00071392837,0.000029622792,0.000016745675,0.00026173767,0.0002309461,0.004256269,0.00074091385,0.9898346,0.0037687889,0.000021967127],"about_ca_topic_score_codex":0.00069048157,"about_ca_topic_score_gemma":0.00095466676,"teacher_disagreement_score":0.008331475,"about_ca_system_score_codex":0.0014817887,"about_ca_system_score_gemma":0.00037387438,"threshold_uncertainty_score":0.02787155},"labels":[],"label_agreement":null},{"id":"W2064592298","doi":"10.1016/s0012-365x(02)00319-9","title":"Enumeration of Cayley graphs and digraphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Université du Québec à Montréal; University of Regina","funders":"","keywords":"Cayley graph; Combinatorics; Mathematics; Enumeration; Circulant matrix; Symmetric group; Abelian group; Cayley transform; Cayley's theorem; Graph; Voltage graph; Line graph","score_opus":0.0738408948285501,"score_gpt":0.31466088664430447,"score_spread":0.24081999181575436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064592298","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47344935,0.0030044627,0.3189811,0.0030950757,0.0005008692,0.00015702196,0.0025410533,0.00079805584,0.19747296],"genre_scores_gemma":[0.82138705,0.0021638093,0.119681545,0.00066083524,0.00020513033,0.00014955194,0.0041387985,0.00020278807,0.05141049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947745,0.00015725978,0.000039093833,0.00012569258,0.00012147008,0.00007907737],"domain_scores_gemma":[0.99798405,0.0009361936,0.00019980197,0.00031514457,0.00031040754,0.00025442036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040707435,0.0005935752,0.0006644866,0.0020114493,0.0015813073,0.0037291257,0.001309638,0.0009258448,0.008716063],"category_scores_gemma":[0.0030603223,0.00055062736,0.0005523955,0.0036854094,0.0011748625,0.0039633694,0.0012852185,0.0018153777,0.0010659823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000335897,0.000033047876,0.0005457052,0.00007886097,0.000010719849,0.0000489173,0.00018142805,0.0015719741,0.00085889717,0.9721172,0.0036372954,0.020882381],"study_design_scores_gemma":[0.000009804249,0.000006267327,0.00020469747,0.000019213994,0.0000088073,0.00006765591,0.00010555288,0.004687818,0.00055350125,0.98721284,0.007117811,0.000006064927],"about_ca_topic_score_codex":0.0020556345,"about_ca_topic_score_gemma":0.0048060496,"teacher_disagreement_score":0.008716063,"about_ca_system_score_codex":0.001419699,"about_ca_system_score_gemma":0.00094091106,"threshold_uncertainty_score":0.029158175},"labels":[],"label_agreement":null},{"id":"W2064645351","doi":"10.1016/j.disc.2010.10.005","title":"Strongly regular graphs with non-trivial automorphisms","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Automorphism; Combinatorics; Prime (order theory); Automorphism group; Strongly regular graph; Discrete mathematics; Two-graph; Order (exchange); Pathwidth; Graph; Line graph","score_opus":0.026020517956813226,"score_gpt":0.3024070351341039,"score_spread":0.2763865171772907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064645351","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75288004,0.00031427355,0.15923218,0.0022698662,0.00027169203,0.00010680872,0.00049937627,0.0009000636,0.08352578],"genre_scores_gemma":[0.97258526,0.00018956333,0.012431839,0.00025225925,0.00014079548,0.00007621817,0.00039236728,0.00012347502,0.0138081955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855214,0.000402931,0.00007283732,0.0004691109,0.00026297354,0.00024004579],"domain_scores_gemma":[0.9935573,0.0029887524,0.0007074336,0.0014768584,0.0005475759,0.00072208093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009748872,0.00090163486,0.001186558,0.001307556,0.0020667296,0.0024905032,0.0011688343,0.0013790586,0.0054892455],"category_scores_gemma":[0.0045937262,0.00088167086,0.0012269125,0.0010372926,0.0041408073,0.0057133674,0.0025835396,0.0028703583,0.00094291597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011216588,0.0000384531,0.0006471546,0.00004943856,0.000019579333,0.00020591858,0.00038884103,0.0009124472,0.0025420557,0.99079,0.00089949986,0.003394449],"study_design_scores_gemma":[0.00003349667,0.000027619722,0.000328619,0.000007659582,0.000024362676,0.0002594951,0.00014684506,0.0030916978,0.0015141702,0.9930068,0.0015478435,0.00001140342],"about_ca_topic_score_codex":0.00050943106,"about_ca_topic_score_gemma":0.0006354873,"teacher_disagreement_score":0.0054892455,"about_ca_system_score_codex":0.00077707827,"about_ca_system_score_gemma":0.000564998,"threshold_uncertainty_score":0.018363416},"labels":[],"label_agreement":null},{"id":"W2064696340","doi":"10.1016/j.disc.2011.08.022","title":"List monopolar partitions of claw-free graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Partition (number theory); Disjoint sets; Graph; Discrete mathematics; Claw","score_opus":0.05239536688332093,"score_gpt":0.29177298737165336,"score_spread":0.23937762048833244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064696340","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8305345,0.00059732585,0.08123893,0.0011687763,0.00019698034,0.00014548916,0.0014421062,0.00070688594,0.083969004],"genre_scores_gemma":[0.93542427,0.0003531513,0.023046285,0.0005939363,0.00015779435,0.00018569238,0.0025027555,0.000353345,0.03738278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993563,0.00012159176,0.000041942476,0.00011223179,0.0001565396,0.00021141545],"domain_scores_gemma":[0.9976826,0.0008948931,0.00031530453,0.00030480145,0.00033296476,0.0004693537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048156775,0.00052533066,0.00071543595,0.003245365,0.0032172196,0.0040764147,0.0017145926,0.0015994239,0.018428294],"category_scores_gemma":[0.0025355297,0.00066919863,0.0006202077,0.0023956513,0.0014951947,0.0035879146,0.0021028374,0.0014387416,0.0026551925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041830333,0.000097274904,0.00092980854,0.0001546275,0.000026882588,0.00028756942,0.0009634735,0.0023166935,0.008386013,0.9620272,0.0071375184,0.01725452],"study_design_scores_gemma":[0.000080577665,0.00005013804,0.0008608137,0.00004588577,0.00003386523,0.00023873738,0.000569757,0.008234857,0.0030304936,0.979882,0.0069385,0.00003437351],"about_ca_topic_score_codex":0.0010441273,"about_ca_topic_score_gemma":0.0025061546,"teacher_disagreement_score":0.018428294,"about_ca_system_score_codex":0.0010227789,"about_ca_system_score_gemma":0.0005471958,"threshold_uncertainty_score":0.061648786},"labels":[],"label_agreement":null},{"id":"W2064783977","doi":"10.1016/j.disc.2008.05.040","title":"Maximum uniformly resolvable designs with block sizes 2 and 4","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Block (permutation group theory); Combinatorics; Block size; Pairwise comparison; Class (philosophy); Discrete mathematics; Resolution (logic); Block design; Combinatorial design; Statistics; Computer science","score_opus":0.01656889570623384,"score_gpt":0.1919247001294121,"score_spread":0.17535580442317825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064783977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1269928,0.0015508515,0.82471067,0.0017311701,0.00024155981,0.00035338083,0.0012609939,0.0014724793,0.041686203],"genre_scores_gemma":[0.59004384,0.00091217924,0.39234284,0.0011998526,0.00027072057,0.0011456971,0.0010659677,0.00028923288,0.012729706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99251854,0.0038983957,0.00042104642,0.0009407928,0.0013225555,0.0008986565],"domain_scores_gemma":[0.9791812,0.012219096,0.001737503,0.0047208206,0.001579796,0.0005616395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040998706,0.0020707282,0.0021280795,0.0015173359,0.0014068057,0.0025230893,0.0023794703,0.0030150267,0.008992888],"category_scores_gemma":[0.017044215,0.0016092714,0.0012741061,0.0016179279,0.0015380761,0.0030621614,0.0030727584,0.0021607988,0.0024560555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0040994533,0.00041815138,0.0017891816,0.0009936433,0.0003460674,0.00034132003,0.0006397057,0.10386119,0.07578305,0.6315702,0.009806852,0.17035119],"study_design_scores_gemma":[0.0012231339,0.0017105574,0.0012106785,0.0004656611,0.00026327296,0.00080438546,0.00018363085,0.24780087,0.06360209,0.6622089,0.020320289,0.00020654227],"about_ca_topic_score_codex":0.00052107597,"about_ca_topic_score_gemma":0.0012344862,"teacher_disagreement_score":0.008992888,"about_ca_system_score_codex":0.0014062439,"about_ca_system_score_gemma":0.002720459,"threshold_uncertainty_score":0.030084193},"labels":[],"label_agreement":null},{"id":"W2065396130","doi":"10.1016/j.disc.2012.05.023","title":"Obstructions to partitions of chordal graphs","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Chordal graph; Combinatorics; Discrete mathematics; Treewidth; Outerplanar graph; Indifference graph; Pathwidth; Graph; Line graph","score_opus":0.03427589843562042,"score_gpt":0.3221639786332235,"score_spread":0.2878880801976031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065396130","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81369144,0.00082198984,0.08666907,0.002773781,0.00052500976,0.00012906324,0.0004802993,0.00046337224,0.094445944],"genre_scores_gemma":[0.9694392,0.0005166346,0.009912864,0.00029257024,0.00034428335,0.00010691742,0.000532873,0.00023399436,0.018620545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981981,0.00034818772,0.00008839394,0.0002590304,0.0005531549,0.00055311486],"domain_scores_gemma":[0.9943639,0.002739695,0.00071080576,0.0005686061,0.0002770833,0.0013398739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001015571,0.0007359911,0.0012162003,0.0027443224,0.004365565,0.005467835,0.0018113529,0.0019465291,0.010242742],"category_scores_gemma":[0.0071746265,0.0010816776,0.0014576411,0.0021369339,0.005518889,0.0054839225,0.0074057407,0.00476811,0.0009781986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006876893,0.000027881726,0.0003562225,0.000032114294,0.0000075790417,0.00012918656,0.0005520985,0.0010678321,0.000671685,0.9941988,0.0009991465,0.0018886791],"study_design_scores_gemma":[0.000033768487,0.00001268137,0.00041749884,0.000013122709,0.000010854246,0.00009086641,0.0002846651,0.0026467377,0.00029426767,0.9936638,0.002519076,0.000012723067],"about_ca_topic_score_codex":0.0020967168,"about_ca_topic_score_gemma":0.003128078,"teacher_disagreement_score":0.010242742,"about_ca_system_score_codex":0.0020419932,"about_ca_system_score_gemma":0.0008123894,"threshold_uncertainty_score":0.03426534},"labels":[],"label_agreement":null},{"id":"W2065404513","doi":"10.1016/j.disc.2014.05.002","title":"A winning strategy for<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mn>3</mml:mn><mml:mo>×</mml:mo><mml:mi>n</mml:mi></mml:math>Cylindrical Hex","year":2014,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"London School of Economics and Political Science","keywords":"Mathematics; Scroll; Circumference; Combinatorics; Algorithm; Discrete mathematics; Geometry; Theology; Philosophy","score_opus":0.03323576613227676,"score_gpt":0.27800724431614376,"score_spread":0.24477147818386702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065404513","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08571437,0.0005020921,0.33163658,0.007782146,0.00091960246,0.0006372325,0.0027551595,0.0023356793,0.56771713],"genre_scores_gemma":[0.6601476,0.0006951562,0.11524563,0.0013470721,0.00017661156,0.00055964926,0.0031742656,0.0011536406,0.21750033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982912,0.00033917496,0.00011274326,0.00035959747,0.000360482,0.0005368805],"domain_scores_gemma":[0.9987569,0.0005045539,0.000049019865,0.00011905951,0.00025001957,0.00032038306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001189003,0.0016716078,0.0011655428,0.0013119477,0.0034987675,0.0051380266,0.0019973589,0.003920097,0.04776679],"category_scores_gemma":[0.0034822063,0.0006126121,0.0017125754,0.00083265646,0.0019509809,0.0047522425,0.0039662994,0.0023295747,0.011625003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003373506,0.00014790091,0.00060093385,0.00028739535,0.000113051756,0.00048341264,0.00055711076,0.002799933,0.004819863,0.92277217,0.043243375,0.02383744],"study_design_scores_gemma":[0.00020425666,0.0001982913,0.0005707016,0.00014890972,0.00008578529,0.00047093577,0.00087715086,0.02532635,0.0068553924,0.906611,0.058577225,0.00007403205],"about_ca_topic_score_codex":0.0033418522,"about_ca_topic_score_gemma":0.0065350253,"teacher_disagreement_score":0.04776679,"about_ca_system_score_codex":0.002152146,"about_ca_system_score_gemma":0.002324446,"threshold_uncertainty_score":0.15979576},"labels":[],"label_agreement":null},{"id":"W2066380283","doi":"10.1016/s0012-365x(99)00354-4","title":"Embedding trees into graphs of large girth","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Girth (graph theory); Conjecture; Embedding; Discrete mathematics; Graph; Tree (set theory); Degree (music); Computer science","score_opus":0.015694521293340452,"score_gpt":0.3198006587394579,"score_spread":0.3041061374461175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066380283","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5359748,0.0015918562,0.43150774,0.0017389206,0.00024196997,0.000099650075,0.00051979447,0.0011362584,0.027189018],"genre_scores_gemma":[0.8803445,0.0018125159,0.10182192,0.00042048132,0.00023362233,0.00011267692,0.0005960535,0.00074566546,0.013912641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996357,0.00011104376,0.000016760223,0.00009558311,0.00008745766,0.000053369746],"domain_scores_gemma":[0.9962452,0.0022914421,0.0004084421,0.00049034227,0.00022074117,0.00034382122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032941575,0.00060830376,0.0005635668,0.0013321013,0.00060699374,0.001870376,0.00083780417,0.0011165214,0.004964016],"category_scores_gemma":[0.0041760723,0.00090257224,0.00047614676,0.0014746962,0.0012391489,0.0045233658,0.0024269419,0.0025242404,0.001071936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020082157,0.00009851342,0.0012861304,0.00025226988,0.000033949193,0.00029578654,0.0010427203,0.021833638,0.018182624,0.9008542,0.004363295,0.051556163],"study_design_scores_gemma":[0.000019637975,0.000045894965,0.0005839055,0.000030483725,0.000025746953,0.00023851029,0.00019178608,0.031548463,0.002779356,0.95864666,0.0058759316,0.000013581426],"about_ca_topic_score_codex":0.00023192202,"about_ca_topic_score_gemma":0.00052490423,"teacher_disagreement_score":0.004964016,"about_ca_system_score_codex":0.00043132302,"about_ca_system_score_gemma":0.00021749485,"threshold_uncertainty_score":0.01660633},"labels":[],"label_agreement":null},{"id":"W2066393114","doi":"10.1016/j.disc.2011.02.022","title":"Structure of 4-connected claw-free graphs not containing a subdivision of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>","year":2011,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Subdivision; Mathematics; Scroll; Combinatorics; Discrete mathematics","score_opus":0.025372589599595936,"score_gpt":0.25995595225731705,"score_spread":0.23458336265772112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066393114","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84444064,0.00042589064,0.05361523,0.0008481996,0.00010765655,0.00018651407,0.0036790075,0.0008598215,0.095837034],"genre_scores_gemma":[0.9276076,0.00019955389,0.021532843,0.00028231714,0.000046182835,0.00016603454,0.008622447,0.00021282509,0.04133017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997836,0.000031811906,0.000016592363,0.00006445226,0.00004832175,0.00005536118],"domain_scores_gemma":[0.9984921,0.00042037337,0.00035191642,0.00021398097,0.00026423653,0.00025730958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018763651,0.0005157435,0.0003843463,0.0019452575,0.0014797265,0.0015493222,0.001386058,0.0010744971,0.021388117],"category_scores_gemma":[0.0011557819,0.00048234966,0.0005073923,0.0013123194,0.0012846023,0.0016748266,0.0013192985,0.0010000966,0.00320166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063181913,0.00016596689,0.0038372546,0.00033203114,0.00005842444,0.0015784238,0.0017678908,0.007926628,0.018882625,0.9210498,0.013557572,0.030211518],"study_design_scores_gemma":[0.00013956668,0.00012312712,0.0065283147,0.0001112974,0.000074705655,0.0009766992,0.0008507847,0.020064844,0.009737444,0.9353423,0.025988206,0.00006269584],"about_ca_topic_score_codex":0.0024966826,"about_ca_topic_score_gemma":0.0032022733,"teacher_disagreement_score":0.021388117,"about_ca_system_score_codex":0.0007718987,"about_ca_system_score_gemma":0.00063499756,"threshold_uncertainty_score":0.07155037},"labels":[],"label_agreement":null},{"id":"W2066586325","doi":"10.1016/j.disc.2007.03.083","title":"The structure of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si23.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:math>-subdivision-free toroidal graphs","year":2007,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Vertex (graph theory); Toroid; Torus; Discrete mathematics; Graph; Geometry; Physics","score_opus":0.016993430092239498,"score_gpt":0.25766892586190454,"score_spread":0.24067549576966504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066586325","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037613357,0.00064247503,0.2039901,0.0064288084,0.003904056,0.00045201957,0.1569883,0.06149169,0.5623413],"genre_scores_gemma":[0.043333445,0.0020493236,0.113015175,0.0024617084,0.0014639571,0.00079128845,0.23745102,0.053515516,0.5459186],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995565,0.00007787448,0.000052482028,0.00009943223,0.00014884243,0.00006498737],"domain_scores_gemma":[0.9974911,0.0007268201,0.00015971267,0.0006349633,0.00078904757,0.00019829077],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006792442,0.00094905525,0.00096259906,0.0023888166,0.0012987062,0.004560465,0.001925454,0.0012939582,0.44102642],"category_scores_gemma":[0.004632736,0.0009320355,0.00069238525,0.0049192486,0.000816372,0.005396427,0.0017855936,0.002694737,0.29401326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011209615,0.000061336454,0.00020577938,0.00030369038,0.000008186411,0.000086035914,0.0002691089,0.00066477223,0.0021510099,0.107702665,0.831451,0.056984406],"study_design_scores_gemma":[0.000033077402,0.000016034222,0.00042764333,0.00006526157,0.00000654625,0.0001173179,0.000082114595,0.0018312209,0.0025194313,0.04117373,0.9536897,0.0000379624],"about_ca_topic_score_codex":0.007948583,"about_ca_topic_score_gemma":0.006364421,"teacher_disagreement_score":0.44102642,"about_ca_system_score_codex":0.0020301214,"about_ca_system_score_gemma":0.0019395365,"threshold_uncertainty_score":0.79730797},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.01435913185574652,"score_gpt":0.22230911527552924,"score_spread":0.2079499834197827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066705994","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6891646,0.0061213076,0.240156,0.009878978,0.00039426395,0.00007258384,0.0013420279,0.0002359542,0.052634284],"genre_scores_gemma":[0.95704514,0.0018897805,0.033075087,0.0006578015,0.00056284934,0.00010629944,0.00062149606,0.00012031482,0.0059213038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99700063,0.0013195872,0.00017522484,0.000611836,0.0005284944,0.00036424547],"domain_scores_gemma":[0.974637,0.017296474,0.0023281344,0.0018785156,0.0012695069,0.00259033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040193712,0.0011469623,0.0020403932,0.0038405953,0.0033374464,0.006688658,0.0028460734,0.0022467193,0.005300107],"category_scores_gemma":[0.016700545,0.0013859873,0.0012704005,0.0048793615,0.008770631,0.019733172,0.006937521,0.005422974,0.0004192854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067340676,0.000021188675,0.0007487844,0.0000494942,0.00001312513,0.0000227193,0.00029854543,0.0015285095,0.00019979765,0.9929367,0.0010182728,0.00309544],"study_design_scores_gemma":[0.000013790769,0.00001844378,0.00050403905,0.000019717605,0.000013938568,0.000060820403,0.00013407,0.007222409,0.00015115456,0.9903274,0.0015163202,0.000017953596],"about_ca_topic_score_codex":0.0017775581,"about_ca_topic_score_gemma":0.0014914747,"teacher_disagreement_score":0.006688658,"about_ca_system_score_codex":0.0027946052,"about_ca_system_score_gemma":0.0010253731,"threshold_uncertainty_score":0.021256685},"labels":[],"label_agreement":null},{"id":"W2066869105","doi":"10.1016/j.disc.2010.03.013","title":"Ultracritical and hypercritical binary structures","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Combinatorics; Digraph; Mathematics; Vertex (graph theory); Binary number; Discrete mathematics; Arithmetic; Graph","score_opus":0.016442633351885966,"score_gpt":0.31152094399518226,"score_spread":0.2950783106432963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066869105","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74353206,0.0018604259,0.0542278,0.00519239,0.00042884084,0.000069200905,0.00039151125,0.00023415811,0.1940637],"genre_scores_gemma":[0.9792813,0.00048446617,0.0049723675,0.0004999325,0.00044227662,0.000055109576,0.00020423035,0.000057005484,0.014003222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954885,0.0001006977,0.00001662052,0.00006723682,0.00014899965,0.00011764203],"domain_scores_gemma":[0.99709237,0.0012864098,0.00038861038,0.0002279243,0.00043463483,0.00056999916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064814964,0.00041088986,0.0006078708,0.0033047807,0.0029075146,0.003612713,0.00097319647,0.001349072,0.007981143],"category_scores_gemma":[0.0062374747,0.00046237386,0.00032801463,0.0013211922,0.003937907,0.003761059,0.0021617778,0.0029267084,0.0004927675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019683157,0.000008616116,0.00017027103,0.000010435149,0.0000015108787,0.000028072289,0.000099444456,0.00021733803,0.0002059816,0.9976478,0.0006811724,0.00090966624],"study_design_scores_gemma":[0.000008518534,0.0000034698483,0.00022113787,0.0000075854396,0.0000025441404,0.000051158207,0.000087210974,0.0020262941,0.00018092865,0.9965005,0.0009059037,0.0000046883197],"about_ca_topic_score_codex":0.001513764,"about_ca_topic_score_gemma":0.0018707213,"teacher_disagreement_score":0.007981143,"about_ca_system_score_codex":0.0015434861,"about_ca_system_score_gemma":0.00076582225,"threshold_uncertainty_score":0.026699603},"labels":[],"label_agreement":null},{"id":"W2067133893","doi":"10.1016/j.disc.2004.03.020","title":"Minimum chromaticity of circulant graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Circulant matrix; Combinatorics; Mathematics; Circulant graph; Chromaticity; Chromatic scale; Discrete mathematics; Graph; Graph power; Line graph; Computer science; Artificial intelligence","score_opus":0.02417981242639211,"score_gpt":0.2962456602513835,"score_spread":0.2720658478249914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067133893","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8988854,0.0005311732,0.050236616,0.0019309503,0.00012077748,0.00008184373,0.0012397224,0.00040428742,0.046569224],"genre_scores_gemma":[0.9637596,0.00045258005,0.025166754,0.00034582298,0.00017635178,0.00011756696,0.0012666138,0.00029208703,0.008422666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989792,0.0002360137,0.00003593842,0.0002812441,0.00020831474,0.0002593587],"domain_scores_gemma":[0.991197,0.004709988,0.0009841002,0.0008368541,0.0010242795,0.0012476977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093151565,0.00085823186,0.0012830268,0.0024920532,0.003269304,0.005453248,0.0023682422,0.0019204646,0.010349962],"category_scores_gemma":[0.0073823067,0.0011472163,0.00069350173,0.0026734052,0.0026965416,0.0033658368,0.0014567703,0.0025299704,0.00077817315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009179665,0.00021640502,0.004442289,0.0004442655,0.00007400416,0.00023244739,0.0010994147,0.024927713,0.025587054,0.9054012,0.013573629,0.023083508],"study_design_scores_gemma":[0.0002102396,0.00009396266,0.0034596748,0.000077818186,0.000070410766,0.00028638757,0.0004748679,0.061404016,0.006376379,0.92227745,0.0052092075,0.00005946095],"about_ca_topic_score_codex":0.004805438,"about_ca_topic_score_gemma":0.009477817,"teacher_disagreement_score":0.010349962,"about_ca_system_score_codex":0.0032492094,"about_ca_system_score_gemma":0.0016633414,"threshold_uncertainty_score":0.03462404},"labels":[],"label_agreement":null},{"id":"W2067247085","doi":"10.1016/j.disc.2014.10.001","title":"Forbidden minors for graphs with no first obstruction to parametric Feynman integration","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Feynman diagram; Mathematics; Combinatorics; Planar graph; Parametric statistics; Discrete mathematics; Feynman integral; Graph; Mathematical physics","score_opus":0.017260534697099403,"score_gpt":0.23521452140082533,"score_spread":0.21795398670372593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067247085","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6171576,0.00020683554,0.32960957,0.0008661026,0.00019651662,0.00019138028,0.00043535337,0.00066231476,0.05067438],"genre_scores_gemma":[0.93712354,0.00015043265,0.040386647,0.00021390743,0.0000923614,0.0001959237,0.00042518854,0.0002464277,0.021165472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931955,0.00013428218,0.00004087832,0.00016708244,0.00015163593,0.00018659313],"domain_scores_gemma":[0.99732935,0.0011497348,0.0004735434,0.00037244995,0.00025077874,0.0004241271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007481285,0.0006759127,0.0007992519,0.0014166522,0.002390457,0.0023069265,0.0015926629,0.0013106894,0.0056935814],"category_scores_gemma":[0.003791616,0.0006925017,0.0011642283,0.0008310398,0.0020521658,0.0030829227,0.0021878215,0.0027322646,0.0008275282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009732618,0.00006229861,0.000468087,0.000033532855,0.000012443547,0.00019287737,0.000527319,0.0022463794,0.0029311962,0.9853131,0.0011718296,0.0069435993],"study_design_scores_gemma":[0.000026219102,0.000031346088,0.0003178546,0.0000110867995,0.000014107085,0.00019088495,0.0001698984,0.0130141275,0.001478149,0.9822817,0.0024470447,0.00001758336],"about_ca_topic_score_codex":0.0011885031,"about_ca_topic_score_gemma":0.0015120101,"teacher_disagreement_score":0.0056935814,"about_ca_system_score_codex":0.0011180264,"about_ca_system_score_gemma":0.0008375691,"threshold_uncertainty_score":0.019046962},"labels":[],"label_agreement":null},{"id":"W2067443412","doi":"10.1016/j.disc.2008.03.009","title":"Vertex arboricity of integer distance graph <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si11.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>G</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mi>D</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math>","year":2008,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Arboricity; Combinatorics; Vertex (graph theory); Mathematics; Graph; Integer (computer science); Discrete mathematics; Planar graph; Computer science","score_opus":0.021571592716490357,"score_gpt":0.2563671469383798,"score_spread":0.23479555422188944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067443412","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7492185,0.0005248546,0.11210903,0.0015192849,0.00012969776,0.00008147842,0.0040959576,0.0004988439,0.13182226],"genre_scores_gemma":[0.9562489,0.0004439052,0.022657791,0.00016999537,0.00008404305,0.00007246145,0.0029299117,0.00011768612,0.017275462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966705,0.00006113883,0.000018075674,0.00009852747,0.0000814975,0.000073658666],"domain_scores_gemma":[0.99805695,0.0008988536,0.00037150658,0.00014840768,0.00028318795,0.00024109261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023894166,0.0003147457,0.0002979539,0.0011979241,0.00084185984,0.001670216,0.00053824874,0.00042611116,0.010323202],"category_scores_gemma":[0.0023648601,0.00018884895,0.00025018104,0.0013393046,0.0006646807,0.0013929523,0.00054873206,0.0006725079,0.0014915932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062119064,0.00010113163,0.00943025,0.00039570927,0.000040196355,0.001025674,0.0007517339,0.024864279,0.009618914,0.87137043,0.020380925,0.06139952],"study_design_scores_gemma":[0.000083871055,0.00013864152,0.006112521,0.0000740956,0.00005385252,0.0014099568,0.0005959456,0.083166756,0.007449209,0.8760047,0.024872258,0.000038101196],"about_ca_topic_score_codex":0.0019403842,"about_ca_topic_score_gemma":0.001961414,"teacher_disagreement_score":0.010323202,"about_ca_system_score_codex":0.0007939583,"about_ca_system_score_gemma":0.00038380624,"threshold_uncertainty_score":0.034534514},"labels":[],"label_agreement":null},{"id":"W2069262458","doi":"10.1016/s0012-365x(02)00495-8","title":"On the monotonicity of the broadcast function","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Concordia University","funders":"","keywords":"Vertex (graph theory); Mathematics; Combinatorics; Conjecture; Monotonic function; Broadcasting (networking); Graph; Function (biology); Discrete mathematics; Computer science; Computer network","score_opus":0.024571823278013213,"score_gpt":0.2714664504881405,"score_spread":0.24689462721012728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069262458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2373815,0.0048583485,0.5160241,0.017468518,0.0007389437,0.00015718112,0.0011723178,0.00057563704,0.22162338],"genre_scores_gemma":[0.8730456,0.006257923,0.074708894,0.0031821674,0.0016529962,0.00039681612,0.0010070896,0.00092502154,0.03882349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966176,0.0014545871,0.00015769868,0.00047773807,0.0006895478,0.00060282194],"domain_scores_gemma":[0.9495077,0.040465966,0.0017472854,0.0028141716,0.0040573105,0.0014074971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056840065,0.0009287215,0.0022879012,0.0022646259,0.002880214,0.003953133,0.0027923337,0.0027693901,0.013543631],"category_scores_gemma":[0.041728027,0.0011510354,0.0017571562,0.0026296773,0.006399405,0.0162178,0.0035476207,0.0065644793,0.0020235647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020007388,0.00004935518,0.00056835293,0.00013707968,0.000016168264,0.00010447695,0.00035645074,0.0031386951,0.00158806,0.9771145,0.003855863,0.012870926],"study_design_scores_gemma":[0.00004580535,0.000047583082,0.0005802891,0.000065736895,0.000027041475,0.00031258631,0.00019613549,0.023870382,0.0010676071,0.96781844,0.0059428792,0.00002555118],"about_ca_topic_score_codex":0.0034958739,"about_ca_topic_score_gemma":0.0018153198,"teacher_disagreement_score":0.013543631,"about_ca_system_score_codex":0.002532831,"about_ca_system_score_gemma":0.0021888232,"threshold_uncertainty_score":0.045307994},"labels":[],"label_agreement":null},{"id":"W2069528460","doi":"10.1016/j.disc.2007.11.044","title":"List-edge and list-total colorings of graphs embedded on hyperbolic surfaces","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics; Euler's formula; Enhanced Data Rates for GSM Evolution; Computer science; Artificial intelligence","score_opus":0.03229358121360019,"score_gpt":0.28555978410736266,"score_spread":0.25326620289376245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069528460","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9250274,0.00018752937,0.047211662,0.0004800683,0.00009468317,0.00003624919,0.000679087,0.0003914756,0.02589181],"genre_scores_gemma":[0.9592102,0.0001962013,0.016002828,0.00017614698,0.00006963078,0.000046133344,0.00096366386,0.00032074176,0.023014337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996068,0.00006606151,0.000017564056,0.000078310586,0.00010062598,0.00013075715],"domain_scores_gemma":[0.996869,0.0011230389,0.0004281994,0.00041500782,0.00055359607,0.00061120006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039263626,0.0005734086,0.00046295428,0.0017188159,0.0016512743,0.0026874053,0.0013618966,0.00085527456,0.009085196],"category_scores_gemma":[0.0026367176,0.0006332938,0.00055721606,0.0015552347,0.0016877323,0.002201465,0.0012497832,0.0012762613,0.0008138399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004546822,0.00011276041,0.0059893206,0.00013632332,0.00003132489,0.00035406768,0.0013197897,0.020116882,0.010159439,0.9377921,0.0066793496,0.016853884],"study_design_scores_gemma":[0.00007194688,0.000059709233,0.0048569916,0.000039646085,0.000041778043,0.00025352804,0.0011026181,0.062033374,0.0048120846,0.92121404,0.005462514,0.000051710664],"about_ca_topic_score_codex":0.0046300697,"about_ca_topic_score_gemma":0.007613885,"teacher_disagreement_score":0.009085196,"about_ca_system_score_codex":0.0014186923,"about_ca_system_score_gemma":0.00069456454,"threshold_uncertainty_score":0.030393064},"labels":[],"label_agreement":null},{"id":"W2072209133","doi":"10.1016/j.disc.2004.10.026","title":"The recognition of bound quivers using edge-coloured homomorphisms","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bishop's University; Thompson Rivers University","funders":"","keywords":"Homomorphism; Digraph; Mathematics; Combinatorics; Upper and lower bounds; Quiver; Discrete mathematics; Directed graph; Enhanced Data Rates for GSM Evolution; Graph; Time complexity; Pure mathematics; Computer science; Artificial intelligence","score_opus":0.048571281772499336,"score_gpt":0.3108193656923948,"score_spread":0.2622480839198955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072209133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39235374,0.0004855105,0.56898814,0.0006192115,0.00047135935,0.0001292731,0.00044340926,0.0039596297,0.03254969],"genre_scores_gemma":[0.87950677,0.0002682519,0.102271795,0.0002908372,0.00009055474,0.0001027814,0.00101211,0.0007616462,0.015695252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987118,0.00024877506,0.00010304161,0.0003456332,0.00027680045,0.0003139891],"domain_scores_gemma":[0.9962717,0.0016369921,0.00022605024,0.001089873,0.0004040071,0.0003713563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007241033,0.0006767932,0.0012899454,0.0013939263,0.0017264754,0.005647114,0.0021969574,0.0021795544,0.00823067],"category_scores_gemma":[0.005167496,0.00093472743,0.0011011384,0.0014199297,0.0027039805,0.007609685,0.0038657333,0.0026695775,0.002262162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006310505,0.00027777467,0.0025321925,0.00023773879,0.00006183048,0.00049169705,0.0016851372,0.01723184,0.026081204,0.8307548,0.010729399,0.10928534],"study_design_scores_gemma":[0.000044311993,0.00008173122,0.00078310404,0.0000547202,0.000040006977,0.0002321083,0.00041648353,0.07964915,0.01821211,0.89107114,0.009336318,0.00007879791],"about_ca_topic_score_codex":0.0014049227,"about_ca_topic_score_gemma":0.0017405222,"teacher_disagreement_score":0.00823067,"about_ca_system_score_codex":0.00086351397,"about_ca_system_score_gemma":0.00047508336,"threshold_uncertainty_score":0.027534306},"labels":[],"label_agreement":null},{"id":"W2072270436","doi":"10.1016/j.disc.2010.01.003","title":"Generating self-complementary uniform hypergraphs","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Hypergraph; Mathematics; Combinatorics; Permutation (music); Isomorphism (crystallography); Order (exchange); Discrete mathematics; Expressive power; Representation (politics); Theoretical computer science; Computer science","score_opus":0.007141301343670306,"score_gpt":0.20805923246738756,"score_spread":0.20091793112371725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072270436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41246507,0.00033031244,0.5066419,0.0005380139,0.00020933215,0.000094446754,0.00030926167,0.00039475504,0.079016864],"genre_scores_gemma":[0.9044371,0.00032771612,0.056265924,0.00029059328,0.00017378335,0.00012905298,0.00035286284,0.00018582598,0.03783715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996191,0.00015372306,0.000011326124,0.000059801423,0.00010133407,0.000054752454],"domain_scores_gemma":[0.9969695,0.0018098465,0.00019935517,0.00036389593,0.0004265136,0.00023089419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005587318,0.0003180353,0.000391702,0.0011788821,0.0006358475,0.001083374,0.00067409896,0.0007110318,0.0070699756],"category_scores_gemma":[0.0034974758,0.00036520144,0.00038393488,0.00085025735,0.000777742,0.0015109573,0.0013668603,0.0008111271,0.00061783835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047680565,0.000039506984,0.00030405683,0.00004317623,0.000011266051,0.000111697416,0.00014105086,0.008478808,0.0043822215,0.97271335,0.001751561,0.011975696],"study_design_scores_gemma":[0.000031566666,0.000030760704,0.00034685488,0.000017194576,0.000013812106,0.00019663009,0.00009949868,0.09520985,0.0042765737,0.8959927,0.0037706993,0.0000138907435],"about_ca_topic_score_codex":0.00022410032,"about_ca_topic_score_gemma":0.00039104573,"teacher_disagreement_score":0.0070699756,"about_ca_system_score_codex":0.0005068743,"about_ca_system_score_gemma":0.0002794421,"threshold_uncertainty_score":0.023651421},"labels":[],"label_agreement":null},{"id":"W2072445778","doi":"10.1016/j.disc.2013.08.017","title":"The cluster deletion problem for cographs","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Combinatorics; Mathematics; Split graph; Time complexity; Partition (number theory); Cograph; Clique graph; Graph; Clique; Discrete mathematics; Chordal graph; Line graph; Graph power; 1-planar graph","score_opus":0.015411901310856943,"score_gpt":0.2459727440412529,"score_spread":0.23056084273039595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072445778","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4222078,0.0015341293,0.5217515,0.009879804,0.00040780596,0.00030136574,0.002696793,0.00096687226,0.040253982],"genre_scores_gemma":[0.7946183,0.0011463859,0.16986968,0.0010329628,0.00036844882,0.00033949246,0.005580591,0.00060075126,0.026443424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975412,0.0006230899,0.00013068112,0.00074354233,0.0004921418,0.00046935742],"domain_scores_gemma":[0.98635477,0.008274037,0.0009967778,0.0022228893,0.0011342791,0.0010171961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002026845,0.00087142753,0.002211979,0.0016196852,0.0045716786,0.0047172788,0.0051832153,0.0036628768,0.010199797],"category_scores_gemma":[0.015318959,0.00094723806,0.0014197959,0.003976043,0.003465602,0.011982486,0.004309148,0.004177383,0.0014126363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003921514,0.00014432608,0.002458249,0.0004673018,0.00006784074,0.0003443417,0.00076664315,0.049644377,0.002169814,0.8821141,0.02037685,0.041054048],"study_design_scores_gemma":[0.00006289046,0.000023268143,0.000614868,0.000042507334,0.000034418434,0.0003027241,0.00048829085,0.050958466,0.0017343645,0.9365043,0.009206318,0.000027561673],"about_ca_topic_score_codex":0.00503335,"about_ca_topic_score_gemma":0.004190623,"teacher_disagreement_score":0.010199797,"about_ca_system_score_codex":0.0030424919,"about_ca_system_score_gemma":0.002763682,"threshold_uncertainty_score":0.034121692},"labels":[],"label_agreement":null},{"id":"W2073055376","doi":"10.1016/s0012-365x(03)00277-2","title":"Some new orthogonal designs in orders 32 and 40","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Optimal Experimental Design Methods","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Combinatorics; Complement (music); Order (exchange); Orthogonal array; Resolution (logic); Discrete mathematics; Orthogonal complement; Statistics; Mathematical analysis; Computer science","score_opus":0.1952039077306143,"score_gpt":0.43652435207368806,"score_spread":0.24132044434307376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073055376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022639567,0.00060172996,0.9713488,0.00032095725,0.00029791973,0.0003236208,0.00016083033,0.00015943238,0.0041471506],"genre_scores_gemma":[0.119995445,0.0006527502,0.87192553,0.0004698773,0.0002527392,0.0015439844,0.00023065669,0.0001090725,0.0048200167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97963434,0.014317059,0.0010194583,0.0018893894,0.0024510834,0.0006885449],"domain_scores_gemma":[0.97336924,0.018758606,0.0016246893,0.0034106807,0.0021005853,0.00073621154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02771276,0.0015368595,0.002123644,0.0014885411,0.00092947925,0.0015462538,0.0017146408,0.0011964764,0.007342732],"category_scores_gemma":[0.033105616,0.0010713955,0.0018743684,0.001575173,0.002846593,0.002396488,0.0022740674,0.002040639,0.00066057686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0042499364,0.0007235955,0.0012419896,0.00086291233,0.00026932656,0.00009549206,0.0003941684,0.020933092,0.007845406,0.6483792,0.0032443434,0.31176054],"study_design_scores_gemma":[0.002288011,0.004054055,0.002185859,0.00028618795,0.00050972827,0.00021612874,0.00012660956,0.13767329,0.0121116815,0.81793565,0.022400226,0.00021250035],"about_ca_topic_score_codex":0.00037248392,"about_ca_topic_score_gemma":0.00079987856,"teacher_disagreement_score":0.02771276,"about_ca_system_score_codex":0.0012808742,"about_ca_system_score_gemma":0.0026682673,"threshold_uncertainty_score":0.14656085},"labels":[],"label_agreement":null},{"id":"W2073231246","doi":"10.1016/j.disc.2011.01.011","title":"Coding discretizations of continuous functions","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Discretization; Subsequence; Coding (social sciences); Sequence (biology); Limit (mathematics); Discrete mathematics; Applied mathematics; Algorithm; Mathematical analysis; Statistics","score_opus":0.0264572524158426,"score_gpt":0.2299051483951956,"score_spread":0.203447895979353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073231246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11439302,0.00071180984,0.8478844,0.0008424722,0.00029942428,0.000045265795,0.00046437257,0.00043477607,0.034924433],"genre_scores_gemma":[0.87285227,0.0006426694,0.10616867,0.00029314792,0.00018882738,0.00013283575,0.0006519952,0.00020637122,0.018863061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999158,0.00026522318,0.000053503918,0.00014678757,0.00027568275,0.00010074073],"domain_scores_gemma":[0.9966614,0.002016647,0.00014821884,0.0006143312,0.0003653909,0.00019404078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087646215,0.00039499768,0.00059301226,0.0010072778,0.0006074087,0.0019549346,0.0009768598,0.00085763336,0.006892927],"category_scores_gemma":[0.0049091126,0.0003480862,0.0008206263,0.0009383556,0.0021070873,0.0025953639,0.0012811951,0.002181589,0.0007056648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025563448,0.000010067431,0.00008773365,0.000025699506,0.0000044087337,0.000027301205,0.00013130836,0.008203702,0.0008445357,0.9835539,0.00061456836,0.006471227],"study_design_scores_gemma":[0.000015828993,0.000016865115,0.00010403717,0.000018213534,0.000005006511,0.000044696055,0.00006679557,0.07304927,0.0008068587,0.9235213,0.0023383175,0.000012838234],"about_ca_topic_score_codex":0.0015763382,"about_ca_topic_score_gemma":0.0013230774,"teacher_disagreement_score":0.006892927,"about_ca_system_score_codex":0.0013547854,"about_ca_system_score_gemma":0.000630036,"threshold_uncertainty_score":0.02305913},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Metric dimension; Cayley graph; Vertex (graph theory); Discrete mathematics; Connectivity; Graph; Line graph; Pathwidth","score_opus":0.008927144760715572,"score_gpt":0.2222670857452978,"score_spread":0.21333994098458223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073490544","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78528106,0.0042264713,0.14586121,0.0070824875,0.00035915922,0.00005119861,0.0017858292,0.0002480538,0.055104554],"genre_scores_gemma":[0.97007835,0.0018165858,0.019692754,0.00048446862,0.00041744811,0.00007912851,0.0008190165,0.00007676014,0.0065354756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907637,0.0003412065,0.000047736015,0.00020264536,0.00020893468,0.00012309513],"domain_scores_gemma":[0.99303776,0.0039864094,0.00090364425,0.0006019124,0.00049258623,0.000977813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011095518,0.0006935869,0.001020425,0.002586215,0.0019783652,0.004630624,0.0017884909,0.0015018507,0.003986643],"category_scores_gemma":[0.0069750855,0.0007507732,0.000557816,0.003275759,0.003242123,0.007876006,0.0021052884,0.0027988383,0.00034786476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044038665,0.000016215914,0.0008370375,0.00004834483,0.000013199623,0.000023156119,0.00017802743,0.0033962296,0.0004141979,0.9875288,0.002067884,0.0054327627],"study_design_scores_gemma":[0.000010201716,0.00000829623,0.00046591903,0.00001264901,0.000007898369,0.000041554402,0.00007680003,0.01126964,0.00020853468,0.98580015,0.002085335,0.000012901971],"about_ca_topic_score_codex":0.0020456265,"about_ca_topic_score_gemma":0.0019144525,"teacher_disagreement_score":0.004630624,"about_ca_system_score_codex":0.002278218,"about_ca_system_score_gemma":0.0007927246,"threshold_uncertainty_score":0.016529739},"labels":[],"label_agreement":null},{"id":"W2073783222","doi":"10.1016/j.disc.2003.11.027","title":"On the chromatic index of path decompositions","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Graph; Vertex (graph theory); Chromatic scale; Path (computing); Block (permutation group theory); Edge coloring; Windmill graph; Discrete mathematics; Graph power; Line graph; Computer science","score_opus":0.007012095072584522,"score_gpt":0.2003267415899903,"score_spread":0.1933146465174058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073783222","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71369183,0.0019168438,0.16485052,0.001992692,0.0003197053,0.000079194666,0.0009517278,0.00035402834,0.11584345],"genre_scores_gemma":[0.953521,0.00144553,0.02847847,0.00031470644,0.00036848287,0.00007880141,0.0006945395,0.0003482865,0.014750059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929404,0.00019303121,0.000024787507,0.00013376187,0.00018919243,0.00016520711],"domain_scores_gemma":[0.99151003,0.0052731056,0.0009416711,0.000649417,0.0007253954,0.00090037775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012847682,0.0007712829,0.000874469,0.0048928573,0.0019032874,0.0037713642,0.0014272403,0.0011950561,0.010131526],"category_scores_gemma":[0.008686413,0.0006904576,0.0004941862,0.003918267,0.003079037,0.0053463685,0.0017458451,0.0025774792,0.00079802476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025007912,0.000055337234,0.0018919524,0.00007886503,0.000022567212,0.00006926561,0.00044082667,0.018253507,0.0033920123,0.9536685,0.004885467,0.016991591],"study_design_scores_gemma":[0.000032435124,0.00003743492,0.0015172672,0.00005456107,0.00002798446,0.000097091026,0.00020570269,0.07331254,0.0010643515,0.91934997,0.004272649,0.000027969361],"about_ca_topic_score_codex":0.0035712097,"about_ca_topic_score_gemma":0.004250918,"teacher_disagreement_score":0.010131526,"about_ca_system_score_codex":0.0029045425,"about_ca_system_score_gemma":0.00080383004,"threshold_uncertainty_score":0.033893347},"labels":[],"label_agreement":null},{"id":"W2075048357","doi":"10.1016/j.disc.2013.04.013","title":"The inertia of distance matrices of some graphs","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Government of Shandong Province; National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Eigenvalues and eigenvectors; Inertia; Distance matrix; Graph; Discrete mathematics; Distance matrices in phylogeny; Matrix (chemical analysis)","score_opus":0.018403199891204293,"score_gpt":0.2777834953767149,"score_spread":0.25938029548551056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075048357","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6810011,0.0014464984,0.25980327,0.0024249256,0.00052100775,0.00007225516,0.00051797426,0.00024932,0.05396358],"genre_scores_gemma":[0.9691537,0.0007039008,0.016349897,0.00038131603,0.00085647235,0.00006700076,0.00033208184,0.00012866728,0.012026841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904114,0.00021444805,0.000055532506,0.00024421207,0.00028269537,0.00016193965],"domain_scores_gemma":[0.9949051,0.002300572,0.00094049127,0.00038837726,0.00047129238,0.0009941105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009141986,0.00074086594,0.0007863767,0.003072827,0.0011247767,0.0025942456,0.0013818232,0.0010477169,0.006526177],"category_scores_gemma":[0.005270461,0.00048415264,0.0006726477,0.0014083687,0.0032912677,0.0036146545,0.0016734981,0.0020460451,0.00062478014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048574322,0.000022229637,0.00034159623,0.000032684737,0.000008522689,0.0000781329,0.00040427817,0.001561396,0.0018135051,0.9901125,0.0009879185,0.004588765],"study_design_scores_gemma":[0.000024633528,0.00004802485,0.00082342234,0.000015772133,0.000011501302,0.00019001498,0.00016211774,0.016472155,0.00076378894,0.9783402,0.0031162766,0.000032090145],"about_ca_topic_score_codex":0.0010017467,"about_ca_topic_score_gemma":0.0007656698,"teacher_disagreement_score":0.006526177,"about_ca_system_score_codex":0.0009304127,"about_ca_system_score_gemma":0.00043962183,"threshold_uncertainty_score":0.021832228},"labels":[],"label_agreement":null},{"id":"W2075223139","doi":"10.1016/j.disc.2014.02.009","title":"A new look at an old construction: Constructing (simple) 3-designs from resolvable 2-designs","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Simple (philosophy); Combinatorics; Discrete mathematics; Arithmetic","score_opus":0.022443692911218813,"score_gpt":0.2276431449358064,"score_spread":0.2051994520245876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075223139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0263098,0.0010859104,0.9405404,0.0019721242,0.0006160911,0.00007312287,0.0001828411,0.0005680918,0.028651638],"genre_scores_gemma":[0.24793579,0.0015222329,0.72228533,0.0021096675,0.0004162224,0.00018703126,0.00026796537,0.0005551323,0.024720669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989556,0.00047958273,0.000045029068,0.00015201225,0.0002910448,0.000076753946],"domain_scores_gemma":[0.99782515,0.0009170473,0.00011883415,0.000765847,0.00026895347,0.00010420858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015610118,0.000727592,0.00073378684,0.0012095015,0.0012899861,0.0020734791,0.0011731029,0.001480719,0.009928653],"category_scores_gemma":[0.0039411383,0.0006065617,0.0011965004,0.0010223113,0.002999133,0.0053506764,0.002368694,0.0035941424,0.0028175602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088024695,0.00003462575,0.00020026448,0.00016159522,0.000023997552,0.00006930876,0.00036923046,0.0027030138,0.005404633,0.92604506,0.0031505649,0.061749615],"study_design_scores_gemma":[0.000026563748,0.00009886389,0.000093957504,0.00007910763,0.000016300872,0.00020379326,0.00010439858,0.005407307,0.0038831362,0.96142566,0.028616762,0.000044155633],"about_ca_topic_score_codex":0.00034623052,"about_ca_topic_score_gemma":0.00074568955,"teacher_disagreement_score":0.009928653,"about_ca_system_score_codex":0.0006560598,"about_ca_system_score_gemma":0.0007069969,"threshold_uncertainty_score":0.03321463},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018966663341195778,"score_gpt":0.2364626543621001,"score_spread":0.2174959910209043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075649093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03229604,0.002037098,0.927511,0.0016061676,0.0005786796,0.000133532,0.00018095571,0.00023296235,0.0354235],"genre_scores_gemma":[0.40164936,0.004525748,0.56484747,0.0009510584,0.0013120194,0.0006517385,0.00030851373,0.00019587317,0.025558185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867755,0.00063158275,0.00007428678,0.00017969593,0.00035327228,0.00008366087],"domain_scores_gemma":[0.9938433,0.003953041,0.0005711527,0.0007326651,0.00065367087,0.0002461475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017874159,0.00089121336,0.0008193257,0.002272654,0.0012410228,0.0032123437,0.0013462405,0.0018606182,0.0070897457],"category_scores_gemma":[0.009788048,0.0008910584,0.00090181053,0.0031225546,0.0031592248,0.002957284,0.0016200375,0.0026336336,0.0011600765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047981157,0.00003610617,0.00011808921,0.000082170794,0.00001162905,0.000050599825,0.00006411661,0.013640317,0.0012796989,0.9598591,0.0017208839,0.023089219],"study_design_scores_gemma":[0.000043174787,0.000045334036,0.00008586446,0.000035249857,0.000017734821,0.00014675572,0.00003396078,0.082497895,0.0007575283,0.9095948,0.0067113703,0.00003039589],"about_ca_topic_score_codex":0.0003271527,"about_ca_topic_score_gemma":0.0008128486,"teacher_disagreement_score":0.0070897457,"about_ca_system_score_codex":0.0012114131,"about_ca_system_score_gemma":0.0008573311,"threshold_uncertainty_score":0.023717523},"labels":[],"label_agreement":null},{"id":"W2076752886","doi":"10.1016/s0012-365x(02)00372-2","title":"No iterated morphism generates any Arshon sequence of odd order","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Morphism; Iterated function; Mathematics; Sequence (biology); Order (exchange); Combinatorics; Discrete mathematics","score_opus":0.03221271644476364,"score_gpt":0.24233306495041634,"score_spread":0.2101203485056527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076752886","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7853768,0.00047234583,0.11453921,0.00054770504,0.00056483084,0.000056629608,0.0002031666,0.00058927975,0.09765003],"genre_scores_gemma":[0.9343605,0.00034345328,0.025946412,0.00024219451,0.0001502855,0.000079266974,0.0003763424,0.00023601417,0.038265724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925,0.00010543034,0.00004986897,0.00019911649,0.00018124109,0.00021426717],"domain_scores_gemma":[0.99694747,0.001417965,0.00029198642,0.00039352043,0.0004912029,0.00045791396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007687682,0.00085988775,0.000821789,0.0013137319,0.002298233,0.002446023,0.0008747635,0.0010625098,0.0065045194],"category_scores_gemma":[0.0020758938,0.00042836257,0.001032112,0.000611241,0.0022036615,0.0034820738,0.0021125646,0.0019398569,0.0014901338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040789624,0.00010574958,0.0022111046,0.00011529961,0.00003264355,0.00076985586,0.0010248341,0.00074090133,0.014555589,0.9615288,0.0012006367,0.01730664],"study_design_scores_gemma":[0.000048576323,0.00015220598,0.0011819553,0.00004094385,0.000047208257,0.00084764714,0.00046764803,0.0046125613,0.013876266,0.96611285,0.012559263,0.000052731513],"about_ca_topic_score_codex":0.0005218755,"about_ca_topic_score_gemma":0.0007482077,"teacher_disagreement_score":0.0065045194,"about_ca_system_score_codex":0.0008667289,"about_ca_system_score_gemma":0.00068299414,"threshold_uncertainty_score":0.021759748},"labels":[],"label_agreement":null},{"id":"W2076955343","doi":"10.1016/j.disc.2013.07.018","title":"List-homomorphism problems on graphs and arc consistency","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Homomorphism; Mathematics; Semilattice; Combinatorics; Bipartite graph; Discrete mathematics; Graph homomorphism; Consistency (knowledge bases); Idempotence; Arc (geometry); Graph; Line graph; Voltage graph","score_opus":0.02610413603892978,"score_gpt":0.267608695764183,"score_spread":0.24150455972525323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076955343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21869113,0.0025844343,0.68274313,0.020983983,0.00064106676,0.00024171062,0.0018184988,0.0010295607,0.07126654],"genre_scores_gemma":[0.8166083,0.0028200722,0.13781689,0.0020513507,0.0012396934,0.0004430928,0.0024252764,0.00067572354,0.035919636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970757,0.0012645615,0.000159581,0.00060508744,0.0005344517,0.00036070705],"domain_scores_gemma":[0.9755164,0.01899588,0.0012520412,0.0020505674,0.001130132,0.0010550728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004312171,0.00091736193,0.0022679286,0.0019881213,0.003804391,0.0062278435,0.005820015,0.0048273844,0.01824675],"category_scores_gemma":[0.027795017,0.001390942,0.001883279,0.0063973316,0.0048262784,0.025652824,0.0053522983,0.0085948985,0.0013212073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007908126,0.00006190985,0.0003321669,0.000112554495,0.00001807915,0.00006324082,0.00028877193,0.0039392062,0.00021597101,0.9821047,0.003530923,0.009253352],"study_design_scores_gemma":[0.000029273166,0.000007718232,0.000060231847,0.00001302092,0.00001206466,0.000049237216,0.00011021143,0.0058626067,0.00022073304,0.99256974,0.0010567602,0.000008473763],"about_ca_topic_score_codex":0.0017373783,"about_ca_topic_score_gemma":0.0011334422,"teacher_disagreement_score":0.01824675,"about_ca_system_score_codex":0.0022915145,"about_ca_system_score_gemma":0.0019535394,"threshold_uncertainty_score":0.061041415},"labels":[],"label_agreement":null},{"id":"W2077159664","doi":"10.1016/j.disc.2010.03.034","title":"The complexity of locally injective homomorphisms","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vancouver Island University; University of Victoria","funders":"","keywords":"Injective function; Digraph; Homomorphism; Mathematics; Combinatorics; Tournament; Vertex (graph theory); Discrete mathematics; Antichain; Graph; Partially ordered set","score_opus":0.037456553879670465,"score_gpt":0.30552801845569166,"score_spread":0.2680714645760212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077159664","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.787567,0.0029402436,0.10497082,0.014264993,0.0002592704,0.00007495754,0.0015404532,0.00043635766,0.08794585],"genre_scores_gemma":[0.98025584,0.0011195315,0.0071089505,0.00038762725,0.0005403343,0.00009348064,0.0007376734,0.00011640546,0.00964012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964457,0.0009282178,0.0001679493,0.00066253915,0.0012228043,0.00057286216],"domain_scores_gemma":[0.9691686,0.024959732,0.00141563,0.0019558053,0.0009776545,0.0015225443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022847024,0.00086443074,0.0019151241,0.002672213,0.002357863,0.0083945,0.00344118,0.0024443227,0.011941858],"category_scores_gemma":[0.015613228,0.0010558708,0.0014164675,0.0032005874,0.006350029,0.027413767,0.0049911374,0.0067093363,0.0009197688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001811634,0.00008038786,0.0017859157,0.00012824156,0.000039452596,0.00011072924,0.000761902,0.005917915,0.00079691457,0.9791973,0.002435156,0.008564848],"study_design_scores_gemma":[0.000024757433,0.000012448357,0.0005147504,0.00000983436,0.000016703874,0.00007441322,0.00010362166,0.009158597,0.0003287504,0.9889159,0.0008242941,0.000015879565],"about_ca_topic_score_codex":0.0017265782,"about_ca_topic_score_gemma":0.0012083868,"teacher_disagreement_score":0.011941858,"about_ca_system_score_codex":0.0034065635,"about_ca_system_score_gemma":0.0012678324,"threshold_uncertainty_score":0.039949477},"labels":[],"label_agreement":null},{"id":"W2077219596","doi":"10.1016/j.disc.2014.04.007","title":"A note on the real part of complex chromatic roots","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Chromatic scale; Combinatorics; Chromatic polynomial; Bounded function; Graph; Conjecture; Discrete mathematics; Friendship graph; Windmill graph; Graph power; Line graph; Mathematical analysis","score_opus":0.056421055226195595,"score_gpt":0.32637315449939247,"score_spread":0.26995209927319685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077219596","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057223994,0.030095225,0.22174795,0.045668717,0.03099154,0.000070098424,0.0006041819,0.000897054,0.6127012],"genre_scores_gemma":[0.7080901,0.01767301,0.06504573,0.0077707125,0.022689916,0.00008688177,0.00034809596,0.0009948091,0.17730069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995621,0.00010301216,0.000019929981,0.00011181886,0.00016030211,0.000042952095],"domain_scores_gemma":[0.9978734,0.0013314661,0.00014308453,0.00029649417,0.00022703357,0.00012839831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010832162,0.0009638637,0.0006617186,0.001981007,0.0013127908,0.0033103374,0.0014818212,0.0016558021,0.014466944],"category_scores_gemma":[0.005938473,0.0003778104,0.0005725452,0.0013559072,0.0047918777,0.0048145438,0.0017346198,0.0049935486,0.0023585912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028724735,0.0000073810347,0.00010064582,0.00007042318,0.000006114391,0.00010815158,0.00011985603,0.0005694005,0.0013511549,0.9779856,0.0108126635,0.008839837],"study_design_scores_gemma":[0.000008704107,0.000017017179,0.00033100788,0.00002653498,0.0000076639335,0.00022542433,0.000054036504,0.0016837884,0.00049085415,0.9520023,0.045127865,0.000024847866],"about_ca_topic_score_codex":0.0010210109,"about_ca_topic_score_gemma":0.0010084853,"teacher_disagreement_score":0.014466944,"about_ca_system_score_codex":0.0010443212,"about_ca_system_score_gemma":0.00036560986,"threshold_uncertainty_score":0.048396766},"labels":[],"label_agreement":null},{"id":"W2078027397","doi":"10.1016/s0012-365x(01)00440-x","title":"Isomorphism certificates for undirected graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Subgraph isomorphism problem; Graph isomorphism; Induced subgraph isomorphism problem; Discrete mathematics; Isomorphism (crystallography); Graph; Grid; Line graph; Voltage graph","score_opus":0.08590900831975816,"score_gpt":0.3012478759326275,"score_spread":0.2153388676128693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078027397","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3729303,0.0021053366,0.41531748,0.0106828,0.0008223516,0.00021541574,0.0013444868,0.0018896338,0.19469216],"genre_scores_gemma":[0.9138131,0.0018605168,0.04063394,0.0011730117,0.0009573491,0.00039149175,0.0017102836,0.00044620733,0.03901413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973966,0.00062106684,0.0001658406,0.00073870394,0.00069819903,0.00037959407],"domain_scores_gemma":[0.9846506,0.010224036,0.00118368,0.0014333604,0.0011383735,0.0013699927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002638799,0.00086799834,0.002036114,0.0041197054,0.0051238188,0.0060851397,0.0021163076,0.002648181,0.010982373],"category_scores_gemma":[0.013174727,0.0010906289,0.002001478,0.004156905,0.0076891785,0.022078125,0.006667864,0.008872965,0.0013240088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018979545,0.00001898601,0.00016018124,0.00002526486,0.0000045264974,0.00005727977,0.00026714714,0.00038284692,0.000102082726,0.99574983,0.0009370957,0.002275715],"study_design_scores_gemma":[0.000010299579,0.0000041138865,0.00006033763,0.000005727055,0.000005209354,0.000052299303,0.000056251745,0.0008912163,0.00013430926,0.99753845,0.0012353222,0.0000063529014],"about_ca_topic_score_codex":0.0019762057,"about_ca_topic_score_gemma":0.001478942,"teacher_disagreement_score":0.010982373,"about_ca_system_score_codex":0.0025914698,"about_ca_system_score_gemma":0.002250135,"threshold_uncertainty_score":0.036739647},"labels":[],"label_agreement":null},{"id":"W2078116611","doi":"10.1016/j.disc.2014.11.020","title":"A note on the discrepancy of matrices with bounded row and column sums","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Bounded function; Combinatorics; Lemma (botany); Column (typography); Context (archaeology); Discrete mathematics; Degree (music); Enhanced Data Rates for GSM Evolution; Computer science; Connection (principal bundle)","score_opus":0.005801646184660525,"score_gpt":0.19188970979506242,"score_spread":0.1860880636104019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078116611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06613879,0.013782924,0.8165887,0.02567682,0.005874256,0.00007100608,0.0012484645,0.000718699,0.06990049],"genre_scores_gemma":[0.6713664,0.009507241,0.25629976,0.010346037,0.009995761,0.00031628905,0.0016600644,0.0021637625,0.03834484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99334246,0.002908221,0.0002557112,0.0011486463,0.0019118955,0.00043305723],"domain_scores_gemma":[0.91506135,0.07125491,0.0021022053,0.005325597,0.0036437172,0.0026122357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009596658,0.002571503,0.002851848,0.0037934065,0.0018495225,0.004125263,0.0052545876,0.004319242,0.007959321],"category_scores_gemma":[0.07433889,0.001453885,0.0022647262,0.003169132,0.009648891,0.011666496,0.008606299,0.015579485,0.0015961302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024125141,0.000048551745,0.00092435005,0.00022785788,0.0000516079,0.00022779683,0.00029884846,0.016525637,0.0026727857,0.9583233,0.010415857,0.010042154],"study_design_scores_gemma":[0.000025838302,0.00006135816,0.00052401546,0.000084769345,0.000025679292,0.00021988481,0.00006309257,0.09880548,0.00093625754,0.8912801,0.007904274,0.0000691893],"about_ca_topic_score_codex":0.0022831918,"about_ca_topic_score_gemma":0.0014688532,"teacher_disagreement_score":0.009596658,"about_ca_system_score_codex":0.0027502105,"about_ca_system_score_gemma":0.0012019954,"threshold_uncertainty_score":0.05075258},"labels":[],"label_agreement":null},{"id":"W2078558807","doi":"10.1016/j.disc.2004.09.014","title":"Pancomponented 2-factorizations of complete graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"University of Vermont; University of Minnesota Duluth","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.014412601359995727,"score_gpt":0.21198889922382003,"score_spread":0.1975762978638243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078558807","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5356558,0.00072499755,0.35845584,0.0011733301,0.00032433422,0.00019380248,0.0018154677,0.00046817778,0.10118823],"genre_scores_gemma":[0.85167646,0.0007242998,0.09894436,0.0005547055,0.00033971813,0.00020804701,0.001997119,0.00027511202,0.045280196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914527,0.0001586106,0.000045594457,0.00026398076,0.00020113746,0.0001853923],"domain_scores_gemma":[0.99760675,0.00085178216,0.00043998545,0.00036235334,0.00036399416,0.0003750246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006308847,0.0008102128,0.0008323915,0.0015775942,0.0015104465,0.0025118014,0.0008588155,0.0009486986,0.01309701],"category_scores_gemma":[0.002172151,0.00081627903,0.00087867683,0.0011766712,0.0013702458,0.0035144563,0.001240005,0.0020907102,0.0017857655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020624782,0.00008824286,0.00044952703,0.00010907133,0.000024301826,0.0003245515,0.00069931214,0.005741637,0.005281268,0.9667712,0.0056366418,0.014667938],"study_design_scores_gemma":[0.000025155106,0.000028258275,0.0003874902,0.000020555175,0.000009139285,0.00021071757,0.00015913595,0.010559567,0.00069016026,0.9830467,0.0048486725,0.000014407678],"about_ca_topic_score_codex":0.0010885342,"about_ca_topic_score_gemma":0.0019192155,"teacher_disagreement_score":0.01309701,"about_ca_system_score_codex":0.0007186672,"about_ca_system_score_gemma":0.00043804082,"threshold_uncertainty_score":0.043813884},"labels":[],"label_agreement":null},{"id":"W2078598924","doi":"10.1016/j.disc.2007.04.021","title":"An answer to Hirasaka and Muzychuk: Every p-Schur ring over <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msubsup></mml:math> is Schurian","year":2007,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Lethbridge","funders":"","keywords":"Mathematics; Abelian group; Rank (graph theory); Ring (chemistry); Combinatorics; Group (periodic table); Discrete mathematics; Physics","score_opus":0.02620430582951997,"score_gpt":0.2763898744956428,"score_spread":0.2501855686661228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078598924","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039999415,0.015795084,0.017478447,0.85735136,0.02864354,0.000037641712,0.0008821608,0.00032194896,0.07548984],"genre_scores_gemma":[0.21504854,0.03680554,0.019907,0.33861464,0.07543336,0.00030975073,0.0035764794,0.0012504562,0.30905434],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988047,0.0004216933,0.00007655369,0.00025249505,0.00028966155,0.00015482242],"domain_scores_gemma":[0.9955858,0.0022107367,0.0002814915,0.00026592737,0.0012607239,0.00039528514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001745349,0.00089114375,0.0014764371,0.00071035075,0.0032906095,0.002799979,0.001125757,0.006867286,0.047459424],"category_scores_gemma":[0.011015046,0.00036866064,0.0008605906,0.0012528481,0.0028583398,0.013209626,0.0032421474,0.005274317,0.01247434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001330175,0.000042181076,0.00026462445,0.00033090616,0.000027583232,0.00016713946,0.0004209207,0.00020616659,0.00031931495,0.23712733,0.74406874,0.016892115],"study_design_scores_gemma":[0.000083507795,0.00004529994,0.0007366277,0.00023087629,0.000036511996,0.0004983671,0.0008950339,0.0006387685,0.0005621078,0.37530634,0.62088996,0.00007663574],"about_ca_topic_score_codex":0.0021144454,"about_ca_topic_score_gemma":0.0019689756,"teacher_disagreement_score":0.047459424,"about_ca_system_score_codex":0.0018099612,"about_ca_system_score_gemma":0.0015704421,"threshold_uncertainty_score":0.15876758},"labels":[],"label_agreement":null},{"id":"W2078953187","doi":"10.1016/s0012-365x(02)00749-5","title":"Further results on nearly Kirkman triple systems with subsystems","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Combinatorics; Triple system; Discrete mathematics; Steiner system; Pure mathematics","score_opus":0.01098084679741697,"score_gpt":0.19544290743097195,"score_spread":0.18446206063355497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078953187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25686166,0.0025542472,0.5086723,0.0035325591,0.0009640046,0.00010716669,0.00060240517,0.0003364708,0.22636917],"genre_scores_gemma":[0.91206473,0.0015777822,0.036148764,0.0011902809,0.00038620512,0.000098087454,0.000418302,0.0001219008,0.04799401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997445,0.000053704018,0.000014258118,0.000050443763,0.0000795647,0.000057466685],"domain_scores_gemma":[0.9990355,0.00041921635,0.00010774923,0.000114508395,0.00019201363,0.00013104423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049750385,0.00083378743,0.0008248397,0.0011672032,0.0015461382,0.0013206085,0.0007064029,0.0009316928,0.013879903],"category_scores_gemma":[0.0016142582,0.00034168785,0.0011121539,0.0015681955,0.001220901,0.0034086911,0.0018776747,0.0023024476,0.0010090936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006449563,0.000031733583,0.00023644946,0.00010749891,0.00002069109,0.0001309578,0.00026473636,0.009396672,0.0029423076,0.97534126,0.0020134777,0.009449733],"study_design_scores_gemma":[0.000010371048,0.00003474742,0.00023400008,0.000018457033,0.000015607826,0.000090701265,0.00016646298,0.02524925,0.00092343095,0.96925676,0.0039830464,0.000017087817],"about_ca_topic_score_codex":0.0021165493,"about_ca_topic_score_gemma":0.0020902168,"teacher_disagreement_score":0.013879903,"about_ca_system_score_codex":0.0008852219,"about_ca_system_score_gemma":0.00056549854,"threshold_uncertainty_score":0.046432853},"labels":[],"label_agreement":null},{"id":"W2079295608","doi":"10.1016/j.disc.2005.12.035","title":"Matrix partitions of perfect graphs","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Matrix (chemical analysis); Discrete mathematics","score_opus":0.016787369410474616,"score_gpt":0.303388922085106,"score_spread":0.2866015526746314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079295608","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7442579,0.0009273181,0.13762188,0.0016857636,0.0003884573,0.00012992632,0.0012193854,0.00056268135,0.11320664],"genre_scores_gemma":[0.95701915,0.00042996253,0.016814109,0.00030153582,0.00025844268,0.00010971335,0.00084779056,0.00016282235,0.024056392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931705,0.00017476862,0.000034970097,0.00012442275,0.00018112797,0.00016763009],"domain_scores_gemma":[0.9981931,0.0007285798,0.0003226837,0.00022901874,0.00020589771,0.00032070337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050502556,0.00051930314,0.0006363201,0.0019138604,0.0015115314,0.003261662,0.0008487048,0.0009237952,0.010270477],"category_scores_gemma":[0.0028705741,0.00055732176,0.00050628884,0.0013586611,0.0015212195,0.0028307254,0.001313951,0.0010578673,0.0010448577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010689072,0.00002334086,0.000215663,0.000046428668,0.000009398264,0.00007255932,0.00024714193,0.0025957385,0.0020921642,0.98640615,0.0030314182,0.005153116],"study_design_scores_gemma":[0.000024746954,0.00002254136,0.00043755557,0.000014790404,0.0000099582285,0.00010426868,0.00016169314,0.009630296,0.0009044505,0.98563933,0.003037058,0.0000132911],"about_ca_topic_score_codex":0.00088699284,"about_ca_topic_score_gemma":0.0015038155,"teacher_disagreement_score":0.010270477,"about_ca_system_score_codex":0.00093314267,"about_ca_system_score_gemma":0.0004757967,"threshold_uncertainty_score":0.034358144},"labels":[],"label_agreement":null},{"id":"W2079449107","doi":"10.1016/j.disc.2012.02.018","title":"Almost all cop-win graphs contain a universal vertex","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.03664615384126237,"score_gpt":0.3029478184586781,"score_spread":0.2663016646174157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079449107","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65400374,0.00085625506,0.14095484,0.0020163192,0.00038087642,0.0001595906,0.001015498,0.0012091334,0.19940373],"genre_scores_gemma":[0.96791637,0.000374544,0.014036657,0.0004944648,0.0001247121,0.0001298272,0.00058921345,0.0003061063,0.01602792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991542,0.00012581536,0.000034833,0.00024236609,0.00017898587,0.0002638329],"domain_scores_gemma":[0.9969189,0.0011507005,0.00035552215,0.0006088175,0.0004329249,0.00053305086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056932424,0.0009368485,0.0015480644,0.0022217478,0.0040821703,0.0035881447,0.0018390941,0.0017409862,0.0091799],"category_scores_gemma":[0.004264839,0.001001418,0.001046826,0.0019567953,0.0031838303,0.0062309224,0.0032819894,0.0028898614,0.0012641059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007049507,0.000024924038,0.00048340083,0.00006861674,0.000021966605,0.0001317765,0.00027555146,0.0003886184,0.0010393007,0.99020666,0.0020750354,0.005213786],"study_design_scores_gemma":[0.000014668403,0.000008958751,0.00025947086,0.000019266528,0.000019695695,0.00021217926,0.00020410608,0.00171686,0.00084860134,0.99366426,0.0030230614,0.000008807738],"about_ca_topic_score_codex":0.0010749364,"about_ca_topic_score_gemma":0.0012212185,"teacher_disagreement_score":0.0091799,"about_ca_system_score_codex":0.00093802216,"about_ca_system_score_gemma":0.000685653,"threshold_uncertainty_score":0.030709803},"labels":[],"label_agreement":null},{"id":"W2079465187","doi":"10.1016/j.disc.2006.06.035","title":"Large forbidden trade volumes and edge packings of random graphs","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Disjoint union (topology); Discrete mathematics; Graph; Pairwise comparison","score_opus":0.018677608037279168,"score_gpt":0.28845611920286046,"score_spread":0.26977851116558127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079465187","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8641166,0.0016442413,0.10687827,0.0020851518,0.00011741373,0.00004790325,0.0005218247,0.00035294567,0.0242356],"genre_scores_gemma":[0.9869578,0.00052978453,0.009053439,0.00017211778,0.00014232697,0.00008719245,0.00027994442,0.00011308361,0.0026643116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981912,0.00069994375,0.00009239349,0.00026305052,0.0004619067,0.00029153406],"domain_scores_gemma":[0.9672226,0.02477985,0.003487098,0.00199854,0.00076941063,0.001742546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002354971,0.00065449416,0.0017287247,0.0032738382,0.0021985814,0.0059818407,0.0029887524,0.002161387,0.004996065],"category_scores_gemma":[0.023829825,0.0019372026,0.0009513216,0.0029514763,0.0055772034,0.0082037635,0.0028596052,0.0031155786,0.00038089138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025462778,0.00007761119,0.0019080245,0.000100393445,0.000040477793,0.00020131886,0.00036493043,0.04576088,0.0011747715,0.94242775,0.0020609172,0.0056282543],"study_design_scores_gemma":[0.000023953264,0.000013812291,0.0005308112,0.000018349934,0.000012096938,0.00016365836,0.00009478661,0.05866059,0.0003747319,0.9395773,0.0005168305,0.000013135072],"about_ca_topic_score_codex":0.0008612452,"about_ca_topic_score_gemma":0.0010267989,"teacher_disagreement_score":0.0059818407,"about_ca_system_score_codex":0.0017112553,"about_ca_system_score_gemma":0.0006097933,"threshold_uncertainty_score":0.0167135},"labels":[],"label_agreement":null},{"id":"W2079678732","doi":"10.1016/j.disc.2013.05.023","title":"Dead ends in misère play: The misère monoid of canonical numbers","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Monoid; Integer (computer science); Combinatorics; Left and right; Dead end; Dead body; Discrete mathematics; Computer science","score_opus":0.023520981532640484,"score_gpt":0.2786696937595663,"score_spread":0.2551487122269258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079678732","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17653233,0.0049799695,0.38397655,0.0058986493,0.0018004092,0.0001239009,0.0005952225,0.0004510405,0.42564186],"genre_scores_gemma":[0.8967747,0.0010650157,0.028051961,0.0008118188,0.0005019217,0.0001265585,0.00031103578,0.00019846749,0.07215851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879885,0.00044061517,0.00006398203,0.00021019712,0.00027965475,0.00020665275],"domain_scores_gemma":[0.9985285,0.00059949706,0.000106995554,0.00019227726,0.00032741105,0.00024529558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001240442,0.0007895356,0.0009102316,0.002379278,0.0047602803,0.006549722,0.0012980662,0.0019699614,0.009569373],"category_scores_gemma":[0.0045099724,0.0006124869,0.00076812634,0.0016346392,0.0066008503,0.01077198,0.0032556774,0.003610288,0.0015875516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000099785175,0.0000022548063,0.000029729075,0.000004939597,8.767075e-7,0.000011499243,0.00013231377,0.00010210131,0.00004158584,0.9983998,0.00030316744,0.000961709],"study_design_scores_gemma":[0.0000035417322,0.0000040014265,0.000024359584,0.0000062660597,0.0000018237813,0.000019441777,0.000064112646,0.0006803045,0.000057952882,0.9960531,0.0030796132,0.000005382126],"about_ca_topic_score_codex":0.0024129348,"about_ca_topic_score_gemma":0.0029866458,"teacher_disagreement_score":0.009569373,"about_ca_system_score_codex":0.0017619493,"about_ca_system_score_gemma":0.0013452806,"threshold_uncertainty_score":0.03201276},"labels":[],"label_agreement":null},{"id":"W2079923544","doi":"10.1016/j.disc.2009.06.004","title":"Avoiding squares and overlaps over the natural numbers","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Natural number; Combinatorics; Discrete mathematics; Natural (archaeology); Geography","score_opus":0.00740418815523247,"score_gpt":0.23990761968987745,"score_spread":0.23250343153464498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079923544","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46835008,0.0010510931,0.42359576,0.0012304026,0.0003540943,0.00007547818,0.00016537333,0.00062187907,0.104555845],"genre_scores_gemma":[0.8999559,0.00047475426,0.065616034,0.00026228337,0.00019374545,0.00011861982,0.00017230236,0.0002419962,0.032964393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804723,0.0006534391,0.00011795125,0.0004995735,0.00043311447,0.0002488052],"domain_scores_gemma":[0.9946293,0.0033278405,0.0004428027,0.0008483269,0.00038230236,0.0003693716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012117582,0.0004950266,0.0007057778,0.0008627048,0.0021655413,0.0025266502,0.0009676661,0.0010540432,0.005417958],"category_scores_gemma":[0.006665814,0.0006153009,0.00069571764,0.0009246326,0.003661281,0.006164538,0.0033062685,0.0014941756,0.0010168024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075583856,0.000013746478,0.00031999932,0.000035791887,0.000005818244,0.00016624366,0.00066942425,0.0012484731,0.0016366739,0.985824,0.0006484224,0.009355833],"study_design_scores_gemma":[0.000012064834,0.000023082852,0.00015119716,0.000010979395,0.0000079755855,0.00019426655,0.0002269617,0.0032972258,0.0015483467,0.987866,0.006650354,0.000011553425],"about_ca_topic_score_codex":0.0006140858,"about_ca_topic_score_gemma":0.0010004696,"teacher_disagreement_score":0.005417958,"about_ca_system_score_codex":0.00054822315,"about_ca_system_score_gemma":0.000718588,"threshold_uncertainty_score":0.018124938},"labels":[],"label_agreement":null},{"id":"W2079989676","doi":"10.1016/j.disc.2004.09.001","title":"A family of switch equivalent graphs","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Graph; Discrete mathematics; Disjoint sets","score_opus":0.023447709108356495,"score_gpt":0.255370136399964,"score_spread":0.23192242729160747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079989676","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4726623,0.0013463051,0.36057672,0.0012912885,0.00023566106,0.00017043928,0.0009760115,0.000986331,0.16175511],"genre_scores_gemma":[0.929068,0.0009613638,0.031230958,0.00045115425,0.00009294977,0.00012938699,0.0009593951,0.00015098434,0.03695584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997421,0.00004908404,0.000009623096,0.000081548555,0.00007696323,0.00004062184],"domain_scores_gemma":[0.99937904,0.00023568433,0.000084048974,0.000095083786,0.00011972433,0.000086409054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023620336,0.0005203598,0.00037907218,0.00075625296,0.0008721061,0.0011109493,0.00064237474,0.0006639884,0.008492326],"category_scores_gemma":[0.001341185,0.0002556235,0.0005062657,0.0006593689,0.0005831695,0.0014000969,0.00056012295,0.00089252414,0.00061720295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018726823,0.00007708896,0.0010326811,0.00010446531,0.000045420333,0.0006869914,0.0002952905,0.00882308,0.0068709007,0.9374506,0.0061396654,0.03828656],"study_design_scores_gemma":[0.000065112974,0.00008411327,0.0013253366,0.0000322383,0.00004487359,0.0012178012,0.00015695556,0.05422141,0.0029700988,0.90976083,0.030100854,0.000020340276],"about_ca_topic_score_codex":0.0005912627,"about_ca_topic_score_gemma":0.00044131267,"teacher_disagreement_score":0.008492326,"about_ca_system_score_codex":0.00050054124,"about_ca_system_score_gemma":0.00030127857,"threshold_uncertainty_score":0.02840966},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Diagonal; Simple (philosophy); Mathematics; Modular design; Discrete mathematics; Combinatorics; Computer science; Programming language; Geometry","score_opus":0.06173433587611936,"score_gpt":0.3231308080187126,"score_spread":0.2613964721425932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080042417","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059094345,0.6303611,0.14733656,0.015006101,0.0034378753,0.00015421085,0.0022458408,0.0013167071,0.19423224],"genre_scores_gemma":[0.059309363,0.72073877,0.13023138,0.006714244,0.011140786,0.000426045,0.0077489107,0.0013676245,0.062322866],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960443,0.00084833143,0.0003399939,0.0011884179,0.001263233,0.00031574318],"domain_scores_gemma":[0.98951995,0.0067485794,0.00038408724,0.0015302468,0.001327898,0.00048926636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040840223,0.0022305665,0.0023429606,0.008724233,0.0032145644,0.007709296,0.0044592554,0.0024047717,0.03895567],"category_scores_gemma":[0.009903243,0.0018034676,0.0022634831,0.018488122,0.003464411,0.016774304,0.004541412,0.004507325,0.02316946],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012438772,0.00029110975,0.0019809392,0.0072005023,0.00013503896,0.00020928794,0.0003027779,0.0027408355,0.000997119,0.3161833,0.12022431,0.5496104],"study_design_scores_gemma":[0.000022756576,0.00010360248,0.0020294897,0.0018305839,0.000086035725,0.0011512742,0.0003338609,0.0065225926,0.0012158158,0.2983442,0.6882695,0.000090288915],"about_ca_topic_score_codex":0.0031450822,"about_ca_topic_score_gemma":0.004471516,"teacher_disagreement_score":0.03895567,"about_ca_system_score_codex":0.0037939728,"about_ca_system_score_gemma":0.004152742,"threshold_uncertainty_score":0.13031965},"labels":[],"label_agreement":null},{"id":"W2080199983","doi":"10.1016/j.disc.2008.02.005","title":"A criterion for the half-plane property","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Matroid; Property (philosophy); Homogeneous; Plane (geometry); Polynomial; Combinatorics; Pure mathematics; Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.03454349146865929,"score_gpt":0.25355978755827313,"score_spread":0.21901629608961384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080199983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15267785,0.0012811854,0.5902788,0.0076735583,0.0009099228,0.0002469041,0.001513296,0.0008078859,0.24461058],"genre_scores_gemma":[0.85506445,0.001079012,0.098984964,0.0022457575,0.0010749254,0.0004234157,0.0019073169,0.00066142995,0.038558625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989864,0.00015863076,0.00008425571,0.00029209792,0.00030647355,0.0001721492],"domain_scores_gemma":[0.99504685,0.0021506327,0.0002743453,0.0006479636,0.0013655345,0.00051461137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014079396,0.00064247235,0.0011532635,0.0022930042,0.0020300797,0.0034978478,0.0016755715,0.0024088682,0.01639498],"category_scores_gemma":[0.008685842,0.0004903488,0.0009278618,0.0015247014,0.0038554806,0.007971032,0.0033493887,0.0041153296,0.0036249063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052615153,0.000017970062,0.00030973522,0.000038719907,0.0000060705756,0.00008292253,0.00008165943,0.0002814365,0.0020867696,0.98790514,0.0030440704,0.006092903],"study_design_scores_gemma":[0.000041363728,0.000048151825,0.0005574053,0.000035014164,0.000012464806,0.00038389236,0.00016848942,0.0069157253,0.0038471788,0.9718482,0.016117612,0.00002443546],"about_ca_topic_score_codex":0.00072774664,"about_ca_topic_score_gemma":0.00043736424,"teacher_disagreement_score":0.01639498,"about_ca_system_score_codex":0.0008968569,"about_ca_system_score_gemma":0.0008345665,"threshold_uncertainty_score":0.054846644},"labels":[],"label_agreement":null},{"id":"W2080714423","doi":"10.1016/j.disc.2008.06.012","title":"Existence of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si3.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>r</mml:mi></mml:math>-fold perfect <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si4.gif\" display=\"inline\" overflow=\"scroll\"><mml:mrow><mml:mo>(</mml:mo><mml:mi>v</mml:mi><mml:mo>,</mml:mo><mml:mi>K</mml:mi><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>-Mendelsohn designs with <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si5.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>K</mml:mi><mml:mo>⊆</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mn>4</mml:mn><mml:mo>,</mml:mo><mml:mn>5</mml:mn><mml:mo>,</mml:mo><mml:mn>6</mml:mn><mml:mo>,</mml:mo><mml:mn>7</mml:mn><mml:mo>}</mml:mo></mml:mrow></mml:math>","year":2008,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"","keywords":"Combinatorics; Mathematics; Integer (computer science); Block (permutation group theory); Discrete mathematics; Computer science","score_opus":0.021037681548531122,"score_gpt":0.23780148741442605,"score_spread":0.21676380586589494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080714423","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040665228,0.0014561922,0.55711395,0.0026741475,0.0012802314,0.000266207,0.0022403917,0.0025814823,0.39172223],"genre_scores_gemma":[0.38318563,0.0017243087,0.28959483,0.0018715179,0.0007440842,0.00073131337,0.0044132243,0.002137689,0.3155974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975472,0.0005112004,0.00020086861,0.000667377,0.00075061515,0.000322786],"domain_scores_gemma":[0.9944537,0.0019885998,0.0005882698,0.0009678721,0.0016886704,0.00031284007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022439726,0.0013901355,0.0013230067,0.0013613222,0.0018234747,0.0038744928,0.0010052166,0.0017607177,0.10761767],"category_scores_gemma":[0.009489907,0.0009805639,0.0021630721,0.0010269124,0.0019697666,0.0053839725,0.0021390528,0.0023318722,0.03873792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000428412,0.00018292374,0.0009399407,0.0007370281,0.000100431054,0.00047859497,0.0007574448,0.0023874405,0.009442532,0.8349151,0.036847413,0.11278272],"study_design_scores_gemma":[0.00023717992,0.00044665695,0.001166559,0.00037472422,0.000111929716,0.0012734379,0.00054470566,0.0062445463,0.018188773,0.7196905,0.2515729,0.0001481793],"about_ca_topic_score_codex":0.0008542337,"about_ca_topic_score_gemma":0.0015943159,"teacher_disagreement_score":0.10761767,"about_ca_system_score_codex":0.0015131487,"about_ca_system_score_gemma":0.0015700511,"threshold_uncertainty_score":0.360017},"labels":[],"label_agreement":null},{"id":"W2080876227","doi":"10.1016/j.disc.2008.02.040","title":"Linear bound on extremal functions of some forbidden patterns in 0–1 matrices","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Matrix (chemical analysis); Upper and lower bounds; Discrete mathematics; Mathematical analysis","score_opus":0.02140650063974825,"score_gpt":0.22544171372958507,"score_spread":0.20403521308983683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080876227","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47262233,0.0014298337,0.43541068,0.0039047513,0.00027954648,0.0000710606,0.0005329885,0.00053136906,0.085217394],"genre_scores_gemma":[0.9599763,0.00053957704,0.025079055,0.00052052946,0.00027273674,0.00014588497,0.00030567622,0.00018437405,0.012975941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987753,0.00042078324,0.00004001974,0.00017511839,0.0002790397,0.00030968344],"domain_scores_gemma":[0.99186677,0.005980098,0.0005328463,0.0005238767,0.0005554041,0.0005411379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001331486,0.0015056954,0.00081500394,0.001979713,0.0013789725,0.0024575465,0.002096644,0.0018062209,0.008931149],"category_scores_gemma":[0.010212105,0.0005426717,0.0006391457,0.001712886,0.0022841187,0.0031602266,0.0023374055,0.0031504969,0.0009873445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034958322,0.00008892834,0.00085082464,0.00015336393,0.00003722801,0.00018714358,0.00030791413,0.021307876,0.0062779565,0.9485442,0.003694469,0.018200645],"study_design_scores_gemma":[0.000034823188,0.00005627657,0.00074518984,0.00006296117,0.000024434064,0.00026705227,0.00011680275,0.1201086,0.0035255642,0.87356526,0.0014453745,0.00004777388],"about_ca_topic_score_codex":0.0006247226,"about_ca_topic_score_gemma":0.000763421,"teacher_disagreement_score":0.008931149,"about_ca_system_score_codex":0.0013367949,"about_ca_system_score_gemma":0.0007175472,"threshold_uncertainty_score":0.029877722},"labels":[],"label_agreement":null},{"id":"W2081110589","doi":"10.1016/j.disc.2015.01.034","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si6.gif\" display=\"inline\" overflow=\"scroll\"><mml:mrow><mml:mo>{</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>}</mml:mo></mml:mrow></mml:math>-Degree free spanning forests in graphs","year":2015,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Honjo International Scholarship Foundation","keywords":"Combinatorics; Mathematics; Degree (music); Spanning tree; Minimum degree spanning tree; Connected dominating set; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.034849909263913265,"score_gpt":0.27708938093796787,"score_spread":0.2422394716740546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081110589","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001963601,0.0003868376,0.12913074,0.0056436737,0.001457415,0.0003937147,0.19402672,0.14726235,0.519735],"genre_scores_gemma":[0.027457949,0.001562337,0.11343408,0.002357637,0.00096474134,0.0007709911,0.24102929,0.12753555,0.4848874],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999458,0.00008705687,0.000055285072,0.00009722005,0.0002354475,0.000066995555],"domain_scores_gemma":[0.9977003,0.00062229246,0.00013376522,0.0005249759,0.0007547015,0.00026398592],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00082471786,0.0015774559,0.0012913517,0.0021892649,0.0010501806,0.0054576593,0.0031251425,0.0015922405,0.67955345],"category_scores_gemma":[0.0051153526,0.001060352,0.0010197992,0.0041217795,0.0006789368,0.005064105,0.0026689034,0.002583063,0.58948374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004924717,0.000025928824,0.00013957298,0.00017430905,0.0000066089274,0.000033558554,0.000069563124,0.0002952633,0.0008586074,0.01848733,0.9480393,0.03182062],"study_design_scores_gemma":[0.00004430362,0.000013144372,0.0006756755,0.00007077073,0.0000063975267,0.00011638169,0.0000607113,0.0022148674,0.0028065767,0.023976553,0.9699827,0.000032026368],"about_ca_topic_score_codex":0.007581614,"about_ca_topic_score_gemma":0.009793503,"teacher_disagreement_score":0.67955345,"about_ca_system_score_codex":0.0025263291,"about_ca_system_score_gemma":0.0013238165,"threshold_uncertainty_score":0.4570781},"labels":[],"label_agreement":null},{"id":"W2081444314","doi":"10.1016/j.disc.2011.02.005","title":"Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Nokia Foundation; Academy of Finland","keywords":"Triple system; Disjoint sets; Combinatorics; Isomorphism (crystallography); Mathematics; Order (exchange); Steiner system; Discrete mathematics; Pure mathematics; Crystallography","score_opus":0.024616523113820062,"score_gpt":0.2165696212181642,"score_spread":0.19195309810434413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081444314","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77151585,0.00083652284,0.11462484,0.00095047365,0.0005877717,0.0001150743,0.00038109274,0.0002834224,0.11070487],"genre_scores_gemma":[0.96735495,0.0002069964,0.012133308,0.0002391727,0.00012913799,0.00006853047,0.00017341276,0.000054198514,0.019640367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996087,0.000063491,0.000020029116,0.00005878346,0.00012691961,0.00012213156],"domain_scores_gemma":[0.99933857,0.00012527987,0.00014077267,0.00007904572,0.00016608,0.00015025787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034889102,0.0003314268,0.00066832994,0.0014727518,0.0020678372,0.0016601479,0.0004959324,0.00094272563,0.009254362],"category_scores_gemma":[0.0011461595,0.0003488328,0.0004888328,0.0008610972,0.0013297461,0.0020479623,0.0011075215,0.0014404249,0.00067206804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047856713,0.00001412171,0.0002386655,0.000017856315,0.0000066561474,0.00011395376,0.00017029364,0.0011712792,0.0022804406,0.9918224,0.000826729,0.0032897275],"study_design_scores_gemma":[0.00002150802,0.000058242313,0.0006746579,0.000011087494,0.00000829091,0.00023260429,0.00035845503,0.016624922,0.0018541162,0.9762418,0.0038809443,0.00003334692],"about_ca_topic_score_codex":0.0010249161,"about_ca_topic_score_gemma":0.0012895524,"teacher_disagreement_score":0.009254362,"about_ca_system_score_codex":0.0007726431,"about_ca_system_score_gemma":0.0006641235,"threshold_uncertainty_score":0.03095895},"labels":[],"label_agreement":null},{"id":"W2081625090","doi":"10.1016/j.disc.2014.03.006","title":"Edge-critical cops and robber in planar graphs","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Planar graph; Graph; Vertex (graph theory); Discrete mathematics","score_opus":0.01873342575711553,"score_gpt":0.30105570400728,"score_spread":0.2823222782501645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081625090","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7139003,0.0023732048,0.16588421,0.0034791655,0.00031107283,0.00018500359,0.0005796882,0.0006340595,0.11265324],"genre_scores_gemma":[0.952564,0.0010094233,0.019213103,0.00038665687,0.00020683682,0.00010383719,0.00046177444,0.00022254609,0.025831861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934965,0.00013000828,0.000023958757,0.00015402056,0.0001332783,0.00020902493],"domain_scores_gemma":[0.9966413,0.001642299,0.0005640014,0.00022423784,0.00029542597,0.0006327287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064037775,0.00090480916,0.001699388,0.0026725356,0.0030792493,0.0033037756,0.0017402413,0.0024753355,0.011993296],"category_scores_gemma":[0.0065165106,0.0011314949,0.0008071839,0.0019102622,0.003898078,0.0048093665,0.002919018,0.002510731,0.001145992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013592519,0.00005993032,0.0007037393,0.00016778837,0.000020263351,0.0003183414,0.0005032231,0.008661546,0.001242224,0.97419226,0.0056484225,0.008346318],"study_design_scores_gemma":[0.000038915805,0.000029034456,0.0005477772,0.00003730975,0.000022204496,0.0002744101,0.00043723767,0.022997469,0.00086627365,0.97020054,0.0045280154,0.000020704329],"about_ca_topic_score_codex":0.0029946594,"about_ca_topic_score_gemma":0.003073062,"teacher_disagreement_score":0.011993296,"about_ca_system_score_codex":0.0010946472,"about_ca_system_score_gemma":0.00074066094,"threshold_uncertainty_score":0.040121555},"labels":[],"label_agreement":null},{"id":"W2081993715","doi":"10.1016/j.disc.2006.01.005","title":"Generating indecomposable permutations","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Indecomposable module; Mathematics; Combinatorics; Permutation (music); Transposition (logic); Parity of a permutation; Discrete mathematics; Cyclic permutation; Symmetric group; Geometry","score_opus":0.011048546643465667,"score_gpt":0.23843785035046883,"score_spread":0.22738930370700317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081993715","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4673188,0.0007670841,0.310994,0.0029230607,0.0010810678,0.00026776138,0.0005135008,0.00089562585,0.21523908],"genre_scores_gemma":[0.8754671,0.0006659541,0.04027896,0.00057906203,0.0005544801,0.00022860855,0.0006386468,0.0004573311,0.08112978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987814,0.00036650978,0.00005575854,0.0001695748,0.000396927,0.00022979734],"domain_scores_gemma":[0.9974936,0.0013501196,0.00022036114,0.0005536393,0.00017209681,0.00021028111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010527977,0.0012815057,0.0008848816,0.0016229508,0.0018347453,0.0031902927,0.0015155965,0.0018013127,0.012377802],"category_scores_gemma":[0.0036634542,0.0007075962,0.0011144844,0.0017417023,0.001928262,0.0043501984,0.0031580941,0.0032615827,0.0031584364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055905195,0.00007182663,0.00019319628,0.00003368781,0.000006475361,0.00017948978,0.00019099993,0.0013246048,0.0020898485,0.9831902,0.0012088733,0.01145491],"study_design_scores_gemma":[0.000020563966,0.00002227553,0.0000710344,0.000011557363,0.000007395216,0.0001968391,0.000035937635,0.0048026373,0.0025528697,0.98963344,0.002633903,0.000011519488],"about_ca_topic_score_codex":0.00010396857,"about_ca_topic_score_gemma":0.00018383103,"teacher_disagreement_score":0.012377802,"about_ca_system_score_codex":0.00085426174,"about_ca_system_score_gemma":0.0007717667,"threshold_uncertainty_score":0.041407883},"labels":[],"label_agreement":null},{"id":"W2082281988","doi":"10.1016/j.disc.2007.11.065","title":"The chromatic number of 5-valent circulants","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Circulant matrix; Mathematics; Combinatorics; Chromatic scale; Degree (music); Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.050005829680336726,"score_gpt":0.3275820930475847,"score_spread":0.27757626336724794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082281988","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9122396,0.0005499454,0.016814174,0.001384112,0.00028713827,0.000048327583,0.000639,0.00022466022,0.06781303],"genre_scores_gemma":[0.98377407,0.0003444328,0.005257107,0.00021042468,0.00018472008,0.000050064395,0.00038289712,0.00009216027,0.009704182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993438,0.00013364153,0.000024856372,0.00014627764,0.00016361817,0.00018778104],"domain_scores_gemma":[0.9962592,0.0017441798,0.00064731773,0.00027233674,0.00038199907,0.0006950821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078277313,0.0007959931,0.0006145355,0.004249231,0.0029314125,0.004157124,0.0015550014,0.0016250939,0.010571576],"category_scores_gemma":[0.00394756,0.0005524802,0.00046385278,0.0027206154,0.0036170993,0.0023987861,0.0012460521,0.0016268682,0.0010035206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037640467,0.00006521916,0.0023405056,0.00010509164,0.000030054518,0.00020629152,0.0006084932,0.008933267,0.00962846,0.95924234,0.005407864,0.013056004],"study_design_scores_gemma":[0.000105243256,0.00009764482,0.0051421924,0.00008177934,0.0000650043,0.0004122142,0.0004024856,0.038980618,0.0061695715,0.93872607,0.009708848,0.00010817556],"about_ca_topic_score_codex":0.004084474,"about_ca_topic_score_gemma":0.0055679786,"teacher_disagreement_score":0.010571576,"about_ca_system_score_codex":0.0023794838,"about_ca_system_score_gemma":0.0011323866,"threshold_uncertainty_score":0.035365403},"labels":[],"label_agreement":null},{"id":"W2082570149","doi":"10.1016/j.disc.2006.03.068","title":"Linear transformations on codes","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Victoria","funders":"","keywords":"Hamming code; Linear code; Mathematics; Block code; Hamming distance; Discrete mathematics; Hamming weight; Expander code; Construct (python library); Hamming(7,4); Luby transform code; Reed–Muller code; Combinatorics; Algorithm; Decoding methods; Computer science","score_opus":0.009856434514622547,"score_gpt":0.2397584361478432,"score_spread":0.22990200163322067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082570149","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14086686,0.0047544274,0.24666145,0.00983458,0.0027053393,0.00018313254,0.00088676566,0.0008384735,0.59326893],"genre_scores_gemma":[0.78703314,0.0034288508,0.031580787,0.0018529765,0.0022267583,0.00022388283,0.0006309003,0.0005390518,0.17248358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918073,0.00020329545,0.000028341934,0.000124586,0.00032174282,0.00014130402],"domain_scores_gemma":[0.99924684,0.00027237824,0.00008709859,0.00014803624,0.00016828976,0.00007732809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038978478,0.0008097733,0.00061106915,0.0017561293,0.0012299962,0.0020286012,0.0005871651,0.0010370831,0.013528096],"category_scores_gemma":[0.0018030341,0.00037370724,0.0005249602,0.001614916,0.0024620406,0.0024853637,0.0019344406,0.0025968815,0.0029891261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009017149,0.0000065254417,0.000025476435,0.000016180067,0.0000022098527,0.000012787482,0.00006152437,0.0004378746,0.00036277773,0.9906846,0.0019218056,0.0064593563],"study_design_scores_gemma":[0.000005941991,0.000008543355,0.000056217174,0.000010799401,0.0000022643533,0.000038572554,0.000021638354,0.0019740672,0.00062449166,0.98880225,0.008448011,0.0000071893155],"about_ca_topic_score_codex":0.0011115909,"about_ca_topic_score_gemma":0.00060888374,"teacher_disagreement_score":0.013528096,"about_ca_system_score_codex":0.0014408242,"about_ca_system_score_gemma":0.00079974555,"threshold_uncertainty_score":0.04525602},"labels":[],"label_agreement":null},{"id":"W2082662222","doi":"10.1016/j.disc.2011.10.010","title":"Existence of 2 SOLS and 2 ISOLS","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"University of New South Wales; University Research Committee, Emory University; Mount Saint Vincent University","keywords":"Mathematics; Latin square; Combinatorics; Order (exchange); Discrete mathematics; Chemistry","score_opus":0.02486804389908685,"score_gpt":0.1981370191634325,"score_spread":0.17326897526434565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082662222","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65301996,0.0007519603,0.18741795,0.0032715139,0.0006458821,0.00018305141,0.00086264865,0.0010443934,0.15280262],"genre_scores_gemma":[0.898105,0.00033427248,0.051570974,0.0007378621,0.0004219781,0.00022263057,0.0010269105,0.0003302253,0.047250237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915504,0.00017043868,0.000050487637,0.000161817,0.00019305297,0.00026909987],"domain_scores_gemma":[0.99698,0.001222935,0.00045745907,0.00024637772,0.0005342967,0.00055887457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006930326,0.0013382719,0.0012667937,0.0022250144,0.0023733522,0.0028670044,0.001104947,0.0024628325,0.018347874],"category_scores_gemma":[0.0043960228,0.0009135433,0.0010960887,0.00090991426,0.002382923,0.0029401723,0.0039001189,0.002534676,0.0023183567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079232466,0.00024380599,0.0024867405,0.00034459084,0.00008369067,0.00069916603,0.00089095737,0.0063244137,0.01670029,0.94052905,0.008675374,0.02222951],"study_design_scores_gemma":[0.00024223122,0.00021805851,0.0017537569,0.000070200265,0.000052186766,0.00075497734,0.0010338561,0.040941376,0.007200239,0.9339141,0.013739899,0.000079165664],"about_ca_topic_score_codex":0.00026093295,"about_ca_topic_score_gemma":0.00031790102,"teacher_disagreement_score":0.018347874,"about_ca_system_score_codex":0.0007102638,"about_ca_system_score_gemma":0.00051455374,"threshold_uncertainty_score":0.06137979},"labels":[],"label_agreement":null},{"id":"W2083261017","doi":"10.1016/j.disc.2008.06.011","title":"Hamiltonicity in vertex envelopes of plane cubic graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université de Montréal; Texas A and M University","keywords":"Bipartite graph; Combinatorics; Mathematics; Hamiltonian path problem; Cubic graph; Vertex (graph theory); Discrete mathematics; Pancyclic graph; Hamiltonian path; Foster graph; 1-planar graph; Line graph; Graph; Graph power; Voltage graph","score_opus":0.030867328028344927,"score_gpt":0.2816540099414354,"score_spread":0.2507866819130905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083261017","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9506571,0.00019308821,0.02101386,0.00035112893,0.000027862105,0.000050479477,0.0002831395,0.00008519123,0.02733814],"genre_scores_gemma":[0.9869463,0.00021682696,0.004850847,0.00007488917,0.000021078908,0.0000383547,0.00029219917,0.000039048828,0.0075205197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972564,0.000052254658,0.000009648495,0.00003540461,0.00008689874,0.000090112386],"domain_scores_gemma":[0.9990101,0.0004378304,0.00021995402,0.000094828036,0.00008872321,0.0001485344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022872204,0.0002995318,0.0005098114,0.0009511173,0.0012100933,0.0021976463,0.00074490195,0.00093896996,0.0054241414],"category_scores_gemma":[0.0019791846,0.00057877426,0.0003953303,0.0011486794,0.0012732205,0.0012566211,0.0009945225,0.0010090335,0.00053254975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000528496,0.00013572135,0.005024649,0.00013341499,0.000036936344,0.0006779825,0.0013611087,0.038424462,0.0106001785,0.91303176,0.0037875792,0.026257653],"study_design_scores_gemma":[0.000101118836,0.00007427108,0.004515303,0.00004941344,0.000026205389,0.00028776148,0.0011393242,0.079091504,0.0027971962,0.9071984,0.0046897996,0.000029711906],"about_ca_topic_score_codex":0.0053247726,"about_ca_topic_score_gemma":0.005421495,"teacher_disagreement_score":0.0054241414,"about_ca_system_score_codex":0.00093962735,"about_ca_system_score_gemma":0.0005612313,"threshold_uncertainty_score":0.018145561},"labels":[],"label_agreement":null},{"id":"W2084708927","doi":"10.1016/s0012-365x(03)00284-x","title":"Minimum embedding of balanced P4-designs into 5-cycle systems","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Università di Catania","keywords":"Mathematics; Embedding; Combinatorics; Discrete mathematics; Value (mathematics); Computer science; Statistics","score_opus":0.012596166783818169,"score_gpt":0.2365351013061136,"score_spread":0.22393893452229544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084708927","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47273794,0.00034046054,0.48408017,0.0004060492,0.000066987224,0.0001494876,0.0004019456,0.00033855866,0.041478354],"genre_scores_gemma":[0.86468583,0.00027633892,0.11957303,0.00014627693,0.00003064032,0.00027500733,0.00045122724,0.00010739779,0.014454174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995697,0.00012619051,0.000026296937,0.000081434795,0.000109788256,0.00008654506],"domain_scores_gemma":[0.99929655,0.00023738414,0.00013855187,0.00010281601,0.00014016301,0.00008442345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003716812,0.0006216238,0.00046284572,0.0006783077,0.0006053255,0.0012776363,0.000642417,0.0008811669,0.007164654],"category_scores_gemma":[0.0014900848,0.00054843404,0.00035266613,0.0005567025,0.00054794626,0.0013803252,0.0011815515,0.0008019663,0.0008741728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007488673,0.00013705091,0.0012643561,0.00031435865,0.00007034138,0.00035903795,0.00049980433,0.10467919,0.047107078,0.7507509,0.003271523,0.09079753],"study_design_scores_gemma":[0.00018805041,0.00043918405,0.0012348653,0.00012017242,0.000059292215,0.0003143194,0.00028773618,0.32033676,0.023387957,0.63575494,0.01782772,0.00004898893],"about_ca_topic_score_codex":0.00079243263,"about_ca_topic_score_gemma":0.0010888169,"teacher_disagreement_score":0.007164654,"about_ca_system_score_codex":0.0008000047,"about_ca_system_score_gemma":0.0005532217,"threshold_uncertainty_score":0.02396816},"labels":[],"label_agreement":null},{"id":"W2085045539","doi":"10.1016/j.disc.2008.01.023","title":"Measure preserving homomorphisms and independent sets in tensor graph powers","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Amirkabir University of Technology","keywords":"Mathematics; Homomorphism; Measure (data warehouse); Tensor (intrinsic definition); Discrete mathematics; Graph; Combinatorics; Upper and lower bounds; Pure mathematics; Mathematical analysis; Data mining; Computer science","score_opus":0.03993079443253282,"score_gpt":0.2781595298436143,"score_spread":0.23822873541108147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085045539","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5219342,0.0019487115,0.33585596,0.0032196746,0.00060342683,0.00011982929,0.00036866326,0.0005011516,0.1354484],"genre_scores_gemma":[0.95349663,0.0008595499,0.02435271,0.0004305119,0.00061756175,0.00015094873,0.00016573432,0.00020929934,0.019716974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806195,0.00060140906,0.0001292793,0.00041576827,0.00052436977,0.0002672307],"domain_scores_gemma":[0.99278647,0.0035267721,0.000938071,0.000912551,0.0007075093,0.0011287037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029700806,0.00094740646,0.001712789,0.004956828,0.0038888664,0.0055275685,0.0020168063,0.0016598776,0.0066089095],"category_scores_gemma":[0.00821073,0.0011408237,0.0017757973,0.003736391,0.008833613,0.015684247,0.004069299,0.0050894255,0.0006963216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000788044,0.0000073752444,0.000032896194,0.0000063151106,0.0000028514917,0.000020458052,0.00013185422,0.00015641942,0.00010906877,0.99880624,0.00011786726,0.0006006993],"study_design_scores_gemma":[0.0000047398594,0.000004130975,0.0000354601,0.0000031459906,0.0000042059837,0.00003350629,0.000040038492,0.00084994745,0.00010886663,0.9985061,0.00040537296,0.000004396288],"about_ca_topic_score_codex":0.0011342571,"about_ca_topic_score_gemma":0.0009787673,"teacher_disagreement_score":0.0066089095,"about_ca_system_score_codex":0.0020340201,"about_ca_system_score_gemma":0.00077757344,"threshold_uncertainty_score":0.022108972},"labels":[],"label_agreement":null},{"id":"W2085599297","doi":"10.1016/j.disc.2006.03.060","title":"Canonical forms of shift-invariant maps on <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mo stretchy=\"false\">[</mml:mo><mml:mi mathvariant=\"double-struck\">N</mml:mi><mml:msup><mml:mrow><mml:mo stretchy=\"false\">]</mml:mo></mml:mrow><mml:mrow><mml:mo>∞</mml:mo></mml:mrow></mml:msup></mml:math>","year":2006,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Invariant (physics); Scroll; Combinatorics; Discrete mathematics; Algorithm; Mathematical physics; Theology","score_opus":0.019047662760679134,"score_gpt":0.2542959365121355,"score_spread":0.23524827375145638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085599297","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33566493,0.0012221873,0.2676068,0.0023470754,0.0020398581,0.00022563995,0.0016236574,0.0016349052,0.38763496],"genre_scores_gemma":[0.81030023,0.0010668562,0.029869635,0.00056921254,0.0010610918,0.00020237103,0.001421849,0.0010385084,0.15447022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988066,0.00017199022,0.000059685153,0.00031361188,0.0003493662,0.00029884727],"domain_scores_gemma":[0.99891603,0.00017516945,0.00012816551,0.00011930923,0.0004299122,0.00023155556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068701815,0.0008205465,0.0004947218,0.00304899,0.0015129412,0.0033523904,0.00078292424,0.00073723536,0.024782661],"category_scores_gemma":[0.0019897902,0.00051638053,0.00075321214,0.0014573421,0.0019777825,0.004266281,0.0023525278,0.0016708927,0.006826027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032487296,0.000031279753,0.00019646963,0.00001903734,0.0000057930965,0.00011286176,0.00031450266,0.00027737723,0.001007047,0.9821577,0.004629362,0.011216019],"study_design_scores_gemma":[0.000029259925,0.00005258029,0.00072012027,0.000020679374,0.000012886031,0.00032705517,0.0004597387,0.003470068,0.003155266,0.9614131,0.030304179,0.00003495968],"about_ca_topic_score_codex":0.00087785965,"about_ca_topic_score_gemma":0.0011740213,"teacher_disagreement_score":0.024782661,"about_ca_system_score_codex":0.0011791257,"about_ca_system_score_gemma":0.00076220743,"threshold_uncertainty_score":0.082906246},"labels":[],"label_agreement":null},{"id":"W2086013184","doi":"10.1016/j.disc.2010.12.006","title":"The quasi order of graphs on an ordinal","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"National Science Foundation","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Discrete mathematics; Order (exchange)","score_opus":0.053423251499947096,"score_gpt":0.305496046871558,"score_spread":0.2520727953716109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086013184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40833926,0.00669773,0.42747498,0.011164646,0.0011706055,0.00009290146,0.001089361,0.00065341126,0.14331715],"genre_scores_gemma":[0.92812634,0.0021444035,0.04617905,0.0008026183,0.0009065955,0.00012658439,0.0004230564,0.00019505474,0.021096302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981122,0.00074994704,0.00013505484,0.0003487172,0.00045161994,0.00020246078],"domain_scores_gemma":[0.9935359,0.0035670067,0.00058135536,0.00076702074,0.0007326456,0.00081614486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025115807,0.0005648704,0.0008949489,0.0040367143,0.0032771651,0.006503511,0.0013403428,0.0014267395,0.0047387006],"category_scores_gemma":[0.00675206,0.00093199685,0.001042732,0.0030163485,0.009784615,0.019893797,0.0025753237,0.0039172675,0.000507669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073602073,0.0000031574693,0.00007709743,0.000008097672,0.0000012685241,0.000010915945,0.00014618151,0.00011623759,0.00010850045,0.9986156,0.00015310722,0.0007523015],"study_design_scores_gemma":[0.0000044034673,0.0000060983925,0.00010655943,0.000007960503,0.0000035544751,0.000029281051,0.00008932605,0.0008001735,0.000098996454,0.99677616,0.0020720349,0.0000056205836],"about_ca_topic_score_codex":0.00258965,"about_ca_topic_score_gemma":0.0027623826,"teacher_disagreement_score":0.006503511,"about_ca_system_score_codex":0.002500985,"about_ca_system_score_gemma":0.0012367871,"threshold_uncertainty_score":0.018145978},"labels":[],"label_agreement":null},{"id":"W2086234498","doi":"10.1016/s0012-365x(02)00466-1","title":"Bicolour graphs of Steiner triple systems","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics; Discrete mathematics; Graph","score_opus":0.010595045897118486,"score_gpt":0.20264115917750886,"score_spread":0.19204611328039037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086234498","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70561504,0.000747817,0.15590408,0.0012040811,0.0002787952,0.00013363504,0.0007450636,0.00028277969,0.13508871],"genre_scores_gemma":[0.9474522,0.000509847,0.026004633,0.00037197935,0.0001477408,0.0001347572,0.00072060374,0.00012393868,0.024534442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996039,0.00008416062,0.00001657003,0.000072840085,0.0001273748,0.00009514437],"domain_scores_gemma":[0.9989561,0.0003477631,0.00021601228,0.00010132753,0.00018489799,0.0001937899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028452175,0.00054257375,0.0006690214,0.0023872887,0.0022283047,0.0026414203,0.0009240545,0.0011517506,0.011689295],"category_scores_gemma":[0.0014915046,0.0005538949,0.00044396246,0.002008808,0.0013116311,0.0022198227,0.0012428038,0.0018368773,0.001083079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052843043,0.000017319602,0.00027721675,0.000034509707,0.0000062702684,0.00010700895,0.00019799868,0.0020451052,0.00127451,0.9879814,0.0015814009,0.0064244303],"study_design_scores_gemma":[0.0000139939975,0.000014958003,0.0003896454,0.000020646276,0.000007497558,0.00013184734,0.00022878301,0.011827232,0.0006082082,0.9825865,0.00415864,0.000011957949],"about_ca_topic_score_codex":0.0022012135,"about_ca_topic_score_gemma":0.003422901,"teacher_disagreement_score":0.011689295,"about_ca_system_score_codex":0.0011796902,"about_ca_system_score_gemma":0.00054057036,"threshold_uncertainty_score":0.03910464},"labels":[],"label_agreement":null},{"id":"W2086492126","doi":"10.1016/s0012-365x(03)00041-4","title":"Weighted graphs with all Hamiltonian cycles of the same length","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Mathematics; Combinatorics; Hamiltonian (control theory); Undirected graph; Hamiltonian path; Discrete mathematics; Directed graph; Simple (philosophy); Characterization (materials science); Indifference graph; Pancyclic graph; Graph; Chordal graph; 1-planar graph","score_opus":0.02701261443584759,"score_gpt":0.2765974889872433,"score_spread":0.2495848745513957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086492126","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68699634,0.0011691628,0.22920877,0.0013942927,0.00045974617,0.000364611,0.0033222442,0.000444156,0.076640666],"genre_scores_gemma":[0.87666404,0.0013716167,0.07389058,0.00054660864,0.0002359726,0.00055931765,0.00307301,0.00029598808,0.04336288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992349,0.00015140243,0.00005751523,0.0002022911,0.00016761855,0.0001863019],"domain_scores_gemma":[0.9979201,0.00058961957,0.00039104157,0.000412796,0.00044271638,0.00024366463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041166536,0.0011047571,0.00079539296,0.002018183,0.001752451,0.0018152309,0.0015156117,0.0009833627,0.008193349],"category_scores_gemma":[0.0031417278,0.00062392355,0.000804652,0.0020945668,0.0011275397,0.003404484,0.0015005613,0.000995672,0.0012825185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064565404,0.00017737539,0.002891975,0.00073909166,0.00033149117,0.00083924114,0.00069769786,0.008928633,0.023654377,0.85538054,0.00972032,0.09599364],"study_design_scores_gemma":[0.000064407664,0.000086609165,0.001769676,0.00007906276,0.00017727308,0.00067603367,0.00037985088,0.011990609,0.008728105,0.9572237,0.018775644,0.00004900423],"about_ca_topic_score_codex":0.0008185117,"about_ca_topic_score_gemma":0.0014664389,"teacher_disagreement_score":0.008193349,"about_ca_system_score_codex":0.000551692,"about_ca_system_score_gemma":0.0005980805,"threshold_uncertainty_score":0.027409494},"labels":[],"label_agreement":null},{"id":"W2086629303","doi":"10.1016/j.disc.2005.03.005","title":"Supersolvable LL-lattices of binary trees","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Combinatorics; Binary number; Discrete mathematics; Binary tree; Arithmetic","score_opus":0.04033738929752605,"score_gpt":0.3223062354964241,"score_spread":0.28196884619889806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086629303","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68225515,0.0014900946,0.13510108,0.0031646488,0.00033133317,0.0001497186,0.0017231957,0.0009856968,0.17479908],"genre_scores_gemma":[0.9286853,0.00065984926,0.037923396,0.00070781575,0.00034999262,0.00016086015,0.002018569,0.0002723465,0.029221931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857545,0.00035631369,0.00009080225,0.00019971303,0.00039924192,0.00037842698],"domain_scores_gemma":[0.9963731,0.0019062603,0.00036637372,0.00037295825,0.00035631092,0.00062491733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006727573,0.0006934356,0.0013030557,0.0013044918,0.0025023285,0.0051772096,0.001292226,0.000982797,0.011837989],"category_scores_gemma":[0.0034802891,0.0010271363,0.001091216,0.0013198013,0.0023479336,0.004110544,0.0027397692,0.0041329237,0.0020910357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002683878,0.00009129955,0.0006100174,0.00014482123,0.000024113544,0.00027002295,0.00070926483,0.0023091827,0.0034612052,0.97488004,0.0043219496,0.0129096545],"study_design_scores_gemma":[0.000046572248,0.00001707238,0.0001830924,0.000022107211,0.00001582205,0.00013493643,0.00023429179,0.0047298307,0.0012731884,0.9888265,0.00450161,0.000014895013],"about_ca_topic_score_codex":0.0014331772,"about_ca_topic_score_gemma":0.0028704554,"teacher_disagreement_score":0.011837989,"about_ca_system_score_codex":0.0015463473,"about_ca_system_score_gemma":0.0008939706,"threshold_uncertainty_score":0.03960204},"labels":[],"label_agreement":null},{"id":"W2087041390","doi":"10.1016/s0012-365x(00)00021-2","title":"On the blocking sets in S(3,6,22) and S(4,7,23)","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Blocking (statistics); Combinatorics; Discrete mathematics; Statistics","score_opus":0.008277703968288011,"score_gpt":0.20151276103660234,"score_spread":0.19323505706831434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087041390","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6555255,0.00089624693,0.10593303,0.003919261,0.00020167413,0.00018265232,0.0011037375,0.00042064977,0.23181719],"genre_scores_gemma":[0.91609526,0.00092240534,0.038032092,0.00071229605,0.00015930287,0.00030816358,0.0011665028,0.00038140718,0.042222608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985979,0.00039412867,0.0000528136,0.00014489755,0.0003116227,0.00049855013],"domain_scores_gemma":[0.9906871,0.0060275216,0.0011754083,0.0004915034,0.00061878,0.0009997762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001905772,0.00083804806,0.0011556107,0.0026040669,0.006411736,0.004793119,0.0020681797,0.0015772682,0.014863294],"category_scores_gemma":[0.0066396412,0.0010239459,0.00093964254,0.0018618725,0.0034883555,0.0035352577,0.0020876555,0.0032043883,0.0016372248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020266217,0.000051196766,0.00029885644,0.00003442079,0.0000080176915,0.000054399854,0.00044826887,0.0068533383,0.0011715039,0.98480356,0.002919769,0.0031540901],"study_design_scores_gemma":[0.00007001926,0.000032937074,0.0006496528,0.000053446704,0.000019927662,0.00009078126,0.00043048023,0.042253118,0.0013503651,0.9510313,0.0039835433,0.00003431272],"about_ca_topic_score_codex":0.0087020835,"about_ca_topic_score_gemma":0.009798873,"teacher_disagreement_score":0.014863294,"about_ca_system_score_codex":0.0033783957,"about_ca_system_score_gemma":0.003058331,"threshold_uncertainty_score":0.049722612},"labels":[],"label_agreement":null},{"id":"W2087893738","doi":"10.1016/s0012-365x(01)00257-6","title":"Stirling numbers interpolation using permutations with forbidden subsequences","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Combinatorics; Stirling numbers of the first kind; Interpolation (computer graphics); Stirling number; Stirling numbers of the second kind; Discrete mathematics; Artificial intelligence; Computer science","score_opus":0.09971105842266578,"score_gpt":0.3382802443469355,"score_spread":0.2385691859242697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087893738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10906353,0.0004490493,0.79780877,0.00038151155,0.0007561093,0.000112571826,0.00015984141,0.000672301,0.09059634],"genre_scores_gemma":[0.5527677,0.000789995,0.39186212,0.00022441638,0.00037134727,0.0001935371,0.00031047384,0.0007847168,0.052695766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991848,0.0002517941,0.000057897563,0.00013831088,0.00025811404,0.00010907266],"domain_scores_gemma":[0.9988206,0.00047589338,0.000108819426,0.0003440307,0.00015814662,0.00009244717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011516201,0.00084598426,0.0008370242,0.001956894,0.001550864,0.00166455,0.0014683715,0.0009939778,0.010681834],"category_scores_gemma":[0.004639293,0.0006233396,0.0013350004,0.0022280696,0.0015193389,0.0027195404,0.0021624002,0.0024701497,0.002367277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024120347,0.000046290752,0.00021675286,0.000081311635,0.000011774218,0.00011929135,0.00011080824,0.008345036,0.008479357,0.9240057,0.001290709,0.057051755],"study_design_scores_gemma":[0.00004451421,0.0001592465,0.00027389504,0.00005479066,0.000035685003,0.00032321882,0.00007899951,0.07672954,0.025065288,0.87699896,0.020155026,0.0000808434],"about_ca_topic_score_codex":0.00045457258,"about_ca_topic_score_gemma":0.00091290596,"teacher_disagreement_score":0.010681834,"about_ca_system_score_codex":0.00073858094,"about_ca_system_score_gemma":0.00080704316,"threshold_uncertainty_score":0.035734296},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.026386083277995066,"score_gpt":0.26777340620684853,"score_spread":0.24138732292885345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088306445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14978789,0.0006910762,0.52265745,0.0030611581,0.00029349013,0.00054358674,0.006056211,0.0016525714,0.3152566],"genre_scores_gemma":[0.7880701,0.001030747,0.11298376,0.0013408059,0.0003036193,0.0008456389,0.0121641075,0.0013520954,0.08190907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864906,0.00021743772,0.00009708616,0.0004412242,0.00034053923,0.00025461585],"domain_scores_gemma":[0.99481344,0.0021198175,0.00081660104,0.00074412697,0.0009069313,0.0005990299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079907745,0.00087234844,0.000498348,0.0027226345,0.0019522541,0.004530586,0.0018478016,0.0013493482,0.03426302],"category_scores_gemma":[0.006371943,0.00064639514,0.0009416995,0.0027758346,0.0018413722,0.005774533,0.0021161323,0.0023777594,0.0040221764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004441197,0.000038311737,0.000525026,0.00008752741,0.000013332589,0.00012548943,0.00029959032,0.0016187902,0.0008892688,0.976439,0.008246965,0.011672342],"study_design_scores_gemma":[0.000023647668,0.000021116059,0.0006823492,0.000060711758,0.000022130998,0.0003329663,0.00032038116,0.009558235,0.0016160341,0.96064425,0.026696669,0.000021512646],"about_ca_topic_score_codex":0.0020159034,"about_ca_topic_score_gemma":0.0032356202,"teacher_disagreement_score":0.03426302,"about_ca_system_score_codex":0.0017140703,"about_ca_system_score_gemma":0.0009957995,"threshold_uncertainty_score":0.11462122},"labels":[],"label_agreement":null},{"id":"W2088390361","doi":"10.1016/s0012-365x(00)00190-4","title":"On nice graphs","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; North Atlantic Treaty Organization","keywords":"Mathematics; Combinatorics; Nice; Discrete mathematics; Computer science","score_opus":0.02756542105570989,"score_gpt":0.3109214902902431,"score_spread":0.28335606923453316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088390361","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2831647,0.0027744018,0.15082538,0.011773061,0.0014926877,0.00016658082,0.00084390276,0.0007544624,0.5482049],"genre_scores_gemma":[0.81833106,0.0025563198,0.032665864,0.0020322986,0.0014980145,0.00020387463,0.0013117053,0.0008027666,0.14059809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988398,0.00039766709,0.000038321963,0.00019771235,0.0003428183,0.0001836788],"domain_scores_gemma":[0.99701405,0.0011338042,0.00035403212,0.00045095183,0.00043472214,0.0006123436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008739787,0.0010772444,0.0015345673,0.0030826486,0.0036020298,0.0038690711,0.001753524,0.0022936533,0.015538927],"category_scores_gemma":[0.0052389805,0.0009975163,0.001672931,0.0023355081,0.004119128,0.007606409,0.005107108,0.0052552805,0.0018499056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014807404,0.0000064309856,0.00007245555,0.000023209943,0.0000034249917,0.000020667008,0.00011464455,0.00027604937,0.00014593717,0.99571025,0.0018266449,0.0017855554],"study_design_scores_gemma":[0.0000057193406,0.0000056389413,0.00010870365,0.000010701085,0.0000055348123,0.000056559416,0.00006882608,0.001351256,0.000068522386,0.9950658,0.0032478909,0.0000047205335],"about_ca_topic_score_codex":0.0017162364,"about_ca_topic_score_gemma":0.002078176,"teacher_disagreement_score":0.015538927,"about_ca_system_score_codex":0.0018905372,"about_ca_system_score_gemma":0.0006515889,"threshold_uncertainty_score":0.05198288},"labels":[],"label_agreement":null},{"id":"W2088429527","doi":"10.1016/j.disc.2007.07.033","title":"A generalised upper bound for the k-tuple domination number","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Combinatorics; Tuple; Upper and lower bounds; Domination analysis; Degree (music); Graph; Discrete mathematics; Vertex (graph theory)","score_opus":0.029152086963418405,"score_gpt":0.34070622518997407,"score_spread":0.31155413822655564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088429527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04825212,0.008838053,0.8393561,0.0059588198,0.0011510774,0.00019809898,0.0023046823,0.0016110833,0.092329934],"genre_scores_gemma":[0.691987,0.007654959,0.26167282,0.002315239,0.002847613,0.000952136,0.0023790454,0.001244684,0.028946485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9902953,0.0020634208,0.00050433114,0.002157442,0.0028915561,0.0020880005],"domain_scores_gemma":[0.9595144,0.028210023,0.0013000668,0.006412985,0.0025044752,0.002057971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005973013,0.0024268078,0.003876921,0.0056677284,0.0029425707,0.009391144,0.008847288,0.004317682,0.01664148],"category_scores_gemma":[0.03668623,0.0013067917,0.002786083,0.007371417,0.0061352854,0.01636765,0.010078895,0.0096445,0.0060441634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009696909,0.00015094747,0.0024521635,0.0011070607,0.0001824031,0.0004106184,0.0009478521,0.053290237,0.0102416305,0.8305863,0.018592706,0.08106832],"study_design_scores_gemma":[0.000043637774,0.00012048627,0.0011804136,0.0002557195,0.0001511653,0.00054603926,0.00013149234,0.10800997,0.0041098297,0.8679022,0.017411178,0.0001377208],"about_ca_topic_score_codex":0.0011786782,"about_ca_topic_score_gemma":0.0013734748,"teacher_disagreement_score":0.01664148,"about_ca_system_score_codex":0.0046149115,"about_ca_system_score_gemma":0.0020853996,"threshold_uncertainty_score":0.055671275},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010126028754151422,"score_gpt":0.22893661980495023,"score_spread":0.2188105910507988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088696758","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50159705,0.005513217,0.1586542,0.004734969,0.0013409958,0.00005508786,0.00042708218,0.0004796889,0.32719773],"genre_scores_gemma":[0.94690436,0.0013911881,0.024489151,0.00036895068,0.00031148182,0.000033348275,0.0002058504,0.0001612635,0.026134362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941146,0.00015060739,0.00002904943,0.00006453558,0.0002594269,0.00008482799],"domain_scores_gemma":[0.9991358,0.00039434808,0.00011963426,0.00020046567,0.00008593789,0.00006382721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043837662,0.00071561796,0.00066608784,0.0016091756,0.00093668525,0.0028436277,0.0008668256,0.0012128899,0.008718931],"category_scores_gemma":[0.002179936,0.00059053337,0.0004277709,0.0013760003,0.0026305416,0.0029713942,0.0014947314,0.0025465074,0.0009632936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007909286,0.000010722476,0.00018582171,0.000050112256,0.0000040553723,0.00010955162,0.00016222766,0.0007113753,0.004386083,0.98714983,0.0011866663,0.0059644496],"study_design_scores_gemma":[0.000030821073,0.000022007403,0.00045705176,0.00003124115,0.0000049315267,0.00052751874,0.0001760375,0.006184158,0.0047055297,0.98288107,0.004955493,0.000024177943],"about_ca_topic_score_codex":0.00040055302,"about_ca_topic_score_gemma":0.00047381502,"teacher_disagreement_score":0.008718931,"about_ca_system_score_codex":0.00068281457,"about_ca_system_score_gemma":0.00027511723,"threshold_uncertainty_score":0.029167771},"labels":[],"label_agreement":null},{"id":"W2089397652","doi":"10.1016/j.disc.2014.06.020","title":"Firefighting on square, hexagonal, and triangular grids","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Ryerson University","keywords":"Vertex (graph theory); Combinatorics; Mathematics; Conjecture; Square tiling; Square (algebra); Multiplicative function; Grid; Hexagonal crystal system; Discrete mathematics; Graph; Geometry; Mathematical analysis; Crystallography","score_opus":0.011190456765124372,"score_gpt":0.2579566958760887,"score_spread":0.24676623911096435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089397652","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6861919,0.00046398104,0.26847717,0.0009781204,0.00021982378,0.00012876345,0.0005253614,0.00028721397,0.04272763],"genre_scores_gemma":[0.96296203,0.00024151159,0.02102749,0.00009781375,0.000040351635,0.000046578047,0.00021755716,0.000053164997,0.0153133515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995591,0.00013792794,0.000010756482,0.00009386146,0.00005444924,0.00014394677],"domain_scores_gemma":[0.9980276,0.0010753248,0.00018937353,0.00019784873,0.00021610191,0.00029369458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054923334,0.00039985887,0.00060603843,0.00064037094,0.00094498857,0.0014350223,0.0011551523,0.0008704035,0.007821722],"category_scores_gemma":[0.0040828683,0.00028745722,0.00048442336,0.00068681914,0.00095563126,0.0021143497,0.0011139362,0.00077594724,0.0006882305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008331983,0.00011159483,0.0044066105,0.000098668424,0.00006240757,0.00033136463,0.0002992408,0.81800103,0.0023020643,0.14610374,0.005976971,0.021473074],"study_design_scores_gemma":[0.000034050052,0.00004262516,0.0006391528,0.000009349085,0.000008669585,0.00004164462,0.00020788462,0.93969506,0.00039373417,0.0577499,0.0011668523,0.000011088537],"about_ca_topic_score_codex":0.012078209,"about_ca_topic_score_gemma":0.007817409,"teacher_disagreement_score":0.012078209,"about_ca_system_score_codex":0.0009552035,"about_ca_system_score_gemma":0.0004949947,"threshold_uncertainty_score":0.0261662},"labels":[],"label_agreement":null},{"id":"W2089708856","doi":"10.1016/j.disc.2005.09.045","title":"Combinatorial pseudo-triangulations","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University; National Science Foundation","keywords":"Mathematics; Triangulation; Combinatorics; Property (philosophy); Plane (geometry); Graph; Planar graph; Planar; Combinatorial proof; Combinatorial algorithms; Discrete mathematics; Geometry; Computer science","score_opus":0.00530349729458748,"score_gpt":0.19845867172203693,"score_spread":0.19315517442744945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089708856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106825516,0.0010512074,0.5610963,0.0020736994,0.0009825552,0.00016739484,0.001461315,0.00041664336,0.32592538],"genre_scores_gemma":[0.63447523,0.0014880243,0.20982568,0.00094767375,0.00051797467,0.00036771045,0.0024547265,0.00069923076,0.14922366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993654,0.00018767104,0.000029755302,0.00012152876,0.00022836158,0.00006728919],"domain_scores_gemma":[0.9989247,0.00039626943,0.00010644819,0.00021267752,0.00022790566,0.00013199881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036527595,0.00068040646,0.0006153094,0.0019010105,0.0013335369,0.0021493777,0.0011796952,0.0010784921,0.026779134],"category_scores_gemma":[0.002685191,0.00062777835,0.00085359777,0.0014221226,0.0016939637,0.002376692,0.0019844275,0.002868203,0.0030771333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016995798,0.000007163995,0.00006354164,0.000035279983,0.000004626019,0.000037245147,0.00005435736,0.0017897475,0.00060915656,0.98652333,0.0029059765,0.007952582],"study_design_scores_gemma":[0.000014576972,0.000014160292,0.00017241262,0.000019608427,0.0000068834743,0.00022989609,0.000104541024,0.01089411,0.0007650031,0.9705771,0.017191365,0.000010348396],"about_ca_topic_score_codex":0.0005112072,"about_ca_topic_score_gemma":0.0008097741,"teacher_disagreement_score":0.026779134,"about_ca_system_score_codex":0.0007313765,"about_ca_system_score_gemma":0.00033911422,"threshold_uncertainty_score":0.089585185},"labels":[],"label_agreement":null},{"id":"W2089778934","doi":"10.1016/j.disc.2015.01.024","title":"On the spectrum and number of convex sets in graphs","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Discrete mathematics; Cograph; Split graph; Block graph; Convex set; Vertex (graph theory); Line graph; Graph; Regular polygon; Pathwidth; Convex optimization","score_opus":0.038613218446952,"score_gpt":0.32228538706123816,"score_spread":0.2836721686142862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089778934","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7217984,0.003838296,0.18507242,0.010496962,0.00060855807,0.00007097179,0.001174074,0.00033213964,0.076608054],"genre_scores_gemma":[0.97042733,0.0016014224,0.018495027,0.00041578183,0.00089788967,0.0001065325,0.00043104045,0.00017092888,0.0074539646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980282,0.00075403927,0.00008281506,0.00039583867,0.00047528962,0.0002637229],"domain_scores_gemma":[0.9683915,0.025016267,0.0018651044,0.0011311481,0.0011104901,0.002485529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027262191,0.0011761659,0.0020684996,0.0058104433,0.0022342072,0.004721476,0.003955952,0.0021851927,0.011346989],"category_scores_gemma":[0.01898863,0.0011008143,0.001100981,0.0034788207,0.00823243,0.011911429,0.0037139498,0.0032214182,0.0006709254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013873828,0.00004429696,0.0010110539,0.000075836564,0.000021225902,0.000061138555,0.0002614275,0.0070319735,0.0009968006,0.9826251,0.001936827,0.005795539],"study_design_scores_gemma":[0.000019860061,0.000017032778,0.0007436991,0.000038473598,0.000012608832,0.000106528096,0.00013491504,0.028103532,0.0002934412,0.9696406,0.0008708403,0.00001841979],"about_ca_topic_score_codex":0.001397872,"about_ca_topic_score_gemma":0.001122044,"teacher_disagreement_score":0.011346989,"about_ca_system_score_codex":0.0029601888,"about_ca_system_score_gemma":0.00078724837,"threshold_uncertainty_score":0.037959456},"labels":[],"label_agreement":null},{"id":"W2090014573","doi":"10.1016/j.disc.2006.06.046","title":"When is a partial Latin square uniquely completable, but not its completable product?","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Latin square; Mathematics; Combinatorics; Product (mathematics); Class (philosophy); Square (algebra); Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.03146294528738935,"score_gpt":0.23948568130272163,"score_spread":0.20802273601533228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090014573","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7317035,0.00081504625,0.089241266,0.004801544,0.0006698616,0.000052004532,0.00069635926,0.0006569423,0.17136341],"genre_scores_gemma":[0.97507215,0.00025107598,0.011142226,0.00051770644,0.00029445605,0.000026636551,0.00047177981,0.00015545642,0.012068576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894756,0.00016246541,0.000043953747,0.00041113864,0.0001957165,0.00023913893],"domain_scores_gemma":[0.99681073,0.0013947275,0.00055477367,0.0004936213,0.00045128536,0.00029477762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007631439,0.0002927079,0.00058937137,0.00076075,0.0015977314,0.0028081015,0.0007391622,0.0018320394,0.013869322],"category_scores_gemma":[0.0057417527,0.00048214884,0.00045456045,0.00092800235,0.0040201466,0.006122758,0.0010824837,0.001206488,0.0011684535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002655692,0.000034151355,0.0020218927,0.00013021375,0.000026710648,0.000619695,0.000568586,0.001855301,0.0051569277,0.961067,0.005858731,0.022395294],"study_design_scores_gemma":[0.00004169864,0.00009312094,0.0025637657,0.000044538843,0.000035095833,0.001457015,0.0020186675,0.006090404,0.0072382363,0.963625,0.016709141,0.00008328891],"about_ca_topic_score_codex":0.0012444545,"about_ca_topic_score_gemma":0.0015048197,"teacher_disagreement_score":0.013869322,"about_ca_system_score_codex":0.0007363945,"about_ca_system_score_gemma":0.0007542285,"threshold_uncertainty_score":0.046397507},"labels":[],"label_agreement":null},{"id":"W2090123683","doi":"10.1016/j.disc.2011.03.009","title":"The order of hypotraceable oriented graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"University of South Africa","keywords":"Mathematics; Digraph; Combinatorics; Order (exchange); Graph; Discrete mathematics","score_opus":0.03619054761954036,"score_gpt":0.28107950846148855,"score_spread":0.2448889608419482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090123683","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8706192,0.00038998327,0.06562143,0.00084094354,0.00020856323,0.00006830446,0.00082753575,0.000374284,0.061049722],"genre_scores_gemma":[0.9529685,0.00061895733,0.017564818,0.00039579943,0.0002575801,0.000061196275,0.0013292397,0.0002906626,0.02651324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992244,0.00014007633,0.00006743522,0.00014630814,0.00023585651,0.00018587013],"domain_scores_gemma":[0.99424744,0.0024857828,0.0009269065,0.0008338508,0.0006796326,0.00082648004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006318998,0.0004542897,0.000707285,0.002162472,0.001545863,0.0038492393,0.001007344,0.0008565097,0.007116572],"category_scores_gemma":[0.0033092394,0.00059793855,0.00059287297,0.0014850065,0.002628957,0.0047015552,0.0011584333,0.0018235102,0.0012902607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002395656,0.00007609695,0.0015679192,0.00006895056,0.0000139225585,0.00034084127,0.0011671532,0.002397702,0.006771974,0.97306395,0.0016910555,0.012600946],"study_design_scores_gemma":[0.000028790846,0.00006385372,0.0011951714,0.00002332074,0.000016839498,0.00019650743,0.00034507114,0.005173326,0.003096174,0.98522896,0.0046094162,0.000022485696],"about_ca_topic_score_codex":0.0018815983,"about_ca_topic_score_gemma":0.0026879408,"teacher_disagreement_score":0.007116572,"about_ca_system_score_codex":0.0010640763,"about_ca_system_score_gemma":0.00084660284,"threshold_uncertainty_score":0.023807347},"labels":[],"label_agreement":null},{"id":"W2090259579","doi":"10.1016/j.disc.2003.11.022","title":"Latin Squares with Self-Orthogonal Conjugates","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Latin square; Mathematics; Idempotence; Combinatorics; Orthogonal array; Conjugate; Transpose; Graph; Idempotent matrix; Discrete mathematics; Order (exchange); Eigenvalues and eigenvectors; Statistics","score_opus":0.005529690822069073,"score_gpt":0.18325978756344172,"score_spread":0.17773009674137263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090259579","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17444335,0.0015431563,0.613149,0.0026699523,0.0016180957,0.00014439765,0.00022895634,0.00073749386,0.2054656],"genre_scores_gemma":[0.78294075,0.0013275685,0.1295636,0.0019421211,0.0009767791,0.00028495258,0.00020352371,0.0004567403,0.08230395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870956,0.0006127944,0.000062376756,0.00023250181,0.00026771362,0.000114963565],"domain_scores_gemma":[0.9975655,0.0010891585,0.00042106528,0.00046452257,0.0003092939,0.00015043293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007962093,0.00091349974,0.00062479475,0.0013349525,0.00086519826,0.0020773099,0.0006253712,0.0014839444,0.010989321],"category_scores_gemma":[0.005396284,0.0005088916,0.0004679871,0.0015779779,0.0019038655,0.0025009685,0.002019334,0.0012851977,0.0029047872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006106519,0.000020784946,0.00019916221,0.000040750336,0.000014188357,0.00015997778,0.00011025793,0.0022044934,0.004870683,0.9719092,0.0021600965,0.018249314],"study_design_scores_gemma":[0.000028530827,0.00004986929,0.00025798313,0.000030994237,0.0000134738975,0.0006911563,0.000089238085,0.019666668,0.005934665,0.9618923,0.011316373,0.00002868065],"about_ca_topic_score_codex":0.00012654708,"about_ca_topic_score_gemma":0.00019328835,"teacher_disagreement_score":0.010989321,"about_ca_system_score_codex":0.00044981623,"about_ca_system_score_gemma":0.00042406077,"threshold_uncertainty_score":0.036762893},"labels":[],"label_agreement":null},{"id":"W2090338574","doi":"10.1016/j.disc.2008.07.031","title":"Spanning cubic graph designs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Cubic graph; Combinatorics; Mathematics; Graph; Discrete mathematics; Symmetric graph; Line graph; Voltage graph","score_opus":0.03203451386966064,"score_gpt":0.21934337109967816,"score_spread":0.18730885723001753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090338574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12633455,0.0006814623,0.70945233,0.0012952111,0.00030796867,0.000321396,0.00094816886,0.0010028499,0.15965615],"genre_scores_gemma":[0.70691615,0.00091681,0.23267108,0.000778999,0.00016651016,0.00040411318,0.0009934681,0.0002787688,0.05687405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992316,0.0002243702,0.000031452346,0.00016099369,0.0002317949,0.00011976845],"domain_scores_gemma":[0.99839574,0.00049475493,0.00016330012,0.00047206902,0.00033958963,0.00013459298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005381895,0.00049,0.00052313355,0.0008827338,0.0008934043,0.0014052498,0.00083380373,0.0009579777,0.014522293],"category_scores_gemma":[0.002970869,0.00038946627,0.00043012085,0.0014533229,0.00068649714,0.0015074235,0.0012965637,0.0012065805,0.0020882117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016554665,0.00007798972,0.00032370756,0.00017001801,0.000026969314,0.00008344572,0.00016085857,0.021103786,0.0071796603,0.8661077,0.011362214,0.09323827],"study_design_scores_gemma":[0.000114981565,0.00014964606,0.00039817442,0.00005376285,0.000040800925,0.0002570975,0.00014693216,0.12258096,0.0066700773,0.837946,0.031612363,0.00002910612],"about_ca_topic_score_codex":0.0011871114,"about_ca_topic_score_gemma":0.002232349,"teacher_disagreement_score":0.014522293,"about_ca_system_score_codex":0.00093518535,"about_ca_system_score_gemma":0.0011288642,"threshold_uncertainty_score":0.0485819},"labels":[],"label_agreement":null},{"id":"W2090735384","doi":"10.1016/j.disc.2009.06.034","title":"Blocking numbers and fixing numbers of convex bodies","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Peking University","keywords":"Mathematics; Blocking (statistics); Combinatorics; Regular polygon; Discrete mathematics; Geometry; Statistics","score_opus":0.04043078438145104,"score_gpt":0.32279426921063,"score_spread":0.28236348482917895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090735384","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31485868,0.0034592275,0.5350491,0.002837566,0.00039501715,0.0001301028,0.00044806834,0.00031783624,0.14250442],"genre_scores_gemma":[0.85884213,0.0034454982,0.08962131,0.0006747087,0.00050718116,0.00049484865,0.0007879794,0.00033832234,0.04528809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974232,0.0006367853,0.00011604544,0.0004525708,0.00078036415,0.00059109245],"domain_scores_gemma":[0.987761,0.0076149893,0.0014844431,0.0009772343,0.0008725845,0.001289739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037444064,0.0014393404,0.0019385231,0.0040270505,0.003707977,0.0060174153,0.0036001357,0.0021867268,0.010769332],"category_scores_gemma":[0.014978388,0.0014109637,0.0020716556,0.003150569,0.0103340475,0.010038798,0.004184856,0.0079131,0.0014300416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018395234,0.000005239522,0.00007606108,0.000014693637,0.0000042983384,0.00000858965,0.00007444183,0.0010165588,0.0003152154,0.99705625,0.00023031584,0.0011799894],"study_design_scores_gemma":[0.000017252314,0.000017010843,0.00019115476,0.000014910826,0.000014273347,0.000025439169,0.00008444965,0.0048782113,0.00047816316,0.9924521,0.0018139596,0.000013031153],"about_ca_topic_score_codex":0.0031857057,"about_ca_topic_score_gemma":0.0027411766,"teacher_disagreement_score":0.010769332,"about_ca_system_score_codex":0.0042057172,"about_ca_system_score_gemma":0.0016246152,"threshold_uncertainty_score":0.036027014},"labels":[],"label_agreement":null},{"id":"W2090816779","doi":"10.1016/j.disc.2009.10.001","title":"A note on the rank parity function","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Parity (physics); Combinatorics; Rank (graph theory); Discrete mathematics","score_opus":0.04614618136873212,"score_gpt":0.32470854157232665,"score_spread":0.27856236020359454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090816779","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04100498,0.015232293,0.22963504,0.07159913,0.0274029,0.000047594436,0.00054675114,0.0006294949,0.61390173],"genre_scores_gemma":[0.69189936,0.015730683,0.083281636,0.019639365,0.03718417,0.00017806397,0.00044122798,0.0011643803,0.15048116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991424,0.00028308606,0.000040328283,0.00014425511,0.00029699298,0.000092889735],"domain_scores_gemma":[0.9977342,0.0013213656,0.00012420634,0.0003895288,0.00025767495,0.00017312318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019604706,0.0008218862,0.0009157407,0.0015646397,0.002205198,0.0029731279,0.0014004717,0.0020712179,0.009157102],"category_scores_gemma":[0.0054829395,0.00032331934,0.0007719918,0.0011275235,0.006140143,0.007723524,0.0028278064,0.006430128,0.002474347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000088788665,0.000004613457,0.000038465154,0.000017067392,0.0000016762012,0.000039498846,0.000060099454,0.00010513767,0.00024352026,0.9905958,0.005080748,0.003804542],"study_design_scores_gemma":[0.000003364749,0.0000069707453,0.000050122253,0.000008719043,0.000002047221,0.00006108077,0.000013000357,0.00034334548,0.00013290042,0.98446876,0.014903117,0.0000066867156],"about_ca_topic_score_codex":0.0006275893,"about_ca_topic_score_gemma":0.0005293301,"teacher_disagreement_score":0.009157102,"about_ca_system_score_codex":0.00086618407,"about_ca_system_score_gemma":0.00078940846,"threshold_uncertainty_score":0.03063351},"labels":[],"label_agreement":null},{"id":"W2091988189","doi":"10.1016/j.disc.2008.04.063","title":"Edge-disjoint spanners in tori","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Torus; Spanner; Enhanced Data Rates for GSM Evolution; Graph; Discrete mathematics; Geometry; Computer science","score_opus":0.03796996279367364,"score_gpt":0.2981838599308869,"score_spread":0.26021389713721327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091988189","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8418901,0.00053147256,0.045247942,0.00067731517,0.00038596228,0.00011527372,0.0009806792,0.0006726774,0.10949854],"genre_scores_gemma":[0.9565314,0.00039693384,0.011258736,0.00019705592,0.00012693799,0.00010934759,0.0008700267,0.00015568602,0.030353984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996289,0.00005299225,0.000022180131,0.00008485195,0.00008449221,0.00012653205],"domain_scores_gemma":[0.9993556,0.00016054035,0.00012320706,0.00007905974,0.00007147666,0.00021007795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026295712,0.0007633821,0.00089295115,0.0017911086,0.0027845637,0.0021038505,0.0011452193,0.00094018347,0.013880073],"category_scores_gemma":[0.0011530316,0.0004890619,0.0005132163,0.0016836909,0.0017645924,0.002401652,0.0027233062,0.0012995574,0.0017024899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020802428,0.000060989827,0.0009500891,0.0001271998,0.000028171664,0.0004781327,0.0008111486,0.005609903,0.0023663754,0.96987313,0.0055468227,0.013939996],"study_design_scores_gemma":[0.00003615311,0.000051607873,0.00091431,0.000029388344,0.000033630884,0.0002480795,0.00066343026,0.009457795,0.0011551224,0.9811881,0.006202857,0.000019527948],"about_ca_topic_score_codex":0.0010441332,"about_ca_topic_score_gemma":0.0019401883,"teacher_disagreement_score":0.013880073,"about_ca_system_score_codex":0.0005368607,"about_ca_system_score_gemma":0.0003653101,"threshold_uncertainty_score":0.04643345},"labels":[],"label_agreement":null},{"id":"W2092204243","doi":"10.1016/j.disc.2009.12.012","title":"Broadcasts and domination in trees","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.01369033957713226,"score_gpt":0.2972594238184539,"score_spread":0.2835690842413216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092204243","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75882506,0.0032608157,0.15688457,0.006125349,0.00019563998,0.00009220937,0.00058782904,0.00031369514,0.07371476],"genre_scores_gemma":[0.97297746,0.0010690264,0.0090628425,0.00029981675,0.00028805636,0.000069926165,0.00020799907,0.00009078872,0.015934056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987569,0.0003976974,0.000061720624,0.00021433919,0.0002866267,0.0002827694],"domain_scores_gemma":[0.9785664,0.016843371,0.0014793329,0.0010710434,0.000987016,0.0010528376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015027376,0.00028337687,0.0011208897,0.0017407136,0.002450291,0.0040518106,0.0013178474,0.0012590482,0.0057040895],"category_scores_gemma":[0.012255068,0.0006995735,0.0006276844,0.0029691688,0.003696562,0.005298099,0.0019222943,0.002436048,0.0004581377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018638186,0.000050294624,0.0013104344,0.00010287135,0.00003339989,0.00014399356,0.0017246746,0.008240224,0.0019633304,0.9694249,0.0029325674,0.013886944],"study_design_scores_gemma":[0.000059599963,0.00001340551,0.0005532432,0.000015714686,0.00002745202,0.00013128064,0.00027371102,0.015833825,0.0005224392,0.9791819,0.0033744143,0.0000130768385],"about_ca_topic_score_codex":0.003587183,"about_ca_topic_score_gemma":0.0043620216,"teacher_disagreement_score":0.0057040895,"about_ca_system_score_codex":0.0021847156,"about_ca_system_score_gemma":0.0009955652,"threshold_uncertainty_score":0.01908201},"labels":[],"label_agreement":null},{"id":"W2092855545","doi":"10.1016/s0012-365x(01)00251-5","title":"Shifted quasi-symmetric functions and the Hopf algebra of peak functions","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Hopf algebra; Symmetric function; Quotient; Combinatorics; Subalgebra; Schubert polynomial; Pure mathematics; Algebra over a field","score_opus":0.03567777624807792,"score_gpt":0.27016336014146,"score_spread":0.23448558389338206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092855545","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68241644,0.002999362,0.16136056,0.0022039805,0.00066635356,0.00004435218,0.00026675922,0.0004164335,0.14962581],"genre_scores_gemma":[0.97288233,0.00082950183,0.0069813496,0.00024398917,0.00045998913,0.000021889295,0.0001042276,0.000063070904,0.018413562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996941,0.0000635255,0.000012470453,0.0000500337,0.00009466528,0.00008519196],"domain_scores_gemma":[0.9994167,0.00015447618,0.00008769312,0.00006209454,0.00011573385,0.0001633169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006868849,0.00058139965,0.00052965764,0.002082163,0.0014531777,0.0024710065,0.000979717,0.00077132706,0.0071019237],"category_scores_gemma":[0.0013839107,0.00030218644,0.00045020977,0.0013508956,0.0027979626,0.004745056,0.0013358422,0.0014831072,0.0010003619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000178084,0.000007259225,0.000060411192,0.000008676084,0.0000023899972,0.000028219589,0.00006633037,0.00034605598,0.0006626067,0.9960257,0.00026224664,0.002512254],"study_design_scores_gemma":[0.0000054537263,0.000008326003,0.0001124791,0.0000027605583,0.000002311007,0.000042830332,0.000046453773,0.001861205,0.0003659342,0.9966581,0.00088728743,0.000006895498],"about_ca_topic_score_codex":0.0012978048,"about_ca_topic_score_gemma":0.00087996124,"teacher_disagreement_score":0.0071019237,"about_ca_system_score_codex":0.0012398165,"about_ca_system_score_gemma":0.00077891356,"threshold_uncertainty_score":0.023758292},"labels":[],"label_agreement":null},{"id":"W2093085368","doi":"10.1016/s0012-365x(02)00757-4","title":"Idempotents for derangement numbers","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Derangement; Mathematics; Symmetric group; Combinatorics; Mathematical proof; Group (periodic table); Generating function; Function (biology); Discrete mathematics","score_opus":0.09211082856488614,"score_gpt":0.34019823681360245,"score_spread":0.2480874082487163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093085368","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23067322,0.003899182,0.29286674,0.004470396,0.003193494,0.00012738847,0.0006408571,0.0005176265,0.46361116],"genre_scores_gemma":[0.84189665,0.003232061,0.057859074,0.0010966863,0.0027028455,0.000307913,0.00068734796,0.00041216594,0.09180521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989548,0.00020342399,0.00007152577,0.0002149713,0.0003233312,0.0002319299],"domain_scores_gemma":[0.9983563,0.0008077878,0.00019835301,0.00015616923,0.00022522216,0.00025614843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002057862,0.002097138,0.0010561192,0.005510988,0.003991156,0.0059166895,0.001571591,0.0018280987,0.010873298],"category_scores_gemma":[0.0037430727,0.0008501326,0.0012012738,0.0036194546,0.005927039,0.009791446,0.0030631619,0.0074211378,0.0027804875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012977845,0.0000059888625,0.000026899053,0.000007123415,0.0000015389666,0.000036480422,0.000109089015,0.00006971556,0.00019933969,0.9973162,0.00041771674,0.0017970351],"study_design_scores_gemma":[0.000008091323,0.000008983498,0.000056691864,0.0000057398897,0.000003911921,0.00006182231,0.0000428276,0.00037778306,0.00020937211,0.99515754,0.004059322,0.000007800951],"about_ca_topic_score_codex":0.0005207627,"about_ca_topic_score_gemma":0.0005817223,"teacher_disagreement_score":0.010873298,"about_ca_system_score_codex":0.0019225441,"about_ca_system_score_gemma":0.00052513415,"threshold_uncertainty_score":0.036374748},"labels":[],"label_agreement":null},{"id":"W2093094658","doi":"10.1016/j.disc.2008.06.028","title":"Isonemal prefabrics with only parallel axes of symmetry","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Design Education and Practice","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Weaving; Combinatorics; Symmetry (geometry); Order (exchange); Discrete mathematics; Geometry","score_opus":0.022786645087648827,"score_gpt":0.24649249607275464,"score_spread":0.22370585098510581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093094658","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12508976,0.00033451567,0.31729054,0.0004041563,0.0022511834,0.0001606971,0.00025727405,0.0007766623,0.55343527],"genre_scores_gemma":[0.7635385,0.00030793258,0.110063426,0.0002971291,0.0003398392,0.00016214252,0.00041779975,0.0004851038,0.124388166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991386,0.00012579636,0.000053499713,0.0001853451,0.00037766504,0.000119037446],"domain_scores_gemma":[0.9993006,0.00007137361,0.00006457761,0.0002476247,0.00024773314,0.00006799115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041276624,0.00074223196,0.0005549502,0.0008039959,0.00095052214,0.0019051488,0.00067704514,0.0005625155,0.029513076],"category_scores_gemma":[0.0015156976,0.000289718,0.0003874294,0.0005713489,0.0016081915,0.0018404495,0.0016922052,0.0016862152,0.0053525013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030144895,0.000099006545,0.0010530778,0.00015026312,0.000015167775,0.00028788517,0.00042679417,0.0053306804,0.024852926,0.8304289,0.0094107045,0.12764314],"study_design_scores_gemma":[0.000150954,0.0011379799,0.004571756,0.00012897505,0.000040225674,0.0019008534,0.0013736009,0.033522792,0.03579891,0.5332464,0.38803712,0.000090461006],"about_ca_topic_score_codex":0.00049134984,"about_ca_topic_score_gemma":0.0005768921,"teacher_disagreement_score":0.029513076,"about_ca_system_score_codex":0.0003898067,"about_ca_system_score_gemma":0.00046062743,"threshold_uncertainty_score":0.0987311},"labels":[],"label_agreement":null},{"id":"W2093448135","doi":"10.1016/s0012-365x(00)00166-7","title":"On generalized constraints and certificates","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Calgary","keywords":"Mathematics; Boolean function; Boolean expression; Permutation (music); Constant (computer programming); Discrete mathematics; Parity function; Set (abstract data type); Complete Boolean algebra; Maximum satisfiability problem; Boolean network; Two-element Boolean algebra; Product term; Standard Boolean model; Combinatorics; And-inverter graph; Algebra over a field; Computer science; Pure mathematics","score_opus":0.02833773675154287,"score_gpt":0.2662817561944066,"score_spread":0.23794401944286372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093448135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064928666,0.0058444785,0.5473609,0.017119877,0.0019156912,0.00019813726,0.0011885539,0.00050931034,0.36093444],"genre_scores_gemma":[0.78793454,0.006950759,0.09676694,0.0028854515,0.0025271121,0.00032992242,0.0018229301,0.0005664516,0.10021591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99680364,0.0011751393,0.00017837774,0.000700958,0.0007706429,0.0003713218],"domain_scores_gemma":[0.9922937,0.00477941,0.00040328447,0.001302572,0.00082710886,0.00039389823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030383999,0.0014418537,0.0018933474,0.002677851,0.0039603775,0.005773769,0.0027913034,0.0023703622,0.0184717],"category_scores_gemma":[0.011837096,0.0012611942,0.0022099928,0.0059561403,0.010930274,0.026031038,0.007619566,0.008928055,0.0019308425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009523511,0.00000400687,0.000030315687,0.000017289674,0.0000031067013,0.00002381222,0.00009553015,0.00043240702,0.00003115693,0.9964336,0.0010286663,0.0018905585],"study_design_scores_gemma":[0.000004827728,0.000001973733,0.000019386696,0.000009588639,0.000003266193,0.000017839044,0.000030839423,0.00063597824,0.00003165252,0.9958299,0.0034114814,0.0000033265592],"about_ca_topic_score_codex":0.005264577,"about_ca_topic_score_gemma":0.0038024145,"teacher_disagreement_score":0.0184717,"about_ca_system_score_codex":0.003369726,"about_ca_system_score_gemma":0.0017490117,"threshold_uncertainty_score":0.061793923},"labels":[],"label_agreement":null},{"id":"W2093495451","doi":"10.1016/s0012-365x(99)00300-3","title":"On P4-transversals of perfect graphs","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Transversal (combinatorics); Conjecture; Graph; Discrete mathematics; Induced subgraph; Chordal graph; Split graph; 1-planar graph","score_opus":0.017158800873379818,"score_gpt":0.28878315858051556,"score_spread":0.2716243577071357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093495451","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82311,0.0005861828,0.09411328,0.0015359798,0.00033408226,0.00013457013,0.0010695965,0.000433505,0.07868272],"genre_scores_gemma":[0.9361876,0.0010990372,0.027250191,0.00049679325,0.0003077173,0.00016643379,0.0019526817,0.00030575797,0.0322339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861145,0.00034748003,0.000091627226,0.0002977228,0.00025794946,0.00039367308],"domain_scores_gemma":[0.9945052,0.002287437,0.0011456283,0.00047281824,0.0004814704,0.0011074294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013832801,0.0015119605,0.0012014867,0.0035551856,0.0031137457,0.003980175,0.0017598238,0.0019414538,0.011947135],"category_scores_gemma":[0.0051970324,0.0017361547,0.0018631065,0.0026244149,0.003607752,0.0058323774,0.004395958,0.003951164,0.0015345629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027967745,0.00004951391,0.0011435618,0.00010136744,0.000028846964,0.00045198668,0.00082065794,0.002695084,0.0025333585,0.9837107,0.002129632,0.0060556466],"study_design_scores_gemma":[0.000042571468,0.000047937436,0.0008035413,0.000046262572,0.000026809623,0.00024080503,0.00045711672,0.005048256,0.00086363824,0.9900601,0.002342819,0.000020240692],"about_ca_topic_score_codex":0.0025514099,"about_ca_topic_score_gemma":0.0030278896,"teacher_disagreement_score":0.011947135,"about_ca_system_score_codex":0.0019606114,"about_ca_system_score_gemma":0.0009323304,"threshold_uncertainty_score":0.03996712},"labels":[],"label_agreement":null},{"id":"W2093500811","doi":"10.1016/j.disc.2009.10.006","title":"Rooted directed path graphs are leaf powers","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft; Wilfrid Laurier University","keywords":"Mathematics; Combinatorics; Discrete mathematics; Graph; Pathwidth; Interval graph; Line graph","score_opus":0.018272626899669405,"score_gpt":0.28614597697249655,"score_spread":0.26787335007282714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093500811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12174988,0.00084566686,0.61173624,0.0017044486,0.00041854318,0.00021173188,0.0013596062,0.0014551362,0.26051873],"genre_scores_gemma":[0.7204345,0.0016737474,0.13265882,0.0010229798,0.0003761463,0.00029174087,0.0018097551,0.0010315194,0.14070074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934846,0.00012535903,0.000036576308,0.00021743627,0.00016943502,0.000102814774],"domain_scores_gemma":[0.99662423,0.0017600504,0.00030382,0.000519716,0.0004893019,0.00030298493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006062149,0.000522421,0.0006935479,0.0014112089,0.001302158,0.0027247986,0.0011046281,0.0009142212,0.019844811],"category_scores_gemma":[0.004557312,0.0007624632,0.0007167049,0.0017182792,0.0020946825,0.007049101,0.001659436,0.0030299358,0.0052967723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033503104,0.000023124076,0.00020341687,0.00008399938,0.000010246051,0.00012832964,0.0003231466,0.0005340006,0.0016311635,0.9759902,0.0038360192,0.01720285],"study_design_scores_gemma":[0.000013458769,0.0000086761365,0.00012125271,0.000019208765,0.000012917547,0.00014916329,0.0000951208,0.002272592,0.00090573117,0.98388994,0.012506138,0.000005725942],"about_ca_topic_score_codex":0.00049086835,"about_ca_topic_score_gemma":0.00079367845,"teacher_disagreement_score":0.019844811,"about_ca_system_score_codex":0.00067599234,"about_ca_system_score_gemma":0.0004538024,"threshold_uncertainty_score":0.066387475},"labels":[],"label_agreement":null},{"id":"W2094159810","doi":"10.1016/j.disc.2013.11.010","title":"A simple combinatorial interpretation of certain generalized Bell and Stirling numbers","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stirling number; Bell polynomials; Stirling numbers of the first kind; Stirling numbers of the second kind; Interpretation (philosophy); Simple (philosophy); Mathematics; Combinatorics; Generalization; Series (stratigraphy); Natural number; Discrete mathematics; Computer science","score_opus":0.0200517363745567,"score_gpt":0.30154425982799915,"score_spread":0.28149252345344244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094159810","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30168006,0.0025736163,0.22919185,0.0064137415,0.00116788,0.00013353753,0.0006294,0.00064396486,0.4575659],"genre_scores_gemma":[0.9062163,0.0012883375,0.051131647,0.0015685257,0.001074014,0.00015352332,0.00035662233,0.00019589002,0.03801512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994991,0.0001346749,0.00002680606,0.00009458888,0.00013931896,0.00010554285],"domain_scores_gemma":[0.99900264,0.00038334334,0.00015177458,0.00017307681,0.00015550813,0.00013370182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009066923,0.0007687053,0.000759996,0.0022811268,0.0023602713,0.0033396867,0.001663662,0.0017663413,0.0119445305],"category_scores_gemma":[0.003041537,0.00047081048,0.00089713885,0.0024691077,0.0048810053,0.005135,0.0017651754,0.0027704572,0.0010217767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046362748,0.0000022523109,0.000018349241,0.000009595204,9.182105e-7,0.000021330485,0.000042351086,0.000068545356,0.00017333517,0.9985436,0.00036748918,0.0007476049],"study_design_scores_gemma":[0.0000051655493,0.000004038348,0.000055939126,0.000004966135,0.0000025981467,0.00006530373,0.00003572328,0.00066212256,0.00012105747,0.9967656,0.0022698068,0.000007543979],"about_ca_topic_score_codex":0.00090639293,"about_ca_topic_score_gemma":0.0012197973,"teacher_disagreement_score":0.0119445305,"about_ca_system_score_codex":0.0011892341,"about_ca_system_score_gemma":0.0006083742,"threshold_uncertainty_score":0.039958417},"labels":[],"label_agreement":null},{"id":"W2094278957","doi":"10.1016/j.disc.2010.11.007","title":"Well-covered circulant graphs","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Circulant matrix; Lexicographical order; Mathematics; Combinatorics; Circulant graph; Discrete mathematics; Characterization (materials science); Graph; Line graph; Voltage graph","score_opus":0.016664478147683726,"score_gpt":0.28505904869301746,"score_spread":0.2683945705453337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094278957","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7313993,0.0015563478,0.14117384,0.0028888115,0.00036742038,0.00012394965,0.0013188842,0.0007519973,0.12041948],"genre_scores_gemma":[0.9413505,0.0014566925,0.022783436,0.00078383496,0.00065695134,0.00019195434,0.0014402756,0.00033294357,0.031003492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989291,0.0002613,0.00003886857,0.00019460436,0.00032747744,0.00024864892],"domain_scores_gemma":[0.99500835,0.0024777234,0.0005577991,0.0005138785,0.0006411423,0.0008011246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007153848,0.0010328871,0.0012684816,0.0027444242,0.0019999994,0.0030836524,0.0012123967,0.0017918497,0.008848225],"category_scores_gemma":[0.0049973927,0.00083574106,0.0006699548,0.0021685183,0.0017060157,0.0039410093,0.0017444721,0.0025298514,0.0013933297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000929766,0.000040797517,0.0003192161,0.000069362126,0.000018450733,0.00017468478,0.00017886722,0.002230983,0.0031497194,0.9837104,0.0046991096,0.005315349],"study_design_scores_gemma":[0.000041321662,0.00002690437,0.00063743646,0.000023822726,0.000027750943,0.0003820977,0.00010525785,0.018269317,0.0018769521,0.97303253,0.005555863,0.00002075241],"about_ca_topic_score_codex":0.0011575625,"about_ca_topic_score_gemma":0.0014163076,"teacher_disagreement_score":0.008848225,"about_ca_system_score_codex":0.0011036567,"about_ca_system_score_gemma":0.0007013769,"threshold_uncertainty_score":0.029600263},"labels":[],"label_agreement":null},{"id":"W2094589803","doi":"10.1016/j.disc.2004.03.018","title":"On automorphism groups of circulant digraphs of square-free order","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Wreath product; Circulant matrix; Combinatorics; Digraph; Automorphism group; Degree (music); Automorphism; Order (exchange); Free product; Discrete mathematics; Product (mathematics); Direct product; Group (periodic table); Permutation group; Permutation (music)","score_opus":0.043856239545983874,"score_gpt":0.3194297307008574,"score_spread":0.2755734911548735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094589803","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87265605,0.00071933167,0.048285935,0.00085003866,0.0002893975,0.00008209923,0.0002495593,0.00026038158,0.07660718],"genre_scores_gemma":[0.9726643,0.0005734815,0.006280884,0.00028010123,0.00023501922,0.000051150124,0.00032090768,0.00008655576,0.019507648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949086,0.000102877886,0.000024069033,0.00011011953,0.000105643194,0.00016638022],"domain_scores_gemma":[0.9976332,0.0010777551,0.00033893378,0.00027055317,0.00019853002,0.00048105497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005347222,0.0007785974,0.0009116304,0.0019689465,0.0026428895,0.003209168,0.0009210272,0.0010282712,0.004565162],"category_scores_gemma":[0.0022402776,0.000581113,0.0009994311,0.0016273655,0.0034353782,0.0029467638,0.0016810618,0.0017920586,0.0006193736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046694055,0.000026438509,0.0003518451,0.000018235796,0.0000055728965,0.00012330164,0.0006396427,0.0011544107,0.0010158592,0.99374133,0.00044404343,0.002432626],"study_design_scores_gemma":[0.000020576725,0.00002242568,0.00036426086,0.000011314064,0.0000090294125,0.000063226944,0.00019405228,0.0031139387,0.00042605502,0.9934862,0.002276776,0.00001214717],"about_ca_topic_score_codex":0.0047152555,"about_ca_topic_score_gemma":0.005514512,"teacher_disagreement_score":0.0047152555,"about_ca_system_score_codex":0.0019087273,"about_ca_system_score_gemma":0.00096604537,"threshold_uncertainty_score":0.015271962},"labels":[],"label_agreement":null},{"id":"W2094803507","doi":"10.1016/s0012-365x(03)00241-3","title":"Analysis of greedy algorithms on graphs with bounded degrees","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Heuristics; Combinatorics; Bounded function; Sequence (biology); Greedy algorithm; Algorithm; Random graph; Discrete mathematics; Mathematical optimization; Graph","score_opus":0.028575948934962812,"score_gpt":0.2982504229598212,"score_spread":0.2696744740248584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094803507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30260807,0.003397885,0.65959656,0.0051870523,0.000179288,0.00032639736,0.0006274523,0.0010358735,0.027041443],"genre_scores_gemma":[0.8775885,0.0027599917,0.098916054,0.0010100469,0.0005197013,0.00053376984,0.0011249897,0.0009913264,0.016555501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950393,0.0020561912,0.00015007844,0.00063867547,0.0011064239,0.0010093472],"domain_scores_gemma":[0.9196687,0.06784895,0.004102525,0.0027192403,0.0028857242,0.0027747932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061975494,0.0026773685,0.0028653746,0.00407968,0.0021552795,0.005795953,0.006384124,0.003902176,0.009709852],"category_scores_gemma":[0.05447374,0.001860767,0.0019369317,0.0043906104,0.0060759094,0.010511411,0.0041639204,0.004039643,0.0010367379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075796404,0.00027541662,0.002438786,0.00045319228,0.00014252117,0.00014620725,0.0004942596,0.35877007,0.002458944,0.6050373,0.0071131075,0.021912156],"study_design_scores_gemma":[0.00009701376,0.00008046927,0.00046065188,0.000058430698,0.000054604963,0.00007752993,0.00014514117,0.5729127,0.0006120493,0.4243514,0.0011263221,0.000023718307],"about_ca_topic_score_codex":0.0038024345,"about_ca_topic_score_gemma":0.0036406105,"teacher_disagreement_score":0.009709852,"about_ca_system_score_codex":0.0065399376,"about_ca_system_score_gemma":0.004783081,"threshold_uncertainty_score":0.04745084},"labels":[],"label_agreement":null},{"id":"W2095991286","doi":"10.1016/j.disc.2008.05.005","title":"Linear-time certifying algorithms for near-graphical sequences","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Simon Fraser University","funders":"","keywords":"Mathematics; Algorithm; Combinatorics; Discrete mathematics; Time complexity","score_opus":0.06133415210901777,"score_gpt":0.3142347807293254,"score_spread":0.25290062862030765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095991286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03717007,0.00025416518,0.95369613,0.0007684045,0.00016306022,0.00015768764,0.0002984232,0.002523664,0.0049684625],"genre_scores_gemma":[0.5257197,0.00038980614,0.46217692,0.0006274426,0.00029558447,0.0003619205,0.001895149,0.00067384844,0.007859708],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995456,0.0010466338,0.00035842252,0.0012150727,0.0013679524,0.00055588444],"domain_scores_gemma":[0.97178763,0.01866377,0.001662006,0.0049250512,0.0020441746,0.0009173092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032356787,0.0015442938,0.0021982412,0.0016397405,0.0014109027,0.0033747053,0.0033203776,0.0024063943,0.010602424],"category_scores_gemma":[0.03054054,0.0008438303,0.0017088214,0.0022600053,0.0025268137,0.007183197,0.005273844,0.005606787,0.0025202853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012906777,0.00043243522,0.0020746381,0.00072353246,0.00014067785,0.00022773723,0.00057481136,0.20647147,0.009926606,0.32663283,0.0162037,0.43530086],"study_design_scores_gemma":[0.00015779886,0.00020022168,0.0002457818,0.000046275065,0.00004470345,0.00022059605,0.00009874321,0.45385745,0.0053587183,0.5374016,0.0023291702,0.000038980226],"about_ca_topic_score_codex":0.0012201332,"about_ca_topic_score_gemma":0.0017645378,"teacher_disagreement_score":0.010602424,"about_ca_system_score_codex":0.0018306734,"about_ca_system_score_gemma":0.0026953046,"threshold_uncertainty_score":0.035468638},"labels":[],"label_agreement":null},{"id":"W2098101530","doi":"10.1016/s0012-365x(03)00128-6","title":"Simply connected incidence algebras","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Universidad Nacional del Sur; Consejo Nacional de Investigaciones Científicas y Técnicas","keywords":"Mathematics; Incidence (geometry); Converse; Incidence algebra; Partially ordered set; Quiver; Combinatorics; Strongly connected component; Simply connected space; Discrete mathematics; Pure mathematics; Algebra over a field; Algebra representation; Cellular algebra; Geometry","score_opus":0.029255388882786837,"score_gpt":0.2962791128912523,"score_spread":0.26702372400846547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098101530","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23868869,0.0016448643,0.10628338,0.002998116,0.0005110184,0.00010292396,0.0006408212,0.00043676005,0.6486934],"genre_scores_gemma":[0.8680271,0.0017673594,0.0135645,0.0006153826,0.00072666595,0.0001373251,0.00085871393,0.00009780126,0.11420516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994754,0.00009408957,0.000027435472,0.00011191521,0.00021350115,0.00007767207],"domain_scores_gemma":[0.99932885,0.00019964694,0.00010999285,0.000085986634,0.00016491408,0.00011072282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043702748,0.00073583185,0.00063976797,0.0020612502,0.002339969,0.0043621645,0.0007915711,0.00087494316,0.013460706],"category_scores_gemma":[0.0014768823,0.0004050234,0.00047488417,0.0023560636,0.0027560492,0.0057287365,0.0017296143,0.002721948,0.0018761462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040090604,0.0000075750504,0.00004999619,0.000005499138,0.0000013832117,0.0000131865645,0.00007625661,0.000090191534,0.00012561168,0.99749386,0.0006297957,0.0015025544],"study_design_scores_gemma":[0.0000032531193,0.0000025334643,0.00007735249,0.000002602766,0.0000036547767,0.000044453824,0.000038909257,0.00044473377,0.00014924807,0.9951239,0.0041060233,0.000003310455],"about_ca_topic_score_codex":0.0009464384,"about_ca_topic_score_gemma":0.00095555023,"teacher_disagreement_score":0.013460706,"about_ca_system_score_codex":0.0012863366,"about_ca_system_score_gemma":0.00081524014,"threshold_uncertainty_score":0.045030534},"labels":[],"label_agreement":null},{"id":"W2100075407","doi":"10.1016/j.disc.2009.11.037","title":"Locally toroidal polytopes and modular linear groups","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Coxeter group; Polytope; Combinatorics; Quotient; Prime (order theory); Integer (computer science); Group (periodic table); Modulo; Automorphism; Euclidean geometry; Polyhedron; Discrete mathematics; Geometry","score_opus":0.021833471607629988,"score_gpt":0.29969325283046083,"score_spread":0.27785978122283084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100075407","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7050451,0.0022963108,0.085845895,0.004584483,0.0007393217,0.000093119466,0.00044779648,0.00030106583,0.20064689],"genre_scores_gemma":[0.9587861,0.00096285244,0.0061070044,0.00035979305,0.0006146265,0.00007236157,0.00030356017,0.00004835721,0.032745477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966156,0.000070520735,0.000013598616,0.000077659715,0.000089397974,0.000087248656],"domain_scores_gemma":[0.99944633,0.00015812696,0.00015067587,0.000054989854,0.000058767295,0.00013103962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040315438,0.0007300548,0.0006128668,0.0014681574,0.0018852546,0.0026919972,0.00073913997,0.0007183258,0.009798661],"category_scores_gemma":[0.0010781607,0.00037437282,0.00049660174,0.00110991,0.0036473174,0.0029397055,0.001817759,0.0026103423,0.0012471689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039286824,0.000017939059,0.00014720601,0.00002082621,0.00000572912,0.00005897561,0.00024333787,0.0006719793,0.00057457783,0.993602,0.0009506705,0.0036676228],"study_design_scores_gemma":[0.000019601408,0.000019513784,0.00028233472,0.000009122102,0.000007939786,0.00006974752,0.00019858932,0.0014171205,0.00025704218,0.99368906,0.0040196897,0.000010108866],"about_ca_topic_score_codex":0.000973797,"about_ca_topic_score_gemma":0.0011441436,"teacher_disagreement_score":0.009798661,"about_ca_system_score_codex":0.0013214037,"about_ca_system_score_gemma":0.00041321485,"threshold_uncertainty_score":0.032779813},"labels":[],"label_agreement":null},{"id":"W2101758859","doi":"10.1016/j.disc.2005.11.031","title":"Efficient computation of 2-medians in a tree network with positive/negative weights","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Queen's University","funders":"","keywords":"Mathematics; Median; Combinatorics; Computation; Tree (set theory); Discrete mathematics; Algorithm","score_opus":0.00960064485197893,"score_gpt":0.21025245240602075,"score_spread":0.20065180755404183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101758859","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13559288,0.00020547272,0.8579555,0.0005078767,0.000056738652,0.00007674762,0.00067997584,0.0010958404,0.0038289225],"genre_scores_gemma":[0.4654646,0.00012571776,0.5292298,0.000087764136,0.000044749595,0.00010196472,0.00094874675,0.0002616682,0.0037349574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995382,0.000115796596,0.000030720224,0.00012474234,0.00010880999,0.00008177667],"domain_scores_gemma":[0.9974552,0.0018199859,0.00019007726,0.00017444835,0.00020738174,0.00015293382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010424799,0.0007846498,0.0012401171,0.001431892,0.00090557814,0.0021534376,0.0016173227,0.0016404471,0.006365148],"category_scores_gemma":[0.0067371544,0.000868103,0.00087119796,0.0015370542,0.00076849357,0.0028633578,0.0017306366,0.001221172,0.0006763367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034528636,0.000081975944,0.00192699,0.00014963474,0.000056190358,0.00009970504,0.00015829346,0.88444126,0.0023846035,0.041861493,0.0030849501,0.06540963],"study_design_scores_gemma":[0.000012257726,0.000012047541,0.000116950156,0.000005580518,0.000005052813,0.000010775931,0.000024539228,0.9772215,0.000452083,0.021869643,0.00026557522,0.0000039283136],"about_ca_topic_score_codex":0.0071825106,"about_ca_topic_score_gemma":0.013171541,"teacher_disagreement_score":0.0071825106,"about_ca_system_score_codex":0.0016266915,"about_ca_system_score_gemma":0.0012110681,"threshold_uncertainty_score":0.02129352},"labels":[],"label_agreement":null},{"id":"W2102027040","doi":"10.1016/s0012-365x(00)00265-x","title":"Using simulated annealing to construct extremal graphs","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Combinatorics; Mathematics; Girth (graph theory); Discrete mathematics; Graph","score_opus":0.08826871707175327,"score_gpt":0.3565440002992728,"score_spread":0.26827528322751953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102027040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12716573,0.00030602256,0.85993177,0.0003605225,0.000080815465,0.000084731044,0.00006434967,0.0004601572,0.01154595],"genre_scores_gemma":[0.58969325,0.0002162297,0.40551144,0.00010387565,0.000025599922,0.00014485637,0.00015856451,0.00030050823,0.0038456344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938226,0.00031455664,0.000023520153,0.000109531014,0.00011423308,0.000055935343],"domain_scores_gemma":[0.99679166,0.0022807908,0.00017354751,0.00043995815,0.00018261783,0.0001313052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012101982,0.00059736805,0.00091012416,0.0016371141,0.0011557896,0.0012565838,0.0012275014,0.0012758548,0.0025249093],"category_scores_gemma":[0.0066871573,0.0009888884,0.0012247872,0.00075106544,0.002719794,0.0020184857,0.0020548296,0.0022682727,0.0002976345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008057441,0.00007754805,0.00056115387,0.00008488575,0.000057280453,0.00007438099,0.00023147168,0.51301676,0.0026423417,0.462977,0.0008731174,0.019323427],"study_design_scores_gemma":[0.00001648675,0.00002096128,0.000079542944,0.000016008822,0.000011603063,0.000016333164,0.00003271198,0.67911845,0.0008717965,0.31896,0.00084593764,0.000010248138],"about_ca_topic_score_codex":0.001595429,"about_ca_topic_score_gemma":0.0030133992,"teacher_disagreement_score":0.0025249093,"about_ca_system_score_codex":0.0015982441,"about_ca_system_score_gemma":0.0007145876,"threshold_uncertainty_score":0.011596084},"labels":[],"label_agreement":null},{"id":"W2102693912","doi":"10.1016/j.disc.2005.02.007","title":"Altitude of regular graphs with girth at least five","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Girth (graph theory); Altitude (triangle); Discrete mathematics; Graph; Geometry","score_opus":0.015220925666949678,"score_gpt":0.26418970163527294,"score_spread":0.24896877596832326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102693912","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9411,0.0003639101,0.013497182,0.0003847166,0.00006721357,0.000022085536,0.00041059748,0.00026324467,0.04389103],"genre_scores_gemma":[0.9925909,0.00015689504,0.002558644,0.000042782496,0.00005454807,0.000011446847,0.00034526474,0.000035001674,0.0042045014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997807,0.000040305047,0.000007929423,0.000035563513,0.00006509984,0.000070355556],"domain_scores_gemma":[0.99905246,0.00035767868,0.00017849004,0.00007679682,0.00007985492,0.00025466963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001658448,0.00024068853,0.00048381631,0.0012874275,0.0010195684,0.0012589685,0.0006493921,0.00046065418,0.004058522],"category_scores_gemma":[0.0015231458,0.00024776853,0.000311268,0.0006212747,0.0010460354,0.0013936774,0.0011429643,0.00096792245,0.00044760806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005428279,0.00010560709,0.009245384,0.00021105119,0.00004557208,0.0007230775,0.0014327186,0.018336218,0.015282558,0.92376953,0.0059266207,0.024378764],"study_design_scores_gemma":[0.000068475376,0.00014929037,0.012780016,0.000045820052,0.000037407262,0.0013211954,0.0008169827,0.047817297,0.0055234283,0.9174703,0.013925795,0.000043994256],"about_ca_topic_score_codex":0.0011049638,"about_ca_topic_score_gemma":0.0009449828,"teacher_disagreement_score":0.004058522,"about_ca_system_score_codex":0.0005093987,"about_ca_system_score_gemma":0.00022751969,"threshold_uncertainty_score":0.013577044},"labels":[],"label_agreement":null},{"id":"W2102761613","doi":"10.1016/j.disc.2009.04.032","title":"Homomorphisms of triangle-free graphs without a <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si4.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>-minor","year":2009,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Univerzita Karlova v Praze","keywords":"Mathematics; Homomorphism; Combinatorics; Conjecture; Graph; Minor (academic); Graph homomorphism; Discrete mathematics; Planar graph; Graph minor; Line graph; Graph power","score_opus":0.023136840028414683,"score_gpt":0.26391603190692375,"score_spread":0.24077919187850907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102761613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37283084,0.00073941617,0.39354065,0.0012737875,0.0010578651,0.00031523398,0.0018971325,0.003134185,0.22521089],"genre_scores_gemma":[0.88146275,0.00049306825,0.045991857,0.0005678775,0.00033724948,0.00022463579,0.00245959,0.0007056749,0.06775733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990269,0.00020047385,0.00006612963,0.00031198765,0.00020780916,0.00018669401],"domain_scores_gemma":[0.99683577,0.0011848366,0.00035311276,0.0005900389,0.000512957,0.0005232004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007060476,0.00045438783,0.00030013183,0.0012863067,0.0012457756,0.0015507732,0.0011264891,0.00058294256,0.021787105],"category_scores_gemma":[0.0038258808,0.00044653792,0.00092999043,0.0008839049,0.0011533409,0.0039597643,0.0016625988,0.0012572209,0.0032820767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024397619,0.0001348969,0.0009620803,0.00018856218,0.000027719818,0.000552334,0.0011993626,0.0010173598,0.0063852244,0.9451531,0.00896286,0.03517258],"study_design_scores_gemma":[0.00009564705,0.00015466425,0.001640187,0.000057647267,0.000059403555,0.0016130899,0.00074907625,0.0067198174,0.010089272,0.93947214,0.03929229,0.000056703862],"about_ca_topic_score_codex":0.0010703192,"about_ca_topic_score_gemma":0.0011056866,"teacher_disagreement_score":0.021787105,"about_ca_system_score_codex":0.00074463186,"about_ca_system_score_gemma":0.0005153271,"threshold_uncertainty_score":0.072885156},"labels":[],"label_agreement":null},{"id":"W2102857168","doi":"10.1016/s0012-365x(99)00247-2","title":"Extremal properties of ray-nonsingular matrices","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Invertible matrix; Mathematics; Matrix (chemical analysis); Combinatorics; Square matrix; Order (exchange); Square (algebra); Row; Involutory matrix; Pure mathematics; Discrete mathematics; Symmetric matrix; Eigenvalues and eigenvectors; Computer science; Geometry; Physics","score_opus":0.011510298309909744,"score_gpt":0.1873934737358378,"score_spread":0.17588317542592807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102857168","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61940634,0.0010972684,0.3218166,0.0012263232,0.00009346441,0.000056119763,0.00044829518,0.00034501855,0.055510525],"genre_scores_gemma":[0.98215336,0.00048653944,0.010994979,0.00009755514,0.00015341227,0.00003125564,0.00019958534,0.000070867834,0.0058125067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994361,0.00017098275,0.000021787331,0.00010294468,0.0001631342,0.000105013525],"domain_scores_gemma":[0.99387383,0.0035042034,0.0010390541,0.00036312357,0.000683037,0.00053674524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007867294,0.00079950056,0.0005921851,0.0026914557,0.0007919129,0.002455809,0.0008428973,0.00087005063,0.006960581],"category_scores_gemma":[0.007124255,0.0005077239,0.00032040427,0.0012929462,0.0020124842,0.0024617012,0.0010635605,0.0018152178,0.00062332203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015542719,0.00004041497,0.0009578729,0.00006727209,0.000022416409,0.00020495993,0.00027125212,0.014266638,0.006400437,0.9674895,0.0015204966,0.008603453],"study_design_scores_gemma":[0.000030750944,0.000076784265,0.0015134505,0.00003703358,0.000018075338,0.0003070319,0.00022345867,0.12796597,0.0032887124,0.8645447,0.0019520138,0.00004208602],"about_ca_topic_score_codex":0.0006631255,"about_ca_topic_score_gemma":0.00068122434,"teacher_disagreement_score":0.006960581,"about_ca_system_score_codex":0.000789557,"about_ca_system_score_gemma":0.00039937146,"threshold_uncertainty_score":0.023285449},"labels":[],"label_agreement":null},{"id":"W2104170615","doi":"10.1016/j.disc.2007.04.044","title":"The reconstruction conjecture and edge ideals","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Betti number; Conjecture; Hilbert series and Hilbert polynomial; Vertex (graph theory); Discrete mathematics; Monomial ideal; Algebraic number; Simple graph; Krull dimension; Ideal (ethics); Graph; Pure mathematics; Hilbert space; Algebra over a field; Noetherian; Polynomial ring","score_opus":0.02916167738349223,"score_gpt":0.32663152882984064,"score_spread":0.2974698514463484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104170615","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48541364,0.007270951,0.16608196,0.04326538,0.0012329171,0.000055097906,0.0005510587,0.000483993,0.29564503],"genre_scores_gemma":[0.9659407,0.0018465986,0.010526631,0.0014474007,0.0008764248,0.000023088602,0.00049369864,0.00006860664,0.01877681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989145,0.0003873466,0.000040916148,0.00024377767,0.00023219782,0.00018118162],"domain_scores_gemma":[0.9950976,0.0030601854,0.00033185576,0.0007765855,0.00044869087,0.00028512534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00216861,0.0005153656,0.0010090464,0.0011094613,0.0020384165,0.0037567432,0.001227405,0.0025055655,0.009779058],"category_scores_gemma":[0.00750868,0.000529612,0.0007074269,0.0014915222,0.007347329,0.013901426,0.003003422,0.0043897307,0.0009683768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055115597,0.000014394074,0.0002709195,0.000022282882,0.0000035672474,0.000033514178,0.00009388891,0.00040779595,0.00013590598,0.9942689,0.001409541,0.0032841437],"study_design_scores_gemma":[0.000014690883,0.000006374066,0.000135735,0.000008387281,0.0000030844906,0.000045480923,0.00008012338,0.0012226313,0.00018018151,0.99593145,0.0023672886,0.000004488746],"about_ca_topic_score_codex":0.00091380096,"about_ca_topic_score_gemma":0.0006046653,"teacher_disagreement_score":0.009779058,"about_ca_system_score_codex":0.00097031845,"about_ca_system_score_gemma":0.0005610687,"threshold_uncertainty_score":0.032714248},"labels":[],"label_agreement":null},{"id":"W2104859703","doi":"10.1016/j.disc.2006.04.031","title":"Construction of trees and graphs with equal domination parameters","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Constructive; Domination analysis; Characterization (materials science); Combinatorics; Simple (philosophy); Discrete mathematics; Constructive proof; Tree (set theory); Graph; Process (computing); Computer science; Vertex (graph theory)","score_opus":0.012808463335140137,"score_gpt":0.2573611950184089,"score_spread":0.24455273168326874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104859703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22113085,0.00034914608,0.7187222,0.00084823364,0.0001496048,0.00017309454,0.00044541623,0.000863089,0.057318356],"genre_scores_gemma":[0.7036509,0.00043119662,0.2769017,0.00032616634,0.000071872746,0.00022688622,0.00059348205,0.0005689798,0.017228799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993481,0.00016923794,0.00003402335,0.00012687345,0.00018077827,0.00014092312],"domain_scores_gemma":[0.997827,0.00088685733,0.00017542961,0.0005129531,0.0002761022,0.00032160638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064454443,0.00047235147,0.000699049,0.0012203,0.0014078773,0.0020810033,0.0013207827,0.001223971,0.005246314],"category_scores_gemma":[0.003006243,0.00072473637,0.0008313555,0.0013458405,0.0015983081,0.0025085767,0.0025300775,0.0024928534,0.0010988577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084238614,0.00005318186,0.00051577954,0.00007161091,0.000014478354,0.00018025126,0.00042721396,0.0041359165,0.0093361335,0.9595935,0.001845449,0.023742225],"study_design_scores_gemma":[0.000039576313,0.000023071672,0.00039183427,0.000029851552,0.000026944312,0.00023402402,0.00018053132,0.014131826,0.0068487595,0.9678124,0.010256561,0.000024595223],"about_ca_topic_score_codex":0.00044176134,"about_ca_topic_score_gemma":0.0009597236,"teacher_disagreement_score":0.005246314,"about_ca_system_score_codex":0.00093354634,"about_ca_system_score_gemma":0.0007449108,"threshold_uncertainty_score":0.017550647},"labels":[],"label_agreement":null},{"id":"W2106210406","doi":"10.1016/j.disc.2007.07.029","title":"Graphs with the n-e.c. adjacency property constructed from affine planes","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; Wilfrid Laurier University; Sackville Memorial Hospital","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund","keywords":"Mathematics; Adjacency list; Affine transformation; Combinatorics; Property (philosophy); Discrete mathematics; Affine plane (incidence geometry); Pure mathematics; Geometry; Plane (geometry)","score_opus":0.02013294716597633,"score_gpt":0.2593920561754373,"score_spread":0.23925910900946099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106210406","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6576432,0.0006282274,0.20302264,0.0009022436,0.00015352058,0.00006483703,0.0006213733,0.00033051267,0.13663343],"genre_scores_gemma":[0.9541181,0.0005844447,0.028985197,0.00019952162,0.00008033681,0.00006641964,0.00055696984,0.00008756262,0.015321594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969614,0.00007836024,0.000018098313,0.000064486645,0.00007349038,0.000069394606],"domain_scores_gemma":[0.9990994,0.00031867463,0.00018822092,0.00013029568,0.00015232264,0.0001111313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022325176,0.00035145518,0.00035677856,0.0016190968,0.0011984217,0.0018700643,0.00060692657,0.0007798668,0.004651161],"category_scores_gemma":[0.0017135311,0.00028827754,0.00034669405,0.0013808083,0.0015992784,0.0026271597,0.001190415,0.0013300292,0.0009525606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021825404,0.000011546811,0.0002012282,0.00001619194,0.00000320116,0.00006954406,0.000094091505,0.0021114657,0.0015370955,0.98807764,0.0007929713,0.007063276],"study_design_scores_gemma":[0.000009016785,0.000013584785,0.0003508718,0.000012049647,0.000005420221,0.00014073856,0.0001344754,0.007622453,0.001357403,0.9856764,0.0046672123,0.000010258383],"about_ca_topic_score_codex":0.0013024725,"about_ca_topic_score_gemma":0.0012267289,"teacher_disagreement_score":0.004651161,"about_ca_system_score_codex":0.00059357914,"about_ca_system_score_gemma":0.0003272684,"threshold_uncertainty_score":0.015559673},"labels":[],"label_agreement":null},{"id":"W2106280765","doi":"10.1016/j.disc.2005.04.004","title":"Edge-disjoint spanners in Cartesian products of graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Cartesian product; Mathematics; Disjoint sets; Hypercube; Discrete mathematics; Graph; Cograph; Chordal graph; 1-planar graph","score_opus":0.021931015845525842,"score_gpt":0.2876060824299282,"score_spread":0.2656750665844023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106280765","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8358892,0.00065819535,0.13690558,0.0002941242,0.000118890835,0.00005324591,0.00034981835,0.0002866417,0.025444388],"genre_scores_gemma":[0.93170255,0.0007918149,0.049190722,0.00014027358,0.0001313688,0.000091328606,0.0006985926,0.00013904677,0.017114246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99903286,0.00022356227,0.00009773448,0.00027016565,0.00022626552,0.00014942136],"domain_scores_gemma":[0.9964205,0.0016276977,0.0006196915,0.00035765374,0.00043848052,0.0005360313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009498513,0.0005868878,0.00080961734,0.0018047531,0.0014428763,0.002316423,0.0009406373,0.00074903696,0.005752534],"category_scores_gemma":[0.003062405,0.0008932801,0.0006021039,0.002038591,0.0019403415,0.004371409,0.0024746058,0.0011603157,0.0008522734],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001868931,0.000072802315,0.00217208,0.00013527411,0.000035805362,0.00040406402,0.0014086297,0.002840673,0.0035670858,0.9684863,0.0014785456,0.019211713],"study_design_scores_gemma":[0.000018903163,0.000066228735,0.0009186964,0.000025503787,0.00003307105,0.00038509656,0.00039802643,0.0044550207,0.0016481281,0.98775357,0.0042835157,0.000014364799],"about_ca_topic_score_codex":0.00049192813,"about_ca_topic_score_gemma":0.00092388503,"teacher_disagreement_score":0.005752534,"about_ca_system_score_codex":0.00037407991,"about_ca_system_score_gemma":0.0003675813,"threshold_uncertainty_score":0.019244134},"labels":[],"label_agreement":null},{"id":"W2106547329","doi":"10.1016/j.disc.2009.03.049","title":"Random maximal independent sets and the unfriendly theater seating arrangement problem","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Toronto; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Mathematics; Combinatorics; Freedman; Limit (mathematics); Discrete mathematics; Mathematical analysis; Law","score_opus":0.02337288482308188,"score_gpt":0.2941904887986892,"score_spread":0.27081760397560733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106547329","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4919592,0.0012738089,0.42230913,0.012785268,0.00025358686,0.00025502537,0.0014261922,0.00036096774,0.06937681],"genre_scores_gemma":[0.9453996,0.00059157435,0.03050724,0.0004028727,0.00024283907,0.0002456383,0.0007525555,0.0001117025,0.021745883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99581426,0.002272359,0.00012588724,0.0005824772,0.00055388804,0.0006511507],"domain_scores_gemma":[0.98458976,0.01086207,0.0015971432,0.0012020762,0.0005919937,0.0011569022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043222043,0.0008801303,0.0026287383,0.0011825766,0.0025723223,0.003764017,0.004702026,0.004442869,0.013689761],"category_scores_gemma":[0.020832883,0.0013656776,0.00134217,0.0019351663,0.0050438824,0.0055207657,0.0030151214,0.0051614936,0.0011180083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027669847,0.00016377684,0.00068554294,0.000072493895,0.000053757514,0.00010322835,0.00027092724,0.07300985,0.00030210282,0.9087138,0.0055835727,0.010764312],"study_design_scores_gemma":[0.000076452125,0.0000300597,0.00041056582,0.000019366807,0.000016134774,0.000050392497,0.00016563437,0.1336731,0.00020688467,0.8634739,0.0018509197,0.000026525317],"about_ca_topic_score_codex":0.003898591,"about_ca_topic_score_gemma":0.0031691873,"teacher_disagreement_score":0.013689761,"about_ca_system_score_codex":0.0029237806,"about_ca_system_score_gemma":0.0019994273,"threshold_uncertainty_score":0.04579681},"labels":[],"label_agreement":null},{"id":"W2106653152","doi":"10.1016/j.disc.2005.04.024","title":"Labeling trees with a condition at distance two","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Combinatorics; Mathematics; Degree (music); Span (engineering); Graph; Integer (computer science); Edge-graceful labeling; Discrete mathematics; Graph power; Physics; Computer science","score_opus":0.008680740982188557,"score_gpt":0.2300537654908175,"score_spread":0.22137302450862895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106653152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3625937,0.0008476348,0.5390951,0.011059417,0.00067224994,0.00022323822,0.0026987612,0.0018293659,0.08098053],"genre_scores_gemma":[0.74516225,0.0006964701,0.22571783,0.002613288,0.000582294,0.00034066508,0.0034411498,0.00081056193,0.020635542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99723035,0.00073142175,0.00021853209,0.00077338854,0.0005355255,0.0005107885],"domain_scores_gemma":[0.9746902,0.01775134,0.0011363089,0.0032625508,0.001426573,0.0017329218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022132094,0.00068726565,0.0018014644,0.0016515817,0.0033813252,0.005211563,0.0024014327,0.0045915204,0.013657728],"category_scores_gemma":[0.019297006,0.0010303588,0.001188481,0.0025909706,0.003806076,0.013042679,0.0046406696,0.0066171666,0.002119362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057440053,0.00016287925,0.0011807636,0.00021163707,0.000022019274,0.00012292778,0.00048325944,0.004086524,0.0069619566,0.9458808,0.01260734,0.02770547],"study_design_scores_gemma":[0.00008570677,0.00005500015,0.00045148598,0.000039780032,0.000025040166,0.00017304791,0.00024046755,0.017250566,0.004109651,0.97014093,0.007397163,0.0000311139],"about_ca_topic_score_codex":0.0016008423,"about_ca_topic_score_gemma":0.0018176481,"teacher_disagreement_score":0.013657728,"about_ca_system_score_codex":0.002521273,"about_ca_system_score_gemma":0.0018054415,"threshold_uncertainty_score":0.045689642},"labels":[],"label_agreement":null},{"id":"W2107127602","doi":"10.1016/j.disc.2014.12.014","title":"Vertex elimination orderings for hereditary graph classes","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Université de Lyon; EGIDE; Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja; Providence Health Care; Agence Nationale de la Recherche; Ministère de l'Europe et des Affaires Étrangères","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Discrete mathematics; Property (philosophy); Graph","score_opus":0.049916631788807925,"score_gpt":0.3235960227806383,"score_spread":0.27367939099183036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107127602","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68073654,0.0005646997,0.16823475,0.0019964098,0.00033938268,0.00012799937,0.001321378,0.00068251364,0.14599633],"genre_scores_gemma":[0.9300251,0.00054879347,0.029406894,0.0004201999,0.0002900927,0.000120368735,0.0016264169,0.00035810904,0.037203934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904984,0.00016878614,0.000051081577,0.00016681512,0.00026987027,0.00029363923],"domain_scores_gemma":[0.99686605,0.00155884,0.0003183898,0.0003503838,0.00035764807,0.00054867537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008802635,0.00052238913,0.00067208504,0.0024519116,0.0026008885,0.003890293,0.0011695715,0.00083889894,0.009551727],"category_scores_gemma":[0.0028506808,0.00057203165,0.00077396363,0.002229396,0.0023276727,0.0042829746,0.0013274547,0.002632951,0.0008783001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004618582,0.000054827564,0.0007464044,0.000029389821,0.000006859347,0.000070296,0.00035569712,0.0007061812,0.0008571867,0.984797,0.0022275914,0.010102344],"study_design_scores_gemma":[0.000024562949,0.000014569647,0.0007167339,0.000014106902,0.000013456408,0.000088841436,0.00020623107,0.003853591,0.00073289336,0.99001735,0.004306461,0.000011255824],"about_ca_topic_score_codex":0.0027142484,"about_ca_topic_score_gemma":0.0055730212,"teacher_disagreement_score":0.009551727,"about_ca_system_score_codex":0.0019524891,"about_ca_system_score_gemma":0.0010921083,"threshold_uncertainty_score":0.031953752},"labels":[],"label_agreement":null},{"id":"W2109408352","doi":"10.1016/j.disc.2015.10.008","title":"Triangle-free graphs with the maximum number of cycles","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Upper and lower bounds; Triangle-free graph; Pancyclic graph; Discrete mathematics; Graph; Complete bipartite graph; 1-planar graph; Chordal graph","score_opus":0.0421209842775522,"score_gpt":0.30227501331117884,"score_spread":0.26015402903362667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109408352","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6069943,0.0019760577,0.21269064,0.0034146744,0.00028400664,0.00012761769,0.0009939407,0.0006440963,0.17287475],"genre_scores_gemma":[0.9446682,0.0008810579,0.031520803,0.0004802529,0.00018642007,0.00013815303,0.00048702452,0.00020004039,0.021438045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916697,0.00020716706,0.000047808688,0.00018650753,0.00023255796,0.00015911066],"domain_scores_gemma":[0.99395174,0.0033287937,0.0005950903,0.0006818939,0.00064950524,0.00079289556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007024084,0.00059862854,0.0008419625,0.0019353715,0.0014728709,0.0030210614,0.0019694048,0.0016069876,0.010738921],"category_scores_gemma":[0.0068237446,0.0008071228,0.00066968607,0.0017897538,0.0019018793,0.00556478,0.0019700543,0.0018449867,0.001113471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011421183,0.000028518749,0.0005802786,0.00009111495,0.000014196638,0.00014945905,0.00023011719,0.00300707,0.0029521172,0.980243,0.002325363,0.010264508],"study_design_scores_gemma":[0.000023696632,0.000013427099,0.00021555081,0.000019956162,0.000010660982,0.00018100966,0.000095995165,0.00803214,0.0012037959,0.98765,0.0025441754,0.000009737997],"about_ca_topic_score_codex":0.001425598,"about_ca_topic_score_gemma":0.0020968784,"teacher_disagreement_score":0.010738921,"about_ca_system_score_codex":0.0010895794,"about_ca_system_score_gemma":0.00070295145,"threshold_uncertainty_score":0.03592521},"labels":[],"label_agreement":null},{"id":"W2111826700","doi":"10.1016/s0012-365x(03)00089-x","title":"Embedding Steiner triple systems into Steiner systems S(2,4,v)","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Steiner system; Embedding; Steiner tree problem; Mathematics; Combinatorics; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.009964591549771824,"score_gpt":0.22347137955274649,"score_spread":0.21350678800297465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111826700","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53629464,0.00040205792,0.39932528,0.0006283923,0.00020087029,0.00015911447,0.0009212475,0.0006336749,0.06143469],"genre_scores_gemma":[0.8774119,0.00033889024,0.10599051,0.00014133286,0.000038717262,0.00011016023,0.00078956736,0.00018916826,0.01498986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996487,0.00009612196,0.000024402887,0.00006265671,0.00008890235,0.00007921381],"domain_scores_gemma":[0.9994197,0.00017805945,0.00014322715,0.000088124296,0.000086638174,0.000084328996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026418242,0.00051667274,0.000387538,0.0011326105,0.0006940028,0.0019344066,0.00052694726,0.0007568871,0.008840847],"category_scores_gemma":[0.0011947517,0.00052018446,0.00036529946,0.0014948993,0.0007150276,0.0019478181,0.0016064752,0.0012392098,0.0012655347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003348171,0.000097044045,0.0014754521,0.00018194162,0.00004727574,0.00044956408,0.0008271032,0.03253467,0.017175863,0.8592693,0.0073699686,0.08023704],"study_design_scores_gemma":[0.00006787559,0.00019658386,0.0012910477,0.00006303472,0.0000378123,0.0005195886,0.00092978566,0.09002111,0.010694086,0.87508047,0.021059684,0.000038949765],"about_ca_topic_score_codex":0.0006802992,"about_ca_topic_score_gemma":0.0011477218,"teacher_disagreement_score":0.008840847,"about_ca_system_score_codex":0.00070035766,"about_ca_system_score_gemma":0.00039331472,"threshold_uncertainty_score":0.029575646},"labels":[],"label_agreement":null},{"id":"W2114702003","doi":"10.1016/j.disc.2013.01.011","title":"Oriented trees in digraphs","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Agence Nationale de la Recherche","keywords":"Digraph; Combinatorics; Conjecture; Mathematics; Order (exchange); Tree (set theory); Integer (computer science); Chromatic scale; Discrete mathematics; Computer science","score_opus":0.018996780892726,"score_gpt":0.27824834799511794,"score_spread":0.25925156710239194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114702003","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43423665,0.0052793818,0.36431047,0.0034069289,0.0005587434,0.00013640197,0.0010308832,0.0005422701,0.1904982],"genre_scores_gemma":[0.90715563,0.0032463241,0.05035798,0.000703969,0.00036606964,0.00018106661,0.0006114911,0.00014990765,0.037227485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993591,0.0001734802,0.000047823625,0.00013628491,0.00018948627,0.00009384428],"domain_scores_gemma":[0.9973749,0.001449225,0.00031231352,0.00017365401,0.00029696134,0.0003928359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006709031,0.00045071176,0.0007733901,0.003427799,0.0021843286,0.0038625982,0.0009469404,0.0010657858,0.0055886554],"category_scores_gemma":[0.0034626797,0.0007188531,0.00054047455,0.003443308,0.002640952,0.0058445446,0.0019132248,0.0020500128,0.0008248232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060537363,0.000008358101,0.00011971679,0.00002063761,0.00000221539,0.000040373736,0.00017538923,0.00035838742,0.0001665745,0.99607724,0.00041673498,0.0026083672],"study_design_scores_gemma":[0.000005432868,0.0000036050499,0.00008680014,0.000014198192,0.000005489904,0.000070604896,0.00009049885,0.0014891973,0.000121427765,0.99447036,0.0036384794,0.0000039974766],"about_ca_topic_score_codex":0.0014306342,"about_ca_topic_score_gemma":0.002429684,"teacher_disagreement_score":0.0055886554,"about_ca_system_score_codex":0.0015397076,"about_ca_system_score_gemma":0.00058617484,"threshold_uncertainty_score":0.01869589},"labels":[],"label_agreement":null},{"id":"W2115400757","doi":"10.1016/s0012-365x(02)00491-0","title":"Toward the rectilinear crossing number of Kn: new drawings, upper bounds, and asymptotics","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Crossing number (knot theory); Point (geometry); Graph; Enhanced Data Rates for GSM Evolution; Complete graph; Line segment; Plane (geometry); Discrete mathematics; Geometry; Computer science","score_opus":0.023865429777955555,"score_gpt":0.2814076873342632,"score_spread":0.25754225755630766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115400757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066983856,0.008237443,0.828518,0.0028777998,0.0005234134,0.000086754255,0.00063076435,0.0009893564,0.09115274],"genre_scores_gemma":[0.52939385,0.01379644,0.41332486,0.0016491872,0.0014852391,0.00041402338,0.0016966639,0.0017261654,0.036513526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976084,0.000681748,0.00009644652,0.0005672101,0.0007845786,0.00026163485],"domain_scores_gemma":[0.98468494,0.009529073,0.0011208948,0.0023542724,0.001391978,0.00091883604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035764247,0.0023614573,0.0015543115,0.006349226,0.0016150345,0.00500668,0.0042867176,0.002400543,0.0136544015],"category_scores_gemma":[0.031404193,0.0014618399,0.001090135,0.0067516724,0.0045397333,0.014225796,0.0046329475,0.00935539,0.0031539057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001168924,0.00008718775,0.001606146,0.000254163,0.0000179301,0.00008480414,0.0003003032,0.049859602,0.0017612017,0.8670618,0.011523628,0.06732641],"study_design_scores_gemma":[0.000012354767,0.000040514973,0.000671997,0.00013548258,0.000028000943,0.0002092879,0.0001250724,0.18969409,0.0018714373,0.79220307,0.014960893,0.000047860838],"about_ca_topic_score_codex":0.0024537048,"about_ca_topic_score_gemma":0.0029352952,"teacher_disagreement_score":0.0136544015,"about_ca_system_score_codex":0.0029486192,"about_ca_system_score_gemma":0.0010107986,"threshold_uncertainty_score":0.045678556},"labels":[],"label_agreement":null},{"id":"W2115498309","doi":"10.1016/j.disc.2005.10.013","title":"On the biased <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si9.gif\" overflow=\"scroll\"><mml:mi>n</mml:mi></mml:math>-in-a-row game","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Order (exchange); Scroll; Combinatorics; Limit (mathematics); Discrete mathematics; Mathematical analysis; Theology; Philosophy","score_opus":0.030854778058483547,"score_gpt":0.26731498438581824,"score_spread":0.2364602063273347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115498309","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051921703,0.00016525484,0.37144446,0.007155778,0.00056295394,0.0005348761,0.002911022,0.002293202,0.5630107],"genre_scores_gemma":[0.525468,0.000441883,0.17711942,0.0019288998,0.00013724098,0.0006114546,0.0028792415,0.0014278489,0.28998604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865675,0.0005203008,0.000057460686,0.00020250557,0.00037036111,0.00019257376],"domain_scores_gemma":[0.99853826,0.0007995511,0.000053246524,0.00020921286,0.00022580265,0.00017399142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008842511,0.00073564326,0.0007770994,0.0005661567,0.0018438743,0.0024142552,0.0017791401,0.0015227195,0.08282488],"category_scores_gemma":[0.006243235,0.0003494221,0.0006537685,0.00050944753,0.0011696623,0.004192862,0.002878062,0.0016202219,0.013204916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031298315,0.00013411058,0.0006678884,0.0001072816,0.000033198245,0.00017853083,0.0005627323,0.010981891,0.0027180768,0.8780489,0.06933125,0.036923155],"study_design_scores_gemma":[0.00017310184,0.00012381583,0.00062097434,0.00010386997,0.00003323584,0.00013019519,0.00048681366,0.11433983,0.0031780011,0.7585693,0.12218021,0.000060658742],"about_ca_topic_score_codex":0.008074489,"about_ca_topic_score_gemma":0.016335584,"teacher_disagreement_score":0.08282488,"about_ca_system_score_codex":0.0013528082,"about_ca_system_score_gemma":0.0014813353,"threshold_uncertainty_score":0.27707684},"labels":[],"label_agreement":null},{"id":"W2115696218","doi":"10.1016/j.disc.2006.07.020","title":"Multicomplexes and polynomials with real zeros","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Polynomial; Polytope; Discrete mathematics; Mathematical analysis","score_opus":0.02252980996007601,"score_gpt":0.2897096351266191,"score_spread":0.2671798251665431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115696218","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46227792,0.012643832,0.2478811,0.012264966,0.0033475768,0.000107003856,0.00083879434,0.0005196258,0.26011914],"genre_scores_gemma":[0.92539537,0.0027186133,0.026117448,0.0008388285,0.00224648,0.00009907479,0.0003790283,0.00012059337,0.042084605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992163,0.00019314546,0.000039967446,0.00019777595,0.00021592826,0.00013682057],"domain_scores_gemma":[0.99723047,0.001420484,0.0006180248,0.00022120426,0.000258689,0.00025105895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009234899,0.0012032138,0.00094420335,0.0032248315,0.0021287147,0.004365469,0.0011999462,0.0014446877,0.011153875],"category_scores_gemma":[0.0058585634,0.00075301767,0.000661658,0.0033765882,0.0049439096,0.006127591,0.0024167579,0.00441794,0.0014208644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025983243,0.000010760151,0.0000871364,0.000028881408,0.0000047208027,0.000056042772,0.00012248679,0.00026579222,0.00027984267,0.9944575,0.0012145736,0.003446274],"study_design_scores_gemma":[0.000011072748,0.000008511448,0.000117043746,0.000009938287,0.000004727378,0.00014843952,0.0000565474,0.0008515005,0.00014751265,0.9953631,0.0032738554,0.000007771446],"about_ca_topic_score_codex":0.00057194964,"about_ca_topic_score_gemma":0.00070247863,"teacher_disagreement_score":0.011153875,"about_ca_system_score_codex":0.0014541288,"about_ca_system_score_gemma":0.00045131534,"threshold_uncertainty_score":0.03731346},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.01639847693871242,"score_gpt":0.20255324714007103,"score_spread":0.18615477020135862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116924935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34808818,0.0014260914,0.5581511,0.0014368728,0.00045309335,0.00016858062,0.00026942315,0.0003510055,0.089655735],"genre_scores_gemma":[0.8870853,0.001023485,0.08439453,0.00063603045,0.00038989412,0.00020033064,0.00020204419,0.00012787031,0.02594036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813974,0.00088521396,0.000065061155,0.00018957352,0.0004387728,0.0002815026],"domain_scores_gemma":[0.99276227,0.0046424493,0.0009534538,0.0007612693,0.0005885627,0.0002920348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021270318,0.0009239761,0.0008513956,0.0015181596,0.0012486218,0.0018279237,0.0010270375,0.001507478,0.0067565],"category_scores_gemma":[0.009132831,0.0006370734,0.00058664713,0.0014679037,0.0020971787,0.0019191735,0.0017073895,0.0012932176,0.00091796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003854244,0.000037139802,0.0004390872,0.00009411073,0.000020060084,0.00015042066,0.0002602158,0.0142055955,0.0034975086,0.96109617,0.0020287104,0.017785538],"study_design_scores_gemma":[0.00010907793,0.00015409161,0.00027994072,0.00006945519,0.000029717618,0.0002727069,0.00009993234,0.07054199,0.00313646,0.9194855,0.0057794084,0.000041591502],"about_ca_topic_score_codex":0.0007027793,"about_ca_topic_score_gemma":0.0010175311,"teacher_disagreement_score":0.0067565,"about_ca_system_score_codex":0.0013773463,"about_ca_system_score_gemma":0.0008862996,"threshold_uncertainty_score":0.022602797},"labels":[],"label_agreement":null},{"id":"W2117152550","doi":"10.1016/j.disc.2010.03.019","title":"Strong embeddings of minimum genus","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"American Roentgen Ray Society","keywords":"Genus; Mathematics; Combinatorics; Biology; Zoology","score_opus":0.007247097993559703,"score_gpt":0.21757489133790484,"score_spread":0.21032779334434512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117152550","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5769003,0.0013284228,0.25107652,0.005334987,0.00054200855,0.00009308908,0.0005991446,0.0005868239,0.16353874],"genre_scores_gemma":[0.9456517,0.0007563531,0.024489535,0.0006582691,0.00038300166,0.00012238353,0.0004806199,0.00030883538,0.027149297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992545,0.00016685374,0.000032357246,0.00017957012,0.00021913755,0.00014747896],"domain_scores_gemma":[0.99682236,0.0015386419,0.0004324501,0.00039380364,0.0003015987,0.0005111311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005955356,0.0010761669,0.0012100235,0.0019969426,0.0020063824,0.0034675915,0.001299472,0.0017310535,0.008807445],"category_scores_gemma":[0.004472807,0.0009895029,0.0009624285,0.0010932231,0.0029090522,0.0075522466,0.0052395076,0.004512979,0.0010139158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040070496,0.000014503882,0.00018045821,0.000029990126,0.000006867961,0.00005257722,0.00021077653,0.0009589535,0.00069282897,0.99383175,0.0009801799,0.003000984],"study_design_scores_gemma":[0.000013169451,0.000013359449,0.00019039803,0.000011565257,0.0000067658893,0.000073513984,0.00011235402,0.004225541,0.0003066713,0.9929309,0.0021090664,0.0000067388432],"about_ca_topic_score_codex":0.0003666633,"about_ca_topic_score_gemma":0.0004744145,"teacher_disagreement_score":0.008807445,"about_ca_system_score_codex":0.0010982779,"about_ca_system_score_gemma":0.00027965746,"threshold_uncertainty_score":0.029463828},"labels":[],"label_agreement":null},{"id":"W2118486152","doi":"10.1016/s0012-365x(03)00297-8","title":"Well-located graphs: a collection of well-covered ones","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Dominating set; Graph; Maximal independent set; Discrete mathematics; Independent set; Characterization (materials science); Chordal graph; 1-planar graph","score_opus":0.02135974380539746,"score_gpt":0.2823232364815937,"score_spread":0.26096349267619623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118486152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42345557,0.0066204043,0.5016329,0.0016491131,0.0003482972,0.00025574383,0.0032174352,0.0013159863,0.061504573],"genre_scores_gemma":[0.8370781,0.005392264,0.11443816,0.0006465196,0.00087623304,0.00040118018,0.004962478,0.0010780873,0.035126943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755895,0.0003598241,0.00015643236,0.0007347569,0.0008366456,0.00035346937],"domain_scores_gemma":[0.9910059,0.0034527916,0.0010216472,0.0018418637,0.0016416635,0.001036161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012252377,0.0013759801,0.0023491604,0.006290957,0.0029968082,0.004281474,0.002669312,0.0023182407,0.0071698283],"category_scores_gemma":[0.009360594,0.0015512338,0.0014017478,0.0068443157,0.0027935011,0.008962695,0.0038788493,0.0032857086,0.0016408477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002065708,0.00009179155,0.0028379564,0.0004945504,0.000112194764,0.0010896354,0.001611082,0.0059508565,0.0050356206,0.9342453,0.00852925,0.03979532],"study_design_scores_gemma":[0.000030632964,0.00005853246,0.0021476727,0.00009861169,0.00010705862,0.0016124407,0.0006141086,0.017016605,0.0021514592,0.95606196,0.02005391,0.000046973433],"about_ca_topic_score_codex":0.0010470075,"about_ca_topic_score_gemma":0.0013955395,"teacher_disagreement_score":0.0071698283,"about_ca_system_score_codex":0.0011579357,"about_ca_system_score_gemma":0.00074961496,"threshold_uncertainty_score":0.023985505},"labels":[],"label_agreement":null},{"id":"W2118876122","doi":"10.1016/j.disc.2009.09.005","title":"Minimal Euclidean representations of graphs","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; University of Calgary","keywords":"Mathematics; Combinatorics; Euclidean geometry; Discrete mathematics; Geometry","score_opus":0.0383726678968565,"score_gpt":0.34198105174236,"score_spread":0.3036083838455035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118876122","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4695094,0.0021032258,0.22602515,0.0045858677,0.0007510272,0.000098963625,0.00082203926,0.00059724954,0.29550704],"genre_scores_gemma":[0.914725,0.0009590083,0.03234661,0.00066271354,0.00048715793,0.00008425337,0.0007161707,0.00019886451,0.0498201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994875,0.00014305722,0.000028333932,0.000100821635,0.00015303135,0.000087225904],"domain_scores_gemma":[0.999393,0.00014403599,0.00011596433,0.00008967551,0.000110514295,0.00014686031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000431121,0.00069280405,0.00059342216,0.001695256,0.0008686433,0.0027627898,0.0011780844,0.0010332888,0.008940337],"category_scores_gemma":[0.0015102891,0.0003326198,0.00047976483,0.00096589385,0.0014378869,0.0025964626,0.0018635731,0.0021962798,0.0012574106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012575034,0.0000072268563,0.00003435242,0.000013957204,0.0000024007313,0.000016845013,0.000074794116,0.0003717439,0.00048423203,0.9954074,0.00067766296,0.0028966926],"study_design_scores_gemma":[0.000010025542,0.000009888597,0.00011029912,0.0000070670612,0.000003724463,0.000050616312,0.0000769019,0.0022649055,0.00029953202,0.99366647,0.0034944129,0.0000062200993],"about_ca_topic_score_codex":0.0005781645,"about_ca_topic_score_gemma":0.0007960227,"teacher_disagreement_score":0.008940337,"about_ca_system_score_codex":0.0009069053,"about_ca_system_score_gemma":0.00033032778,"threshold_uncertainty_score":0.029908419},"labels":[],"label_agreement":null},{"id":"W2118962918","doi":"10.1016/s0012-365x(03)00280-2","title":"Splitting systems and separating systems","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.016749313579064496,"score_gpt":0.24829603083223578,"score_spread":0.23154671725317127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118962918","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3087342,0.00540189,0.28321654,0.00708862,0.0012555926,0.00008775695,0.0005216465,0.00043648094,0.39325723],"genre_scores_gemma":[0.89697385,0.0021629396,0.026394386,0.0011079691,0.0008230222,0.000091525384,0.00051254866,0.00018813042,0.071745686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996406,0.00009238085,0.000018134693,0.00007841255,0.00010460707,0.000065909946],"domain_scores_gemma":[0.9992679,0.00028591038,0.00009199454,0.00015186862,0.00010758821,0.00009481596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005531813,0.00051850977,0.0005701567,0.0010864395,0.0018796675,0.0020369715,0.0006073991,0.0012205999,0.011759393],"category_scores_gemma":[0.0018064341,0.00041032812,0.00047648977,0.0011787416,0.002757195,0.004851046,0.00225088,0.0029855429,0.0014785898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006785651,0.0000031196537,0.000027104757,0.000007571716,0.0000013354056,0.0000062782988,0.000059030343,0.00018549983,0.00020545318,0.9969427,0.0006871533,0.0018679281],"study_design_scores_gemma":[0.0000024044257,0.0000021505787,0.000029644309,0.0000024834299,0.0000011488713,0.000017908786,0.000019950288,0.0007026588,0.00010951144,0.9971113,0.0019987652,0.0000020188254],"about_ca_topic_score_codex":0.00044096238,"about_ca_topic_score_gemma":0.0003398792,"teacher_disagreement_score":0.011759393,"about_ca_system_score_codex":0.00078855135,"about_ca_system_score_gemma":0.00045733422,"threshold_uncertainty_score":0.039339125},"labels":[],"label_agreement":null},{"id":"W2121129417","doi":"10.1016/j.disc.2004.06.006","title":"Addressing the Petersen graph","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Redeemer University","funders":"","keywords":"Combinatorics; Mathematics; Tuple; Graph; Petersen graph; Discrete mathematics; Eigenvalues and eigenvectors; Graph power; Line graph","score_opus":0.1290262573121771,"score_gpt":0.35734721239166956,"score_spread":0.22832095507949246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121129417","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18431497,0.0043494683,0.36763656,0.025552714,0.00289376,0.00010375313,0.0004671575,0.00053708046,0.41414458],"genre_scores_gemma":[0.8257818,0.0041750874,0.069724455,0.002813431,0.0023923595,0.000098629556,0.00053953513,0.00037312537,0.094101496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995951,0.00012638148,0.000011800406,0.00009445013,0.000087971566,0.00008435304],"domain_scores_gemma":[0.99936014,0.0002698488,0.000055571007,0.0001321506,0.00009071497,0.00009169899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040526481,0.00054773845,0.0006975051,0.0012879506,0.0026219273,0.0023133196,0.0009739603,0.0022099908,0.012053483],"category_scores_gemma":[0.0025153654,0.00036073,0.00075357466,0.0010751709,0.0023300292,0.0060308203,0.003493735,0.00365416,0.0016866432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006969337,0.000007594029,0.00004535884,0.00002573804,0.000003660854,0.000035433266,0.0000761147,0.00095617794,0.00018670375,0.99017113,0.00320762,0.0052776113],"study_design_scores_gemma":[0.0000019992183,0.0000023263863,0.00002033912,0.0000048515562,0.0000021985024,0.000027956157,0.00005854385,0.0024160317,0.00015064103,0.9910555,0.00625705,0.000002495091],"about_ca_topic_score_codex":0.001262657,"about_ca_topic_score_gemma":0.001655714,"teacher_disagreement_score":0.012053483,"about_ca_system_score_codex":0.00085461425,"about_ca_system_score_gemma":0.00074997405,"threshold_uncertainty_score":0.04032296},"labels":[],"label_agreement":null},{"id":"W2121911143","doi":"10.1016/s0012-365x(00)00145-x","title":"Domino tableaux, Schützenberger involution, and the symmetric group action","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Combinatorics; Domino; Mathematics; Bijection; Young tableau; Symmetric group; Permutation group; Permutation (music); Philosophy","score_opus":0.030698894733745884,"score_gpt":0.2968365589327087,"score_spread":0.26613766419896284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121911143","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6962567,0.0036027087,0.026875647,0.005188912,0.0004998432,0.000047422105,0.0003849697,0.00021005086,0.26693374],"genre_scores_gemma":[0.9688215,0.0008432455,0.0018831696,0.0002469698,0.0002813413,0.000024107223,0.00010960609,0.000027552142,0.027762452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997813,0.000050563238,0.000007778728,0.00003398199,0.000062430896,0.00006394945],"domain_scores_gemma":[0.99962246,0.00013851974,0.00007943664,0.000041158277,0.00004101444,0.00007737126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003816856,0.0004612034,0.00055687944,0.0015196088,0.0014826724,0.0021012542,0.0005566069,0.0008767859,0.004836065],"category_scores_gemma":[0.0009746342,0.00025468884,0.00046103593,0.0010651652,0.0027187672,0.0019730662,0.000903257,0.0011640593,0.00054967956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003009806,0.000011947065,0.00010712555,0.000006616498,0.000002470611,0.00003485647,0.0000789054,0.0004915815,0.00034576378,0.9961195,0.0006843414,0.002086677],"study_design_scores_gemma":[0.00001536882,0.000007720113,0.00015997476,0.000003136332,0.0000025394868,0.00003616559,0.00003536105,0.0011791964,0.00021252272,0.9964998,0.0018428344,0.000005426683],"about_ca_topic_score_codex":0.0036384491,"about_ca_topic_score_gemma":0.004102163,"teacher_disagreement_score":0.004836065,"about_ca_system_score_codex":0.0015532004,"about_ca_system_score_gemma":0.00090927386,"threshold_uncertainty_score":0.01617819},"labels":[],"label_agreement":null},{"id":"W2122599841","doi":"10.1016/j.disc.2013.08.032","title":"A Dirac-type characterization of<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-chordal graphs","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Chordal graph; Mathematics; Combinatorics; Characterization (materials science); Graph; Discrete mathematics; Physics","score_opus":0.018689806947235477,"score_gpt":0.2611651905464756,"score_spread":0.2424753835992401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122599841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17578407,0.00076799095,0.470671,0.0020454607,0.00093958207,0.00015522286,0.0022823247,0.0009940105,0.34636036],"genre_scores_gemma":[0.8706885,0.0005154839,0.061774116,0.0009929165,0.00036577586,0.000085775464,0.0017104158,0.00038220952,0.063484915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995085,0.00007454383,0.00004292007,0.00012890119,0.00014732762,0.00009791222],"domain_scores_gemma":[0.99795,0.0005830943,0.00021585605,0.00033197715,0.0005786317,0.00034045213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046586452,0.00040187791,0.00037630665,0.00200212,0.001558254,0.0023833592,0.0014387758,0.0007349419,0.01659812],"category_scores_gemma":[0.0024912509,0.00028899853,0.0004413417,0.001880029,0.0017696543,0.0023086,0.0015874669,0.0017410491,0.0025351753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027411974,0.000008894596,0.00032911642,0.00002826357,0.0000035237015,0.000089262205,0.0001508303,0.0002910995,0.00094875245,0.9895336,0.0025260057,0.0060632285],"study_design_scores_gemma":[0.000016380429,0.00001881923,0.0004791455,0.00003293291,0.000008862344,0.00038140322,0.00029150007,0.004035442,0.0014656223,0.97416806,0.019083312,0.000018547336],"about_ca_topic_score_codex":0.0018695616,"about_ca_topic_score_gemma":0.002173492,"teacher_disagreement_score":0.01659812,"about_ca_system_score_codex":0.0013288055,"about_ca_system_score_gemma":0.0006826138,"threshold_uncertainty_score":0.055526316},"labels":[],"label_agreement":null},{"id":"W2122813432","doi":"10.1016/j.disc.2008.09.009","title":"Acyclic improper colourings of graphs with bounded maximum degree","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies; Commonwealth Scholarship Commission","keywords":"Mathematics; Combinatorics; Infimum and supremum; Degree (music); Bipartite graph; Bounded function; Discrete mathematics; Graph","score_opus":0.05244063705834468,"score_gpt":0.273282174174059,"score_spread":0.2208415371157143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122813432","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8055524,0.0009477846,0.16199,0.0013489813,0.00017265278,0.000056323348,0.00047164623,0.0002982102,0.02916195],"genre_scores_gemma":[0.96109366,0.0006982818,0.027181529,0.0003716176,0.00014243975,0.00007979021,0.00045736082,0.00020425009,0.009771214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843794,0.00055121694,0.00010944015,0.0002871227,0.00035304914,0.00026133173],"domain_scores_gemma":[0.9796729,0.012278372,0.0026041921,0.0022291297,0.0015051942,0.0017101845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019178907,0.0006550758,0.0009787462,0.0023712104,0.0018219062,0.0032054104,0.0015213998,0.0015600177,0.0034810265],"category_scores_gemma":[0.011643311,0.0012171987,0.0008880427,0.0022881015,0.0036917357,0.005519959,0.0022873734,0.0027727291,0.00041859015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016193306,0.000026917898,0.0015182949,0.000080719474,0.000015899033,0.00019447948,0.00080801,0.003995624,0.0034495203,0.98333794,0.00096863555,0.005442019],"study_design_scores_gemma":[0.0000143960115,0.000009231873,0.00054682174,0.00001711489,0.000015693988,0.00008359864,0.00012278272,0.006156822,0.0008628333,0.9907252,0.0014352639,0.000010254619],"about_ca_topic_score_codex":0.0018468378,"about_ca_topic_score_gemma":0.0032882688,"teacher_disagreement_score":0.0034810265,"about_ca_system_score_codex":0.0014971993,"about_ca_system_score_gemma":0.0006065233,"threshold_uncertainty_score":0.011645198},"labels":[],"label_agreement":null},{"id":"W2123039547","doi":"10.1016/j.disc.2011.10.026","title":"Cover starters for covering arrays of strength two","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Carleton University","funders":"","keywords":"Cover (algebra); Mathematics; Combinatorics; Heuristic; Covering space; Upper and lower bounds; Representation (politics); Discrete mathematics; Mathematical optimization; Engineering","score_opus":0.04715693982522598,"score_gpt":0.2780852931107338,"score_spread":0.23092835328550784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123039547","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17589287,0.00028940174,0.7852436,0.0005383377,0.00014989999,0.00014030312,0.00031774014,0.0031103562,0.034317493],"genre_scores_gemma":[0.7645515,0.00024262081,0.20225176,0.0004051684,0.0001291975,0.0002732207,0.00081188546,0.0014507951,0.029883761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998502,0.00028298778,0.00007278978,0.00027877587,0.00056999444,0.00029336548],"domain_scores_gemma":[0.99331,0.004263401,0.0004350776,0.0009864792,0.00059926644,0.00040583985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009887561,0.0009944177,0.00090231077,0.0014209267,0.0011640509,0.001672255,0.001013292,0.0014950687,0.012508786],"category_scores_gemma":[0.00943219,0.0007187784,0.0009906815,0.0010463872,0.0015088732,0.0038583498,0.002791884,0.0022143333,0.002314525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009029787,0.00019729727,0.0032871556,0.00026270034,0.000074644806,0.0010217322,0.0012420274,0.026184738,0.024102304,0.79347456,0.013559098,0.1356907],"study_design_scores_gemma":[0.00009047465,0.00020546805,0.000847258,0.00008598264,0.00007249391,0.00063126406,0.000222928,0.13654782,0.019579425,0.8283504,0.013314895,0.000051462433],"about_ca_topic_score_codex":0.00048827328,"about_ca_topic_score_gemma":0.00080023,"teacher_disagreement_score":0.012508786,"about_ca_system_score_codex":0.0007306283,"about_ca_system_score_gemma":0.00052134524,"threshold_uncertainty_score":0.041846037},"labels":[],"label_agreement":null},{"id":"W2124170870","doi":"10.1016/j.disc.2012.02.025","title":"Friendship 3-hypergraphs","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Friendship; Combinatorics; Discrete mathematics; Social psychology; Psychology","score_opus":0.011234086696318393,"score_gpt":0.20991442903738364,"score_spread":0.19868034234106524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124170870","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.403715,0.0010281118,0.32652214,0.0029260733,0.00025497412,0.0002582535,0.0020048756,0.00081616186,0.2624744],"genre_scores_gemma":[0.8772634,0.00082639256,0.04211959,0.0006777481,0.00026567336,0.00027881868,0.001446242,0.00024880064,0.076873384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990351,0.00030671715,0.000041885833,0.00026952548,0.00019166942,0.00015516904],"domain_scores_gemma":[0.99546957,0.0019728113,0.0005915054,0.00063773594,0.00058485614,0.00074366014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005641258,0.00050018425,0.0006733978,0.0020569614,0.0027591293,0.002942831,0.0012361135,0.0014798745,0.024953302],"category_scores_gemma":[0.0036889268,0.00059181015,0.00068182545,0.0022537431,0.0011452498,0.005043229,0.0021655764,0.002002624,0.002972967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009032201,0.00006529793,0.0011929997,0.000098968856,0.00004663536,0.00050804537,0.00077738054,0.0018368907,0.0019255397,0.96361923,0.007683894,0.022154782],"study_design_scores_gemma":[0.000033083204,0.000024050509,0.000982397,0.00003329546,0.0000375188,0.0006100623,0.00044095248,0.010062398,0.0012972545,0.9674488,0.019011725,0.000018406272],"about_ca_topic_score_codex":0.000810816,"about_ca_topic_score_gemma":0.0010804614,"teacher_disagreement_score":0.024953302,"about_ca_system_score_codex":0.00071080413,"about_ca_system_score_gemma":0.0003682295,"threshold_uncertainty_score":0.08347714},"labels":[],"label_agreement":null},{"id":"W2125208816","doi":"10.1016/j.disc.2003.10.030","title":"Enumerating branched orientable surface coverings over a non-orientable surface","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Surface (topology); Combinatorics; Discrete mathematics; Geometry","score_opus":0.03230022985800513,"score_gpt":0.32981736089546,"score_spread":0.29751713103745486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125208816","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9301026,0.00043655824,0.052671608,0.00026417026,0.000041187403,0.000032854437,0.0005067333,0.00034731813,0.015597096],"genre_scores_gemma":[0.9515384,0.000521523,0.0364721,0.000108721004,0.00007065583,0.000044561388,0.0021609345,0.00015902262,0.008924033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994893,0.000065104585,0.000046825233,0.000098647484,0.0001656474,0.00013441825],"domain_scores_gemma":[0.99770904,0.0014198794,0.000184769,0.00022340362,0.00022251334,0.00024028176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004327777,0.0010099545,0.0010187164,0.002827868,0.0012189455,0.0026788537,0.0011538798,0.0012564438,0.00571766],"category_scores_gemma":[0.003227788,0.00050987117,0.0008031317,0.0026975435,0.0012754246,0.0036401676,0.0022415249,0.0012705027,0.00062151067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082150457,0.00035011568,0.040868986,0.001112365,0.00024554273,0.0021877952,0.0035559207,0.062072437,0.038413525,0.6638712,0.009392981,0.17710756],"study_design_scores_gemma":[0.000055566965,0.00014828713,0.008320662,0.00015460534,0.00020639095,0.0012778477,0.0013568031,0.15594961,0.0143561205,0.8065648,0.011562494,0.000046885165],"about_ca_topic_score_codex":0.0011690124,"about_ca_topic_score_gemma":0.0017550905,"teacher_disagreement_score":0.00571766,"about_ca_system_score_codex":0.0010813088,"about_ca_system_score_gemma":0.00034357127,"threshold_uncertainty_score":0.019127488},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.012410563887565994,"score_gpt":0.2081247982007641,"score_spread":0.1957142343131981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125862453","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6564007,0.003009041,0.12785348,0.0058092177,0.0005323189,0.00008003603,0.0009356629,0.000400922,0.20497864],"genre_scores_gemma":[0.9672075,0.0019074386,0.012407125,0.0004946722,0.00060380594,0.00010808773,0.00052080397,0.00020350194,0.016547086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990687,0.00029991943,0.000027885411,0.00021010118,0.00018697053,0.0002065265],"domain_scores_gemma":[0.987649,0.009165664,0.00093348196,0.00073701754,0.00062962226,0.00088507024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016155082,0.0010377622,0.0009463703,0.004468062,0.0022399332,0.0045083864,0.002070809,0.0013523755,0.0107421735],"category_scores_gemma":[0.010500664,0.0007741141,0.0005913022,0.0037290107,0.006313661,0.007873175,0.0026568917,0.0034124204,0.0007430129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012455558,0.00002788641,0.0010031639,0.000063057916,0.000011538029,0.000036697093,0.00027377007,0.008179095,0.00088325114,0.97918403,0.0026442162,0.0075687547],"study_design_scores_gemma":[0.000023834566,0.000019464303,0.000855365,0.000034541317,0.000017190461,0.00005911203,0.00012489039,0.020037914,0.0005326271,0.97565573,0.002616123,0.000023232822],"about_ca_topic_score_codex":0.0038795313,"about_ca_topic_score_gemma":0.0033514986,"teacher_disagreement_score":0.0107421735,"about_ca_system_score_codex":0.0034618194,"about_ca_system_score_gemma":0.0010012706,"threshold_uncertainty_score":0.035936177},"labels":[],"label_agreement":null},{"id":"W2126829018","doi":"10.1016/j.disc.2005.03.020","title":"Rebuilding convex sets in graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Division of Electrical, Communications and Cyber Systems","keywords":"Combinatorics; Mathematics; Convex hull; Neighbourhood (mathematics); Convex set; Vertex (graph theory); Wheel graph; Discrete mathematics; Independent set; Chordal graph; Distance; Graph; Graph power; Regular polygon; Line graph; Geometry; Convex optimization","score_opus":0.026380368166790867,"score_gpt":0.32054564366337096,"score_spread":0.2941652754965801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126829018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15787216,0.0010853718,0.78288066,0.0026502027,0.00065252173,0.00012416448,0.0003815002,0.0014950831,0.05285833],"genre_scores_gemma":[0.57762676,0.0015573589,0.3710082,0.0008674503,0.000291492,0.00013586238,0.0008255436,0.0020180263,0.04566935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989672,0.0003430563,0.00004605336,0.00020230615,0.0002995528,0.00014192241],"domain_scores_gemma":[0.99591583,0.0016987018,0.00017943089,0.0015591502,0.00032996287,0.00031700038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089408987,0.00092133484,0.0013522955,0.0018433584,0.0016372895,0.0027807043,0.0021535084,0.0012982498,0.010938132],"category_scores_gemma":[0.006008062,0.001222437,0.0014028416,0.0015101351,0.0029921148,0.0050818813,0.004671823,0.00487629,0.0022940396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010619637,0.00007050382,0.00033536932,0.00019563337,0.00004851334,0.00019019644,0.000577413,0.035184365,0.00816243,0.8833156,0.007152816,0.064660974],"study_design_scores_gemma":[0.000012686761,0.000021447318,0.00015724833,0.000032110962,0.000017321838,0.00009452268,0.0002399036,0.039188344,0.0032278434,0.9452567,0.011737404,0.000014410574],"about_ca_topic_score_codex":0.002199729,"about_ca_topic_score_gemma":0.0030422069,"teacher_disagreement_score":0.010938132,"about_ca_system_score_codex":0.0011575228,"about_ca_system_score_gemma":0.00056771276,"threshold_uncertainty_score":0.03659171},"labels":[],"label_agreement":null},{"id":"W213041943","doi":"10.1016/s0012-365x(00)00009-1","title":"The complexity of H-colouring of bounded degree graphs","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Degree (music); Bounded function; Mathematics; Combinatorics; Discrete mathematics; Computer science; Physics","score_opus":0.0813376872937042,"score_gpt":0.3177632359906591,"score_spread":0.23642554869695487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W213041943","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89668,0.00094302505,0.06865992,0.0068811043,0.00015856596,0.0001241206,0.0021731225,0.00040865946,0.023971673],"genre_scores_gemma":[0.9814051,0.00060183275,0.011030692,0.00040361466,0.0002539017,0.000090282185,0.0013462022,0.00017889771,0.0046895305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99659735,0.0009970368,0.00016722202,0.00068981,0.0008214301,0.00072712795],"domain_scores_gemma":[0.94973814,0.040387824,0.0033289155,0.0030416537,0.0010840003,0.0024194438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002182085,0.0009901064,0.002226928,0.0016000903,0.0023366606,0.0089684175,0.004737194,0.0035319773,0.012335269],"category_scores_gemma":[0.022469554,0.0012236084,0.0019070501,0.0032433632,0.005503381,0.014859922,0.0042068856,0.00500051,0.00079857925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018448363,0.00040151904,0.0108657,0.00071595435,0.00021753939,0.0005722352,0.0020005265,0.16669427,0.009130656,0.76375467,0.012560173,0.031241918],"study_design_scores_gemma":[0.000113618284,0.000042140076,0.0016777152,0.000027428814,0.000051189258,0.0001576256,0.00024013157,0.10444813,0.0013431887,0.89080405,0.0010576822,0.00003710255],"about_ca_topic_score_codex":0.0055119083,"about_ca_topic_score_gemma":0.004359256,"teacher_disagreement_score":0.012335269,"about_ca_system_score_codex":0.0045714052,"about_ca_system_score_gemma":0.0022530851,"threshold_uncertainty_score":0.041265607},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.022213408380759768,"score_gpt":0.22897733315431235,"score_spread":0.20676392477355257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131552237","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39951965,0.0008559262,0.3176211,0.0065932306,0.00084984786,0.00026029907,0.0005772881,0.0012520124,0.2724706],"genre_scores_gemma":[0.9371998,0.00045835212,0.015796816,0.00073091855,0.00029457954,0.00014349612,0.00029249734,0.00027903612,0.04480443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994326,0.0001799996,0.000018135383,0.00009398581,0.00015125949,0.00012399054],"domain_scores_gemma":[0.9986494,0.00060845446,0.000116774856,0.00033881082,0.00013539249,0.00015115392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053496484,0.00049219525,0.00077915704,0.0014347018,0.0017363029,0.002198402,0.0010601373,0.0017134715,0.014247753],"category_scores_gemma":[0.0025215943,0.00037275333,0.0008150436,0.0011370898,0.0021972354,0.0040496793,0.002307863,0.0024886772,0.001477495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015966782,0.000017194934,0.000030884363,0.000014028047,0.0000029671853,0.000019435083,0.00006802959,0.0013187781,0.00048787185,0.9944119,0.00086098356,0.0027519304],"study_design_scores_gemma":[0.0000054388415,0.0000052182854,0.00004081022,0.00000374673,0.0000017755441,0.000014862635,0.000019635056,0.006416854,0.00028489163,0.9924602,0.00074305024,0.0000034956552],"about_ca_topic_score_codex":0.00086981157,"about_ca_topic_score_gemma":0.00046003237,"teacher_disagreement_score":0.014247753,"about_ca_system_score_codex":0.0012138145,"about_ca_system_score_gemma":0.0006315398,"threshold_uncertainty_score":0.04766345},"labels":[],"label_agreement":null},{"id":"W2131690757","doi":"10.1016/j.disc.2006.04.037","title":"Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Steiner tree problem; Connectivity; Discrete mathematics; Path graph; Graph; Graph power; Line graph","score_opus":0.012587430546820573,"score_gpt":0.2672030840537653,"score_spread":0.2546156535069447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131690757","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8405136,0.0012289956,0.101052016,0.001275006,0.00018671896,0.000042936594,0.00057892257,0.0001434152,0.05497834],"genre_scores_gemma":[0.97071886,0.00093295827,0.019378936,0.00014194088,0.00019965092,0.00006095807,0.0003827442,0.00003746653,0.00814662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994863,0.000115878414,0.00003553054,0.0001091726,0.0001668167,0.00008629965],"domain_scores_gemma":[0.99713695,0.0016412819,0.0005860056,0.00015031167,0.00018420276,0.0003011474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005961109,0.00045805107,0.00070886366,0.0023111503,0.0014486905,0.0023811948,0.0012696595,0.0008695824,0.005217598],"category_scores_gemma":[0.0035961866,0.00048487866,0.00043541822,0.0037103398,0.0023183145,0.0032193277,0.0011420725,0.0018374247,0.00038112365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009816918,0.000026142607,0.0010524379,0.000056542234,0.000010943048,0.000102979655,0.00030294174,0.0066356272,0.000876805,0.9806309,0.0010926833,0.009113792],"study_design_scores_gemma":[0.00003566177,0.000029635044,0.0012012569,0.000017164588,0.0000191506,0.00020222331,0.000263918,0.011342283,0.0005788689,0.9839595,0.0023365289,0.000013811114],"about_ca_topic_score_codex":0.0010357437,"about_ca_topic_score_gemma":0.0016344844,"teacher_disagreement_score":0.005217598,"about_ca_system_score_codex":0.0013194688,"about_ca_system_score_gemma":0.0004355299,"threshold_uncertainty_score":0.017454624},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Hypergraph; Mathematics; Graph; Discrete mathematics; Fractional coloring; Graph coloring; Graph power; Line graph","score_opus":0.01983438949883126,"score_gpt":0.2645574246920283,"score_spread":0.24472303519319705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132073309","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64310473,0.0007439355,0.28563982,0.0022523226,0.00024966185,0.00018475273,0.0016664129,0.00075437606,0.06540396],"genre_scores_gemma":[0.8575771,0.0005800971,0.11829964,0.00042540132,0.00020399399,0.00024253642,0.0012951236,0.00035982483,0.021016238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992873,0.00021412218,0.00002529723,0.00021445099,0.000107705804,0.00015118068],"domain_scores_gemma":[0.9960908,0.0019335188,0.0004139152,0.0005684098,0.00036590992,0.00062729226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007200694,0.0005592758,0.00067545974,0.001213925,0.0020863712,0.0026613544,0.0015180049,0.0010798249,0.006347728],"category_scores_gemma":[0.0034101058,0.00074253615,0.00059727445,0.0014483394,0.0017457829,0.0036772334,0.001383657,0.001541573,0.00082116516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050454185,0.00019484869,0.0030887634,0.00028862146,0.00008578768,0.00032774833,0.0007879321,0.013721907,0.017770588,0.9203133,0.009903252,0.033012755],"study_design_scores_gemma":[0.00004908514,0.000041823536,0.0010333216,0.000033119864,0.000033393506,0.00019045285,0.00029930455,0.029483179,0.0037386105,0.95929164,0.0057846196,0.000021537166],"about_ca_topic_score_codex":0.002151375,"about_ca_topic_score_gemma":0.0036356484,"teacher_disagreement_score":0.006347728,"about_ca_system_score_codex":0.0013253512,"about_ca_system_score_gemma":0.0009575224,"threshold_uncertainty_score":0.021235228},"labels":[],"label_agreement":null},{"id":"W2132290920","doi":"10.1016/s0012-365x(99)00291-5","title":"Exponents of vertex-transitive digraphs","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Digraph; Combinatorics; Mathematics; Vertex (graph theory); Transitive relation; Conjecture; Exponent; Discrete mathematics; Abelian group; Integer (computer science); Order (exchange); Graph","score_opus":0.016401083506896945,"score_gpt":0.2788626426154422,"score_spread":0.26246155910854524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132290920","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.817212,0.0013881411,0.07157736,0.0018023304,0.00059871055,0.00017894304,0.0013694162,0.000394239,0.10547887],"genre_scores_gemma":[0.968796,0.0010046491,0.009374506,0.00022287053,0.00038831925,0.00008715857,0.00065413024,0.00015108951,0.019321226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929214,0.00014542094,0.00007114846,0.00012755871,0.00020532629,0.00015839536],"domain_scores_gemma":[0.9945766,0.003162619,0.0005865133,0.00030512037,0.00042601323,0.00094319414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009195712,0.0009215385,0.0012153467,0.003546003,0.0018607235,0.004667222,0.0010079229,0.00076574495,0.01008621],"category_scores_gemma":[0.0057206675,0.0007894784,0.00066680496,0.001902735,0.0020059338,0.0058867726,0.0020537777,0.0023753084,0.0013235386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014865088,0.000046189765,0.0008839857,0.00009856401,0.000015089298,0.0005213141,0.000619848,0.00087683665,0.0019786607,0.9867426,0.001889851,0.006178316],"study_design_scores_gemma":[0.00009593757,0.00004585014,0.00090028794,0.00004804453,0.000027413376,0.00041111856,0.00033713473,0.0051440354,0.0011906761,0.9866367,0.005140242,0.000022647864],"about_ca_topic_score_codex":0.0005687437,"about_ca_topic_score_gemma":0.00089725864,"teacher_disagreement_score":0.01008621,"about_ca_system_score_codex":0.0012911409,"about_ca_system_score_gemma":0.0003987084,"threshold_uncertainty_score":0.033741713},"labels":[],"label_agreement":null},{"id":"W2132342512","doi":"10.1016/s0012-365x(02)00446-6","title":"Application des fonctions symétriques à la résolution d’équations différentielles autonomes combinatoires","year":2002,"lang":"fr","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Mathematics; Isomorphism (crystallography); Ring (chemistry); Pure mathematics; Context (archaeology); Combinatorics; Algebra over a field","score_opus":0.034071277776162416,"score_gpt":0.29261164641680054,"score_spread":0.2585403686406381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132342512","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38310376,0.002341638,0.5277593,0.0023464812,0.0011540933,0.00007784957,0.00012142508,0.00043432726,0.08266116],"genre_scores_gemma":[0.8454161,0.001994341,0.11482771,0.00038903303,0.0006075141,0.00008537327,0.0001838037,0.00023323299,0.036262874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993255,0.00027680735,0.000031324038,0.000120130106,0.0001805447,0.00006558606],"domain_scores_gemma":[0.99875593,0.00080798945,0.000083437546,0.0000897012,0.00016255172,0.00010040407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001152828,0.0011099143,0.00078306923,0.0017491075,0.0012204354,0.0024200215,0.00067264604,0.0012583919,0.0047265454],"category_scores_gemma":[0.0037619614,0.00041087283,0.0020286709,0.00089532766,0.0024370225,0.0018135943,0.0014327986,0.0041082804,0.00072054134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017569157,0.00013238341,0.00097052805,0.00015836908,0.00011244259,0.0006661397,0.0007251654,0.030816047,0.024099158,0.8846874,0.0023761413,0.055080518],"study_design_scores_gemma":[0.00019622603,0.00025128058,0.0025882267,0.0000727145,0.00008788819,0.0016057551,0.0007293449,0.31996387,0.030312808,0.60790783,0.036189783,0.000094364485],"about_ca_topic_score_codex":0.0021737807,"about_ca_topic_score_gemma":0.0014053917,"teacher_disagreement_score":0.0047265454,"about_ca_system_score_codex":0.0014522135,"about_ca_system_score_gemma":0.0005059726,"threshold_uncertainty_score":0.01581192},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05433294052060191,"score_gpt":0.2997596365732926,"score_spread":0.24542669605269066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132838208","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.630928,0.0053451075,0.23555058,0.0049933763,0.0006900397,0.00009166333,0.0006650087,0.00064186484,0.121094346],"genre_scores_gemma":[0.95305425,0.0011563865,0.027469069,0.00046032591,0.00032053466,0.00010571332,0.00032806993,0.00011851441,0.016987165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994597,0.00013664171,0.000035201898,0.00010145599,0.00016018191,0.00010691246],"domain_scores_gemma":[0.9973598,0.0011720681,0.00032578892,0.0005255077,0.00024033306,0.0003765755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007649033,0.00025898288,0.0008752,0.0019183545,0.0025512679,0.0050458065,0.0013335858,0.0018324683,0.0077229613],"category_scores_gemma":[0.004824174,0.00062658015,0.00057226804,0.0016491604,0.0046742405,0.0067713386,0.002647359,0.0017978289,0.00073548313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014385153,0.000006380877,0.00014366898,0.000018393539,0.0000035222963,0.000023001927,0.00014285796,0.00100876,0.0002384162,0.9957681,0.0005526133,0.0020799236],"study_design_scores_gemma":[0.000011808987,0.0000044552694,0.00009326639,0.000006927464,0.0000030174567,0.000045238394,0.000099735546,0.002313925,0.00015250845,0.9945215,0.002742159,0.0000053027347],"about_ca_topic_score_codex":0.00091634603,"about_ca_topic_score_gemma":0.0011661218,"teacher_disagreement_score":0.0077229613,"about_ca_system_score_codex":0.0008733015,"about_ca_system_score_gemma":0.0005296827,"threshold_uncertainty_score":0.025835931},"labels":[],"label_agreement":null},{"id":"W2132893794","doi":"10.1016/j.disc.2008.02.018","title":"Minimal factorizations of permutations into star transpositions","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; St. Mary's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Permutation (music); Combinatorics; Simple (philosophy); Star (game theory); Symmetry (geometry); Parity of a permutation; Discrete mathematics; Cyclic permutation; Symmetric group","score_opus":0.012347586672236626,"score_gpt":0.21153801401279682,"score_spread":0.1991904273405602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132893794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25336283,0.00050518586,0.65268934,0.00067404803,0.00030851987,0.00020508213,0.00092744664,0.00084135163,0.0904862],"genre_scores_gemma":[0.7432172,0.0007145976,0.19842932,0.00042252772,0.00026667275,0.00023848285,0.0019491295,0.0005814817,0.054180656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991522,0.0001732099,0.000066135835,0.00020279703,0.00018085421,0.00022493488],"domain_scores_gemma":[0.99853146,0.0005332612,0.00019043432,0.00030079507,0.00024439566,0.00019965436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006227912,0.0007658953,0.0007993848,0.0010979438,0.001421816,0.0025293843,0.00070623227,0.0007583459,0.014654529],"category_scores_gemma":[0.0023370106,0.0006319583,0.0011999449,0.0010774984,0.0014613875,0.0029917606,0.0014716821,0.0015369509,0.003315335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015597233,0.00005454989,0.0002583609,0.00007832885,0.000013956005,0.00012138939,0.00036202956,0.0023530915,0.00465342,0.964539,0.0035710905,0.0238389],"study_design_scores_gemma":[0.00002501472,0.00005454913,0.00017544994,0.000027223878,0.000015594254,0.00013866478,0.0001229014,0.0058039953,0.002089805,0.9832855,0.008246278,0.000015063415],"about_ca_topic_score_codex":0.00075201906,"about_ca_topic_score_gemma":0.00124433,"teacher_disagreement_score":0.014654529,"about_ca_system_score_codex":0.00066569564,"about_ca_system_score_gemma":0.0007679379,"threshold_uncertainty_score":0.049024224},"labels":[],"label_agreement":null},{"id":"W2132962549","doi":"10.1016/j.disc.2011.07.029","title":"A pattern sequence approach to Stern’s sequence","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Sequence (biology); Complement (music); Base (topology); Word (group theory); Integer (computer science); Binary number; Discrete mathematics; Arithmetic; Geometry","score_opus":0.09206309257501788,"score_gpt":0.2726519713867397,"score_spread":0.1805888788117218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132962549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017443592,0.0004419388,0.9229342,0.0009437819,0.0004403265,0.00006375247,0.00011982237,0.0002490007,0.057363555],"genre_scores_gemma":[0.47816706,0.0013522389,0.41924697,0.0009427697,0.0008147981,0.00027785607,0.00034406292,0.0005129198,0.09834151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999382,0.00017554857,0.00005121101,0.00014123574,0.00018890637,0.00006102251],"domain_scores_gemma":[0.9990871,0.00029957504,0.000059792168,0.0001978877,0.000261211,0.000094415096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082602346,0.0005687995,0.00057938416,0.0016046048,0.0011488721,0.0018231388,0.0010877055,0.0010403066,0.0124870585],"category_scores_gemma":[0.0029097176,0.0003310507,0.0007720554,0.0016117478,0.002212746,0.0053344085,0.0016103121,0.0017400135,0.0028938171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008423307,0.00000532617,0.00004010278,0.000012149407,0.0000020261064,0.000027633507,0.000112931135,0.00042074954,0.0005098944,0.9910864,0.00053148676,0.0072428626],"study_design_scores_gemma":[0.0000043087593,0.000017200358,0.00003917889,0.0000072176385,0.0000030263654,0.00008142362,0.000047257457,0.0058534704,0.00049915776,0.98242074,0.011020483,0.0000064582964],"about_ca_topic_score_codex":0.0007371162,"about_ca_topic_score_gemma":0.00055177615,"teacher_disagreement_score":0.0124870585,"about_ca_system_score_codex":0.0009009869,"about_ca_system_score_gemma":0.00068274,"threshold_uncertainty_score":0.04177338},"labels":[],"label_agreement":null},{"id":"W2133964621","doi":"10.1016/s0012-365x(00)00309-5","title":"On an adjacency property of almost all graphs","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Adjacency list; Combinatorics; Property (philosophy); Discrete mathematics","score_opus":0.04621793690242231,"score_gpt":0.31474598516234925,"score_spread":0.26852804825992693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133964621","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5994314,0.0029132725,0.25965065,0.007703283,0.00047392104,0.00006842808,0.0006790468,0.00039062975,0.12868948],"genre_scores_gemma":[0.9543382,0.0022540437,0.026883174,0.0011126618,0.0012003065,0.00014093121,0.00069422985,0.00018836932,0.013188001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904996,0.00032521883,0.00004700738,0.00024329951,0.00021305236,0.00012138166],"domain_scores_gemma":[0.99023294,0.006736746,0.00071050157,0.0006457086,0.0008247632,0.0008492804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015893793,0.0007862063,0.0011064042,0.0029594235,0.002778271,0.0028605831,0.0017635898,0.0016969807,0.0054792613],"category_scores_gemma":[0.008702227,0.00063305994,0.0009979402,0.0035685857,0.005071453,0.0120697515,0.0028557272,0.00382087,0.0005391892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023421468,0.0000175315,0.00025153422,0.00002869152,0.0000060259817,0.000038231374,0.00027914564,0.0008794492,0.0005006057,0.99380904,0.0008729927,0.0032933208],"study_design_scores_gemma":[0.0000043111686,0.000008186539,0.00014295364,0.000006515111,0.000004420191,0.000040969873,0.000063352585,0.002490562,0.000099920086,0.99634176,0.00079222536,0.000004745258],"about_ca_topic_score_codex":0.001635479,"about_ca_topic_score_gemma":0.001268275,"teacher_disagreement_score":0.0054792613,"about_ca_system_score_codex":0.0011915477,"about_ca_system_score_gemma":0.00064689317,"threshold_uncertainty_score":0.018329918},"labels":[],"label_agreement":null},{"id":"W2135113048","doi":"10.1016/j.disc.2012.06.016","title":"Upper bounds on the broadcast function using minimum dominating sets","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Concordia University","funders":"","keywords":"Mathematics; Combinatorics; Dominating set; Upper and lower bounds; Discrete mathematics; Graph; Vertex (graph theory)","score_opus":0.04128615133262544,"score_gpt":0.2757651594480155,"score_spread":0.23447900811539005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135113048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05412986,0.021487577,0.85503954,0.007662689,0.0010579433,0.00026003833,0.0013812013,0.0016118422,0.05736925],"genre_scores_gemma":[0.71883637,0.021076018,0.22006509,0.0026516886,0.0029618507,0.0013164659,0.002262213,0.0017114508,0.029118922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99479973,0.0015749009,0.00017603225,0.0005957122,0.0018957893,0.00095789676],"domain_scores_gemma":[0.94352543,0.04741704,0.0014772299,0.0032031345,0.0027212843,0.0016558524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008502825,0.0042760437,0.00466605,0.0053785266,0.002307831,0.00696277,0.0061181546,0.0034294429,0.008723972],"category_scores_gemma":[0.04361828,0.0017112219,0.0024134377,0.005157839,0.003799143,0.011343999,0.00617651,0.007588724,0.0022433246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00190246,0.00045415555,0.0015523235,0.0019777247,0.00030412053,0.00021873027,0.00077156874,0.41202506,0.009586444,0.3944196,0.031650033,0.14513776],"study_design_scores_gemma":[0.00013104425,0.00023581285,0.0008345857,0.00042346524,0.00025800487,0.00027853687,0.00017923706,0.67242634,0.004778752,0.30991858,0.010455967,0.000079683705],"about_ca_topic_score_codex":0.0024356723,"about_ca_topic_score_gemma":0.003496502,"teacher_disagreement_score":0.008773074,"about_ca_system_score_codex":0.008773074,"about_ca_system_score_gemma":0.0029889643,"threshold_uncertainty_score":0.06365341},"labels":[],"label_agreement":null},{"id":"W2135393175","doi":"10.1016/s0012-365x(02)00680-5","title":"On Hamilton cycle decompositions of the tensor product of complete graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of the Fraser Valley","funders":"","keywords":"Tensor product; Mathematics; Product (mathematics); Tensor (intrinsic definition); Combinatorics; Tensor product of Hilbert spaces; Tensor contraction; Pure mathematics; Geometry","score_opus":0.014568636633819994,"score_gpt":0.199769635454023,"score_spread":0.185200998820203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135393175","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51167613,0.0020597223,0.3770486,0.0012047528,0.00028179458,0.00018288496,0.0012791004,0.00032447896,0.10594254],"genre_scores_gemma":[0.8903881,0.001642992,0.06319726,0.00033481396,0.0002974871,0.00018470128,0.0013915198,0.00030131434,0.042261817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962616,0.00010355906,0.000016106656,0.00006797965,0.00010228523,0.000084007246],"domain_scores_gemma":[0.9986374,0.00047678675,0.00024845847,0.00014251046,0.0002551097,0.00023974733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059204426,0.0008112093,0.0007033924,0.0024778848,0.0011212699,0.0021026984,0.00078841916,0.00076560525,0.009114847],"category_scores_gemma":[0.0019781243,0.00056647306,0.00075580773,0.0017628798,0.0014628515,0.0026764176,0.0009205898,0.0015188647,0.0007644657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032296208,0.000019721067,0.0001753034,0.000034515728,0.000008576441,0.00004624868,0.00020103445,0.004421685,0.00082347787,0.98620784,0.0018892221,0.006140087],"study_design_scores_gemma":[0.000008183579,0.000010412784,0.00018374612,0.000015378138,0.000006034814,0.000030113386,0.00008166711,0.020846725,0.0001975484,0.9765387,0.0020740195,0.000007485956],"about_ca_topic_score_codex":0.0031983806,"about_ca_topic_score_gemma":0.0044512926,"teacher_disagreement_score":0.009114847,"about_ca_system_score_codex":0.001365827,"about_ca_system_score_gemma":0.00067447464,"threshold_uncertainty_score":0.030492127},"labels":[],"label_agreement":null},{"id":"W2136080029","doi":"10.1016/s0012-365x(03)00235-8","title":"A note on random homomorphism from arbitrary graphs to Z","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Homomorphism; Combinatorics; Discrete mathematics; Random graph; Graph","score_opus":0.03144709697083665,"score_gpt":0.27727898541952223,"score_spread":0.2458318884486856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136080029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049379375,0.0063486323,0.8013001,0.025659971,0.0070403125,0.00014713725,0.0005259824,0.000948585,0.10864992],"genre_scores_gemma":[0.72838265,0.0117333215,0.14895327,0.011251636,0.011429205,0.00063848775,0.00055593654,0.001155528,0.085900016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790335,0.0007734099,0.00008325048,0.0005695033,0.0004708385,0.00019967476],"domain_scores_gemma":[0.9885759,0.008498705,0.0004979423,0.0014374332,0.00036897877,0.0006210688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002563069,0.0011663835,0.0017974644,0.0017606432,0.0026074192,0.0027143802,0.0022311118,0.0022777542,0.0068192543],"category_scores_gemma":[0.012443564,0.00073927105,0.0020239854,0.0021040186,0.004815988,0.0106146755,0.006197461,0.0069794958,0.0011523908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028322449,0.000014270162,0.000101617705,0.00005354198,0.000011824334,0.000070967595,0.00010737719,0.0011048602,0.00054962497,0.9869664,0.0045899944,0.00640131],"study_design_scores_gemma":[0.000015014506,0.000029549037,0.00014244851,0.000015606689,0.00002143664,0.00017237436,0.00003075757,0.0062039006,0.00067695335,0.9822918,0.010376136,0.000024012385],"about_ca_topic_score_codex":0.00084945845,"about_ca_topic_score_gemma":0.00057161006,"teacher_disagreement_score":0.0068192543,"about_ca_system_score_codex":0.0015224201,"about_ca_system_score_gemma":0.00074889493,"threshold_uncertainty_score":0.022812665},"labels":[],"label_agreement":null},{"id":"W2136941318","doi":"10.1016/j.disc.2015.09.021","title":"On Hilbert bases of cuts","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Subdivision; Semigroup; Discrete mathematics; Graph","score_opus":0.05055297230452935,"score_gpt":0.32561556219233206,"score_spread":0.27506258988780274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136941318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26381478,0.0028127255,0.39631838,0.005818989,0.0011576249,0.000112543676,0.0011810291,0.0005633359,0.32822058],"genre_scores_gemma":[0.8712982,0.0014737345,0.05412206,0.0012518961,0.00090111524,0.00014413169,0.0011595823,0.00047031452,0.069178954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989759,0.00027643988,0.000036710328,0.00020935904,0.000292906,0.0002086799],"domain_scores_gemma":[0.9984428,0.0006492664,0.00016865559,0.00016679008,0.0002726173,0.00029987676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011146878,0.0012299429,0.0011584361,0.0028194338,0.0019064967,0.0041934713,0.0017674733,0.0014467012,0.016023614],"category_scores_gemma":[0.003477819,0.00081661047,0.0010349414,0.0024486121,0.004041372,0.006822966,0.003597759,0.005729511,0.0019167417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001565372,0.000006830685,0.00003958143,0.000009733233,0.0000036512683,0.000010982051,0.000063966756,0.0003438137,0.00015204909,0.9969105,0.00059601536,0.0018473376],"study_design_scores_gemma":[0.000007334698,0.000004562612,0.00004538853,0.0000047209633,0.0000023651114,0.000011586139,0.000037800044,0.0011595597,0.00006035922,0.9975823,0.0010803824,0.0000036377146],"about_ca_topic_score_codex":0.0020682367,"about_ca_topic_score_gemma":0.0018833957,"teacher_disagreement_score":0.016023614,"about_ca_system_score_codex":0.0022276996,"about_ca_system_score_gemma":0.00070591667,"threshold_uncertainty_score":0.053604305},"labels":[],"label_agreement":null},{"id":"W2137430154","doi":"10.1016/j.disc.2008.03.021","title":"Edge-switching homomorphisms of edge-coloured graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Homomorphism; Vertex (graph theory); Isomorphism (crystallography); Discrete mathematics; Homomorphic encryption; Graph; Graph homomorphism; Corollary; Graph isomorphism; Line graph; Voltage graph; Computer science","score_opus":0.03286005786231506,"score_gpt":0.2848804775606165,"score_spread":0.25202041969830147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137430154","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7903577,0.00034519588,0.16873115,0.0005236374,0.00031708705,0.00011059766,0.0003435872,0.0008547922,0.03841627],"genre_scores_gemma":[0.96304274,0.0003016463,0.024460968,0.00024365127,0.00015739532,0.00008999292,0.0003032084,0.00019323229,0.011207114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890053,0.0002493668,0.000062520194,0.00032175842,0.00020948685,0.00025634182],"domain_scores_gemma":[0.996403,0.0016923202,0.0003965997,0.0005061905,0.00030234738,0.0006996513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010481967,0.0005091383,0.0005336473,0.0018666099,0.0014417843,0.0024914665,0.001434818,0.0009977763,0.005154256],"category_scores_gemma":[0.0036188406,0.0006217293,0.00095717306,0.0013710232,0.0022279222,0.0036752843,0.0019401376,0.0024800133,0.0005409048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023107426,0.00014638876,0.0011763654,0.00006533351,0.000026815194,0.00036847274,0.0012455509,0.0024689646,0.009407474,0.9640008,0.0011228373,0.019739848],"study_design_scores_gemma":[0.000050458057,0.000065569344,0.0010945256,0.000016128532,0.00003384429,0.0003383398,0.0003018834,0.008778479,0.0045909737,0.9814471,0.0032516248,0.00003114548],"about_ca_topic_score_codex":0.0008197727,"about_ca_topic_score_gemma":0.00067013013,"teacher_disagreement_score":0.005154256,"about_ca_system_score_codex":0.00097194506,"about_ca_system_score_gemma":0.00055513374,"threshold_uncertainty_score":0.01724267},"labels":[],"label_agreement":null},{"id":"W2137906639","doi":"10.1016/s0012-365x(99)00251-4","title":"Extremal graphs for inequalities involving domination parameters","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Science Foundation","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Domination analysis; Characterization (materials science); Upper and lower bounds; Discrete mathematics; Graph; Extremal combinatorics; Inequality; Chordal graph","score_opus":0.04637501544429559,"score_gpt":0.31262080457621927,"score_spread":0.26624578913192365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137906639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24254745,0.004229422,0.57524425,0.0082407,0.00063179684,0.0001772485,0.001204497,0.0004403145,0.1672843],"genre_scores_gemma":[0.9236846,0.0020822568,0.050769456,0.0013086252,0.0012064984,0.00034278087,0.00079379056,0.00037516974,0.01943684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971284,0.0011167771,0.000117644806,0.00061943545,0.00057308684,0.00044467332],"domain_scores_gemma":[0.977693,0.01747227,0.0017816499,0.0011349723,0.00082325866,0.00109469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039184513,0.0018142124,0.002121834,0.0045559322,0.0026594526,0.0057632844,0.004737457,0.0034918215,0.014388454],"category_scores_gemma":[0.023510657,0.0014313468,0.0014271424,0.0039396374,0.004576913,0.012949098,0.0041391836,0.0096057495,0.00088636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050081762,0.000021213053,0.00020537595,0.000068608875,0.000017176773,0.00004715891,0.000115621515,0.002771551,0.00047139058,0.9919757,0.0012754771,0.0029805747],"study_design_scores_gemma":[0.000008821061,0.0000056460062,0.00017691101,0.000020849773,0.000011809311,0.00004824436,0.000041991727,0.0114723975,0.00015677753,0.9872214,0.0008244822,0.000010628658],"about_ca_topic_score_codex":0.001003795,"about_ca_topic_score_gemma":0.0013837215,"teacher_disagreement_score":0.014388454,"about_ca_system_score_codex":0.0032237372,"about_ca_system_score_gemma":0.00073443115,"threshold_uncertainty_score":0.048134148},"labels":[],"label_agreement":null},{"id":"W2137962531","doi":"10.1016/j.disc.2013.05.012","title":"A lower bound for the chromatic capacity in terms of the chromatic number of a graph","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Combinatorics; Mathematics; Monochromatic color; Chromatic scale; Conjecture; Graph; Wheel graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Upper and lower bounds; Graph power; Physics; Line graph; Computer science; Optics; Mathematical analysis","score_opus":0.03284534236989184,"score_gpt":0.29258533012331056,"score_spread":0.2597399877534187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137962531","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12676825,0.016687775,0.62518084,0.017195698,0.0017808052,0.0003026752,0.007594411,0.0027741129,0.20171548],"genre_scores_gemma":[0.8226574,0.009998327,0.119535126,0.0030425927,0.0038359924,0.0011368168,0.0040233415,0.0018547144,0.0339158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952756,0.0009811819,0.00017460033,0.0011522095,0.0012545175,0.0011617658],"domain_scores_gemma":[0.9557603,0.034683693,0.0011501192,0.004164185,0.0021286414,0.002113054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003566167,0.0037419489,0.0031056348,0.007880102,0.0031657172,0.0077731404,0.007972419,0.0040308293,0.029618565],"category_scores_gemma":[0.026944261,0.0015288811,0.0020974781,0.009225513,0.005899299,0.015141134,0.0062272297,0.008683437,0.0040740576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065162056,0.00028733045,0.0017993511,0.0011897335,0.00026168596,0.00029176482,0.00053745223,0.13073467,0.016900584,0.7635438,0.036791872,0.047010135],"study_design_scores_gemma":[0.00005719125,0.00010908362,0.0016120323,0.0003872593,0.00019399746,0.0004078142,0.00015422874,0.29148027,0.0055199233,0.6821926,0.017697955,0.00018764508],"about_ca_topic_score_codex":0.004752089,"about_ca_topic_score_gemma":0.006163101,"teacher_disagreement_score":0.029618565,"about_ca_system_score_codex":0.0065829204,"about_ca_system_score_gemma":0.0029991984,"threshold_uncertainty_score":0.09908396},"labels":[],"label_agreement":null},{"id":"W2139277171","doi":"10.1016/j.disc.2008.02.023","title":"On the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si66.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-orientability of random graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Scroll; Combinatorics; Discrete mathematics; Algorithm; Theology; Philosophy","score_opus":0.022976516589453093,"score_gpt":0.2663674007408643,"score_spread":0.2433908841514112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139277171","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030830032,0.0008875053,0.15112396,0.008058176,0.003624041,0.00038557962,0.17536986,0.051936578,0.6055313],"genre_scores_gemma":[0.027866615,0.0032326626,0.0789208,0.0031972474,0.0017811798,0.0006623858,0.20273823,0.04230827,0.63929254],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999401,0.00009049065,0.000042433032,0.00008619178,0.00032535667,0.000054519394],"domain_scores_gemma":[0.99835867,0.0007433965,0.000092018796,0.0003208193,0.00035995702,0.0001251378],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00052973593,0.0011747719,0.0010802555,0.00271347,0.0008314058,0.0037673158,0.0018176585,0.0012169726,0.5677579],"category_scores_gemma":[0.003892034,0.00074067287,0.0010802622,0.004827158,0.0006667392,0.004039635,0.002274996,0.002025608,0.30171347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045860386,0.000028320885,0.000113250484,0.00017980358,0.000006731227,0.00006731988,0.00009591234,0.0006812333,0.0010394217,0.044667855,0.91524583,0.037828464],"study_design_scores_gemma":[0.000046969984,0.000012082912,0.000894996,0.00011018916,0.0000060766843,0.00013121363,0.00006278102,0.00278513,0.0021084691,0.061902523,0.93190145,0.00003822028],"about_ca_topic_score_codex":0.006989937,"about_ca_topic_score_gemma":0.010361264,"teacher_disagreement_score":0.5677579,"about_ca_system_score_codex":0.001569572,"about_ca_system_score_gemma":0.0008499074,"threshold_uncertainty_score":0.6165409},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Quadratic equation; GF(2); Combinatorics; Discrete mathematics; Finite field","score_opus":0.015836492332065445,"score_gpt":0.2384164064629816,"score_spread":0.22257991413091616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139563752","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5911467,0.00042309493,0.30130744,0.0010688914,0.00023673277,0.00016579177,0.00020089718,0.0004539999,0.10499643],"genre_scores_gemma":[0.93146604,0.00034429698,0.039763495,0.00017206321,0.00022777896,0.00013395109,0.00026007867,0.00019289032,0.02743941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824834,0.0005183379,0.00007079125,0.00019653552,0.00049192226,0.00047409232],"domain_scores_gemma":[0.9967528,0.0019582612,0.00032900163,0.0003215084,0.00038929546,0.0002491201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013607226,0.00059604045,0.0006896835,0.0010040638,0.0015044564,0.0023451073,0.00073406094,0.0009814668,0.006581309],"category_scores_gemma":[0.0058207484,0.0003252485,0.0008013998,0.0009774049,0.0026297884,0.0031193767,0.0018756462,0.001835916,0.0011021994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004552948,0.000082646606,0.0009423079,0.00005545203,0.000017002214,0.00023725588,0.0007144945,0.015261969,0.0036994314,0.96271783,0.0014889193,0.014327478],"study_design_scores_gemma":[0.0000674877,0.00016764119,0.0005160148,0.00003760891,0.000016774859,0.00030171298,0.00018366467,0.12016889,0.009579275,0.86475223,0.0041635423,0.000045105906],"about_ca_topic_score_codex":0.0009523142,"about_ca_topic_score_gemma":0.00084048806,"teacher_disagreement_score":0.006581309,"about_ca_system_score_codex":0.0010303844,"about_ca_system_score_gemma":0.0009559314,"threshold_uncertainty_score":0.022016644},"labels":[],"label_agreement":null},{"id":"W2139964171","doi":"10.1016/j.disc.2010.03.007","title":"On the base sequence conjecture","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Mathematics; Combinatorics; Base (topology); Hadamard transform; Hadamard matrix; Sequence (biology); Graph; Order (exchange); Discrete mathematics","score_opus":0.012978194770711046,"score_gpt":0.21385572170279482,"score_spread":0.20087752693208377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139964171","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20759392,0.005121908,0.13851637,0.05599853,0.00472683,0.00006491593,0.001132689,0.0008952884,0.5859495],"genre_scores_gemma":[0.9069185,0.003277805,0.013408499,0.008993425,0.005932019,0.00015298375,0.001215346,0.00039618852,0.059705198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883264,0.00030340505,0.000029715824,0.00028181545,0.00035840593,0.00019403243],"domain_scores_gemma":[0.9952951,0.0030822833,0.0002181756,0.00060309283,0.00043247928,0.00036888465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014950259,0.0010269915,0.0015729826,0.0015019494,0.0026034417,0.0037502917,0.001464559,0.0028031,0.019862989],"category_scores_gemma":[0.008638826,0.00048364847,0.00070491235,0.0018722872,0.0039508543,0.009478234,0.0032621967,0.0061687897,0.00345495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006076231,0.000023837174,0.00016775858,0.00003683955,0.000005522947,0.000055806024,0.000106636384,0.000731212,0.00025319876,0.9854114,0.008144846,0.005002241],"study_design_scores_gemma":[0.000012528589,0.000005879395,0.000055476456,0.000011391125,0.0000029872028,0.000032929613,0.000026797767,0.0013641281,0.00009168862,0.99535996,0.003032554,0.0000036444071],"about_ca_topic_score_codex":0.0010056285,"about_ca_topic_score_gemma":0.00051544205,"teacher_disagreement_score":0.019862989,"about_ca_system_score_codex":0.0012980365,"about_ca_system_score_gemma":0.00069134776,"threshold_uncertainty_score":0.06644827},"labels":[],"label_agreement":null},{"id":"W2140257813","doi":"10.1016/j.disc.2011.07.005","title":"Forbidden configurations and repeated induction","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Forb; Simple (philosophy); Matrix (chemical analysis); Conjecture; Permutation (music); Concatenation (mathematics); Discrete mathematics; Physics","score_opus":0.026610481705318167,"score_gpt":0.2025038179924041,"score_spread":0.17589333628708595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140257813","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17066856,0.0010992846,0.524313,0.0029996778,0.00064585014,0.00013810986,0.0005137336,0.00083846867,0.2987834],"genre_scores_gemma":[0.83493793,0.00077389827,0.08963643,0.0010215068,0.0003724458,0.00028893765,0.0007491,0.00050936826,0.07171034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998054,0.00060576753,0.00008059733,0.00043594925,0.0004362618,0.00038742283],"domain_scores_gemma":[0.9960502,0.0023055184,0.00024302836,0.0007017915,0.00039742194,0.00030208877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096470374,0.00079818064,0.0012282641,0.0018581616,0.0037162635,0.0026719854,0.003056853,0.001429086,0.014219223],"category_scores_gemma":[0.003559494,0.00097405823,0.001703689,0.00200281,0.004647712,0.005439167,0.0041360515,0.006512422,0.0024064127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017672728,0.000018260347,0.00007222975,0.000017209275,0.0000045287056,0.000084797946,0.00014145959,0.00059599034,0.00038387554,0.9945004,0.0009160533,0.0032475083],"study_design_scores_gemma":[0.000005082802,0.0000037988498,0.000034154713,0.0000057415486,0.000003599664,0.00005619117,0.000030009407,0.001318634,0.00035562276,0.99667716,0.0015044775,0.000005528696],"about_ca_topic_score_codex":0.0012495285,"about_ca_topic_score_gemma":0.0014873169,"teacher_disagreement_score":0.014219223,"about_ca_system_score_codex":0.0015074557,"about_ca_system_score_gemma":0.0007662457,"threshold_uncertainty_score":0.047568023},"labels":[],"label_agreement":null},{"id":"W2141324117","doi":"10.1016/j.disc.2015.05.025","title":"Generalized de Bruijn words for primitive words and powers","year":2015,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lexicographical order; De Bruijn sequence; Combinatorics; Word (group theory); Alphabet; Mathematics; Order (exchange); Upper and lower bounds; Combinatorics on words; Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.03411923224235038,"score_gpt":0.2946641922986173,"score_spread":0.2605449600562669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141324117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2764235,0.007518003,0.3547751,0.00978165,0.0025890137,0.0002289237,0.0012112305,0.00069612946,0.34677655],"genre_scores_gemma":[0.8724216,0.0025584332,0.04662768,0.0013949693,0.0021067248,0.00026360326,0.00049188716,0.0003565032,0.07377847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998251,0.0005645431,0.00010526269,0.00036370856,0.0004444524,0.0002708661],"domain_scores_gemma":[0.9978083,0.0010514404,0.00026823403,0.0004335612,0.00025098963,0.00018747518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011701136,0.0013159603,0.0013348929,0.003166048,0.0025779523,0.0062248698,0.0012992277,0.0020885337,0.012925594],"category_scores_gemma":[0.004845796,0.00086954806,0.00091915426,0.0036250683,0.0063407025,0.009217222,0.003464161,0.004678051,0.0030087626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010468427,0.0000035106261,0.00002016682,0.000013249482,0.0000014925213,0.000023832064,0.000092536044,0.00015898827,0.00017024692,0.9971765,0.00057491334,0.0017541476],"study_design_scores_gemma":[0.0000035743853,0.000002042523,0.000014307784,0.000006663911,0.0000016392282,0.000036173387,0.000022673174,0.0005176565,0.00011748635,0.9967174,0.0025559664,0.00000437565],"about_ca_topic_score_codex":0.00059115706,"about_ca_topic_score_gemma":0.000533189,"teacher_disagreement_score":0.012925594,"about_ca_system_score_codex":0.0018649573,"about_ca_system_score_gemma":0.0007875819,"threshold_uncertainty_score":0.043240428},"labels":[],"label_agreement":null},{"id":"W2142062721","doi":"10.1016/s0012-365x(99)00359-3","title":"On the problem of a matching orthogonal to a 2-factorization","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Matching (statistics); Graph factorization; Factorization; Bipartite graph; Enhanced Data Rates for GSM Evolution; Graph; Factor-critical graph; Discrete mathematics; Algorithm; Line graph; Graph power; Computer science; Artificial intelligence","score_opus":0.007633022768852604,"score_gpt":0.1989644467495303,"score_spread":0.19133142398067768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142062721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18076715,0.002093201,0.7315525,0.013508247,0.0011415718,0.00031440475,0.0010790346,0.0004360014,0.06910794],"genre_scores_gemma":[0.6489673,0.0029911823,0.28548643,0.002210295,0.0018406755,0.0003510385,0.0014517495,0.0005459213,0.05615537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984491,0.00053626375,0.000079493286,0.0004500441,0.00023762567,0.00024754682],"domain_scores_gemma":[0.9921257,0.006122138,0.0005480101,0.00048335368,0.0004010375,0.0003197149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002636877,0.0010916849,0.0021772783,0.001110853,0.0020489506,0.0032440373,0.001731843,0.0057263714,0.016022403],"category_scores_gemma":[0.018057086,0.0009878771,0.0013269794,0.002144563,0.003555067,0.0090551535,0.0032899417,0.0036253904,0.0016175321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042955545,0.00016731516,0.00042046382,0.000338003,0.000053825624,0.00016304092,0.00030493175,0.03365811,0.0013490458,0.90785694,0.016235676,0.039023187],"study_design_scores_gemma":[0.00006785573,0.00004860635,0.00012531267,0.000039104827,0.000015910127,0.000099717785,0.00017410255,0.062991545,0.00040845355,0.9324659,0.003542812,0.000020748144],"about_ca_topic_score_codex":0.0028729173,"about_ca_topic_score_gemma":0.0016490121,"teacher_disagreement_score":0.016022403,"about_ca_system_score_codex":0.0013826097,"about_ca_system_score_gemma":0.0017928334,"threshold_uncertainty_score":0.05360031},"labels":[],"label_agreement":null},{"id":"W2142143427","doi":"10.1016/j.disc.2015.09.027","title":"Uniqueness and minimal obstructions for tree-depth","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Conjecture; Discrete mathematics; Graph; Uniqueness","score_opus":0.06581150215029835,"score_gpt":0.3367363074743629,"score_spread":0.27092480532406454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142143427","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47077537,0.0023440365,0.365635,0.0075447634,0.00065197225,0.00017408573,0.00094143033,0.0010448177,0.15088856],"genre_scores_gemma":[0.9343551,0.0008368713,0.036484994,0.0008880812,0.0004997165,0.00018711288,0.0005555952,0.00055624626,0.02563647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980672,0.00035748119,0.00012469402,0.00048230102,0.0004982032,0.0004701588],"domain_scores_gemma":[0.9936272,0.003644618,0.0005056756,0.00065898936,0.0005243247,0.0010391382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018872415,0.0008559639,0.0019966622,0.0032193947,0.0047055488,0.0050274264,0.0026011658,0.0031330602,0.011601489],"category_scores_gemma":[0.010207277,0.0015201321,0.0024696365,0.0023474356,0.0061369403,0.014913268,0.009477325,0.008316793,0.0011223316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031300977,0.000019412213,0.00022185147,0.00003900142,0.000008039592,0.000045069883,0.00027643956,0.0004444413,0.00034775716,0.9959013,0.0007497477,0.0019155697],"study_design_scores_gemma":[0.000012850344,0.000007385211,0.00013974903,0.000011096701,0.000012818802,0.00006782368,0.000096178985,0.001598011,0.00022809302,0.9964629,0.0013507145,0.000012455504],"about_ca_topic_score_codex":0.0010626869,"about_ca_topic_score_gemma":0.0013563276,"teacher_disagreement_score":0.011601489,"about_ca_system_score_codex":0.0017902572,"about_ca_system_score_gemma":0.0010891006,"threshold_uncertainty_score":0.03881079},"labels":[],"label_agreement":null},{"id":"W2142334108","doi":"10.1016/j.disc.2005.02.022","title":"Detailed wordlength pattern of regular fractional factorial split-plot designs in terms of complementary sets","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Optimal Experimental Design Methods","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Science Foundation","keywords":"Mathematics; Fractional factorial design; Factorial; Split plot; Factorial experiment; Plot (graphics); Arithmetic; Discrete mathematics; Combinatorics; Statistics; Mathematical analysis","score_opus":0.14529886469096281,"score_gpt":0.4207809977068823,"score_spread":0.2754821330159195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142334108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0570567,0.0004394709,0.9303028,0.00022118624,0.000100489204,0.00031529003,0.0007041073,0.00088602974,0.009973898],"genre_scores_gemma":[0.44317853,0.00039160936,0.54698193,0.00018958458,0.000059960297,0.0014893272,0.0007450962,0.00041580765,0.0065481453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945825,0.0025127404,0.00044476698,0.0009207813,0.0013270675,0.00021217573],"domain_scores_gemma":[0.9801564,0.013285306,0.0014264779,0.0028029613,0.0021074761,0.00022137465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004010417,0.0008436024,0.0010966915,0.0014577716,0.0004365593,0.0014914981,0.001187324,0.00096682325,0.0134907225],"category_scores_gemma":[0.021839662,0.00068947126,0.00071086246,0.0014842722,0.0013345171,0.0016552821,0.00061096775,0.0010585851,0.0016352782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026183242,0.00037787724,0.0023554403,0.0013075201,0.00011530645,0.0003046466,0.00040624273,0.041765485,0.08565255,0.4763215,0.005715102,0.38306013],"study_design_scores_gemma":[0.0003664624,0.0012096327,0.0062853717,0.0002696493,0.00011696416,0.00063740916,0.00015035922,0.37500143,0.055394202,0.54566514,0.014753151,0.0001502477],"about_ca_topic_score_codex":0.00027023608,"about_ca_topic_score_gemma":0.00036852199,"teacher_disagreement_score":0.0134907225,"about_ca_system_score_codex":0.0008429595,"about_ca_system_score_gemma":0.0009838261,"threshold_uncertainty_score":0.045131028},"labels":[],"label_agreement":null},{"id":"W2143157065","doi":"10.1016/j.disc.2008.04.052","title":"Nordhaus–Gaddum inequalities for the fractional and circular chromatic numbers","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Chromatic scale; Graph; Inequality; Discrete mathematics; Rational number; Windmill graph; Integer (computer science); Graph power; Line graph; Mathematical analysis","score_opus":0.03739885792471782,"score_gpt":0.25553148185387725,"score_spread":0.21813262392915944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143157065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16153659,0.01114087,0.49841118,0.014972535,0.0014754538,0.0001231555,0.0015460877,0.00029266634,0.31050146],"genre_scores_gemma":[0.80743015,0.006567882,0.14125368,0.0025236495,0.0014694629,0.0003458315,0.00073225243,0.00017921443,0.039497912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990189,0.0002918646,0.000048239686,0.00022975709,0.00022280207,0.00018840565],"domain_scores_gemma":[0.99351877,0.004752241,0.0004034163,0.00042003143,0.00045223458,0.00045337202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027603135,0.00092711026,0.0011483495,0.003961322,0.0027890098,0.004099999,0.0022694536,0.002342516,0.009767287],"category_scores_gemma":[0.010810914,0.0006108688,0.0011520573,0.003458179,0.00511272,0.009008174,0.0029335413,0.00633609,0.0009326209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019255602,0.0000064479364,0.000084429834,0.000026313992,0.0000031790428,0.000011020703,0.000058405923,0.0010773189,0.00019913816,0.994436,0.001220922,0.002857572],"study_design_scores_gemma":[0.000008852617,0.0000046256177,0.00016900932,0.00002116144,0.000005289397,0.000023551345,0.0000362941,0.007775107,0.00019958596,0.98855394,0.0031909887,0.000011596464],"about_ca_topic_score_codex":0.0034125242,"about_ca_topic_score_gemma":0.0036622693,"teacher_disagreement_score":0.009767287,"about_ca_system_score_codex":0.0048537906,"about_ca_system_score_gemma":0.0013785115,"threshold_uncertainty_score":0.035216868},"labels":[],"label_agreement":null},{"id":"W2144688537","doi":"10.1016/s0012-365x(03)00236-x","title":"Channel assignment on graphs of bounded treewidth","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Treewidth; Mathematics; Partial k-tree; Bipartite graph; Discrete mathematics; Vertex (graph theory); Bounded function; Chordal graph; Clique-sum; 1-planar graph; Pathwidth; Graph; Line graph","score_opus":0.032515523825681424,"score_gpt":0.29640658569259887,"score_spread":0.26389106186691746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144688537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3563684,0.0006706502,0.6089427,0.0024630106,0.00022811405,0.000137396,0.0006824983,0.0015350649,0.028972179],"genre_scores_gemma":[0.8994015,0.0007487142,0.08361334,0.0004989988,0.00023063172,0.00023089825,0.00055791787,0.0005702222,0.01414785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998489,0.0004246889,0.000052970707,0.0002735425,0.00025429868,0.00050551584],"domain_scores_gemma":[0.9854702,0.00970597,0.00092020084,0.0015056662,0.0010157424,0.0013822936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001346338,0.00069749216,0.0013192055,0.0014186497,0.0025722452,0.0035849682,0.0021778843,0.0013745675,0.008293873],"category_scores_gemma":[0.009387059,0.00079635874,0.00058819435,0.002336088,0.0021413716,0.008046966,0.0030440572,0.0022193538,0.00092533947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005137933,0.00014631824,0.0006059236,0.00018574328,0.000021822725,0.00015208422,0.00045552466,0.037792675,0.0046121255,0.923559,0.007103702,0.024851346],"study_design_scores_gemma":[0.00006706019,0.00003533557,0.00019482036,0.000029343764,0.000028914383,0.00008021447,0.0001620091,0.098480284,0.0020066618,0.8961161,0.0027740197,0.00002517171],"about_ca_topic_score_codex":0.0020603803,"about_ca_topic_score_gemma":0.0025387928,"teacher_disagreement_score":0.008293873,"about_ca_system_score_codex":0.0018989996,"about_ca_system_score_gemma":0.0017599586,"threshold_uncertainty_score":0.027745724},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.013538983090129991,"score_gpt":0.22829075911196148,"score_spread":0.2147517760218315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146551015","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41634235,0.0010870097,0.4043043,0.0010171555,0.00024153778,0.00018970699,0.0030946527,0.00035614154,0.173367],"genre_scores_gemma":[0.8508242,0.00070316,0.05508052,0.00038852406,0.00015243505,0.00018687299,0.0027379824,0.0002904463,0.08963601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997602,0.000052504784,0.000012188644,0.000051324132,0.00005424462,0.00006956318],"domain_scores_gemma":[0.99938786,0.00016671917,0.000104103776,0.00007684701,0.00012657732,0.00013788919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022924186,0.00029357232,0.00024049403,0.0012205587,0.00068953267,0.0013287708,0.0005192628,0.0005057151,0.019237002],"category_scores_gemma":[0.0009425652,0.00031255264,0.00036046165,0.0007422871,0.00071324117,0.001472885,0.0008069486,0.0007104161,0.0014190922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044385175,0.00002394759,0.00021896728,0.00006580405,0.000013851002,0.00012160638,0.0002228563,0.0046650297,0.0024600166,0.9764885,0.0054687033,0.010206351],"study_design_scores_gemma":[0.00003195793,0.000017398439,0.0007531452,0.00002889191,0.00001126284,0.00010420453,0.00021269747,0.018806953,0.0011131639,0.97082,0.0080879135,0.000012550786],"about_ca_topic_score_codex":0.0011491161,"about_ca_topic_score_gemma":0.0029207352,"teacher_disagreement_score":0.019237002,"about_ca_system_score_codex":0.0008041917,"about_ca_system_score_gemma":0.00036027443,"threshold_uncertainty_score":0.06435424},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023228310909942266,"score_gpt":0.31802018887315664,"score_spread":0.2947918779632144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148534827","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12989254,0.028869933,0.19223821,0.037561156,0.010813925,0.0000669268,0.0005570432,0.00065495603,0.5993453],"genre_scores_gemma":[0.7838297,0.015175056,0.0416902,0.005076056,0.017159434,0.00016157654,0.00056053547,0.00061065756,0.1357367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797803,0.00076936494,0.00007858343,0.00029409956,0.0006833443,0.00019652219],"domain_scores_gemma":[0.9952559,0.0029667206,0.0002272469,0.00048465474,0.00053332513,0.00053217536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021268579,0.0016099977,0.0022041048,0.003990786,0.0040361295,0.005021848,0.0032102298,0.00272913,0.01038067],"category_scores_gemma":[0.009143458,0.0007440807,0.0013295935,0.004707713,0.006943697,0.010679954,0.005762287,0.0075440058,0.001849555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009556722,0.00001599095,0.00004735021,0.0000540809,0.000004691795,0.000018278199,0.00008288645,0.00040552788,0.000068013374,0.9939056,0.002503206,0.0028847866],"study_design_scores_gemma":[0.0000038557077,0.0000018600584,0.000022156877,0.000010017535,0.000003950495,0.00002078084,0.000014879283,0.0009389914,0.00004809334,0.9958144,0.0031173374,0.0000035879527],"about_ca_topic_score_codex":0.0008422365,"about_ca_topic_score_gemma":0.0007763895,"teacher_disagreement_score":0.01038067,"about_ca_system_score_codex":0.0023747007,"about_ca_system_score_gemma":0.0013142782,"threshold_uncertainty_score":0.03472674},"labels":[],"label_agreement":null},{"id":"W2148613230","doi":"10.1016/j.disc.2007.09.036","title":"Existence of HSOLSSOMs of type<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msup><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mi>u</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:math>","year":2007,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"Natural Sciences and Engineering Research Council of Canada; University Research Committee, Emory University; Mount Saint Vincent University; National Science Foundation","keywords":"Type (biology); Mathematics; Combinatorics","score_opus":0.018511940353796677,"score_gpt":0.23985099198396553,"score_spread":0.22133905163016887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148613230","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5518076,0.0011194273,0.1491214,0.0046381583,0.000747135,0.00016847684,0.0050560078,0.0017444049,0.2855974],"genre_scores_gemma":[0.8818027,0.00049996976,0.02658817,0.00067843474,0.00028871998,0.000100556535,0.003896787,0.00034563924,0.085799046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993643,0.00008493457,0.000032727396,0.0001333512,0.00014899771,0.00023558736],"domain_scores_gemma":[0.99510175,0.0021643704,0.0004604073,0.00052368775,0.0009224313,0.0008273535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047701373,0.00052374025,0.00051051064,0.0019740297,0.0023086525,0.0030652962,0.00053464243,0.0009551975,0.038117554],"category_scores_gemma":[0.0038352131,0.0005110891,0.0008280725,0.0009916882,0.0013551757,0.0029250237,0.002283041,0.0014419025,0.006313898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038224933,0.000108370725,0.003945738,0.0002192456,0.000046756584,0.000489208,0.0005455355,0.0010727219,0.005445716,0.94811094,0.020150619,0.019482942],"study_design_scores_gemma":[0.0001231284,0.00010541739,0.004750234,0.00012118248,0.000063857886,0.0011964424,0.0013556816,0.012438482,0.013187044,0.9073572,0.059239294,0.00006203821],"about_ca_topic_score_codex":0.00085347414,"about_ca_topic_score_gemma":0.0014608603,"teacher_disagreement_score":0.038117554,"about_ca_system_score_codex":0.0011761911,"about_ca_system_score_gemma":0.00080108835,"threshold_uncertainty_score":0.12751591},"labels":[],"label_agreement":null},{"id":"W2148690319","doi":"10.1016/j.disc.2011.01.008","title":"Existence of cyclic <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mrow><mml:mo>(</mml:mo><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mi>λ</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>-GDD of type <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:msup><mml:mrow><mml:mi>g</mml:mi></mml:mrow><mml:mrow><mml:mi>v</mml:mi></mml:mrow></mml:msup></mml:math> having prescribed number of short orbits","year":2011,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Block (permutation group theory); Mathematics; Scroll; Algorithm; Combinatorics; Theology; Philosophy","score_opus":0.021680919208669144,"score_gpt":0.2432433234344426,"score_spread":0.22156240422577345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148690319","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49654105,0.0017606583,0.27402672,0.003877479,0.00066092,0.00025809152,0.0061098477,0.0014898389,0.21527545],"genre_scores_gemma":[0.88946164,0.0008235055,0.050582636,0.0005455304,0.00022785677,0.00016443478,0.00515315,0.00042493726,0.05261633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912244,0.00010574473,0.000051044186,0.00022156266,0.00021673668,0.00028241763],"domain_scores_gemma":[0.99529654,0.0019445559,0.0006099168,0.0007013809,0.0008916756,0.0005558991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061295787,0.0005525666,0.00067240663,0.0016571743,0.0023602466,0.0029109407,0.0008149112,0.0011563606,0.023576962],"category_scores_gemma":[0.00515364,0.00057423394,0.0009365438,0.0011573166,0.0013411472,0.002647413,0.0021534653,0.0014974516,0.0049889428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036753571,0.00010562833,0.002544768,0.00031373682,0.000047420235,0.00046530666,0.00074625417,0.0025953983,0.010783753,0.94113433,0.017954001,0.02294196],"study_design_scores_gemma":[0.00013539997,0.00014713965,0.00252146,0.00017824862,0.000075196884,0.0014866673,0.000659888,0.023768593,0.023809474,0.8934777,0.05363825,0.00010204806],"about_ca_topic_score_codex":0.0018738956,"about_ca_topic_score_gemma":0.0023943186,"teacher_disagreement_score":0.023576962,"about_ca_system_score_codex":0.001520106,"about_ca_system_score_gemma":0.0016326436,"threshold_uncertainty_score":0.07887286},"labels":[],"label_agreement":null},{"id":"W2148892386","doi":"10.1016/j.disc.2014.01.013","title":"A new proof for the Erdős–Ko–Rado theorem for the alternating group","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Coset; Alternating group; Group (periodic table); Discrete mathematics; Combinatorial proof; Algebraic number; Symmetric group","score_opus":0.03293154812879251,"score_gpt":0.30649463699279755,"score_spread":0.27356308886400504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148892386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04738711,0.0061974376,0.74255663,0.01572253,0.0061449,0.00015945849,0.0010726559,0.000992458,0.17976685],"genre_scores_gemma":[0.5905088,0.008647107,0.29174027,0.01094765,0.0072115394,0.00053078844,0.0010889976,0.0012966362,0.08802805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999099,0.0002087763,0.00007653471,0.00024112899,0.00027938848,0.00009511599],"domain_scores_gemma":[0.9975051,0.0011840226,0.0002072802,0.00029853926,0.00051122904,0.0002938307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021052524,0.0016552417,0.0012525974,0.0037947078,0.0014796865,0.0019248767,0.001699227,0.001751427,0.01314587],"category_scores_gemma":[0.0052301837,0.00053590693,0.0018932826,0.0017733596,0.0035691133,0.0073829778,0.005012602,0.006856355,0.0020782305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037120677,0.00004415064,0.0002308559,0.00018953466,0.000030169575,0.00016840914,0.00024134335,0.00064009725,0.0024192822,0.97351825,0.006983905,0.015496982],"study_design_scores_gemma":[0.000026640797,0.000028994611,0.0003216006,0.000037222682,0.00003930989,0.00026505865,0.00006457506,0.003669575,0.0008743916,0.9659077,0.028733421,0.000031537893],"about_ca_topic_score_codex":0.0007331801,"about_ca_topic_score_gemma":0.0008434899,"teacher_disagreement_score":0.01314587,"about_ca_system_score_codex":0.0012443892,"about_ca_system_score_gemma":0.00070541265,"threshold_uncertainty_score":0.04397732},"labels":[],"label_agreement":null},{"id":"W2149824583","doi":"10.1016/j.disc.2008.01.030","title":"Shortened recurrence relations for Bernoulli numbers","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bernoulli number; Mathematics; Stirling numbers of the first kind; Recurrence relation; Stirling number; Stirling numbers of the second kind; Bernoulli's principle; Combinatorics; Bernoulli polynomials; Discrete mathematics; Bernoulli process","score_opus":0.0917419491776357,"score_gpt":0.3525544244270336,"score_spread":0.2608124752493979,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149824583","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18538631,0.014779089,0.57600313,0.0061465492,0.005440957,0.00017004427,0.0010622822,0.0009923434,0.21001926],"genre_scores_gemma":[0.7498611,0.006104658,0.1406367,0.0022966226,0.0038011435,0.0003359325,0.001025485,0.0008042188,0.09513415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882454,0.00034245104,0.00011861219,0.00016842733,0.0004113902,0.00013455181],"domain_scores_gemma":[0.997795,0.00086880685,0.00032162157,0.0003014373,0.0005276235,0.00018553503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020142721,0.00087822985,0.000784096,0.0029372186,0.0013535963,0.002345906,0.0012357044,0.0009881011,0.009488428],"category_scores_gemma":[0.0070319967,0.00049669883,0.00077696756,0.0022633388,0.0017470414,0.0038530715,0.0013651417,0.002595866,0.0026430741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016914184,0.000006899716,0.000077870565,0.000034701246,0.0000037723335,0.000056297973,0.00016883669,0.0005169813,0.0006636095,0.9891164,0.0023219197,0.0070158076],"study_design_scores_gemma":[0.000006978272,0.00000933146,0.0001328408,0.000017846514,0.000007858148,0.00009891576,0.000026003841,0.0041582175,0.00037342758,0.98729277,0.007859404,0.0000164063],"about_ca_topic_score_codex":0.0015093446,"about_ca_topic_score_gemma":0.0019083723,"teacher_disagreement_score":0.009488428,"about_ca_system_score_codex":0.0016797275,"about_ca_system_score_gemma":0.00078209833,"threshold_uncertainty_score":0.031741977},"labels":[],"label_agreement":null},{"id":"W2149865162","doi":"10.1016/j.disc.2007.03.063","title":"Classes of optical orthogonal codes from arcs in root subspaces","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Linear subspace; Mathematics; Projective test; Combinatorics; Projective space; Projective plane; Finite geometry; Projective geometry; Discrete mathematics; Collineation; Pure mathematics; Algebraic geometry; Geometry","score_opus":0.01075960854073414,"score_gpt":0.23306942574860354,"score_spread":0.2223098172078694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149865162","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75115526,0.0005042625,0.1483279,0.0009752756,0.00017096789,0.00011446016,0.0010386014,0.0005454047,0.09716786],"genre_scores_gemma":[0.96413755,0.0004013396,0.015661983,0.00027166837,0.00019085222,0.0001376839,0.0009094962,0.00024983528,0.018039547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993087,0.00012048146,0.000031175216,0.00012918947,0.00022162299,0.00018882802],"domain_scores_gemma":[0.99766386,0.0011694863,0.00038750045,0.00030883183,0.0002170859,0.00025332323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041356793,0.0006195062,0.000499858,0.0017102618,0.001206423,0.0026253422,0.000691217,0.0010277266,0.0063730027],"category_scores_gemma":[0.0027062858,0.00040943455,0.00055632717,0.0009721641,0.0016966058,0.0022944391,0.0016109431,0.0014997785,0.000727343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011180336,0.000051166957,0.0008488668,0.000051302104,0.00000926259,0.000097512624,0.00027264733,0.0027744954,0.0038551346,0.97486055,0.002250858,0.014816372],"study_design_scores_gemma":[0.00006443388,0.00005112923,0.0013616666,0.000043859953,0.00001731755,0.0003757705,0.00022794915,0.020944385,0.0053311246,0.96192443,0.009624666,0.00003319781],"about_ca_topic_score_codex":0.00063979207,"about_ca_topic_score_gemma":0.0005995367,"teacher_disagreement_score":0.0063730027,"about_ca_system_score_codex":0.0008706416,"about_ca_system_score_gemma":0.0006765785,"threshold_uncertainty_score":0.021319747},"labels":[],"label_agreement":null},{"id":"W2150983673","doi":"10.1016/j.disc.2005.09.026","title":"The well-covered dimension of random graphs","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Corollary; Dimension (graph theory); Vector space; Discrete mathematics; Graph; Constant (computer programming); Pure mathematics","score_opus":0.01158243144290393,"score_gpt":0.25639333638352607,"score_spread":0.24481090494062213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150983673","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8683781,0.006336981,0.079105556,0.010480393,0.0002391539,0.000040024108,0.0018396986,0.00041675978,0.033163365],"genre_scores_gemma":[0.9893153,0.002033418,0.004780971,0.00036291048,0.00063447695,0.00007830009,0.0004214531,0.00009612319,0.002277096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978078,0.0009452131,0.00008316237,0.00034981727,0.00050837424,0.0003056044],"domain_scores_gemma":[0.97004807,0.021191755,0.0023478372,0.0024623834,0.0010118253,0.0029380915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029617148,0.0007747285,0.0019425462,0.0054722945,0.0018833204,0.0060419324,0.002074154,0.0021755365,0.0048264912],"category_scores_gemma":[0.022126641,0.0013251296,0.000839946,0.0027351321,0.005974771,0.013556391,0.003250062,0.0030271413,0.00039378088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010206329,0.000026278973,0.0014938307,0.00008222897,0.000041918298,0.00006409094,0.00039840673,0.005194509,0.00070848694,0.98608273,0.0023429065,0.0034624988],"study_design_scores_gemma":[0.000015431078,0.000011957374,0.0009140328,0.000025934136,0.000019614534,0.00013480942,0.0001248978,0.018817194,0.00024834627,0.97863036,0.0010378053,0.000019534205],"about_ca_topic_score_codex":0.000833579,"about_ca_topic_score_gemma":0.00064718357,"teacher_disagreement_score":0.0060419324,"about_ca_system_score_codex":0.0019281042,"about_ca_system_score_gemma":0.0005795214,"threshold_uncertainty_score":0.016146183},"labels":[],"label_agreement":null},{"id":"W2151612990","doi":"10.1016/j.disc.2005.12.030","title":"On an adjacency property of almost all tournaments","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tournament; Combinatorics; Mathematics; Vertex (graph theory); Adjacency list; Discrete mathematics; Property (philosophy); Integer (computer science); Graph; Computer science","score_opus":0.03215702963553921,"score_gpt":0.3041861461422333,"score_spread":0.27202911650669415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151612990","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7486934,0.0010668375,0.17122625,0.003020411,0.00025525616,0.000055504282,0.0004904799,0.00026141945,0.07493044],"genre_scores_gemma":[0.974571,0.0006876815,0.014690783,0.0004856542,0.00053213467,0.000094264884,0.00046746686,0.00009937166,0.008371725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988617,0.00034994335,0.000059801943,0.00029244384,0.00026243037,0.00017380096],"domain_scores_gemma":[0.99074286,0.0057813493,0.0008912578,0.00062047684,0.00092186563,0.001042295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014862565,0.00063973264,0.0011259066,0.0022011967,0.0029038645,0.0038674155,0.0019074731,0.0016257934,0.0059895297],"category_scores_gemma":[0.009884391,0.0006323653,0.001003907,0.0031625964,0.0042343168,0.008399702,0.0025520094,0.003185886,0.00046684474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000510855,0.0000312163,0.00061392377,0.000030361725,0.0000111534555,0.000066348744,0.00033904985,0.0014409686,0.00083531626,0.9918544,0.0008865954,0.0038395608],"study_design_scores_gemma":[0.000012641645,0.000017590599,0.00035052228,0.000008024613,0.000009108935,0.000080778744,0.000100295765,0.0055079274,0.0001791413,0.99280566,0.00091905176,0.000009207427],"about_ca_topic_score_codex":0.0018684488,"about_ca_topic_score_gemma":0.0014939258,"teacher_disagreement_score":0.0059895297,"about_ca_system_score_codex":0.0011159308,"about_ca_system_score_gemma":0.0006833301,"threshold_uncertainty_score":0.020036936},"labels":[],"label_agreement":null},{"id":"W2152329689","doi":"10.1016/j.disc.2005.06.043","title":"On a new reformulation of Hadwiger's conjecture","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Homomorphism; Combinatorics; Conjecture; Discrete mathematics; Graph; Class (philosophy); Minor (academic); Computer science","score_opus":0.016026557696064973,"score_gpt":0.2854202328056561,"score_spread":0.2693936751095911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152329689","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10897468,0.0026032329,0.32295325,0.08706399,0.011427803,0.00019457116,0.0012359625,0.0010278737,0.4645186],"genre_scores_gemma":[0.8274395,0.0018225223,0.06485456,0.018847695,0.008348888,0.00032217876,0.0010797716,0.00045893615,0.07682606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978765,0.00071533106,0.000095961164,0.00044861695,0.0005040748,0.0003594812],"domain_scores_gemma":[0.99647886,0.0015333603,0.00024820562,0.0009386117,0.0005254282,0.000275634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003764017,0.0009912867,0.0019078928,0.0021478974,0.003633899,0.0043613217,0.0029112909,0.0034500512,0.017224526],"category_scores_gemma":[0.010187769,0.00049996615,0.0015683672,0.0021500946,0.008327875,0.014122899,0.004972276,0.0063206144,0.0028629084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016879174,0.000010072482,0.000049991984,0.00001676778,0.0000035177995,0.00002162803,0.000057596422,0.0002299651,0.00006444246,0.9941062,0.0038895202,0.0015334062],"study_design_scores_gemma":[0.000011584519,0.000005236202,0.000035755114,0.000007652557,0.0000022605168,0.000018977793,0.000021321297,0.0010060059,0.00005127602,0.99614894,0.002685867,0.000005151799],"about_ca_topic_score_codex":0.0017304841,"about_ca_topic_score_gemma":0.0013875338,"teacher_disagreement_score":0.017224526,"about_ca_system_score_codex":0.0024051869,"about_ca_system_score_gemma":0.0013476349,"threshold_uncertainty_score":0.057621777},"labels":[],"label_agreement":null},{"id":"W2153047381","doi":"10.1016/s0012-365x(01)00429-0","title":"Cyclic BSEC of block size 3","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Mathematics; Block (permutation group theory); Automorphism; Generalization; Combinatorics; Block design; Block size; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.010955568007798157,"score_gpt":0.1896627000552109,"score_spread":0.17870713204741276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153047381","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4383825,0.0016561769,0.42361662,0.0018475795,0.00076046214,0.0004119369,0.0019832922,0.0018880666,0.12945329],"genre_scores_gemma":[0.92182463,0.0006802888,0.04911617,0.0008272911,0.00031383737,0.00027246028,0.0008060776,0.0003263934,0.025832752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879324,0.0002824843,0.00005219955,0.00013853624,0.00034042212,0.0003931984],"domain_scores_gemma":[0.9930821,0.0026626722,0.00055818976,0.0017927418,0.0015288632,0.00037549553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071540836,0.00068403967,0.00070302916,0.0011474731,0.0010489029,0.0011608967,0.0006485936,0.0010657787,0.011807673],"category_scores_gemma":[0.0058399634,0.0002929078,0.0003731288,0.0016775324,0.00096472685,0.0010699292,0.0012433887,0.0011193239,0.002016526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015858578,0.00020332533,0.0020153518,0.00030086184,0.00008941398,0.0007087884,0.00031013734,0.028428681,0.071969375,0.77185684,0.022424659,0.10010671],"study_design_scores_gemma":[0.00026800722,0.0005649632,0.0028625058,0.00015391008,0.00009030157,0.0013704811,0.00019886847,0.27005285,0.06306128,0.6154992,0.04575895,0.00011862097],"about_ca_topic_score_codex":0.0016399652,"about_ca_topic_score_gemma":0.0022292645,"teacher_disagreement_score":0.011807673,"about_ca_system_score_codex":0.0008362624,"about_ca_system_score_gemma":0.0015514585,"threshold_uncertainty_score":0.039500654},"labels":[],"label_agreement":null},{"id":"W2153548489","doi":"10.1016/j.disc.2005.12.032","title":"How to build a brick","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Graph factorization; Factor-critical graph; Conjecture; Matching (statistics); Graph; Connected component; Discrete mathematics; Graph power; Line graph","score_opus":0.01802467165638636,"score_gpt":0.283069835033532,"score_spread":0.2650451633771456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153548489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020359194,0.0016743223,0.7294626,0.023148956,0.005258944,0.00044917504,0.0004580963,0.004565058,0.2146236],"genre_scores_gemma":[0.1619925,0.0014591924,0.682299,0.0046654623,0.00037699155,0.00049733423,0.0006762011,0.0035627428,0.1444706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899,0.0002410489,0.000055818393,0.00019837257,0.00033636947,0.00017823838],"domain_scores_gemma":[0.9972856,0.00055186905,0.00008766684,0.0010373535,0.00064594613,0.00039166713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013809307,0.00093525706,0.00084417855,0.0014054759,0.003306331,0.004068862,0.0017788741,0.0024876099,0.06268023],"category_scores_gemma":[0.0076032886,0.0012440284,0.0012175982,0.00062622014,0.002813976,0.01399428,0.006595484,0.0051509123,0.029827634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016326101,0.000152963,0.00070380897,0.0003412924,0.000055817258,0.0003323851,0.0013518629,0.0060444297,0.0072273524,0.73508394,0.09337738,0.15516545],"study_design_scores_gemma":[0.000046705143,0.000087855224,0.00028048272,0.00027616983,0.00003871494,0.00029524893,0.001408509,0.009336577,0.004222206,0.62194216,0.3620032,0.000062163606],"about_ca_topic_score_codex":0.0016498647,"about_ca_topic_score_gemma":0.0021795668,"teacher_disagreement_score":0.06268023,"about_ca_system_score_codex":0.0007287623,"about_ca_system_score_gemma":0.0014359027,"threshold_uncertainty_score":0.20968628},"labels":[],"label_agreement":null},{"id":"W2153808094","doi":"10.1016/j.disc.2011.12.019","title":"Avoiding 3/2-powers over the natural numbers","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Natural number; Mathematics; Lexicographical order; Sequence (biology); Combinatorics; Discrete mathematics; Natural (archaeology); Arithmetic","score_opus":0.011964409503328352,"score_gpt":0.25287049316825305,"score_spread":0.2409060836649247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153808094","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5500071,0.00064441474,0.2623972,0.0012266617,0.00081858714,0.00011990251,0.00017583916,0.000770651,0.18383965],"genre_scores_gemma":[0.9173255,0.00027757813,0.03083138,0.00032093248,0.00021314787,0.00009910813,0.000130132,0.00026277464,0.050539434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878734,0.0003102083,0.00009941771,0.00024173889,0.00028823022,0.00027304114],"domain_scores_gemma":[0.99753284,0.0009925809,0.00034389726,0.000451966,0.00033296467,0.00034575065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009302177,0.00063955184,0.0005559222,0.0009766932,0.002093139,0.003130818,0.00091489346,0.0011390776,0.0092308875],"category_scores_gemma":[0.0033402422,0.0005071582,0.0009969492,0.0006557479,0.00281862,0.005531523,0.002741325,0.0020702258,0.0021275461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009484468,0.000032558055,0.00028355117,0.000038544807,0.0000091660795,0.00029129477,0.00055457774,0.00073094637,0.0037081828,0.98660326,0.001033924,0.006619171],"study_design_scores_gemma":[0.000022078828,0.000030011515,0.000086460575,0.000013996225,0.00000798822,0.00027122753,0.00017091674,0.0022245948,0.0033371535,0.987169,0.0066533317,0.000013237895],"about_ca_topic_score_codex":0.0003316003,"about_ca_topic_score_gemma":0.0005892759,"teacher_disagreement_score":0.0092308875,"about_ca_system_score_codex":0.0006549325,"about_ca_system_score_gemma":0.00048952876,"threshold_uncertainty_score":0.030880392},"labels":[],"label_agreement":null},{"id":"W2154926368","doi":"10.1016/j.disc.2008.12.027","title":"Error-correcting codes from permutation groups","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Engineering and Physical Sciences Research Council; Government of the United Kingdom; GCHQ","keywords":"Mathematics; Conjecture; Permutation (music); Permutation group; Permutation graph; Combinatorics; Symmetric group; Discrete mathematics; Decoding methods; Construct (python library); Partial permutation; Cyclic permutation; Graph; Algorithm; Computer science","score_opus":0.01787885720311226,"score_gpt":0.2609267653700013,"score_spread":0.24304790816688904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154926368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17316434,0.0056478893,0.72795504,0.0068548736,0.0015745818,0.00029211008,0.0009033951,0.0015594516,0.082048394],"genre_scores_gemma":[0.88361764,0.004849905,0.074267395,0.00093871914,0.0011504005,0.00022504563,0.00075049483,0.00033585785,0.03386464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988882,0.00023221497,0.000055975815,0.00013572419,0.0005548015,0.00013310627],"domain_scores_gemma":[0.99631566,0.0018534426,0.00041463962,0.0008430502,0.0004691856,0.00010407228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080957153,0.0009490602,0.0007365068,0.0018764382,0.000959724,0.0019902901,0.00095647166,0.0016662483,0.0039509684],"category_scores_gemma":[0.006473483,0.0004501154,0.0005080819,0.0021602435,0.0018661798,0.0030898592,0.0021189475,0.0024521507,0.0011227914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100954654,0.000031494277,0.0002848509,0.00013974695,0.000017104894,0.00020841068,0.00025689308,0.012870901,0.0041258885,0.9333095,0.0033934682,0.045260888],"study_design_scores_gemma":[0.000024140518,0.000032943793,0.00014401188,0.00003961917,0.000013466972,0.0002742834,0.000026591291,0.020947088,0.0058197714,0.9639574,0.008695292,0.00002533379],"about_ca_topic_score_codex":0.0005254651,"about_ca_topic_score_gemma":0.00037863592,"teacher_disagreement_score":0.0039509684,"about_ca_system_score_codex":0.0009236214,"about_ca_system_score_gemma":0.0012447466,"threshold_uncertainty_score":0.01321733},"labels":[],"label_agreement":null},{"id":"W2156236336","doi":"10.1016/j.disc.2012.02.014","title":"Combinatorial types of bicyclic polytopes","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Polytope; Combinatorics; Mathematics; Vertex (graph theory); Bicyclic molecule; Abelian group; Homogeneous space; Equivalence (formal languages); Discrete mathematics; Graph; Stereochemistry; Chemistry","score_opus":0.039172386532622845,"score_gpt":0.32858803930279656,"score_spread":0.2894156527701737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156236336","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74067396,0.0008223001,0.043383997,0.0013549359,0.00041204662,0.00014796005,0.0021056584,0.0003028853,0.21079613],"genre_scores_gemma":[0.9579524,0.00063488225,0.00915276,0.00030462418,0.00023692094,0.00013486532,0.0019054626,0.0001318797,0.02954612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902964,0.00012874573,0.000059865528,0.00015385952,0.00040219325,0.00022570013],"domain_scores_gemma":[0.9983925,0.0004850963,0.00033397734,0.00020566056,0.00024635714,0.00033633877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043487313,0.00072515156,0.00082760624,0.003986823,0.0020092768,0.0052448437,0.0017908001,0.0009562447,0.016837902],"category_scores_gemma":[0.0022965588,0.00078944536,0.00064629107,0.0041330317,0.0025188506,0.0030204137,0.0020807022,0.0021550385,0.0012333033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014257846,0.00003382362,0.0014920132,0.00008555488,0.00001531285,0.0001777163,0.00031912816,0.0021461674,0.0012698576,0.9808318,0.003596045,0.009890058],"study_design_scores_gemma":[0.000086705,0.000057798537,0.004451213,0.00008877825,0.000053002514,0.0007476381,0.0007908166,0.008647173,0.001634168,0.9633335,0.020048555,0.000060817245],"about_ca_topic_score_codex":0.0019972497,"about_ca_topic_score_gemma":0.0021409222,"teacher_disagreement_score":0.016837902,"about_ca_system_score_codex":0.0016879885,"about_ca_system_score_gemma":0.00047403117,"threshold_uncertainty_score":0.056328356},"labels":[],"label_agreement":null},{"id":"W2157363043","doi":"10.1016/s0012-365x(03)00240-1","title":"Geometric thickness in a grid","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV; McGill University","keywords":"Mathematics; Grid; Combinatorics; Discrete mathematics; Geometry","score_opus":0.019560097313012927,"score_gpt":0.25778395519751834,"score_spread":0.23822385788450542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157363043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17273872,0.00044481494,0.76191074,0.0006173422,0.0002989019,0.000068416,0.00024134414,0.00060116145,0.06307868],"genre_scores_gemma":[0.82034326,0.0003862843,0.15567474,0.00014149542,0.000067591776,0.00006284985,0.00024107545,0.00042713856,0.022655549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962234,0.00008053197,0.000023026132,0.00007345868,0.00014212183,0.000058522648],"domain_scores_gemma":[0.9994134,0.00020192821,0.00008456596,0.00013677304,0.000103416525,0.000059950522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003988713,0.0003494671,0.00042103935,0.0008252988,0.000512388,0.0013602024,0.0008370118,0.0007063025,0.005689294],"category_scores_gemma":[0.0025206483,0.00054333656,0.00035812054,0.0006283449,0.0011916704,0.0015289285,0.0020645524,0.00096492725,0.0008378964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002503145,0.000052084317,0.002488958,0.00018032685,0.000027775388,0.0004519538,0.00034560636,0.24986036,0.01776066,0.6607545,0.004507333,0.06332012],"study_design_scores_gemma":[0.00005570207,0.00009015981,0.0015263575,0.000050167226,0.000028473365,0.0006307834,0.00027254908,0.67328405,0.008678039,0.29589653,0.019451527,0.000035637728],"about_ca_topic_score_codex":0.0008612014,"about_ca_topic_score_gemma":0.0006276563,"teacher_disagreement_score":0.005689294,"about_ca_system_score_codex":0.00043818986,"about_ca_system_score_gemma":0.0003013142,"threshold_uncertainty_score":0.019032598},"labels":[],"label_agreement":null},{"id":"W2157516444","doi":"10.1016/j.disc.2008.09.016","title":"Regular graphs are not universal fixers","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Graph; Discrete mathematics; Domination analysis","score_opus":0.03252796891485716,"score_gpt":0.2708205054394022,"score_spread":0.23829253652454507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157516444","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5500957,0.00417702,0.24009182,0.006465535,0.0010899905,0.00029179003,0.0012866433,0.0034406576,0.19306079],"genre_scores_gemma":[0.9221915,0.001561267,0.030111391,0.0012760251,0.0003758597,0.00028212782,0.00097453035,0.00089747127,0.042329896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99712425,0.0003075218,0.00013951954,0.0011398,0.0004622666,0.0008266058],"domain_scores_gemma":[0.9877643,0.0057081603,0.0011320678,0.0031203802,0.0011348086,0.0011403572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026356783,0.0012903805,0.0029988065,0.0039508413,0.0053596417,0.007329027,0.0024621917,0.0037964804,0.01611282],"category_scores_gemma":[0.011972656,0.0027879144,0.0027464791,0.0024792454,0.009921391,0.020347327,0.008348559,0.0063238377,0.0019969114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007686426,0.000019540874,0.00039060623,0.00007810172,0.00004459572,0.00006893268,0.00036263067,0.00040831548,0.0005938511,0.99258065,0.0013746665,0.0040011676],"study_design_scores_gemma":[0.000039891765,0.000018020162,0.00026947967,0.00003776545,0.00006774548,0.00016897464,0.0003065583,0.00088591326,0.00091782486,0.99200094,0.005259982,0.000027029728],"about_ca_topic_score_codex":0.0016312025,"about_ca_topic_score_gemma":0.001696328,"teacher_disagreement_score":0.01611282,"about_ca_system_score_codex":0.002810836,"about_ca_system_score_gemma":0.0009837478,"threshold_uncertainty_score":0.053902805},"labels":[],"label_agreement":null},{"id":"W2159855713","doi":"10.1016/j.disc.2015.10.002","title":"On contact numbers of totally separable unit sphere packings","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Unit sphere; Separable space; Combinatorics; Unit (ring theory); Natural number; Euclidean geometry; Euclidean space; Circle packing; Space (punctuation); Discrete mathematics; Geometry; Mathematical analysis; Computer science","score_opus":0.10173033196819282,"score_gpt":0.3500127294212309,"score_spread":0.2482823974530381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159855713","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.735688,0.0021585547,0.14661165,0.001874322,0.0003718199,0.00008234513,0.00043465418,0.00019785904,0.11258088],"genre_scores_gemma":[0.9764703,0.0010418105,0.011145058,0.00017553093,0.000422121,0.00010283329,0.00039739173,0.000101015656,0.010144057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983333,0.00043947567,0.000082264945,0.00023082095,0.00054384104,0.00037036545],"domain_scores_gemma":[0.9891388,0.0066752504,0.0014446584,0.00044006703,0.00062717916,0.0016740226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021809693,0.001682547,0.002167267,0.0070757554,0.0030331684,0.0066094887,0.0032470159,0.002537337,0.013165246],"category_scores_gemma":[0.013416655,0.000839182,0.0010605297,0.0050637927,0.007598872,0.010533743,0.004611174,0.004239165,0.00089262414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057883888,0.000022378652,0.0002960651,0.000038613776,0.0000062101917,0.000049216582,0.00022079017,0.0032312165,0.0003697016,0.99275947,0.0006133116,0.0023351396],"study_design_scores_gemma":[0.000016424156,0.000028267088,0.0006841843,0.00003057121,0.0000088675815,0.00007615566,0.00018955531,0.028283194,0.00040167876,0.9692478,0.0010148458,0.000018357452],"about_ca_topic_score_codex":0.0016551622,"about_ca_topic_score_gemma":0.001250238,"teacher_disagreement_score":0.013165246,"about_ca_system_score_codex":0.0029420014,"about_ca_system_score_gemma":0.0007991254,"threshold_uncertainty_score":0.04404211},"labels":[],"label_agreement":null},{"id":"W2160761829","doi":"10.1016/j.disc.2009.07.030","title":"On the transversal number and VC-dimension of families of positive homothets of a convex body","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Transversal (combinatorics); Mathematics; Dimension (graph theory); Convex body; Combinatorics; Regular polygon; Discrete mathematics; Convex hull; Mathematical analysis; Geometry","score_opus":0.008605788005068239,"score_gpt":0.24061121999814877,"score_spread":0.23200543199308055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160761829","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9273204,0.00049922353,0.049785808,0.0005660583,0.00009200756,0.000033116186,0.00034886567,0.00008867745,0.02126586],"genre_scores_gemma":[0.985014,0.00038068983,0.009038009,0.00006854636,0.00010554703,0.00005205083,0.00035144834,0.000062846215,0.0049268287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923205,0.00018558797,0.000040190604,0.00019765366,0.00020332645,0.00014126358],"domain_scores_gemma":[0.9909587,0.005313861,0.0012591778,0.00045034397,0.00060927466,0.0014086704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001994685,0.0009367518,0.0010701857,0.005413918,0.0029215978,0.004414344,0.0019715868,0.0013033573,0.007750386],"category_scores_gemma":[0.00851846,0.0010221063,0.0010420876,0.0016306513,0.005322568,0.004001663,0.0030475599,0.0023967936,0.000376004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003026329,0.000072850264,0.0077520986,0.00008875094,0.000063221625,0.00025379928,0.00081800227,0.015078496,0.0035892015,0.95961016,0.0014520186,0.010918718],"study_design_scores_gemma":[0.00008071106,0.00014525317,0.012261531,0.00014513866,0.00010215121,0.0009161366,0.0012762347,0.14524512,0.0029287993,0.8319605,0.0048187934,0.000119620534],"about_ca_topic_score_codex":0.0019677277,"about_ca_topic_score_gemma":0.0014426846,"teacher_disagreement_score":0.007750386,"about_ca_system_score_codex":0.0019488176,"about_ca_system_score_gemma":0.00050612236,"threshold_uncertainty_score":0.025927663},"labels":[],"label_agreement":null},{"id":"W2160893622","doi":"10.1016/j.disc.2003.10.027","title":"Binary optimal linear rate 1/2 codes","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Circulant matrix; Automorphism group; Linear code; Minimum distance; Discrete mathematics; Binary number; Code (set theory); Binary code; Automorphism; Block code; Decoding methods; Algorithm; Arithmetic","score_opus":0.017284274332645698,"score_gpt":0.255960872085661,"score_spread":0.23867659775301528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160893622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10672932,0.0077984845,0.67814475,0.011303606,0.0022030373,0.0003461786,0.0024959352,0.0018101084,0.18916847],"genre_scores_gemma":[0.7708863,0.0045823143,0.151077,0.0027661668,0.0014744997,0.0007041925,0.0009878952,0.00068316044,0.0668386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99687874,0.0009545082,0.0001745638,0.00034827428,0.0009958011,0.000648075],"domain_scores_gemma":[0.99647,0.0017057591,0.00037746615,0.0006759236,0.00058216683,0.00018868818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018020674,0.0014528676,0.0012101589,0.0016831582,0.0011938512,0.0030212237,0.0013513615,0.0024090058,0.01254993],"category_scores_gemma":[0.008878532,0.0008229825,0.0005988134,0.0024227202,0.001626374,0.0033762276,0.003027367,0.0023398774,0.0031189036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064339954,0.000094073825,0.00038375036,0.0002817996,0.00003932771,0.00010598229,0.00015613413,0.03235385,0.008023974,0.86413664,0.014215795,0.07956535],"study_design_scores_gemma":[0.00021057995,0.00014119534,0.0003207888,0.00021276558,0.00005130648,0.00033167808,0.00008111414,0.12786175,0.01011933,0.84374344,0.016831933,0.00009404453],"about_ca_topic_score_codex":0.00073223043,"about_ca_topic_score_gemma":0.00096396374,"teacher_disagreement_score":0.01254993,"about_ca_system_score_codex":0.0022147652,"about_ca_system_score_gemma":0.0025804588,"threshold_uncertainty_score":0.041983724},"labels":[],"label_agreement":null},{"id":"W2161786270","doi":"10.1016/j.disc.2004.10.001","title":"Erratum to “Construction of new extremal self-dual codes” [Discrete Mathematics 263 (2003) 81–91]","year":2004,"lang":"en","type":"erratum","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Dual (grammatical number); Discrete mathematics; Combinatorics","score_opus":0.016396793248745076,"score_gpt":0.24953170746511466,"score_spread":0.2331349142163696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161786270","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010190918,0.0027296224,0.0056269267,0.06005994,0.9024553,0.00008977391,0.0015368937,0.0006796596,0.025802838],"genre_scores_gemma":[0.035893448,0.016243175,0.03244322,0.112979084,0.19522807,0.00049608405,0.008986028,0.0028910083,0.5948399],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974573,0.0003801606,0.00038390743,0.00031634886,0.0012368927,0.00022541499],"domain_scores_gemma":[0.99432087,0.0012847747,0.00037876578,0.00059011305,0.0031003612,0.00032522803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018660243,0.0025728154,0.002689676,0.003917383,0.005258704,0.0031593195,0.005195097,0.006201586,0.046905246],"category_scores_gemma":[0.020595077,0.0013954957,0.0016559999,0.0028461246,0.002550198,0.003972287,0.0017193904,0.008174507,0.022970729],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101586724,0.000022791615,0.000056626468,0.00020105178,0.00002275606,0.00022982019,0.000033270735,0.0001684241,0.00026714912,0.0072118742,0.9822453,0.009439302],"study_design_scores_gemma":[0.00010504557,0.00012826416,0.0010470381,0.0003176979,0.00011006613,0.0007609571,0.0001168733,0.0015197784,0.0027573039,0.02602249,0.9669652,0.00014929702],"about_ca_topic_score_codex":0.0049311295,"about_ca_topic_score_gemma":0.007295888,"teacher_disagreement_score":0.046905246,"about_ca_system_score_codex":0.0035121976,"about_ca_system_score_gemma":0.0026891641,"threshold_uncertainty_score":0.1569137},"labels":[],"label_agreement":null},{"id":"W2163288567","doi":"10.1016/j.disc.2009.12.006","title":"The number of irreducible polynomials of degree <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si115.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>n</mml:mi></mml:math> over <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si116.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi mathvariant=\"double-struck\">F</mml:mi></mml:mrow><mml:mrow><mml:mi>q</mml:mi></mml:mrow></mml:msub></mml:math> with given trace and constant terms","year":2010,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Degree (music); Combinatorics; TRACE (psycholinguistics); Constant (computer programming); Discrete mathematics; Physics; Computer science","score_opus":0.01869653219332097,"score_gpt":0.24817503262386428,"score_spread":0.22947850043054333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163288567","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7108335,0.0012834824,0.101464264,0.0063188598,0.0008232776,0.00018114015,0.0074717826,0.0014858443,0.17013776],"genre_scores_gemma":[0.9391728,0.00080752734,0.0125796655,0.00023942575,0.0004212011,0.00007925871,0.00309807,0.00029438917,0.04330769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977062,0.00034811272,0.00012217936,0.00042339324,0.00069456716,0.0007055555],"domain_scores_gemma":[0.99155957,0.0037111458,0.0008880583,0.0012971052,0.0014100705,0.0011340558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017820192,0.0006650017,0.0008464451,0.0022351046,0.002216395,0.0037296645,0.0013578766,0.0010188838,0.020663943],"category_scores_gemma":[0.012177567,0.0003363342,0.00072828046,0.001805835,0.0028550907,0.0041207797,0.0020014218,0.002151066,0.00459654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018872502,0.0002825627,0.01211555,0.0007215556,0.00011961244,0.0007381816,0.0010577054,0.009773038,0.017728003,0.79955703,0.0330783,0.12294111],"study_design_scores_gemma":[0.00024077884,0.00043441533,0.01478721,0.00026539856,0.00021272013,0.0038592867,0.0007497102,0.038476992,0.053508837,0.8216524,0.06559657,0.00021565128],"about_ca_topic_score_codex":0.0013634085,"about_ca_topic_score_gemma":0.0012980328,"teacher_disagreement_score":0.020663943,"about_ca_system_score_codex":0.0018405407,"about_ca_system_score_gemma":0.0022143049,"threshold_uncertainty_score":0.0691278},"labels":[],"label_agreement":null},{"id":"W2163424543","doi":"10.1016/j.disc.2009.01.022","title":"Packing and covering <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mstyle mathvariant=\"bold\"><mml:mi>k</mml:mi></mml:mstyle></mml:math>-chain free subsets in Boolean lattices","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Chain (unit); Hypergraph; Center (category theory); Discrete mathematics; Crystallography; Physics","score_opus":0.014458789890085151,"score_gpt":0.23765184926040478,"score_spread":0.22319305937031964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163424543","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21963246,0.002641616,0.554376,0.0018414159,0.00050997984,0.00012720408,0.00178637,0.0010539944,0.21803094],"genre_scores_gemma":[0.83542305,0.0017305256,0.103396855,0.00029968016,0.00033160864,0.00012268296,0.0020002164,0.00056978036,0.056125525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910223,0.00022746797,0.00007901513,0.00019849061,0.000234649,0.0001582469],"domain_scores_gemma":[0.9983392,0.0008029675,0.00014952323,0.00039228305,0.00015247712,0.00016365568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006145103,0.0004428141,0.0007759616,0.0012615877,0.0015676259,0.003056683,0.0005058101,0.00076262304,0.015277231],"category_scores_gemma":[0.003164387,0.00053199066,0.0009303236,0.0017785397,0.002154612,0.0048882626,0.0020450028,0.0011365348,0.0025324286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007872755,0.000022482223,0.0003636359,0.0000879353,0.0000094248135,0.00014336758,0.0004251497,0.002387864,0.0016828488,0.96396226,0.0066658007,0.0241704],"study_design_scores_gemma":[0.000011388646,0.00002770466,0.00044171492,0.000029053375,0.000010758569,0.00024144062,0.00020491131,0.008379906,0.0026538202,0.9710226,0.016959807,0.000016954022],"about_ca_topic_score_codex":0.0014826484,"about_ca_topic_score_gemma":0.0016466532,"teacher_disagreement_score":0.015277231,"about_ca_system_score_codex":0.0010521875,"about_ca_system_score_gemma":0.0004752684,"threshold_uncertainty_score":0.051107466},"labels":[],"label_agreement":null},{"id":"W2163735025","doi":"10.1016/j.disc.2015.10.011","title":"Matching divisible designs with block size four","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Block size; Clique; Divisibility rule; Block (permutation group theory); Graph; Discrete mathematics; Matching (statistics); Clique graph; Line graph; Computer science; Statistics; Voltage graph","score_opus":0.03406893018427814,"score_gpt":0.22406720160125312,"score_spread":0.18999827141697498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163735025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28259498,0.0007259568,0.66290635,0.0012767601,0.00035313802,0.00040846795,0.0004581405,0.0011368527,0.05013939],"genre_scores_gemma":[0.7854605,0.00035066053,0.19606668,0.0006359259,0.0001448243,0.00035466443,0.00023267494,0.00010243738,0.016651602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976713,0.0008501679,0.00016641899,0.00040200548,0.00055144547,0.00035858573],"domain_scores_gemma":[0.9952429,0.0017172162,0.00065537693,0.0014946354,0.00060262164,0.00028723778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020448957,0.0007390009,0.0008913178,0.0010963738,0.0008338196,0.001980763,0.0011726884,0.001367098,0.009755677],"category_scores_gemma":[0.0066808346,0.00055469107,0.0004407619,0.001344501,0.0008908292,0.0018909888,0.0017191661,0.0010306186,0.0018003286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024371515,0.00032471595,0.0018919437,0.0003447395,0.0001345862,0.00025309456,0.0002979221,0.03480469,0.054439154,0.72718436,0.005726867,0.17216074],"study_design_scores_gemma":[0.00086321065,0.0014766878,0.000734955,0.00016391213,0.00014506473,0.00050010567,0.00014360526,0.18707846,0.047036514,0.7297696,0.03200221,0.00008569118],"about_ca_topic_score_codex":0.00040899278,"about_ca_topic_score_gemma":0.0005814981,"teacher_disagreement_score":0.009755677,"about_ca_system_score_codex":0.0012904247,"about_ca_system_score_gemma":0.0012139995,"threshold_uncertainty_score":0.032635987},"labels":[],"label_agreement":null},{"id":"W2164323648","doi":"10.1016/j.disc.2003.09.015","title":"Enumeration of eulerian and unicursal planar maps","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Eulerian path; Mathematics; Valency; Combinatorics; Bipartite graph; Planar; Enumeration; Simple (philosophy); Discrete mathematics; Pure mathematics; Graph; Lagrangian; Computer science","score_opus":0.02551314916711092,"score_gpt":0.2942163599691722,"score_spread":0.2687032108020613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164323648","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71738905,0.0011010143,0.11003098,0.0013973699,0.00015826334,0.00006273274,0.0008279794,0.0003317021,0.16870098],"genre_scores_gemma":[0.89675224,0.0012061802,0.047178753,0.0002226451,0.00010673362,0.000070423266,0.0015248064,0.00016957261,0.05276872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994785,0.000097276024,0.00003948693,0.000082688675,0.00017497364,0.00012711468],"domain_scores_gemma":[0.998836,0.0005101333,0.00014858074,0.00015031842,0.00022407419,0.00013092387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030380237,0.00045944273,0.00052557356,0.0018946942,0.001359674,0.002651981,0.001034969,0.0006761576,0.009777725],"category_scores_gemma":[0.0028741893,0.0003834941,0.0003815526,0.0026421554,0.0013106308,0.0031546105,0.0022498544,0.001290032,0.0010088456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010320316,0.000036415666,0.0016353057,0.00012978842,0.000010039994,0.000117779564,0.00042950743,0.002306497,0.0023021349,0.9461609,0.0027386646,0.044029724],"study_design_scores_gemma":[0.000015255952,0.000021047452,0.0013270741,0.000046723166,0.000023948442,0.0003641451,0.0004733284,0.0094142165,0.0037896459,0.963831,0.020676691,0.000016927657],"about_ca_topic_score_codex":0.0010402828,"about_ca_topic_score_gemma":0.001801322,"teacher_disagreement_score":0.009777725,"about_ca_system_score_codex":0.0010008796,"about_ca_system_score_gemma":0.000538883,"threshold_uncertainty_score":0.032709777},"labels":[],"label_agreement":null},{"id":"W2164662793","doi":"10.1016/j.disc.2011.11.039","title":"Generalized packing designs","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorial design; Generalization; Block (permutation group theory); Block design; Orthogonal array; Packing problems; Combinatorics; Class (philosophy); Block size; Construct (python library); Discrete mathematics; Computer science; Key (lock); Statistics","score_opus":0.0547393547728578,"score_gpt":0.22740142291409257,"score_spread":0.17266206814123478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164662793","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12751304,0.001094962,0.6719705,0.001109142,0.0007866382,0.0002483776,0.0007076878,0.0009947595,0.19557498],"genre_scores_gemma":[0.68555075,0.0012508491,0.21801837,0.0013646517,0.00057310035,0.0005410725,0.0012673504,0.00056782924,0.090866014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855274,0.000446974,0.00006163202,0.00035852147,0.00038030744,0.00019973783],"domain_scores_gemma":[0.9982836,0.00041748566,0.0001686718,0.00068122445,0.00028626694,0.00016277167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007015938,0.0010988871,0.0011029651,0.0015270618,0.0013990479,0.002610186,0.001037423,0.0017852207,0.021044636],"category_scores_gemma":[0.003223028,0.00084017176,0.0009118854,0.0019976879,0.001461398,0.002705147,0.0024147169,0.0019122162,0.0045346417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010343356,0.000035720666,0.00017235745,0.00007351947,0.000022438813,0.00009606266,0.000110568064,0.0043177065,0.003755095,0.95259494,0.0047944076,0.03392377],"study_design_scores_gemma":[0.000051451454,0.00009221795,0.0002587619,0.00004463581,0.000033252105,0.00032872029,0.00008858117,0.029032277,0.0040221815,0.94630384,0.019715266,0.000028789626],"about_ca_topic_score_codex":0.00034575618,"about_ca_topic_score_gemma":0.00051180256,"teacher_disagreement_score":0.021044636,"about_ca_system_score_codex":0.00075144815,"about_ca_system_score_gemma":0.00074060267,"threshold_uncertainty_score":0.07040131},"labels":[],"label_agreement":null},{"id":"W2165426231","doi":"10.1016/s0012-365x(03)00086-4","title":"Homomorphisms and oriented colorings of equivalence classes of oriented graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Homomorphism; Combinatorics; Chromatic scale; Friendship graph; Windmill graph; Discrete mathematics; Digraph; Vertex (graph theory); Integer (computer science); Critical graph; Graph; Equivalence (formal languages); Graph homomorphism; Line graph; Graph power; Computer science","score_opus":0.023863299157697044,"score_gpt":0.289789815704448,"score_spread":0.265926516546751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165426231","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82761204,0.000491999,0.13771632,0.00078147877,0.00028256667,0.000097136515,0.00029504372,0.0003520436,0.032371353],"genre_scores_gemma":[0.96324956,0.000444364,0.02700508,0.0002897888,0.00027852508,0.00011784129,0.00045953202,0.00016513195,0.007990151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888986,0.00029962193,0.00006774042,0.0002968695,0.00018106212,0.00026483255],"domain_scores_gemma":[0.9955402,0.0022914852,0.00067042984,0.0004465649,0.0003069115,0.00074442814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012460349,0.0005887844,0.0006214251,0.0024693322,0.001999393,0.0033986468,0.001442129,0.00097266346,0.004384232],"category_scores_gemma":[0.0048454213,0.0009489815,0.0011441762,0.0014882697,0.0033615734,0.0054310937,0.0021165493,0.0026218875,0.00042595688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115184026,0.000115897055,0.0015911579,0.000044839853,0.000017152544,0.00014246421,0.001264364,0.0013883681,0.0018836175,0.98089385,0.0008218371,0.011721386],"study_design_scores_gemma":[0.000031056952,0.000024446512,0.0008888543,0.000013038438,0.00001861441,0.000121204794,0.0003538767,0.0033287436,0.0007936163,0.9926206,0.0017920188,0.000013952283],"about_ca_topic_score_codex":0.0016780588,"about_ca_topic_score_gemma":0.0016584835,"teacher_disagreement_score":0.004384232,"about_ca_system_score_codex":0.0013221117,"about_ca_system_score_gemma":0.00065621175,"threshold_uncertainty_score":0.0146666765},"labels":[],"label_agreement":null},{"id":"W2166525679","doi":"10.1016/j.disc.2011.11.027","title":"Enumeration of unrooted orientable maps of arbitrary genus by number of edges and vertices","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Enumeration; Genus; Embedding; Discrete mathematics","score_opus":0.037800835729499827,"score_gpt":0.28083531937180994,"score_spread":0.24303448364231012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166525679","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9271327,0.00036070298,0.043764893,0.00022351557,0.000069720365,0.000038082657,0.0003015235,0.0002640276,0.027844798],"genre_scores_gemma":[0.9473941,0.0005369315,0.040247876,0.00008894842,0.000073362826,0.00006460492,0.00073788565,0.00025272416,0.010603567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940896,0.00009292976,0.000045665896,0.000105654275,0.00019554807,0.00015131188],"domain_scores_gemma":[0.99765563,0.0012226625,0.0003170509,0.0002464645,0.00027196837,0.00028618617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003851147,0.000897539,0.0009660242,0.0025037753,0.001110962,0.003211321,0.0013282418,0.0011085141,0.0058533726],"category_scores_gemma":[0.0028524813,0.00060895144,0.0004917118,0.0025360845,0.0014549098,0.0031263193,0.0015483903,0.001197347,0.0006694544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012464143,0.00042968395,0.013425166,0.0008709746,0.00009688735,0.001585879,0.0025555415,0.02191734,0.07198071,0.7610029,0.005651696,0.119236894],"study_design_scores_gemma":[0.00011488996,0.0002791476,0.010962188,0.00022903163,0.00019906412,0.0014236862,0.0015999425,0.086320564,0.043857493,0.8393908,0.015517641,0.000105509236],"about_ca_topic_score_codex":0.00040560198,"about_ca_topic_score_gemma":0.00089305115,"teacher_disagreement_score":0.0058533726,"about_ca_system_score_codex":0.0007016289,"about_ca_system_score_gemma":0.00032235842,"threshold_uncertainty_score":0.019581497},"labels":[],"label_agreement":null},{"id":"W2166530698","doi":"10.1016/s0012-365x(02)00802-6","title":"An improved upper bound for queens domination numbers","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Domination analysis; Discrete mathematics; Graph; Vertex (graph theory); Mathematical analysis","score_opus":0.01858940680374713,"score_gpt":0.32251044383524996,"score_spread":0.3039210370315028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166530698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048818763,0.01448402,0.7050486,0.010666484,0.0040972363,0.0005555778,0.0039665597,0.005665775,0.2066969],"genre_scores_gemma":[0.43450198,0.0092774695,0.44461396,0.0050017633,0.0068016355,0.0016824524,0.005309723,0.0038494677,0.08896167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9868947,0.0020086302,0.00047989198,0.0025855184,0.0053810673,0.0026502116],"domain_scores_gemma":[0.9652654,0.02396479,0.0007504471,0.005615108,0.0027048243,0.0016994097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069348644,0.0046640863,0.00471037,0.0074802553,0.0042104907,0.01126754,0.012543419,0.004832562,0.040946957],"category_scores_gemma":[0.03319966,0.0023274014,0.0039504976,0.0071357246,0.0049054543,0.018211087,0.011626526,0.014926283,0.012623701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026902228,0.0010601422,0.0034495,0.0018094594,0.00032053312,0.00067502836,0.0010153875,0.103151575,0.027596954,0.520142,0.09005983,0.24802937],"study_design_scores_gemma":[0.00023384053,0.00029626844,0.002303752,0.00043573612,0.00036180989,0.0005527172,0.00019897279,0.32982424,0.015251873,0.59818584,0.052115012,0.00023984155],"about_ca_topic_score_codex":0.0038848585,"about_ca_topic_score_gemma":0.0069565056,"teacher_disagreement_score":0.040946957,"about_ca_system_score_codex":0.0080866935,"about_ca_system_score_gemma":0.0041051153,"threshold_uncertainty_score":0.13698125},"labels":[],"label_agreement":null},{"id":"W2167228424","doi":"10.1016/j.disc.2007.10.022","title":"On <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si20.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>-transversals of chordal graphs","year":2007,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Transversal (combinatorics); Chordal graph; Mathematics; Combinatorics; Graph; Algorithm; Discrete mathematics; Mathematical analysis","score_opus":0.02070235063290941,"score_gpt":0.2688354726682089,"score_spread":0.2481331220352995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167228424","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017399959,0.0007120963,0.055926807,0.0040651797,0.0021360433,0.0003608432,0.091996685,0.05754527,0.785517],"genre_scores_gemma":[0.017804073,0.002415188,0.035750683,0.0019096911,0.0010175442,0.00044049788,0.10891631,0.05953922,0.7722068],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994646,0.00007777047,0.000038395152,0.00008704573,0.00027045258,0.000061824816],"domain_scores_gemma":[0.99852693,0.00050997495,0.000082040744,0.0002725636,0.0004292401,0.00017929194],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00062727265,0.0014877163,0.0013345166,0.0027870622,0.0010736847,0.0052912557,0.0024391226,0.0012282412,0.7800867],"category_scores_gemma":[0.003369031,0.000818759,0.0011820591,0.005034654,0.00070405327,0.0046291337,0.0025207635,0.0024304641,0.6259487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008403862,0.000039207098,0.00012663256,0.00021452138,0.000009297807,0.000049120987,0.00009792034,0.0002654572,0.001127232,0.018545188,0.93241143,0.047029994],"study_design_scores_gemma":[0.000047618898,0.000016377755,0.0009074339,0.00011707742,0.000008900069,0.00009401444,0.00008695586,0.0012663954,0.0018284384,0.01725831,0.97833997,0.000028458659],"about_ca_topic_score_codex":0.010095899,"about_ca_topic_score_gemma":0.012963856,"teacher_disagreement_score":0.7800867,"about_ca_system_score_codex":0.0026028955,"about_ca_system_score_gemma":0.001097341,"threshold_uncertainty_score":0.31367964},"labels":[],"label_agreement":null},{"id":"W2169487918","doi":"10.1016/j.disc.2011.10.018","title":"Upper bounds for the bondage number of graphs on topological surfaces","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Graph; Upper and lower bounds; Genus; Mathematical proof; Domination analysis; Planar graph; Discrete mathematics; Surface (topology); Geometry; Botany; Biology","score_opus":0.06550048523045542,"score_gpt":0.3397857713035316,"score_spread":0.2742852860730762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169487918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34107724,0.013248845,0.3726067,0.011359476,0.0016859327,0.00024643407,0.0022333064,0.002378965,0.25516313],"genre_scores_gemma":[0.8835106,0.00717058,0.075600915,0.00094811013,0.001887172,0.00051599054,0.0014540504,0.0010820522,0.027830468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972977,0.0005790531,0.00010069193,0.00053290545,0.0009907542,0.0004988357],"domain_scores_gemma":[0.9725011,0.019523542,0.0014278807,0.0024800736,0.0013332865,0.0027339556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033398438,0.0027895826,0.0027142123,0.0074076513,0.0033962945,0.0058687897,0.005428367,0.0036934584,0.018961752],"category_scores_gemma":[0.022963801,0.0014659096,0.0018476353,0.004006332,0.0050627165,0.012688821,0.0061605196,0.0074586454,0.0028392542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003409679,0.0001413272,0.0013527669,0.00039063432,0.000069035064,0.00014450616,0.00047281515,0.025947839,0.0061172857,0.9361564,0.008643543,0.020222912],"study_design_scores_gemma":[0.000029245519,0.000057010504,0.0010193258,0.0001152392,0.000058000813,0.00016830872,0.00010471945,0.07674018,0.0026470611,0.91247576,0.0065277675,0.000057410925],"about_ca_topic_score_codex":0.001047004,"about_ca_topic_score_gemma":0.0018810923,"teacher_disagreement_score":0.018961752,"about_ca_system_score_codex":0.003953163,"about_ca_system_score_gemma":0.00095391745,"threshold_uncertainty_score":0.06343341},"labels":[],"label_agreement":null},{"id":"W2170800107","doi":"10.1016/s0012-365x(01)00046-2","title":"Star forests, dominating sets and Ramsey-type problems","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Star (game theory); Graph; Upper and lower bounds; Complete bipartite graph; Discrete mathematics; Minimum degree spanning tree; Edge-transitive graph; Graph power; Line graph","score_opus":0.038758774683058876,"score_gpt":0.29286162080845174,"score_spread":0.25410284612539286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170800107","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4899637,0.026929632,0.34883213,0.018955272,0.0010683674,0.00016617634,0.001351263,0.00041419885,0.11231929],"genre_scores_gemma":[0.8987491,0.01076971,0.057764973,0.0015115677,0.0014917521,0.00018959098,0.0010137516,0.00008357806,0.02842598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990552,0.0003769492,0.00004158581,0.0002277047,0.00018095845,0.000117705094],"domain_scores_gemma":[0.99585813,0.0029995388,0.0003751954,0.00024727156,0.00018276533,0.0003371353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018417229,0.0007196845,0.0013573729,0.0012411459,0.0023005733,0.0037942845,0.0015493812,0.0021487193,0.0045059025],"category_scores_gemma":[0.005206747,0.00084713014,0.0007951167,0.0031167294,0.0027920604,0.008778959,0.0016725113,0.003235634,0.0004569146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001835728,0.00012724086,0.0008947524,0.00030546734,0.000048235575,0.00010825333,0.00039122626,0.011353007,0.0011367016,0.95596224,0.008784812,0.020704413],"study_design_scores_gemma":[0.000024091052,0.000014317458,0.00025051078,0.00001530354,0.000018601217,0.00012038189,0.00012358656,0.009473087,0.0001860481,0.987045,0.002720955,0.000008147407],"about_ca_topic_score_codex":0.00096116523,"about_ca_topic_score_gemma":0.0016986723,"teacher_disagreement_score":0.0045059025,"about_ca_system_score_codex":0.0014704585,"about_ca_system_score_gemma":0.00085443316,"threshold_uncertainty_score":0.015073717},"labels":[],"label_agreement":null},{"id":"W2171224738","doi":"10.1016/j.disc.2012.11.016","title":"Nonincident points and blocks in designs","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Steiner system; Block (permutation group theory); Projective plane; Integer (computer science); Order (exchange); Discrete mathematics; Set (abstract data type); Upper and lower bounds; Projective test; Blocking set; Projective space; Pure mathematics; Collineation; Geometry; Computer science; Mathematical analysis","score_opus":0.017609548280486755,"score_gpt":0.22740561784222574,"score_spread":0.209796069561739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171224738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11053683,0.0010003021,0.8562296,0.00050437794,0.0001253228,0.000065449596,0.000095303185,0.00018367244,0.031259134],"genre_scores_gemma":[0.8253069,0.0010187767,0.1502702,0.00023533255,0.00021796484,0.00023208787,0.00011509965,0.00011124553,0.022492412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815637,0.0008000468,0.00008113668,0.00032377447,0.00049978733,0.00013886497],"domain_scores_gemma":[0.99264354,0.0045534074,0.00079326273,0.0011898362,0.0005466921,0.0002732761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016735443,0.0007708699,0.0011113627,0.0015672834,0.001070538,0.0022027462,0.00097416545,0.0016191162,0.005987994],"category_scores_gemma":[0.00889827,0.0010061896,0.0004603974,0.0014056822,0.0034742316,0.0036184073,0.001603154,0.0021845524,0.0009686315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006711956,0.000016989492,0.0002049071,0.00003620383,0.0000077948125,0.000043414446,0.00010253795,0.0078537315,0.00078274217,0.9789394,0.0003041874,0.011640961],"study_design_scores_gemma":[0.00002006183,0.00004035532,0.00009431238,0.00001607727,0.0000067094475,0.00005596122,0.0000356358,0.020564472,0.0006215382,0.97658825,0.001947677,0.000008900152],"about_ca_topic_score_codex":0.0005104036,"about_ca_topic_score_gemma":0.00055072684,"teacher_disagreement_score":0.005987994,"about_ca_system_score_codex":0.00074147515,"about_ca_system_score_gemma":0.00056137197,"threshold_uncertainty_score":0.02003187},"labels":[],"label_agreement":null},{"id":"W2175518075","doi":"10.1016/j.disc.2003.05.001","title":"Induced matchings in intersection graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Chordal graph; Indifference graph; Split graph; Block graph; Discrete mathematics; Pathwidth; Induced subgraph; Intersection graph; Matching (statistics); Interval graph; 1-planar graph; Cograph; Line graph; Graph; Vertex (graph theory)","score_opus":0.026987633859876316,"score_gpt":0.3014352730218232,"score_spread":0.2744476391619469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2175518075","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6140175,0.0011591908,0.26190743,0.0023469473,0.00027016146,0.00023078293,0.0015374654,0.0011824359,0.117348164],"genre_scores_gemma":[0.91224855,0.00092003343,0.05430849,0.00043475055,0.00023342579,0.00020245292,0.0020729396,0.00035568344,0.029223815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804294,0.0004316753,0.00014667817,0.00049503456,0.00053607736,0.0003474709],"domain_scores_gemma":[0.9935569,0.0031366264,0.001064716,0.0007279522,0.00071088795,0.0008029538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001445428,0.0006089981,0.0013807939,0.0038794023,0.0034656231,0.0057225693,0.0027556536,0.0021701357,0.014062199],"category_scores_gemma":[0.008498328,0.0013834962,0.001358011,0.006120078,0.002309907,0.012758322,0.0035275996,0.0040507084,0.0017752276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013233234,0.000097960554,0.0009921155,0.00007927007,0.000022865948,0.00011229294,0.0005099595,0.001496011,0.0008399452,0.9811952,0.0019814486,0.012540505],"study_design_scores_gemma":[0.000029080315,0.00001979317,0.00036511445,0.00002480842,0.00004091501,0.0001422984,0.0002486936,0.007916015,0.00093480176,0.98646057,0.0038058122,0.000012106662],"about_ca_topic_score_codex":0.001349552,"about_ca_topic_score_gemma":0.0014642753,"teacher_disagreement_score":0.014062199,"about_ca_system_score_codex":0.00203093,"about_ca_system_score_gemma":0.0009476664,"threshold_uncertainty_score":0.047042727},"labels":[],"label_agreement":null},{"id":"W2179550966","doi":"10.1016/j.disc.2011.03.028","title":"The crossing number of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si8.gif\" display=\"inline\" overflow=\"scroll\"><mml:msubsup><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mspace width=\"0.16667em\"/><mml:mi>□</mml:mi><mml:mspace width=\"0.16667em\"/><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:math>","year":2011,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Research Nova Scotia; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV; Agentúra na Podporu Výskumu a Vývoja","keywords":"Cartesian product; Combinatorics; Mathematics; Graph; Crossing number (knot theory); Vertex (graph theory); Discrete mathematics","score_opus":0.024330179051812898,"score_gpt":0.2668875939251289,"score_spread":0.242557414873316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2179550966","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09550601,0.0011308737,0.20002851,0.0020198936,0.0029398517,0.00016511253,0.021638889,0.009728647,0.6668422],"genre_scores_gemma":[0.5170203,0.0016927165,0.108794615,0.0008684173,0.0007464763,0.0002805199,0.030768836,0.012259337,0.32756877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936765,0.00006354608,0.000031744068,0.00021244114,0.00021568312,0.0001090064],"domain_scores_gemma":[0.99865216,0.0004301968,0.000116162046,0.00020138359,0.00041711738,0.00018292326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045727927,0.00079509587,0.0006016332,0.002632892,0.0010967703,0.003156907,0.0008547344,0.00091499067,0.15976076],"category_scores_gemma":[0.0037018782,0.00035616977,0.00061164424,0.001991901,0.000834149,0.0032770343,0.00080832624,0.0016169917,0.046125703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038526673,0.00012417794,0.0029147246,0.0005303152,0.000049897957,0.0006623016,0.0006120827,0.0051616766,0.022408742,0.52777094,0.27992335,0.1594565],"study_design_scores_gemma":[0.000053607513,0.00011070867,0.007442113,0.0001897355,0.000063852145,0.0015560719,0.00048764856,0.020054953,0.031951487,0.33881187,0.59915346,0.00012453106],"about_ca_topic_score_codex":0.0017960396,"about_ca_topic_score_gemma":0.0016011586,"teacher_disagreement_score":0.15976076,"about_ca_system_score_codex":0.0011458903,"about_ca_system_score_gemma":0.00061862497,"threshold_uncertainty_score":0.534453},"labels":[],"label_agreement":null},{"id":"W2181210596","doi":"10.1016/j.disc.2015.10.040","title":"Constructing new covering arrays from LFSR sequences over finite fields","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"","keywords":"Linear feedback shift register; Mathematics; Finite field; Combinatorics; Discrete mathematics; Arithmetic; Shift register; Computer science; Telecommunications","score_opus":0.03939350846225521,"score_gpt":0.26092098253967705,"score_spread":0.22152747407742185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2181210596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22907351,0.00063512434,0.7474291,0.0004918115,0.0004583096,0.000109034176,0.00033709203,0.0030189326,0.018447174],"genre_scores_gemma":[0.7086297,0.00062065513,0.2804183,0.00035158667,0.0003103786,0.00019651031,0.0009597514,0.00062305934,0.0078899665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929917,0.00017934744,0.00006625239,0.000112482,0.00019385868,0.0001489613],"domain_scores_gemma":[0.9982146,0.000809693,0.00018334425,0.00046952872,0.00020200631,0.00012073017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050321495,0.0006108918,0.00069491356,0.0009490842,0.0006192145,0.00137461,0.0006178318,0.00082670373,0.0036487353],"category_scores_gemma":[0.0029782096,0.00042278145,0.0005323082,0.0011148269,0.0006904063,0.002364752,0.0016065899,0.001251439,0.0014368992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060340005,0.00019507261,0.0018016518,0.00043353683,0.000057516,0.00076656265,0.00090594206,0.031116387,0.09903844,0.54439175,0.008184533,0.31250522],"study_design_scores_gemma":[0.00012602305,0.00050874165,0.0008758878,0.00016017215,0.000082726714,0.001464085,0.0004186746,0.18735445,0.13797909,0.62125605,0.049640115,0.00013401569],"about_ca_topic_score_codex":0.00010700372,"about_ca_topic_score_gemma":0.00018514541,"teacher_disagreement_score":0.0036487353,"about_ca_system_score_codex":0.0004434568,"about_ca_system_score_gemma":0.00040858903,"threshold_uncertainty_score":0.012206197},"labels":[],"label_agreement":null},{"id":"W2200162493","doi":"10.1016/j.disc.2016.08.005","title":"The complexity of signed graph and edge-coloured graph homomorphisms","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Signed graph; Homomorphism; Mathematics; Combinatorics; Discrete mathematics; Graph homomorphism; Vertex (graph theory); Conjecture; Graph; Line graph; Voltage graph","score_opus":0.0429401250024845,"score_gpt":0.28911771706390726,"score_spread":0.24617759206142276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2200162493","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73218864,0.0015803218,0.2103491,0.0076555447,0.00031134306,0.00013532808,0.0023208898,0.00055622763,0.04490254],"genre_scores_gemma":[0.9644627,0.0008586218,0.022128161,0.0003631439,0.00036295276,0.0001342257,0.0013878217,0.00020602276,0.010096402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966606,0.0009182853,0.0001778258,0.00064940855,0.0010517234,0.00054220494],"domain_scores_gemma":[0.97558933,0.018222027,0.0018060885,0.0019332673,0.0010034676,0.0014457948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019342969,0.0009067873,0.0017401113,0.0019050281,0.0016165714,0.0075133215,0.00375614,0.002769286,0.013677404],"category_scores_gemma":[0.019946637,0.0008022992,0.0017363516,0.0028332882,0.004184862,0.019716032,0.004234721,0.0046058106,0.0009951773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046108832,0.000170624,0.0023959358,0.00025394597,0.000062762534,0.00017185975,0.0006677722,0.04073751,0.0018338098,0.92774373,0.005619662,0.019881325],"study_design_scores_gemma":[0.000035978355,0.000022151462,0.00043012656,0.0000133912035,0.000018779863,0.00007504893,0.0000935584,0.0595971,0.0005209756,0.9383006,0.0008722278,0.000020069056],"about_ca_topic_score_codex":0.0026062971,"about_ca_topic_score_gemma":0.0022638321,"teacher_disagreement_score":0.013677404,"about_ca_system_score_codex":0.003953636,"about_ca_system_score_gemma":0.002013789,"threshold_uncertainty_score":0.045755506},"labels":[],"label_agreement":null},{"id":"W2214784206","doi":"10.1016/j.disc.2015.10.007","title":"Mapping planar graphs into the Coxeter graph","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Centre National de la Recherche Scientifique; China Scholarship Council; Université Paris-Sud; Javna Agencija za Raziskovalno Dejavnost RS; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Mathematics; Coxeter group; Combinatorics; Coxeter graph; Planar graph; Discrete mathematics; Artin group; Coxeter element; Outerplanar graph; Graph minor; Coxeter complex; Graph homomorphism; Line graph; Graph; Voltage graph","score_opus":0.04711086523227034,"score_gpt":0.30476144166333313,"score_spread":0.2576505764310628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2214784206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2639601,0.0004439645,0.61667573,0.0019324062,0.0004917244,0.00015824231,0.00042685657,0.0010160569,0.114894815],"genre_scores_gemma":[0.79276323,0.0011900517,0.13716166,0.00064914045,0.00034387913,0.00015283705,0.0006367482,0.00071628956,0.06638614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997913,0.00005089893,0.0000070663027,0.00006186107,0.000056941994,0.00003194848],"domain_scores_gemma":[0.99940705,0.00023360444,0.00008373611,0.00013475076,0.00007867517,0.00006225909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002232241,0.00043959855,0.00029159235,0.0010297872,0.00066690246,0.0013695309,0.0008541889,0.0006301062,0.011292151],"category_scores_gemma":[0.002181093,0.0002975789,0.00049187255,0.0008735991,0.001130507,0.0029305094,0.002006687,0.0019583157,0.0012511326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000621789,0.00004695166,0.0002965818,0.000064336906,0.000008022927,0.00010506493,0.00033493695,0.005849401,0.00397581,0.9340091,0.003756153,0.051491484],"study_design_scores_gemma":[0.000015292504,0.0000325884,0.00022484601,0.000010423678,0.000007519889,0.00012376306,0.0002188421,0.01497811,0.0017127321,0.9710043,0.011660832,0.000010735901],"about_ca_topic_score_codex":0.0013401507,"about_ca_topic_score_gemma":0.0011744989,"teacher_disagreement_score":0.011292151,"about_ca_system_score_codex":0.0005522128,"about_ca_system_score_gemma":0.00042973497,"threshold_uncertainty_score":0.037776053},"labels":[],"label_agreement":null},{"id":"W2216111877","doi":"10.1016/j.disc.2015.12.005","title":"The difference and ratio of the fractional matching number and the matching number of graphs","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Matching (statistics); Vertex (graph theory); Graph; Alpha (finance); Discrete mathematics; Bipartite graph; Statistics","score_opus":0.029488448416568232,"score_gpt":0.3089172482565552,"score_spread":0.279428799839987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2216111877","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6591188,0.005024945,0.25592777,0.0052324682,0.0010729945,0.00006176148,0.0005835106,0.00042043807,0.07255735],"genre_scores_gemma":[0.9654037,0.0013995639,0.025035981,0.00037648983,0.0007770352,0.00008881135,0.0002030982,0.00012377644,0.0065915403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985318,0.0005360494,0.00006430756,0.00037558613,0.00031023484,0.00018201154],"domain_scores_gemma":[0.98802865,0.008525407,0.0012191508,0.0007348621,0.0006689752,0.00082296843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028066305,0.0006449404,0.0012172027,0.0041147997,0.0009812354,0.0027319163,0.0025973246,0.0018645115,0.006120155],"category_scores_gemma":[0.025057115,0.00048076833,0.000735062,0.002335528,0.0041775615,0.0075120456,0.0018081728,0.0022957744,0.0005665867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023643921,0.00003734122,0.0008546638,0.00009407369,0.0000212309,0.00005413518,0.00013847322,0.0075227777,0.0021183072,0.9753483,0.0012633653,0.012310927],"study_design_scores_gemma":[0.000025867465,0.000034813787,0.00074180117,0.000025286854,0.000020001375,0.00019857734,0.000059043625,0.042109184,0.0012950074,0.9531155,0.0023504733,0.000024408466],"about_ca_topic_score_codex":0.00057539245,"about_ca_topic_score_gemma":0.00028840016,"teacher_disagreement_score":0.006120155,"about_ca_system_score_codex":0.001975023,"about_ca_system_score_gemma":0.0006688952,"threshold_uncertainty_score":0.020473897},"labels":[],"label_agreement":null},{"id":"W2218365453","doi":"10.1016/j.disc.2016.11.003","title":"Bounded height interlaced pairs of parking functions","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; National Parks Board - Singapore","keywords":"Mathematics; Bounded function; Quotient; Chebyshev polynomials; Enumeration; Chebyshev filter; Ring (chemistry); Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.03790940045275126,"score_gpt":0.3035160457601983,"score_spread":0.26560664530744704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2218365453","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5841362,0.0009257433,0.27822173,0.0009569394,0.0005257884,0.00009471776,0.0006536919,0.0007583663,0.13372687],"genre_scores_gemma":[0.94399714,0.00033476474,0.025752494,0.0003301365,0.00014570188,0.00008714614,0.00047776022,0.00023097277,0.028643887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998892,0.00021102562,0.00006486216,0.00024140296,0.0002916884,0.0002989407],"domain_scores_gemma":[0.99779403,0.0008384728,0.00027453952,0.00024210125,0.00031227854,0.000538699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009910039,0.0011304768,0.001075111,0.0027077727,0.0022402275,0.003418947,0.0021384251,0.001557556,0.013925848],"category_scores_gemma":[0.0044861864,0.0009383346,0.0010952892,0.0017801387,0.0028762699,0.0054986044,0.004354635,0.0033807694,0.002095812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009411767,0.000023488907,0.00027611436,0.00003734945,0.000010507233,0.00012920401,0.00019482637,0.000936046,0.00086523336,0.992855,0.0010190139,0.0035591528],"study_design_scores_gemma":[0.000027763872,0.000037356454,0.00031978477,0.00001916035,0.000019367026,0.00026390658,0.00015018987,0.007022267,0.0013177184,0.9881712,0.0026235317,0.000027868444],"about_ca_topic_score_codex":0.00083062705,"about_ca_topic_score_gemma":0.0008882623,"teacher_disagreement_score":0.013925848,"about_ca_system_score_codex":0.0014285838,"about_ca_system_score_gemma":0.0005943853,"threshold_uncertainty_score":0.046586633},"labels":[],"label_agreement":null},{"id":"W2230116819","doi":"10.1016/j.disc.2016.04.025","title":"On the chromatic number of Latin square graphs","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Simon Fraser University; Iran National Science Foundation","keywords":"Mathematics; Latin square; Chromatic scale; Combinatorics; Square (algebra); Discrete mathematics; Geometry","score_opus":0.012626269838465693,"score_gpt":0.21597526861001257,"score_spread":0.20334899877154688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2230116819","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6693507,0.004048206,0.11569367,0.00705883,0.0009094568,0.00008239223,0.0009184907,0.00037704816,0.20156121],"genre_scores_gemma":[0.96493906,0.0018214772,0.013321599,0.0005698699,0.0006250237,0.000092967864,0.00037563848,0.0001909772,0.018063338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993005,0.0002499665,0.000018669412,0.00015372477,0.00014502922,0.00013211083],"domain_scores_gemma":[0.9925678,0.005240592,0.0007632692,0.0003858709,0.0004905487,0.0005519302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010304933,0.0008011368,0.00068509526,0.0038540545,0.0015862173,0.0029231107,0.0014301826,0.0010866118,0.0115757305],"category_scores_gemma":[0.008095817,0.000505045,0.00037497003,0.0029339904,0.003907515,0.0038118025,0.0016074169,0.0019809674,0.0007582374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028540616,0.000049827937,0.0015912036,0.00013255553,0.000025318483,0.00007801357,0.00039072087,0.03563911,0.0036156632,0.9344148,0.008042348,0.015735088],"study_design_scores_gemma":[0.00004654429,0.000042934505,0.0014550426,0.00007538589,0.000024759569,0.00011162786,0.00024322383,0.096465535,0.001367433,0.8936944,0.0064293784,0.000043695345],"about_ca_topic_score_codex":0.004242399,"about_ca_topic_score_gemma":0.0049207383,"teacher_disagreement_score":0.0115757305,"about_ca_system_score_codex":0.002973135,"about_ca_system_score_gemma":0.00094154425,"threshold_uncertainty_score":0.03872466},"labels":[],"label_agreement":null},{"id":"W2234839101","doi":"10.1016/j.disc.2015.12.015","title":"Bicircular matroids are 3-colorable","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Matroid; Combinatorics; Mathematics; Graphic matroid; Matroid partitioning; Conjecture; Minor (academic); Discrete mathematics; Oriented matroid; Graph; Weighted matroid","score_opus":0.022580380518233262,"score_gpt":0.2829587157284189,"score_spread":0.26037833521018566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2234839101","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70923424,0.0010082518,0.11135637,0.002710939,0.00042965356,0.00026876398,0.0033587806,0.0014055759,0.17022741],"genre_scores_gemma":[0.8992007,0.0008991204,0.04270063,0.000982301,0.00018855036,0.00034048202,0.0023476493,0.00046223024,0.052878316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994784,0.000074325646,0.00002838268,0.00010897971,0.00017494978,0.0001350787],"domain_scores_gemma":[0.9981522,0.0005918603,0.0004372523,0.00015997038,0.00031075755,0.0003478425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029676492,0.0012469419,0.001144276,0.0014574039,0.0017914507,0.0042732446,0.0017934341,0.0014559424,0.015457942],"category_scores_gemma":[0.0014775799,0.0012333744,0.00076835806,0.0020535882,0.0014957037,0.002790762,0.0017076544,0.0034347728,0.0028680353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060781074,0.00020098654,0.0015134447,0.0004506372,0.000074492506,0.00058491837,0.00077535963,0.007922294,0.014644971,0.90794575,0.01716677,0.048112568],"study_design_scores_gemma":[0.00013338172,0.00008195668,0.0020059159,0.00007503231,0.00006846902,0.00073096046,0.00046751832,0.02075949,0.0048173787,0.9523623,0.018440416,0.000057262365],"about_ca_topic_score_codex":0.0026997162,"about_ca_topic_score_gemma":0.004263133,"teacher_disagreement_score":0.015457942,"about_ca_system_score_codex":0.001532218,"about_ca_system_score_gemma":0.0006885621,"threshold_uncertainty_score":0.051711917},"labels":[],"label_agreement":null},{"id":"W2253326806","doi":"10.1016/j.disc.2016.11.032","title":"The coarse geometry of Hartnell’s firefighter problem on infinite graphs","year":2017,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Containment (computer programming); Square tiling; Bounded function; Conjecture; Converse; Euclidean geometry; Discrete mathematics; Property (philosophy); Constant (computer programming); Euclidean space; Grid; Geometry; Computer science; Mathematical analysis","score_opus":0.058459638982851954,"score_gpt":0.3302508096630953,"score_spread":0.27179117068024333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2253326806","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4971483,0.0021009275,0.21371964,0.020218061,0.00052715436,0.00014143268,0.0009660272,0.00026813278,0.26491034],"genre_scores_gemma":[0.95013446,0.0008195557,0.019226959,0.00082818774,0.00035252178,0.0000722742,0.00046565686,0.00014033024,0.027960062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926144,0.0002573242,0.00002411598,0.00015352435,0.00014073992,0.00016298053],"domain_scores_gemma":[0.99804026,0.0010761248,0.00019779125,0.00025071803,0.00014132579,0.00029385323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009998407,0.0006021702,0.0012706557,0.0015309404,0.0029001448,0.004288263,0.0020068714,0.0029224325,0.012025533],"category_scores_gemma":[0.005480361,0.00059918023,0.00074509863,0.0014312909,0.005756703,0.0084711015,0.0035855833,0.003867447,0.0006493147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018035676,0.00000909332,0.00007471703,0.000017327658,0.0000031196882,0.000029259187,0.00009490154,0.0024413674,0.00008318141,0.9946214,0.0013579382,0.001249629],"study_design_scores_gemma":[0.00000855318,0.0000028907966,0.00006481113,0.0000069457933,0.0000020087805,0.000016990007,0.00009043083,0.005711964,0.00005113281,0.9929623,0.0010773912,0.000004571216],"about_ca_topic_score_codex":0.004836788,"about_ca_topic_score_gemma":0.003941217,"teacher_disagreement_score":0.012025533,"about_ca_system_score_codex":0.0024894706,"about_ca_system_score_gemma":0.0011099138,"threshold_uncertainty_score":0.04022944},"labels":[],"label_agreement":null},{"id":"W2254581752","doi":"10.1016/j.disc.2016.04.021","title":"Rainbow Ramsey simple structures","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Combinatorics; Rainbow; Substructure; Discrete mathematics; Countable set; Graph; Existential quantification; Homogeneous","score_opus":0.03344862536478752,"score_gpt":0.3313598361187121,"score_spread":0.29791121075392457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2254581752","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36542842,0.0014212003,0.14793113,0.00416727,0.0005207208,0.00014929367,0.0013331283,0.0014691442,0.47757974],"genre_scores_gemma":[0.8670472,0.0007451726,0.017624356,0.00066590006,0.0002500068,0.00008614473,0.0007456169,0.00026613695,0.11256945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943894,0.000096076496,0.000032876433,0.00015070967,0.00016780458,0.00011366111],"domain_scores_gemma":[0.9989956,0.0002743586,0.00012802205,0.00020534721,0.00015895569,0.00023764194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005690177,0.00057906064,0.0008704355,0.001850713,0.003017843,0.0032918514,0.00092745834,0.0009284097,0.024310973],"category_scores_gemma":[0.0016180744,0.000639975,0.00084311416,0.0016642895,0.002583117,0.008073864,0.0035664877,0.0028191295,0.0026711584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026641515,0.000010698371,0.00007181865,0.000020958763,0.00000556772,0.000040345592,0.00013598366,0.00015084955,0.00046869417,0.99565244,0.0013637581,0.0020522252],"study_design_scores_gemma":[0.000015074317,0.00001005968,0.00016787912,0.000007220586,0.000011744471,0.000106909385,0.00011283979,0.0006147583,0.00038453445,0.9930454,0.005514256,0.000009383076],"about_ca_topic_score_codex":0.00093335204,"about_ca_topic_score_gemma":0.001596163,"teacher_disagreement_score":0.024310973,"about_ca_system_score_codex":0.0012491209,"about_ca_system_score_gemma":0.00059585326,"threshold_uncertainty_score":0.08132833},"labels":[],"label_agreement":null},{"id":"W2397430903","doi":"10.1016/j.disc.2016.04.009","title":"Decompositions of complete graphs into circulants","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.012335997762790976,"score_gpt":0.22011929591447954,"score_spread":0.20778329815168856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397430903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2651553,0.0011498327,0.6294088,0.0008486246,0.00030342792,0.00020966827,0.0012650056,0.0005291357,0.101130165],"genre_scores_gemma":[0.77795213,0.0017220925,0.16278362,0.0007748791,0.0005647969,0.0003382229,0.002126823,0.0006074876,0.05313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994112,0.00015225673,0.000028466404,0.0001266712,0.0001628131,0.00011847593],"domain_scores_gemma":[0.997413,0.00095718075,0.00038559322,0.000378129,0.0005011144,0.0003649435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005069898,0.00083318347,0.0006883223,0.002416352,0.0010661341,0.0023850775,0.0008385605,0.0007641026,0.008269052],"category_scores_gemma":[0.0029060233,0.000579562,0.0007796227,0.001366466,0.0012887788,0.0020678472,0.0008981109,0.001540796,0.0011279833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040296592,0.00004359719,0.00020248385,0.000060854913,0.000014924634,0.00008409728,0.00018638963,0.0067873388,0.0025314018,0.9745238,0.0039457763,0.011579058],"study_design_scores_gemma":[0.00001417482,0.00001902598,0.00033270937,0.000023854594,0.0000126507275,0.00009626742,0.00008458584,0.03047797,0.0007037643,0.96319413,0.005028018,0.000012827346],"about_ca_topic_score_codex":0.0012876372,"about_ca_topic_score_gemma":0.0019029396,"teacher_disagreement_score":0.008269052,"about_ca_system_score_codex":0.00084606494,"about_ca_system_score_gemma":0.000691384,"threshold_uncertainty_score":0.027662694},"labels":[],"label_agreement":null},{"id":"W2417722483","doi":"10.1016/j.disc.2016.05.010","title":"Backbone colourings of graphs","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Nuclear Receptors and Signaling","field":"Neuroscience","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Alberta; Brock University","funders":"","keywords":"Combinatorics; Mathematics; Corollary; Chromatic scale; Graph; Spanning tree; Discrete mathematics; Undirected graph","score_opus":0.027468604448550937,"score_gpt":0.2543703894024976,"score_spread":0.2269017849539467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2417722483","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42222112,0.0013574689,0.38565648,0.0039980044,0.000553712,0.00030855564,0.0019914433,0.0008482643,0.1830651],"genre_scores_gemma":[0.82150614,0.002467952,0.105220586,0.0014202374,0.00047115615,0.00039464168,0.0031867905,0.00069685874,0.06463568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914527,0.00021134439,0.00003945352,0.00024065451,0.00020444406,0.00015891553],"domain_scores_gemma":[0.9957546,0.0021623767,0.0005553056,0.00053521205,0.00043870183,0.000553819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063218386,0.00085276854,0.00087419566,0.0021083832,0.0016591287,0.003363037,0.0013169372,0.0017014521,0.017167632],"category_scores_gemma":[0.0042915605,0.0007910576,0.0008986694,0.001863989,0.0022650494,0.0040239417,0.0019759554,0.002657545,0.0021194618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007894286,0.000028971055,0.000304379,0.00008993557,0.000015531465,0.00011825968,0.00036751354,0.0043836324,0.001994235,0.9723178,0.005190226,0.015110585],"study_design_scores_gemma":[0.00002030737,0.0000094142015,0.00019218301,0.000017823253,0.000009304256,0.00006677002,0.00009171271,0.0052403603,0.00044557438,0.988569,0.0053310883,0.0000063255457],"about_ca_topic_score_codex":0.001442109,"about_ca_topic_score_gemma":0.0016188795,"teacher_disagreement_score":0.017167632,"about_ca_system_score_codex":0.0014047613,"about_ca_system_score_gemma":0.0005673303,"threshold_uncertainty_score":0.05743146},"labels":[],"label_agreement":null},{"id":"W2476701528","doi":"10.1016/s0012-365x(01)00209-6","title":"On dijoins","year":2002,"lang":"es","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Arc (geometry); Integer (computer science); Minimum weight; Combinatorics; Weight function; Discrete mathematics; Function (biology); Statistics; Computer science; Geometry","score_opus":0.04444712923435091,"score_gpt":0.31091035705345427,"score_spread":0.26646322781910337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2476701528","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056704376,0.0037468686,0.10999977,0.010757557,0.004603019,0.000080225305,0.00072816206,0.0005825674,0.8127975],"genre_scores_gemma":[0.52410203,0.0033343125,0.03863309,0.0033043034,0.0014384942,0.00012872198,0.0017347756,0.0010800051,0.42624432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988028,0.00030077295,0.0000720709,0.00030180186,0.00031817408,0.0002045052],"domain_scores_gemma":[0.998519,0.00046414076,0.00009862469,0.0003351484,0.0003540867,0.00022896007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077957223,0.00067476166,0.00080841326,0.002594691,0.0043542273,0.003992591,0.0013520792,0.0013173661,0.039582334],"category_scores_gemma":[0.004902369,0.00046495462,0.0008792158,0.0031727946,0.0029029632,0.0062712724,0.004626803,0.003939604,0.005575059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026889098,0.000012219525,0.00014258898,0.00002377909,0.00000442213,0.000035135872,0.00017275791,0.00027641648,0.00012102824,0.977807,0.008596613,0.012781216],"study_design_scores_gemma":[0.000008703972,0.0000065716627,0.00015017539,0.000026943968,0.0000067297897,0.000075779346,0.00019338758,0.0014213141,0.00015329309,0.90911037,0.0888382,0.000008470199],"about_ca_topic_score_codex":0.0047063283,"about_ca_topic_score_gemma":0.00519951,"teacher_disagreement_score":0.039582334,"about_ca_system_score_codex":0.0020355491,"about_ca_system_score_gemma":0.00091846567,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2513820396","doi":"10.1016/j.disc.2018.04.008","title":"Size-Ramsey numbers of cycles versus a path","year":2018,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation","keywords":"Combinatorics; Ramsey's theorem; Graph; Mathematics; Integer (computer science); Path (computing); Discrete mathematics; Computer science","score_opus":0.046524698944634665,"score_gpt":0.335014328802336,"score_spread":0.2884896298577013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2513820396","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68977475,0.0045088837,0.12854706,0.011890775,0.00058995245,0.000072678384,0.0009341586,0.00045323168,0.16322856],"genre_scores_gemma":[0.97423744,0.0010643689,0.011436764,0.0005555806,0.0005190664,0.0001289546,0.00019948647,0.00012431342,0.01173417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888486,0.00033780877,0.000051988864,0.00028802536,0.00027636962,0.00016086712],"domain_scores_gemma":[0.99274147,0.0047923955,0.0006886542,0.00048290682,0.0005343074,0.0007602235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001786568,0.00083024363,0.00080886483,0.0027990576,0.0017524577,0.004157833,0.0016714974,0.0017908622,0.01004202],"category_scores_gemma":[0.012868678,0.00068602595,0.00061285915,0.002234017,0.0044724755,0.012992681,0.0027674865,0.002694168,0.0006497632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005508727,0.000009852079,0.00032815512,0.00004230141,0.0000047992307,0.000020533045,0.00015178364,0.0010766176,0.0003680117,0.99336183,0.0012599841,0.003321006],"study_design_scores_gemma":[0.000008647008,0.000006672465,0.00014692057,0.0000119463975,0.0000067273127,0.000042906806,0.000050805877,0.003294366,0.00020408914,0.99510574,0.0011147294,0.000006480041],"about_ca_topic_score_codex":0.0009509741,"about_ca_topic_score_gemma":0.0008405329,"teacher_disagreement_score":0.01004202,"about_ca_system_score_codex":0.0017803506,"about_ca_system_score_gemma":0.00084005727,"threshold_uncertainty_score":0.033593893},"labels":[],"label_agreement":null},{"id":"W2521095132","doi":"10.1016/j.disc.2017.08.034","title":"Hall sets, Lazard sets and comma-free codes","year":2017,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Connection (principal bundle); Mathematics; Pure mathematics; Combinatorics; Discrete mathematics; Algebra over a field; Geometry","score_opus":0.06979090799221806,"score_gpt":0.3593128241443918,"score_spread":0.28952191615217376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2521095132","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58036417,0.006710758,0.1831671,0.009820398,0.0009549506,0.0000693036,0.0015107193,0.00068690866,0.21671575],"genre_scores_gemma":[0.9622233,0.0010784093,0.008360139,0.00060114573,0.00073041517,0.00006254836,0.00055094785,0.00010117437,0.026291879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905294,0.00022113963,0.00003713204,0.00022494598,0.0002563736,0.00020741265],"domain_scores_gemma":[0.99805284,0.0009734709,0.00027842095,0.0002363435,0.00018364035,0.0002753781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072082155,0.0006879846,0.0007861025,0.0024688388,0.0027168002,0.004284282,0.0010449239,0.0015138254,0.0116683645],"category_scores_gemma":[0.0036059374,0.0004258523,0.0005019794,0.0027007703,0.00426542,0.0044364724,0.003425063,0.0032713278,0.0016577936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035881516,0.000012239381,0.000232511,0.00003169983,0.0000049013893,0.000026841817,0.00013128694,0.00053488265,0.00025054126,0.99343973,0.0013475158,0.003952057],"study_design_scores_gemma":[0.0000074882123,0.0000035485405,0.00009061805,0.0000059709437,0.0000033211636,0.000018888088,0.00004054573,0.0007872992,0.0001415193,0.9975872,0.0013084252,0.00000517433],"about_ca_topic_score_codex":0.0016060439,"about_ca_topic_score_gemma":0.0017772093,"teacher_disagreement_score":0.0116683645,"about_ca_system_score_codex":0.0016972318,"about_ca_system_score_gemma":0.0009685483,"threshold_uncertainty_score":0.039034545},"labels":[],"label_agreement":null},{"id":"W2549740858","doi":"10.1016/j.disc.2016.08.027","title":"Graph-intersecting set systems and LYM inequalities","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Digraph; Mathematics; Vertex (graph theory); Graph; Limiting; Upper and lower bounds; Complete graph; Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.05286349505153703,"score_gpt":0.30653047238653497,"score_spread":0.25366697733499793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2549740858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32369518,0.007758456,0.410303,0.011743426,0.0005292715,0.00009141298,0.0011574561,0.00023746851,0.24448441],"genre_scores_gemma":[0.9398187,0.0028030532,0.036714595,0.0008877426,0.0004585213,0.00016961254,0.0006145664,0.00009070847,0.018442491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858826,0.0005020285,0.00007143818,0.0002462255,0.00038752082,0.00020452759],"domain_scores_gemma":[0.9915176,0.006231401,0.00071818905,0.00039458124,0.0006020499,0.0005361038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015910865,0.0006857965,0.0012418145,0.003374062,0.0026510945,0.0040990436,0.0019676427,0.0016551473,0.011801019],"category_scores_gemma":[0.007756303,0.0006492977,0.0011655367,0.004153606,0.005225192,0.008400687,0.004363161,0.0049216887,0.00057541515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058777764,0.0000045241654,0.0000672581,0.000016046075,0.0000033180693,0.000013545128,0.000066801804,0.0005553505,0.00006271106,0.99784946,0.00037122483,0.0009839683],"study_design_scores_gemma":[0.0000038417597,0.000002139991,0.000058321777,0.000007092387,0.0000030301335,0.000018675013,0.000043229484,0.0023461755,0.00003818669,0.99678147,0.0006954233,0.0000024892988],"about_ca_topic_score_codex":0.0029531734,"about_ca_topic_score_gemma":0.002665145,"teacher_disagreement_score":0.011801019,"about_ca_system_score_codex":0.002594775,"about_ca_system_score_gemma":0.0008571653,"threshold_uncertainty_score":0.03947842},"labels":[],"label_agreement":null},{"id":"W2550083616","doi":"10.1016/j.disc.2016.11.001","title":"On 2-limited packings of complete grid graphs","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Acadia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Grid; Discrete mathematics; Geometry","score_opus":0.03446265618759715,"score_gpt":0.29242364559519884,"score_spread":0.2579609894076017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2550083616","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83450264,0.0008038948,0.09537469,0.0009041832,0.0001900481,0.00009066165,0.0010548511,0.0003720697,0.06670716],"genre_scores_gemma":[0.94743365,0.0006853512,0.029366612,0.0003332187,0.00018445995,0.0001548788,0.0017035605,0.00028772655,0.019850647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917537,0.00023148011,0.000046360303,0.00016089562,0.0002036922,0.00018225465],"domain_scores_gemma":[0.9969048,0.0014200425,0.00062492746,0.00038911536,0.00018017556,0.0004809385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000508376,0.0009596453,0.0014220265,0.001839962,0.0016759472,0.0031247518,0.001648906,0.0015891606,0.012185004],"category_scores_gemma":[0.004542589,0.0011686044,0.00094281445,0.0019868163,0.0021828401,0.0037645518,0.0029892996,0.0020056646,0.0012084593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007154154,0.00019749286,0.0034436637,0.0003574932,0.00006902516,0.000993346,0.0012769169,0.060660787,0.005695785,0.8897646,0.009354124,0.027471349],"study_design_scores_gemma":[0.00006165328,0.000058353176,0.0019149061,0.00006332957,0.000018008883,0.0003822804,0.00041376997,0.08812844,0.00095271616,0.9045075,0.0034759922,0.00002311372],"about_ca_topic_score_codex":0.0019006125,"about_ca_topic_score_gemma":0.002039644,"teacher_disagreement_score":0.012185004,"about_ca_system_score_codex":0.00087456184,"about_ca_system_score_gemma":0.00036155267,"threshold_uncertainty_score":0.0407629},"labels":[],"label_agreement":null},{"id":"W2551168410","doi":"10.1016/j.disc.2016.09.008","title":"A simple shift rule for <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml13\" display=\"inline\" overflow=\"scroll\" altimg=\"si13.gif\"><mml:mi>k</mml:mi></mml:math>-ary de Bruijn sequences","year":2016,"lang":"nl","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Substring; De Bruijn sequence; Mathematics; Sequence (biology); Combinatorics; Order (exchange); Amortized analysis; String (physics); Simple (philosophy); Discrete mathematics; Algorithm; Data structure; Computer science","score_opus":0.020056188282154667,"score_gpt":0.25692419384793713,"score_spread":0.23686800556578247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2551168410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012339521,0.0010113929,0.6849144,0.0027233253,0.009967345,0.0009095651,0.006812691,0.021965194,0.25935647],"genre_scores_gemma":[0.17857598,0.0016871139,0.49673185,0.0031277747,0.001763641,0.0012396527,0.00856228,0.023664402,0.28464732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981962,0.0002552208,0.00026824823,0.00048914336,0.0005237286,0.00026751249],"domain_scores_gemma":[0.9972007,0.0008246519,0.00010335549,0.0008047196,0.00093950704,0.00012707643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014513244,0.0013176786,0.0009059772,0.0016186198,0.0020515986,0.002718912,0.0015948329,0.0014140885,0.100483015],"category_scores_gemma":[0.006692081,0.00082514307,0.001148999,0.0013354422,0.0014295413,0.0045449724,0.002467842,0.002749797,0.08598724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081456796,0.0001771718,0.00059661374,0.0009407666,0.000055032415,0.0009018952,0.00090065197,0.0009978678,0.03662106,0.4345169,0.2250355,0.29844198],"study_design_scores_gemma":[0.00007325002,0.00008811606,0.0003158829,0.00018903783,0.000031913674,0.00076558284,0.00023265317,0.0022144867,0.045125324,0.17439227,0.77645826,0.000113165064],"about_ca_topic_score_codex":0.0013701302,"about_ca_topic_score_gemma":0.0021266819,"teacher_disagreement_score":0.100483015,"about_ca_system_score_codex":0.00078479084,"about_ca_system_score_gemma":0.0013095926,"threshold_uncertainty_score":0.33614916},"labels":[],"label_agreement":null},{"id":"W2553698168","doi":"10.1016/j.disc.2016.08.014","title":"Zero-sum flows for triple systems","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Toronto Metropolitan University; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Zero (linguistics); Mathematics; Combinatorics; Flow (mathematics); Zero-point energy; Discrete mathematics; Physics; Geometry","score_opus":0.013657764512558332,"score_gpt":0.21520396694117505,"score_spread":0.2015462024286167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2553698168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2663817,0.0009999882,0.6269126,0.0018375575,0.00072640734,0.00010173368,0.00030454848,0.00033645946,0.102399126],"genre_scores_gemma":[0.9230298,0.0008155848,0.04194152,0.000537927,0.00038789018,0.00013861866,0.00021790563,0.00016678128,0.03276409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994886,0.00011778615,0.00002811191,0.00008197875,0.00015346541,0.0001300432],"domain_scores_gemma":[0.99834347,0.00078210834,0.00015905612,0.00014587419,0.00029514756,0.00027434275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009527974,0.00062963343,0.0007294293,0.0020280965,0.0021390456,0.0029767544,0.00073618675,0.0011916682,0.010834141],"category_scores_gemma":[0.003081296,0.00036222505,0.000785651,0.000990239,0.0020149567,0.0037848568,0.0020141494,0.0023083733,0.0009375303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018888091,0.000015461108,0.00006013647,0.000018513474,0.000004448202,0.00003069959,0.00007109221,0.0017779216,0.00055837247,0.9933134,0.00072409015,0.0034069323],"study_design_scores_gemma":[0.0000047835833,0.00000703992,0.00003376031,0.000008150873,0.0000034816578,0.00002856799,0.00003739271,0.011448347,0.00028387565,0.98730856,0.00082880794,0.0000070980045],"about_ca_topic_score_codex":0.0009827061,"about_ca_topic_score_gemma":0.000991248,"teacher_disagreement_score":0.010834141,"about_ca_system_score_codex":0.0012363049,"about_ca_system_score_gemma":0.0009119453,"threshold_uncertainty_score":0.036243796},"labels":[],"label_agreement":null},{"id":"W2556067267","doi":"10.1016/j.disc.2016.10.016","title":"The strong chromatic index of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml1\" display=\"inline\" overflow=\"scroll\" altimg=\"si1.gif\"><mml:mrow><mml:mo>(</mml:mo><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mi>Δ</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>-bipartite graphs","year":2016,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities; Wuhan University of Technology; National Sanitarium Association","keywords":"Edge coloring; Bipartite graph; Combinatorics; Mathematics; Conjecture; Partition (number theory); Graph; Discrete mathematics; Line graph; Graph power","score_opus":0.01711307893769829,"score_gpt":0.2487024743155098,"score_spread":0.2315893953778115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2556067267","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49922326,0.00095360953,0.08482496,0.003965,0.00048156996,0.00010437362,0.006236503,0.0007733591,0.40343744],"genre_scores_gemma":[0.9361936,0.00065441435,0.012859323,0.00042954087,0.00031755364,0.00009733293,0.0020402207,0.0003964372,0.047011584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993667,0.000110306915,0.00002870574,0.00018451345,0.00015041808,0.00015936968],"domain_scores_gemma":[0.9959323,0.0016181691,0.0005249022,0.00041435994,0.00079520734,0.0007150675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085653417,0.000558638,0.00042600353,0.002934759,0.0021110817,0.003974259,0.0009757715,0.0007390731,0.029102342],"category_scores_gemma":[0.004225672,0.00034376263,0.00041857577,0.0022127714,0.0021609387,0.0039347042,0.0015529956,0.0014362753,0.004128563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016187488,0.0000319156,0.0015921113,0.00010486852,0.000020401183,0.000072308605,0.00031259505,0.0025322337,0.003388634,0.96898144,0.012714713,0.010086969],"study_design_scores_gemma":[0.00003825387,0.000040052488,0.0033269234,0.00006626047,0.00003991537,0.00022267761,0.00024966552,0.01613586,0.0045233853,0.953527,0.02179007,0.00003997983],"about_ca_topic_score_codex":0.003235863,"about_ca_topic_score_gemma":0.0047849696,"teacher_disagreement_score":0.029102342,"about_ca_system_score_codex":0.0022421787,"about_ca_system_score_gemma":0.0012278372,"threshold_uncertainty_score":0.097357094},"labels":[],"label_agreement":null},{"id":"W2558490395","doi":"10.1016/j.disc.2017.09.013","title":"Structure and algorithms for (cap, even hole)-free graphs","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja","keywords":"Mathematics; Combinatorics; Discrete mathematics; Algorithm","score_opus":0.03568801725379487,"score_gpt":0.3306678270001661,"score_spread":0.2949798097463712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2558490395","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42379996,0.0014358931,0.50428903,0.006745918,0.0003105704,0.00041457888,0.0020211118,0.0022438345,0.05873914],"genre_scores_gemma":[0.72651654,0.0010618445,0.23117483,0.0013285874,0.00027254305,0.00037535696,0.004952593,0.0010357494,0.033281863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870074,0.0003006258,0.00006780119,0.00038639127,0.00027858096,0.00026591966],"domain_scores_gemma":[0.99014086,0.0062957495,0.0007964385,0.0015472019,0.0006205104,0.00059922657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001271892,0.0011283691,0.00111144,0.0017389181,0.0029559205,0.0063825664,0.004100628,0.002607134,0.013445296],"category_scores_gemma":[0.011657141,0.0012656563,0.0014771317,0.0029863848,0.0028372083,0.011855176,0.0040230495,0.004796958,0.0020057783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006619527,0.00050181436,0.003321192,0.00056834175,0.00007755638,0.00022047576,0.0018291702,0.029740077,0.005225738,0.85136807,0.023387646,0.08309797],"study_design_scores_gemma":[0.00008540372,0.00004230921,0.00040741643,0.00004223398,0.000039455103,0.000097611344,0.00026691885,0.03370869,0.001848594,0.9593341,0.004108171,0.00001916738],"about_ca_topic_score_codex":0.0031817378,"about_ca_topic_score_gemma":0.005193158,"teacher_disagreement_score":0.013445296,"about_ca_system_score_codex":0.002739102,"about_ca_system_score_gemma":0.0021114743,"threshold_uncertainty_score":0.044978976},"labels":[],"label_agreement":null},{"id":"W2563260604","doi":"10.1016/j.disc.2017.10.032","title":"New existence and nonexistence results for strong external difference families","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Shanghai Education Development Foundation; National Natural Science Foundation of China","keywords":"Mathematics; Character (mathematics); Combinatorics; Discrete mathematics; Pure mathematics; Geometry","score_opus":0.0303471063625325,"score_gpt":0.26113389886225996,"score_spread":0.23078679249972747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563260604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13354911,0.0019493669,0.7947303,0.0024551924,0.00045241546,0.00010748823,0.0002609933,0.0002039881,0.06629117],"genre_scores_gemma":[0.867449,0.0020032886,0.09008647,0.0011107337,0.0006941765,0.00029740512,0.00034112594,0.0002004201,0.037817396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878997,0.00035444248,0.0000767836,0.00031183276,0.0003102831,0.00015664677],"domain_scores_gemma":[0.99168956,0.0057763527,0.00046649735,0.00046672206,0.0009615661,0.0006392486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003078187,0.0012126333,0.00113882,0.0024903042,0.0019249199,0.0023904683,0.0018671172,0.0016604506,0.0072410814],"category_scores_gemma":[0.01006517,0.00078758865,0.0017736196,0.0011629919,0.0037924228,0.0069460482,0.005144539,0.0053300946,0.0006078899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085119944,0.00006291213,0.0006018242,0.00013975087,0.00004281014,0.00018598007,0.00038570634,0.004992294,0.00428801,0.9799397,0.001341082,0.007934717],"study_design_scores_gemma":[0.000036713172,0.000077271696,0.00050207024,0.000056374683,0.000048556412,0.0003528051,0.0002497089,0.05402055,0.0024195747,0.9365085,0.005685901,0.000042075804],"about_ca_topic_score_codex":0.00032232862,"about_ca_topic_score_gemma":0.00034689758,"teacher_disagreement_score":0.0072410814,"about_ca_system_score_codex":0.0014537015,"about_ca_system_score_gemma":0.0007428203,"threshold_uncertainty_score":0.024223804},"labels":[],"label_agreement":null},{"id":"W2581995822","doi":"10.1016/j.disc.2018.01.017","title":"Characterizing the number of coloured <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml1\" display=\"inline\" overflow=\"scroll\" altimg=\"si1.gif\"><mml:mi>m</mml:mi></mml:math>-ary partitions modulo <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml2\" display=\"inline\" overflow=\"scroll\" altimg=\"si1.gif\"><mml:mi>m</mml:mi></mml:math>, with and without gaps","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Modulo; Mathematics; Combinatorics; Discrete mathematics; Characterization (materials science); Arithmetic","score_opus":0.02256427158167709,"score_gpt":0.27486236480285825,"score_spread":0.2522980932211812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2581995822","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5856143,0.0016645155,0.27900133,0.0026067689,0.0006684408,0.00017758955,0.0032774473,0.0014552213,0.12553446],"genre_scores_gemma":[0.9386815,0.0005130033,0.04134538,0.00026447285,0.00030330202,0.00015817354,0.001748113,0.0007443813,0.016241642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997029,0.00046791678,0.00020442705,0.0008211576,0.000780666,0.0006968908],"domain_scores_gemma":[0.986661,0.0072514117,0.0013280777,0.0018872075,0.0016786171,0.0011936672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029429456,0.00077173254,0.0010361894,0.0021393327,0.0024760386,0.0062751747,0.0022583234,0.0016940056,0.015637703],"category_scores_gemma":[0.02567116,0.00059814006,0.0008109856,0.0014639072,0.0047958908,0.008263379,0.0035491905,0.0023045726,0.0032522627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000737517,0.00010315452,0.0048681716,0.00030083142,0.000027489974,0.00029376353,0.0012910608,0.007560569,0.004720316,0.94283515,0.011589584,0.02567231],"study_design_scores_gemma":[0.000056036824,0.00010502097,0.002387134,0.0001542581,0.000036337395,0.0006251008,0.0007338518,0.027747136,0.007871962,0.9443982,0.015825588,0.000059391536],"about_ca_topic_score_codex":0.0010191537,"about_ca_topic_score_gemma":0.0011959905,"teacher_disagreement_score":0.015637703,"about_ca_system_score_codex":0.0019771361,"about_ca_system_score_gemma":0.0014680184,"threshold_uncertainty_score":0.052313328},"labels":[],"label_agreement":null},{"id":"W2590589653","doi":"10.1016/j.disc.2017.01.018","title":"Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"","keywords":"Mathematics; Hermitian matrix; Spectral radius; Combinatorics; RADIUS; Discrete mathematics; Hypergraph; Eigenvalues and eigenvectors; Pure mathematics; Physics; Quantum mechanics; Computer science","score_opus":0.02441696141792542,"score_gpt":0.27759628618214044,"score_spread":0.253179324764215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2590589653","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73660725,0.000718389,0.13672625,0.0016754438,0.00036525846,0.00010486925,0.0007993328,0.0004910583,0.122512065],"genre_scores_gemma":[0.9477021,0.0004979626,0.021515492,0.0005253414,0.00020082318,0.00012469786,0.00048155774,0.00017451798,0.028777529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940825,0.00014780607,0.000029155886,0.00015440168,0.00012638245,0.00013392691],"domain_scores_gemma":[0.9973022,0.0011075898,0.0004396217,0.00019950197,0.00026599996,0.00068516866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047114768,0.00079415506,0.0007746801,0.0024219907,0.0021439255,0.002569615,0.000807374,0.0013389316,0.009142896],"category_scores_gemma":[0.002914059,0.00065147434,0.00048320935,0.0015603565,0.0021001596,0.002881917,0.0018808327,0.0019333581,0.0013670758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039676506,0.000022400855,0.00019396227,0.000019949553,0.000005800626,0.00008242524,0.00015250663,0.00087417656,0.0009420779,0.99395967,0.0010069365,0.002700341],"study_design_scores_gemma":[0.000025578473,0.00001831347,0.00031524125,0.000012830839,0.000008459745,0.00020139989,0.00011479776,0.0067725843,0.0006627042,0.98831916,0.0035321391,0.000016814074],"about_ca_topic_score_codex":0.00069993595,"about_ca_topic_score_gemma":0.0008085862,"teacher_disagreement_score":0.009142896,"about_ca_system_score_codex":0.00080456457,"about_ca_system_score_gemma":0.00054428616,"threshold_uncertainty_score":0.030586064},"labels":[],"label_agreement":null},{"id":"W2594363149","doi":"10.1016/j.disc.2012.12.022","title":"On unit weighing matrices with small weight","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Unit (ring theory); Combinatorics; Order (exchange); Decomposition; Multiple; Discrete mathematics; Arithmetic","score_opus":0.010316773478450647,"score_gpt":0.1849298849536345,"score_spread":0.17461311147518385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594363149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10468947,0.0012910883,0.82590115,0.0015812764,0.00055907277,0.000059798836,0.00016693112,0.0002666115,0.0654845],"genre_scores_gemma":[0.81441486,0.0025802478,0.11128019,0.0015182554,0.0012204972,0.00020073702,0.0003112695,0.00046009102,0.068013914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915636,0.00036981597,0.000025404877,0.00013634827,0.00022069394,0.00009143868],"domain_scores_gemma":[0.9941204,0.00412217,0.00045698576,0.000500887,0.0004927728,0.0003067364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000888799,0.0015422645,0.0008456003,0.0015699592,0.0008599292,0.0015417213,0.0012586172,0.0016772754,0.0082952175],"category_scores_gemma":[0.010148483,0.0006153836,0.00042158112,0.0018232466,0.0024305624,0.0033716867,0.0019317855,0.0020206883,0.0014479065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053451815,0.000026691814,0.00011027834,0.000058743022,0.000010698277,0.00009284445,0.00009862546,0.015233608,0.003165226,0.96539295,0.0024514676,0.013305394],"study_design_scores_gemma":[0.000010675751,0.000022633782,0.00011281202,0.000020038311,0.000007034189,0.000086737185,0.000036349596,0.08008941,0.000900265,0.9163581,0.002337777,0.000018080711],"about_ca_topic_score_codex":0.00088645506,"about_ca_topic_score_gemma":0.00087839767,"teacher_disagreement_score":0.0082952175,"about_ca_system_score_codex":0.00071747846,"about_ca_system_score_gemma":0.00041685317,"threshold_uncertainty_score":0.027750254},"labels":[],"label_agreement":null},{"id":"W2600202171","doi":"10.1016/j.disc.2017.01.024","title":"On the roots of all-terminal reliability polynomials","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Terminal (telecommunication); Conjecture; Simple graph; Upper and lower bounds; Properties of polynomial roots; Modulus; Graph; Reliability (semiconductor); Discrete mathematics; Enhanced Data Rates for GSM Evolution; Undirected graph; Polynomial; Mathematical analysis; Computer science; Geometry","score_opus":0.06495913138480752,"score_gpt":0.35416698980653794,"score_spread":0.2892078584217304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600202171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25799865,0.0019661395,0.6580624,0.0027730025,0.00034138732,0.0000679524,0.00041348644,0.0003124234,0.07806452],"genre_scores_gemma":[0.95544344,0.0016634329,0.025336068,0.000241248,0.00040909735,0.00006207596,0.0001627075,0.00017079235,0.016511146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991646,0.00030258423,0.000022926033,0.00014104579,0.00020779023,0.00016112652],"domain_scores_gemma":[0.9906906,0.0067610103,0.0007319408,0.0005648814,0.0008124772,0.00043902986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014436686,0.0007465852,0.000912669,0.001515085,0.00095783034,0.0016483832,0.0012522747,0.0009870455,0.007716138],"category_scores_gemma":[0.017095331,0.00044193363,0.00058872096,0.001196546,0.0031780833,0.0036930458,0.0015703368,0.0038441978,0.0012796323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003858281,0.000015216539,0.00017980793,0.00005337437,0.0000072104,0.000056024746,0.0001700977,0.012420355,0.00090454763,0.9762062,0.0015634572,0.008385156],"study_design_scores_gemma":[0.000010795791,0.000013503223,0.00020000244,0.000022497292,0.0000060250013,0.00005727445,0.00006359845,0.03390356,0.000333353,0.9640869,0.0012891713,0.000013328531],"about_ca_topic_score_codex":0.0010816997,"about_ca_topic_score_gemma":0.0009822049,"teacher_disagreement_score":0.007716138,"about_ca_system_score_codex":0.0011548653,"about_ca_system_score_gemma":0.000780221,"threshold_uncertainty_score":0.025813103},"labels":[],"label_agreement":null},{"id":"W2603167390","doi":"10.1016/j.disc.2017.01.026","title":"Rainbow Hamilton cycles and lopsidependency","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Lemma (botany); Combinatorics; Rainbow; Discrete mathematics; Hamiltonian path; Graph","score_opus":0.04443084468304953,"score_gpt":0.3372585884944339,"score_spread":0.2928277438113844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603167390","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58533543,0.0018514426,0.15697135,0.00487885,0.00041436072,0.00010995812,0.000539807,0.00046151894,0.24943721],"genre_scores_gemma":[0.9375471,0.0008369508,0.016651453,0.00090638944,0.0002813549,0.00016130893,0.00025235093,0.00014645357,0.043216687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993724,0.00014587393,0.000028096154,0.00016601468,0.00016429067,0.0001232879],"domain_scores_gemma":[0.99769586,0.001078776,0.000307139,0.00029921322,0.00023177106,0.00038725152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006635933,0.0005461664,0.0008962111,0.0023276804,0.0027519972,0.0025170639,0.0014189808,0.0013374597,0.011294887],"category_scores_gemma":[0.003936213,0.00063961436,0.00076611346,0.0017609508,0.004252061,0.0049280375,0.0036999632,0.0028317461,0.00082681014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014251875,0.000009659906,0.00011129904,0.000013404009,0.000003080333,0.00003588461,0.0000922492,0.0002974702,0.0002299544,0.996581,0.00059258414,0.0020191881],"study_design_scores_gemma":[0.0000063704215,0.0000032743121,0.000075904405,0.0000037271486,0.0000029930663,0.000039708695,0.000035850975,0.00084797567,0.00011918729,0.9979265,0.0009345794,0.0000038810217],"about_ca_topic_score_codex":0.0011940064,"about_ca_topic_score_gemma":0.0015684172,"teacher_disagreement_score":0.011294887,"about_ca_system_score_codex":0.0013011687,"about_ca_system_score_gemma":0.0007961608,"threshold_uncertainty_score":0.037785232},"labels":[],"label_agreement":null},{"id":"W2605510696","doi":"10.1016/j.disc.2017.03.007","title":"Reconfiguring dominating sets in some well-covered and other classes of graphs","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Simons Foundation","keywords":"Combinatorics; Mathematics; Dominating set; Vertex (graph theory); Graph; Discrete mathematics; Bound graph; Domination analysis; Graph power; Line graph","score_opus":0.035875787122762744,"score_gpt":0.32940287477408253,"score_spread":0.2935270876513198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605510696","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9178882,0.00040287228,0.06530891,0.00090639055,0.00007395222,0.0000739341,0.0006390392,0.0002597806,0.014446916],"genre_scores_gemma":[0.96406555,0.00041627372,0.026882293,0.00021052425,0.00008174679,0.00007358772,0.0007951469,0.000149392,0.007325569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999203,0.00013514265,0.00003747014,0.0002585642,0.00016516008,0.0002005092],"domain_scores_gemma":[0.9950713,0.0023710662,0.00054124277,0.00069495157,0.00030491746,0.0010164221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008153201,0.00074079965,0.00095749594,0.0016675307,0.001813053,0.0027963398,0.0015156694,0.001057884,0.0041855737],"category_scores_gemma":[0.0048106452,0.0007033384,0.001054706,0.0014032839,0.0016726762,0.003784386,0.0017212746,0.0015114163,0.00035792615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009688297,0.00038371878,0.010937097,0.00046088695,0.00022404146,0.0014632444,0.0031783916,0.103033446,0.038248435,0.7605681,0.011634137,0.06889972],"study_design_scores_gemma":[0.00013819647,0.0001925406,0.005860319,0.000055609453,0.00011719067,0.0012961357,0.0011011192,0.17828944,0.008261848,0.7940446,0.010593269,0.00004963111],"about_ca_topic_score_codex":0.0015645579,"about_ca_topic_score_gemma":0.002430553,"teacher_disagreement_score":0.0041855737,"about_ca_system_score_codex":0.001558732,"about_ca_system_score_gemma":0.0005797783,"threshold_uncertainty_score":0.014002204},"labels":[],"label_agreement":null},{"id":"W2608271081","doi":"10.1016/j.disc.2018.03.026","title":"On 1-uniqueness and dense critical graphs for tree-depth","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Uniqueness; Conjecture; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.03676595863659552,"score_gpt":0.35349044696105836,"score_spread":0.3167244883244628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2608271081","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5018837,0.0045528677,0.37655878,0.0075426702,0.0005708212,0.00023430356,0.0008685539,0.0004968167,0.10729147],"genre_scores_gemma":[0.92291105,0.0020349578,0.04808897,0.0015478261,0.000730652,0.00024189503,0.0008168844,0.00045953406,0.023168268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884087,0.00032926822,0.000054301985,0.0003432387,0.0002036852,0.00022867812],"domain_scores_gemma":[0.9899042,0.0068875896,0.0009028496,0.0004984303,0.00072407455,0.0010827853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002253753,0.0014383977,0.0017648898,0.0044228756,0.004612194,0.0043873554,0.002806473,0.0032597587,0.011197085],"category_scores_gemma":[0.016748112,0.0014404579,0.0017268651,0.0028316234,0.0073621618,0.014664729,0.0061460966,0.0062190345,0.0008127902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003686995,0.000019450232,0.00039137914,0.00006830413,0.000008551376,0.00006339417,0.00045637577,0.001276483,0.00036374797,0.9936526,0.0010269415,0.002635909],"study_design_scores_gemma":[0.0000091871025,0.000007789746,0.00015876367,0.00001882091,0.000009095314,0.00005501821,0.0001388999,0.0028327513,0.00012986812,0.9957431,0.00088625733,0.000010393389],"about_ca_topic_score_codex":0.0022203804,"about_ca_topic_score_gemma":0.0032013964,"teacher_disagreement_score":0.011197085,"about_ca_system_score_codex":0.0024774075,"about_ca_system_score_gemma":0.0012318175,"threshold_uncertainty_score":0.037458003},"labels":[],"label_agreement":null},{"id":"W2736029126","doi":"10.1016/j.disc.2018.03.001","title":"On the metric dimension of incidence graphs","year":2018,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Memorial University of Newfoundland","keywords":"Metric dimension; Combinatorics; Mathematics; Bipartite graph; Vertex (graph theory); Chordal graph; Antipodal point; Dimension (graph theory); Discrete mathematics; Indifference graph; Graph; 1-planar graph; Geometry","score_opus":0.02706137648428678,"score_gpt":0.2649673037469288,"score_spread":0.237905927262642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736029126","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55426484,0.006796611,0.33503768,0.022138022,0.00086390146,0.0000980028,0.002522488,0.00037419578,0.0779042],"genre_scores_gemma":[0.94329345,0.003345367,0.03927222,0.0011496871,0.0015676004,0.00016510439,0.0013506867,0.00025439568,0.009601416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975447,0.0010783108,0.00010654146,0.00051772984,0.00043656176,0.0003161567],"domain_scores_gemma":[0.98092055,0.012536171,0.0017524135,0.0015550297,0.0012848813,0.0019509466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029602337,0.0012176243,0.0017095137,0.0039708307,0.0026988727,0.0063903914,0.00266299,0.002721476,0.006435321],"category_scores_gemma":[0.01876298,0.0010228184,0.00094504305,0.0045949384,0.0065031047,0.016056169,0.0045207,0.005375935,0.0006660523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048444905,0.000028269524,0.001005654,0.000057236644,0.000013144795,0.000024027295,0.00018609232,0.002990943,0.00026772567,0.98763937,0.0028754277,0.004863718],"study_design_scores_gemma":[0.000008206443,0.000006619814,0.00030815307,0.00001527717,0.000007839124,0.000032141477,0.00007283445,0.011201256,0.000104566316,0.98675376,0.0014770036,0.0000122712445],"about_ca_topic_score_codex":0.0021952372,"about_ca_topic_score_gemma":0.0015886954,"teacher_disagreement_score":0.006435321,"about_ca_system_score_codex":0.003214349,"about_ca_system_score_gemma":0.0011481959,"threshold_uncertainty_score":0.023321807},"labels":[],"label_agreement":null},{"id":"W2737456378","doi":"10.1016/j.disc.2017.11.003","title":"Orthogonally Resolvable Matching Designs","year":2017,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Matching (statistics); Partition (number theory); Vertex (graph theory); Mathematics; Graph; Bipartite graph; Square (algebra); Discrete mathematics; Geometry; Statistics","score_opus":0.036232110511950265,"score_gpt":0.2616340832965543,"score_spread":0.22540197278460403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737456378","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051832445,0.00057459646,0.9116956,0.0010174593,0.00026569792,0.00009691397,0.00035645283,0.00036160945,0.03379911],"genre_scores_gemma":[0.65362394,0.0011416009,0.30946383,0.0014803961,0.00049217266,0.00036767445,0.0006552003,0.0001996767,0.032575488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974375,0.0011098173,0.000098056786,0.0005028066,0.0005976308,0.00025415007],"domain_scores_gemma":[0.99599564,0.0017695966,0.00053673005,0.0010146789,0.0005249987,0.00015820531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016215947,0.000993849,0.00086688215,0.0012891932,0.0007592827,0.0023597898,0.0013270285,0.0021277484,0.0077891992],"category_scores_gemma":[0.007233955,0.0006287591,0.00065617706,0.0015630226,0.001231763,0.0022874018,0.0021090605,0.0018624442,0.0022281003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018846542,0.0001089032,0.00026154733,0.00009986088,0.00003844396,0.000076713484,0.00008867033,0.0153052565,0.0067861634,0.9183944,0.0031863716,0.055465113],"study_design_scores_gemma":[0.000079893325,0.0000809993,0.00011470819,0.000037814523,0.00002930681,0.00015409465,0.000035619527,0.092678465,0.00419332,0.8952137,0.0073551936,0.0000269445],"about_ca_topic_score_codex":0.00030925366,"about_ca_topic_score_gemma":0.00045423213,"teacher_disagreement_score":0.0077891992,"about_ca_system_score_codex":0.00084478693,"about_ca_system_score_gemma":0.001303877,"threshold_uncertainty_score":0.026057422},"labels":[],"label_agreement":null},{"id":"W2742025611","doi":"10.1016/j.disc.2017.06.006","title":"On nice and injective-nice tournaments","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; York University","funders":"","keywords":"Nice; Tournament; Mathematics; Combinatorics; Injective function; Homomorphism; Vertex (graph theory); Discrete mathematics; Graph; Computer science","score_opus":0.031090017430859575,"score_gpt":0.3399343565656918,"score_spread":0.3088443391348322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742025611","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7219378,0.0012162435,0.13460025,0.0040247524,0.00041757707,0.000116785326,0.0007418384,0.0003613742,0.13658342],"genre_scores_gemma":[0.9624408,0.0006819895,0.013861194,0.00048723695,0.00045195234,0.00010114398,0.00071824493,0.00016039138,0.021097125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99744236,0.00080005947,0.00011837138,0.00044838304,0.0005567755,0.0006338904],"domain_scores_gemma":[0.98763496,0.0065732524,0.0014410994,0.0010979037,0.0010235735,0.0022292137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019393556,0.0011728834,0.002115784,0.0021063697,0.004424585,0.008740466,0.0027693415,0.003081623,0.010708241],"category_scores_gemma":[0.014170574,0.0012636846,0.0018777326,0.0028233605,0.006096594,0.00956954,0.0050675226,0.004759469,0.0008448231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015079473,0.00004096917,0.0007835474,0.00004555081,0.00001775391,0.0001287644,0.00035134732,0.0019781739,0.00047847803,0.99175924,0.0013830862,0.0028821814],"study_design_scores_gemma":[0.000048996262,0.000023255596,0.0005053256,0.000015058291,0.000019517825,0.00011634897,0.00016512649,0.0073628537,0.00012810403,0.9902334,0.0013661426,0.00001584462],"about_ca_topic_score_codex":0.0030458812,"about_ca_topic_score_gemma":0.003971504,"teacher_disagreement_score":0.010708241,"about_ca_system_score_codex":0.002249499,"about_ca_system_score_gemma":0.0009888546,"threshold_uncertainty_score":0.03582263},"labels":[],"label_agreement":null},{"id":"W2751588130","doi":"10.1016/j.disc.2018.06.021","title":"Spanning Euler tours and spanning Euler families in hypergraphs with particular vertex cuts","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Hypergraph; Vertex (graph theory); Euler's formula; Spanning tree; Euler characteristic; Traverse; Discrete mathematics; Graph; Mathematical analysis","score_opus":0.01965353357901875,"score_gpt":0.2796994088672856,"score_spread":0.26004587528826684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751588130","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77729815,0.00068040553,0.17809255,0.0010477683,0.00010939779,0.000088280474,0.0008820566,0.00027564046,0.041525695],"genre_scores_gemma":[0.9299182,0.00092160446,0.04883245,0.00024618497,0.00008723325,0.000117108546,0.0011000129,0.00018577593,0.018591361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995542,0.00012032754,0.000020251357,0.00009949423,0.000081978746,0.00012371645],"domain_scores_gemma":[0.9974324,0.0012146808,0.0004402886,0.00019169106,0.00024073158,0.00048017167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052429165,0.0005786287,0.0005903727,0.001814,0.0019112327,0.0024005065,0.0010714082,0.0016012822,0.009213521],"category_scores_gemma":[0.0046547037,0.0008859349,0.0006675336,0.0021083702,0.0015447926,0.0038969172,0.0015447381,0.0017780446,0.00069306826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016734934,0.00004913361,0.0027521509,0.00013490094,0.000031550164,0.00068112655,0.0007771768,0.017103486,0.0026208078,0.9566996,0.0040847934,0.014897858],"study_design_scores_gemma":[0.000030241083,0.00002416084,0.0016207013,0.000057797442,0.000033583598,0.0006145173,0.00086856016,0.044173468,0.0011974237,0.946781,0.0045773615,0.000021235743],"about_ca_topic_score_codex":0.0016854545,"about_ca_topic_score_gemma":0.0023144116,"teacher_disagreement_score":0.009213521,"about_ca_system_score_codex":0.001121247,"about_ca_system_score_gemma":0.000503079,"threshold_uncertainty_score":0.030822277},"labels":[],"label_agreement":null},{"id":"W2751759068","doi":"10.1016/j.disc.2018.09.013","title":"A lower bound on the size of an absorbing set in an arc-coloured tournament","year":2018,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; McGill University","funders":"","keywords":"Tournament; Combinatorics; Vertex (graph theory); Monochromatic color; Mathematics; Integer (computer science); Upper and lower bounds; Arc (geometry); Path (computing); Discrete mathematics; Physics; Graph; Computer science; Geometry; Optics; Mathematical analysis","score_opus":0.054529297375144684,"score_gpt":0.3354209737109293,"score_spread":0.28089167633578466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751759068","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5094823,0.0023298175,0.4102736,0.006627424,0.00082225323,0.0002361997,0.0018654497,0.0015828364,0.06678003],"genre_scores_gemma":[0.92588186,0.00087540544,0.06053301,0.0008505456,0.0006564752,0.00031662753,0.0011469495,0.0005144594,0.009224726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99576193,0.0011041336,0.00024341771,0.0010790142,0.00096791505,0.0008435537],"domain_scores_gemma":[0.9269524,0.05902693,0.0023915078,0.0043392773,0.001994141,0.00529578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00449636,0.0018371991,0.0029151596,0.0022341413,0.0028025697,0.008961728,0.007003441,0.0044534067,0.014499899],"category_scores_gemma":[0.035399217,0.0018493333,0.0027046672,0.0021067315,0.0049566897,0.0105526,0.0052947984,0.0062035937,0.0011582203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026198877,0.0007166672,0.007032234,0.0010577483,0.0005061284,0.0008912131,0.001209304,0.09547589,0.036537047,0.8044114,0.015458685,0.03408368],"study_design_scores_gemma":[0.00020673966,0.00026933273,0.0014705609,0.000113560236,0.00025387274,0.0005715957,0.00019104488,0.29176557,0.0053242943,0.696388,0.0033646147,0.000080845595],"about_ca_topic_score_codex":0.00090275455,"about_ca_topic_score_gemma":0.00094821234,"teacher_disagreement_score":0.014499899,"about_ca_system_score_codex":0.0024427616,"about_ca_system_score_gemma":0.0015123916,"threshold_uncertainty_score":0.048507035},"labels":[],"label_agreement":null},{"id":"W2755994256","doi":"10.1016/j.disc.2017.08.039","title":"Constructions for orthogonal designs using signed group orthogonal designs","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"University of Lethbridge","keywords":"Mathematics; Hadamard matrix; Hadamard transform; Orthogonal array; Orthogonal matrix; Group (periodic table); Combinatorics; Orthogonal group; Combinatorial design; Complex Hadamard matrix; Discrete mathematics; Orthogonal basis; Mathematical analysis; Statistics; Taguchi methods","score_opus":0.07403725507723834,"score_gpt":0.2900789309838628,"score_spread":0.21604167590662443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2755994256","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026443198,0.00016237622,0.9548476,0.00027540824,0.00030117083,0.0001125362,0.00008052661,0.0002045624,0.017572686],"genre_scores_gemma":[0.37819725,0.00065737526,0.6007127,0.00076586986,0.0003578373,0.00052484276,0.00028761837,0.00032018256,0.018176274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976114,0.0009977772,0.00015079419,0.00026074288,0.00069714594,0.0002821436],"domain_scores_gemma":[0.9969522,0.0011980424,0.000389341,0.00070315023,0.0005238277,0.00023339938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022978168,0.0013042222,0.000749664,0.0020143527,0.0011805091,0.0022758867,0.0008657257,0.0013856357,0.0056278207],"category_scores_gemma":[0.0055900444,0.00076654984,0.001483382,0.0015788091,0.0022884237,0.0021834653,0.0031287814,0.0024851924,0.0016253586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060259536,0.000029587201,0.00012443487,0.000044635777,0.000013589834,0.00007028431,0.00010506955,0.0023679223,0.004943988,0.9741416,0.0007851426,0.017313596],"study_design_scores_gemma":[0.000068799025,0.00017861642,0.00012930635,0.00006534224,0.000038458318,0.00031099873,0.000096475305,0.030060865,0.009838558,0.94755065,0.0116031505,0.000058802045],"about_ca_topic_score_codex":0.00020428414,"about_ca_topic_score_gemma":0.0004167437,"teacher_disagreement_score":0.0056278207,"about_ca_system_score_codex":0.0008033962,"about_ca_system_score_gemma":0.00095621776,"threshold_uncertainty_score":0.018826902},"labels":[],"label_agreement":null},{"id":"W2758605595","doi":"10.1016/j.disc.2017.08.043","title":"Fair and internally fair (holey) hamiltonian decompositions of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml1\" display=\"inline\" overflow=\"scroll\" altimg=\"si1.gif\"><mml:mi>K</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>…</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>;</mml:mo><mml:msub><mml:mrow><mml:mi>λ</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>λ</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math>","year":2017,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Division of Mathematical Sciences","keywords":"Hamiltonian (control theory); Mathematics; Combinatorics; Hamiltonian path; Partition (number theory); Graph; Discrete mathematics","score_opus":0.015872258556416396,"score_gpt":0.2392087625630316,"score_spread":0.22333650400661523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758605595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04618759,0.0003519231,0.6873844,0.0015574492,0.0008173983,0.00027345246,0.0035412442,0.0018044729,0.25808206],"genre_scores_gemma":[0.6058597,0.0004143117,0.15040657,0.0011267859,0.00039009997,0.0006053542,0.0044674864,0.0027086341,0.23402105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994223,0.00010384094,0.000023448732,0.00010312592,0.00014489966,0.00020240141],"domain_scores_gemma":[0.99923515,0.00012061031,0.000056360856,0.00022852024,0.00021818181,0.00014121902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000624226,0.00072714937,0.00049536827,0.0010161003,0.0015109206,0.0025226597,0.0010029748,0.0008529985,0.09561567],"category_scores_gemma":[0.0022899082,0.00033264648,0.0008632512,0.0006026806,0.0016153313,0.0030853285,0.0018634036,0.0013837242,0.012875123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007774983,0.000048231235,0.00025606487,0.000052969273,0.000011926744,0.00011155027,0.00019721186,0.0056581954,0.0010901787,0.9571131,0.021319142,0.014063659],"study_design_scores_gemma":[0.000032956446,0.000028536882,0.00032219812,0.000027477774,0.000009289172,0.000056435012,0.00019097164,0.026285555,0.0010524126,0.9493681,0.022603203,0.000022891334],"about_ca_topic_score_codex":0.0027927388,"about_ca_topic_score_gemma":0.004769307,"teacher_disagreement_score":0.09561567,"about_ca_system_score_codex":0.0011219339,"about_ca_system_score_gemma":0.00112642,"threshold_uncertainty_score":0.3198663},"labels":[],"label_agreement":null},{"id":"W2761354496","doi":"10.1016/j.disc.2017.09.011","title":"Game of cops and robbers in oriented quotients of the integer grid","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Quotient; Digraph; Vertex (graph theory); Grid; Integer (computer science); Transitive relation; Combinatorics; Discrete mathematics; Computer science; Graph; Geometry","score_opus":0.012398138186278645,"score_gpt":0.24427439189744554,"score_spread":0.2318762537111669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761354496","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7025543,0.00037854118,0.20761873,0.0022094087,0.0001943777,0.00020135952,0.00062552997,0.00029807424,0.08591967],"genre_scores_gemma":[0.9486315,0.00017420932,0.034508683,0.00016890744,0.000042408952,0.00010943261,0.00034309117,0.0001037222,0.01591807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875414,0.00045391367,0.00006328615,0.00024064173,0.0001755325,0.00031240616],"domain_scores_gemma":[0.99727863,0.0014439168,0.00021903237,0.0003011138,0.00012458599,0.00063278683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010937946,0.0007150025,0.0014731088,0.000648864,0.0019043963,0.0047018877,0.0020306788,0.0017850116,0.013807878],"category_scores_gemma":[0.006107007,0.00058397435,0.0009287738,0.0009273642,0.0029443677,0.0057148174,0.0027103173,0.0017874448,0.00081755297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031207153,0.00006055093,0.0004995847,0.0000622068,0.000018843506,0.000100480436,0.00025958114,0.023121879,0.0007608406,0.96764743,0.00214553,0.005010938],"study_design_scores_gemma":[0.00011466558,0.000042314943,0.0002528989,0.000021365844,0.000018505221,0.000060791946,0.00037174244,0.09758019,0.0005266793,0.89742196,0.0035704018,0.000018403427],"about_ca_topic_score_codex":0.0050064274,"about_ca_topic_score_gemma":0.0044031786,"teacher_disagreement_score":0.013807878,"about_ca_system_score_codex":0.0019834049,"about_ca_system_score_gemma":0.0010872046,"threshold_uncertainty_score":0.04619193},"labels":[],"label_agreement":null},{"id":"W2768050560","doi":"10.1016/j.disc.2017.10.009","title":"A note on <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml1\" display=\"inline\" overflow=\"scroll\" altimg=\"si1.gif\"><mml:mi>k</mml:mi></mml:math>-cop-win graphs","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Scroll; Graph; Mathematics; Combinatorics; Discrete mathematics; Algorithm; Theology","score_opus":0.028265365783923486,"score_gpt":0.28287838718056013,"score_spread":0.25461302139663666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768050560","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011901697,0.0009924207,0.1077128,0.033183128,0.022271551,0.0004585079,0.086810686,0.06657906,0.68080163],"genre_scores_gemma":[0.011657236,0.0017748965,0.09278366,0.008334449,0.0046960004,0.0006256129,0.07110972,0.06673005,0.7422883],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903667,0.00020834956,0.00009623155,0.00012586488,0.00043622346,0.000096656666],"domain_scores_gemma":[0.9936473,0.002535955,0.0001729616,0.00078558543,0.0024595733,0.00039865178],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014437181,0.0012279178,0.00095989555,0.002135774,0.0014923376,0.0034676737,0.002188269,0.0012508103,0.6778054],"category_scores_gemma":[0.011387286,0.0009439596,0.0010731892,0.003157039,0.0006198224,0.0069624935,0.0019286292,0.0030039414,0.44028872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020837633,0.000012451266,0.000029420713,0.000044715835,0.0000012259624,0.000012391563,0.00002910739,0.00006820237,0.00014671535,0.008390276,0.98273635,0.008508377],"study_design_scores_gemma":[0.000012967302,0.000009100712,0.00017021537,0.000046828784,0.0000016567116,0.000042092543,0.000031362666,0.00031082402,0.0004675783,0.0073873242,0.99150366,0.000016379798],"about_ca_topic_score_codex":0.010011764,"about_ca_topic_score_gemma":0.018211927,"teacher_disagreement_score":0.6778054,"about_ca_system_score_codex":0.0020181148,"about_ca_system_score_gemma":0.001590857,"threshold_uncertainty_score":0.45957142},"labels":[],"label_agreement":null},{"id":"W2770029606","doi":"10.1016/j.disc.2017.10.015","title":"A result in asymmetric Euclidean Ramsey theory","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Combinatorics; Euclidean geometry; Euclidean distance; Euclidean space; Euclidean distance matrix; Ramsey theory; Space (punctuation); Discrete mathematics; Geometry; Computer science","score_opus":0.04576559176547989,"score_gpt":0.34275639981443695,"score_spread":0.29699080804895706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770029606","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3897483,0.003967088,0.17261823,0.014651902,0.0012070531,0.00006766904,0.000710725,0.0005075522,0.41652137],"genre_scores_gemma":[0.9508032,0.0013028146,0.010981376,0.0014918925,0.0008054556,0.00007023168,0.00025646086,0.00014703507,0.034141473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987872,0.0003711588,0.000058419966,0.00024935327,0.0003593602,0.00017451562],"domain_scores_gemma":[0.9977253,0.0010099265,0.00025309977,0.00035066242,0.00029710084,0.00036389928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00137349,0.000792336,0.0014047856,0.0017876746,0.0035797176,0.003072738,0.0017822098,0.0017918233,0.010616294],"category_scores_gemma":[0.0045825476,0.0005293324,0.0008662992,0.0024653852,0.004941951,0.010898805,0.003934873,0.0042169113,0.0010893471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015036159,0.0000070993483,0.000046385616,0.000019808756,0.0000025415077,0.000019601088,0.00006221495,0.00017411976,0.00013287757,0.99805295,0.0006372691,0.000830017],"study_design_scores_gemma":[0.000007642336,0.0000050940594,0.00006679747,0.000005878405,0.000005583099,0.00005395884,0.000038887003,0.0008518299,0.00011856277,0.9969488,0.0018920898,0.0000049033492],"about_ca_topic_score_codex":0.0011363616,"about_ca_topic_score_gemma":0.0007703178,"teacher_disagreement_score":0.010616294,"about_ca_system_score_codex":0.0016618354,"about_ca_system_score_gemma":0.00077312405,"threshold_uncertainty_score":0.03551507},"labels":[],"label_agreement":null},{"id":"W2776481909","doi":"10.1016/j.disc.2019.06.016","title":"A generalization of Schönemann’s theorem via a graph theoretic method","year":2019,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Generalization; Combinatorics; Discrete mathematics; Graph","score_opus":0.017736649349728077,"score_gpt":0.3183112587670702,"score_spread":0.30057460941734215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2776481909","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024345364,0.0017262503,0.7755052,0.0069914698,0.0021991448,0.00010696255,0.00044858246,0.0004232071,0.18825383],"genre_scores_gemma":[0.5797735,0.004714007,0.29481697,0.0053590517,0.004031639,0.00035234136,0.0006120069,0.0009118537,0.10942864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990441,0.00029459066,0.000051745556,0.0002874593,0.00022664688,0.00009551098],"domain_scores_gemma":[0.9987704,0.00056629424,0.00008361974,0.00022733325,0.00023217009,0.0001202153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012804833,0.0011748625,0.0011509133,0.004421179,0.0019495005,0.0018501714,0.0021216997,0.0016604128,0.01200165],"category_scores_gemma":[0.0031102945,0.0006420017,0.0024041554,0.0021099818,0.004155178,0.007925414,0.0036084724,0.004419383,0.0022032252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006790787,0.000014213935,0.000052740816,0.000037952297,0.000011782721,0.000035964327,0.000080739745,0.000616083,0.000352536,0.9918099,0.002117641,0.00486368],"study_design_scores_gemma":[0.000005094079,0.0000074662407,0.000075755874,0.0000083576315,0.000008702388,0.000041501175,0.000016304411,0.0033841631,0.00013336627,0.9904082,0.0059023164,0.000008683072],"about_ca_topic_score_codex":0.0014976677,"about_ca_topic_score_gemma":0.0014672581,"teacher_disagreement_score":0.01200165,"about_ca_system_score_codex":0.001455451,"about_ca_system_score_gemma":0.00065341033,"threshold_uncertainty_score":0.04014957},"labels":[],"label_agreement":null},{"id":"W2779612036","doi":"10.1016/j.disc.2018.05.017","title":"Throttling for the game of Cops and Robbers on graphs","year":2018,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Bandwidth throttling; Combinatorics; Mathematics; Hypercube; Graph; Discrete mathematics; Physics","score_opus":0.04886693414521081,"score_gpt":0.34045688068476365,"score_spread":0.29158994653955284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2779612036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3335036,0.00073043804,0.56365407,0.0039885533,0.0003820098,0.00044180106,0.0006499201,0.0007223983,0.09592725],"genre_scores_gemma":[0.9095435,0.0005090996,0.044858027,0.00041680745,0.00017400699,0.00031092335,0.0004175411,0.0003474136,0.043422688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986975,0.00041767527,0.00004957082,0.00030184462,0.00017232145,0.00036111465],"domain_scores_gemma":[0.9963032,0.0021508667,0.00028481704,0.00027483897,0.00018337755,0.0008028927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012806797,0.0021126382,0.0017166489,0.0011899673,0.0023472335,0.0032631967,0.0028249412,0.0032068978,0.022673871],"category_scores_gemma":[0.008159489,0.00086098886,0.0012306097,0.00089583365,0.003448671,0.006279551,0.00282756,0.00388596,0.0014612408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035331422,0.00013457531,0.000380423,0.00023177787,0.00004952005,0.00021780991,0.00066658796,0.101779684,0.0019446623,0.87300515,0.007930035,0.013306513],"study_design_scores_gemma":[0.0000467585,0.000052171185,0.000121233075,0.000021819651,0.000016056934,0.000036351194,0.00016459668,0.20157762,0.00024129164,0.79586256,0.0018345668,0.000024925503],"about_ca_topic_score_codex":0.0076169735,"about_ca_topic_score_gemma":0.006641022,"teacher_disagreement_score":0.022673871,"about_ca_system_score_codex":0.0022851676,"about_ca_system_score_gemma":0.0018701339,"threshold_uncertainty_score":0.07585168},"labels":[],"label_agreement":null},{"id":"W2782679454","doi":"10.1016/j.disc.2018.05.014","title":"On the roots of Wiener polynomials of graphs","year":2018,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Wiener index; Closure (psychology); Order (exchange); Polynomial; Graph; Discrete mathematics; Mathematical analysis","score_opus":0.05401071563895392,"score_gpt":0.32432745570121224,"score_spread":0.2703167400622583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782679454","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5067312,0.006926725,0.34855202,0.005829454,0.0014246181,0.00007773942,0.0005611578,0.00040666247,0.12949048],"genre_scores_gemma":[0.9339756,0.0038575055,0.022674939,0.00050884415,0.0014676017,0.0000543997,0.00025355295,0.0002869911,0.036920656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992919,0.00020768795,0.000020632664,0.00014200997,0.0001885188,0.00014923365],"domain_scores_gemma":[0.99791974,0.0010996201,0.00028113314,0.00015192865,0.0002276475,0.00031988625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010070968,0.001182709,0.0010026643,0.0033858456,0.0010814185,0.0026687027,0.001194048,0.0012377099,0.007667627],"category_scores_gemma":[0.00788674,0.0005212953,0.0006862211,0.0022457242,0.0038766651,0.0047732876,0.002498542,0.002890257,0.0014569146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003881334,0.000014791303,0.00022942552,0.000057456185,0.000007312917,0.00005282653,0.00022826839,0.0027357943,0.00096274295,0.9846377,0.0014993504,0.009535537],"study_design_scores_gemma":[0.0000067727965,0.0000066359803,0.00014879803,0.000014439182,0.0000039052197,0.000034329787,0.00004926335,0.0058798343,0.00017000175,0.99219817,0.0014795096,0.000008312802],"about_ca_topic_score_codex":0.0014879105,"about_ca_topic_score_gemma":0.0015282902,"teacher_disagreement_score":0.007667627,"about_ca_system_score_codex":0.0013657386,"about_ca_system_score_gemma":0.000661917,"threshold_uncertainty_score":0.0256508},"labels":[],"label_agreement":null},{"id":"W2784736218","doi":"10.1016/j.disc.2018.02.020","title":"On the Hamilton–Waterloo Problem with cycle lengths of distinct parities","year":2018,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Combinatorics; Mathematics; Factorization; Graph; BETA (programming language); Hamiltonian path; Complete graph; Computer science; Algorithm","score_opus":0.0105022115662468,"score_gpt":0.20158907679462257,"score_spread":0.19108686522837576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784736218","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40906018,0.0031434577,0.404701,0.01749382,0.00087926607,0.0003298737,0.001945532,0.00041558925,0.16203126],"genre_scores_gemma":[0.8379873,0.0025260116,0.09898106,0.0020936995,0.0011787696,0.0004024863,0.0016018574,0.00041646266,0.054812364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987563,0.00044414058,0.000043452328,0.00027917387,0.00021846838,0.00025848852],"domain_scores_gemma":[0.9928999,0.005379526,0.0005329927,0.000440751,0.00033913652,0.00040770386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014443053,0.0012989653,0.0017018798,0.0014071722,0.0021612048,0.0033925213,0.002900972,0.0040534004,0.017449204],"category_scores_gemma":[0.013030311,0.0009376625,0.0008608707,0.0026381176,0.0032535673,0.0066826167,0.0027375487,0.0038573823,0.0011408493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017632903,0.00009274923,0.00034978386,0.000186657,0.000035196288,0.00016075147,0.00023180022,0.03543029,0.00076641294,0.93452096,0.01137865,0.01667029],"study_design_scores_gemma":[0.000047582642,0.000013923666,0.00008757866,0.00002129599,0.000009041228,0.000030393583,0.00007608066,0.051503047,0.00018197548,0.9462128,0.001800867,0.000015523228],"about_ca_topic_score_codex":0.0072007556,"about_ca_topic_score_gemma":0.0065756245,"teacher_disagreement_score":0.017449204,"about_ca_system_score_codex":0.0027975354,"about_ca_system_score_gemma":0.0024201665,"threshold_uncertainty_score":0.05837339},"labels":[],"label_agreement":null},{"id":"W2795132661","doi":"10.1016/j.disc.2018.03.006","title":"Recolouring reflexive digraphs","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Homomorphism; Combinatorics; Mathematics; Vertex (graph theory); Discrete mathematics; Graph; Loop (graph theory); Path (computing); Computer science","score_opus":0.035949377190824854,"score_gpt":0.3399009822795958,"score_spread":0.30395160508877095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795132661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40038982,0.00057813624,0.49732473,0.0010023146,0.00055188616,0.00024631343,0.0011740337,0.004221685,0.09451112],"genre_scores_gemma":[0.773917,0.00060682814,0.1615106,0.0005148998,0.00015773861,0.000093031005,0.0015503067,0.0013898743,0.060259644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918276,0.0001552457,0.000059247956,0.00021923658,0.00021288874,0.00017074488],"domain_scores_gemma":[0.9949746,0.0018873746,0.0002458772,0.0019436645,0.0005096341,0.0004388317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007619624,0.0006231697,0.00065422355,0.0015049077,0.0013037359,0.0017442147,0.0012992258,0.0006100426,0.0134355845],"category_scores_gemma":[0.0037523748,0.0005378897,0.0010089792,0.0010236055,0.0012210814,0.003537942,0.0021254576,0.0024878902,0.002732717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045669609,0.0004297208,0.001514017,0.0005163455,0.0000937501,0.0010629282,0.0019274935,0.011153595,0.030925311,0.7514808,0.012262181,0.18817721],"study_design_scores_gemma":[0.000089928646,0.00020899487,0.00091287645,0.0001310131,0.000122459,0.00075464015,0.00077230536,0.03389392,0.023137204,0.8959883,0.043936115,0.000052248022],"about_ca_topic_score_codex":0.0008965796,"about_ca_topic_score_gemma":0.0023170842,"teacher_disagreement_score":0.0134355845,"about_ca_system_score_codex":0.00067516626,"about_ca_system_score_gemma":0.0005006849,"threshold_uncertainty_score":0.04494649},"labels":[],"label_agreement":null},{"id":"W2802440683","doi":"10.1016/j.disc.2018.03.011","title":"Countable linear orders with disjoint infinite intervals are mutually orthogonal","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Countable set; Disjoint sets; Combinatorics; Discrete mathematics","score_opus":0.03621903001739528,"score_gpt":0.3231965152848577,"score_spread":0.2869774852674624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802440683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34544367,0.0009599709,0.45944512,0.001171867,0.00051313464,0.00012111265,0.0007573202,0.00070705987,0.19088075],"genre_scores_gemma":[0.91328186,0.00061126106,0.054062568,0.00040253106,0.00034547236,0.00018478166,0.00061708334,0.0002311955,0.030263254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960175,0.0007915579,0.0003823645,0.0007205949,0.0013309545,0.0007570843],"domain_scores_gemma":[0.99179465,0.003648215,0.0010558272,0.0011865704,0.0014027975,0.00091190974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018569008,0.0010338288,0.0010283397,0.002730785,0.0027066784,0.005693895,0.0011128305,0.0013015324,0.0074111894],"category_scores_gemma":[0.0066056605,0.0015261248,0.0015159039,0.0020328842,0.0065482794,0.008227697,0.0049123704,0.0040813307,0.0017264575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000499275,0.00001962074,0.00021332903,0.0000281134,0.000014424912,0.000072309056,0.00025128038,0.00019347349,0.0009916929,0.99454767,0.0003111913,0.0033069341],"study_design_scores_gemma":[0.000028224022,0.000033539112,0.00035953402,0.000021204678,0.00002689703,0.00031993954,0.00025931568,0.0018206688,0.0017866804,0.9907458,0.00456867,0.000029532523],"about_ca_topic_score_codex":0.00065213995,"about_ca_topic_score_gemma":0.0009652241,"teacher_disagreement_score":0.0074111894,"about_ca_system_score_codex":0.0010192401,"about_ca_system_score_gemma":0.0008840574,"threshold_uncertainty_score":0.02479285},"labels":[],"label_agreement":null},{"id":"W2807476228","doi":"10.1016/j.disc.2018.05.016","title":"Distinguishing chromatic numbers of complements of Cartesian products of complete graphs","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cartesian product; Chromatic scale; Mathematics; Combinatorics; Graph; Discrete mathematics; Class (philosophy); Computer science","score_opus":0.030084909417892134,"score_gpt":0.2666163669998542,"score_spread":0.23653145758196206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807476228","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9308151,0.00022599279,0.049043722,0.00046466303,0.000057694615,0.00003974254,0.00047658014,0.00010432967,0.018772189],"genre_scores_gemma":[0.9749278,0.00015933593,0.020992814,0.00008328602,0.00005010186,0.000061026865,0.0007249837,0.00007548817,0.0029252528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985238,0.00034546727,0.00009607506,0.00045934468,0.00030068032,0.00027465253],"domain_scores_gemma":[0.9888904,0.0075133434,0.0011318695,0.00076804525,0.0007937469,0.0009026874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001779793,0.00061506283,0.00084469677,0.0022697991,0.0020352316,0.005977607,0.0016496661,0.0014098993,0.006033668],"category_scores_gemma":[0.008074578,0.001048344,0.0007770653,0.002018815,0.0040646945,0.0055009075,0.0023295204,0.0023451329,0.00040729734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052412425,0.00007923734,0.004581739,0.000115514595,0.000028960423,0.000118723794,0.0011608384,0.0044635492,0.005289027,0.96982026,0.0017553907,0.012062679],"study_design_scores_gemma":[0.000077816396,0.000087578475,0.0038921079,0.00007143019,0.00006726186,0.00025759434,0.0008447756,0.021907914,0.0066320035,0.9611702,0.004942654,0.000048708003],"about_ca_topic_score_codex":0.001481044,"about_ca_topic_score_gemma":0.0025665322,"teacher_disagreement_score":0.006033668,"about_ca_system_score_codex":0.002058569,"about_ca_system_score_gemma":0.0011819325,"threshold_uncertainty_score":0.020184577},"labels":[],"label_agreement":null},{"id":"W2883849606","doi":"10.1016/j.disc.2018.06.026","title":"A complexity dichotomy for signed <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml3\" display=\"inline\" overflow=\"scroll\" altimg=\"si3.gif\"><mml:mi mathvariant=\"bold\">H</mml:mi></mml:math>-colouring","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scroll; Mathematics; Discrete mathematics; Algorithm; Computer science; Theology","score_opus":0.033416933724127615,"score_gpt":0.290930367711206,"score_spread":0.2575134339870784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883849606","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22014433,0.0036696277,0.24917586,0.043970723,0.0013487587,0.00015159514,0.0031883602,0.00096393324,0.4773867],"genre_scores_gemma":[0.9041264,0.0016508648,0.03440076,0.0058836713,0.0022635437,0.0003222266,0.002447184,0.0005883141,0.048317082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99654824,0.0007932942,0.00016531647,0.00083960907,0.0011005338,0.000552994],"domain_scores_gemma":[0.9798902,0.014818994,0.0009119093,0.0017582237,0.001516988,0.0011035807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022342254,0.0007060489,0.0011037871,0.0028833135,0.0036066072,0.008271809,0.0017034992,0.0026444371,0.023747427],"category_scores_gemma":[0.014286822,0.0005655675,0.0019295684,0.0019390159,0.004946887,0.015190168,0.0052330894,0.007516647,0.0031518107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003472836,0.00002089856,0.00015818409,0.00004993887,0.0000065603576,0.000031219308,0.0001063654,0.00063655037,0.00024608755,0.9890342,0.0065812785,0.0030940697],"study_design_scores_gemma":[0.000013498852,0.000007930542,0.00017221249,0.000014356646,0.000005184955,0.000038492886,0.000036549896,0.003815678,0.00014508469,0.9931514,0.0025901797,0.000009427295],"about_ca_topic_score_codex":0.0020370376,"about_ca_topic_score_gemma":0.0014791595,"teacher_disagreement_score":0.023747427,"about_ca_system_score_codex":0.004740572,"about_ca_system_score_gemma":0.0017228427,"threshold_uncertainty_score":0.07944304},"labels":[],"label_agreement":null},{"id":"W2885945836","doi":"10.1016/j.disc.2018.07.010","title":"A framework for constructing de Bruijn sequences via simple successor rules","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"De Bruijn sequence; Sequence (biology); Successor cardinal; Disjoint sets; Simple (philosophy); Mathematics; Correctness; De Bruijn graph; Discrete mathematics; Shift register; Combinatorics; Algorithm; Computer science","score_opus":0.028255695515363267,"score_gpt":0.3082963769190016,"score_spread":0.2800406814036383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885945836","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017779393,0.00026384275,0.9596585,0.00024420116,0.00015267135,0.00007925737,0.00012020511,0.000681007,0.021020865],"genre_scores_gemma":[0.29054108,0.0008085713,0.68690175,0.00029216614,0.00022624418,0.0003053461,0.00038686374,0.0005171107,0.0200209],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987174,0.00034774683,0.00010717963,0.00025044064,0.00042405145,0.00015313772],"domain_scores_gemma":[0.9981717,0.00093913625,0.000110426416,0.0004364152,0.0002171206,0.0001251288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016846452,0.00089124474,0.00090039225,0.0021200266,0.0020844522,0.003276416,0.0021141467,0.0012305323,0.0070920014],"category_scores_gemma":[0.0045790863,0.000964588,0.0016180212,0.0021095262,0.0033352787,0.0056012548,0.0028081858,0.0032943208,0.0026086296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015589954,0.000020325338,0.000048094367,0.000034949444,0.000004550177,0.000039648596,0.00011426328,0.0024337468,0.0010704774,0.9824651,0.0005224798,0.013230766],"study_design_scores_gemma":[0.000009081749,0.000017667613,0.00002294336,0.00001859325,0.0000070003057,0.00004937335,0.00001965184,0.010513771,0.001504493,0.9823186,0.005502451,0.000016289925],"about_ca_topic_score_codex":0.000783935,"about_ca_topic_score_gemma":0.0011674922,"teacher_disagreement_score":0.0070920014,"about_ca_system_score_codex":0.0009537943,"about_ca_system_score_gemma":0.0011095887,"threshold_uncertainty_score":0.023725092},"labels":[],"label_agreement":null},{"id":"W2890117438","doi":"10.1016/j.disc.2018.07.029","title":"Shedding vertices of vertex decomposable well-covered graphs","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; Redeemer University; Brock University","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Mathematics; Combinatorics; Counterexample; Maximal independent set; Vertex (graph theory); Dominating set; Conjecture; Chordal graph; Discrete mathematics; Indifference graph; 1-planar graph; Graph","score_opus":0.03289806031381621,"score_gpt":0.3346198819930194,"score_spread":0.3017218216792032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890117438","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9098423,0.00028637005,0.06483021,0.00039939396,0.00008684234,0.00003729835,0.0004297159,0.00026744732,0.023820372],"genre_scores_gemma":[0.97698134,0.00031688923,0.010318308,0.000111737565,0.00008574139,0.000045159446,0.00081725954,0.0001301548,0.011193328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994991,0.00008754868,0.000017131926,0.00008711418,0.00015401113,0.00015500425],"domain_scores_gemma":[0.9982827,0.0006145939,0.00026099,0.00019434828,0.00017882019,0.00046855604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003891597,0.00069158606,0.0008480226,0.0017302223,0.0014784512,0.002120312,0.0011305053,0.0011168496,0.005322957],"category_scores_gemma":[0.0023829432,0.0005175168,0.00057267677,0.0011203778,0.0014250171,0.0023269884,0.0018513094,0.0014584895,0.00059698446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039249205,0.00009172848,0.0020991482,0.00011414977,0.000044140597,0.000928758,0.000955784,0.015637051,0.010427414,0.95132816,0.0031038078,0.014877308],"study_design_scores_gemma":[0.000034435634,0.000043719436,0.0010168985,0.000023819493,0.000026368796,0.00027568123,0.00043893832,0.033790413,0.0029658377,0.95831054,0.0030575986,0.000015701351],"about_ca_topic_score_codex":0.0011070489,"about_ca_topic_score_gemma":0.0010736617,"teacher_disagreement_score":0.005322957,"about_ca_system_score_codex":0.0007431648,"about_ca_system_score_gemma":0.00035836504,"threshold_uncertainty_score":0.017807066},"labels":[],"label_agreement":null},{"id":"W2891315125","doi":"10.1016/j.disc.2019.04.007","title":"Weighted Turán problems with applications","year":2019,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Simons Foundation","keywords":"Combinatorics; Multipartite; Mathematics; Graph; Function (biology); Weight function; Discrete mathematics; Physics; Mathematical analysis","score_opus":0.04809885223323755,"score_gpt":0.3065435816624653,"score_spread":0.25844472942922775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891315125","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15256505,0.012017496,0.64694774,0.008714487,0.0015277117,0.00006539921,0.00053136767,0.00033792743,0.17729275],"genre_scores_gemma":[0.81639093,0.00809548,0.07629348,0.0011252485,0.001877303,0.0002441855,0.00051920005,0.00027685388,0.09517729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995245,0.0002195719,0.000019570301,0.00008122456,0.00010360888,0.000051532126],"domain_scores_gemma":[0.99867487,0.00074612006,0.00015516324,0.000087609646,0.00018113488,0.00015525398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009639568,0.0017013897,0.0010358883,0.0023442518,0.0010287199,0.0022405514,0.0013183339,0.0014589708,0.00978926],"category_scores_gemma":[0.0038537781,0.0003942765,0.00081430527,0.0026320356,0.0018408693,0.0033577466,0.0027176477,0.0033235524,0.0008612662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028269389,0.000025239173,0.000120812874,0.00007170517,0.000017759668,0.000032651387,0.00005967327,0.0056864694,0.00034728844,0.98062193,0.0027410374,0.010247253],"study_design_scores_gemma":[0.0000073234205,0.0000098055125,0.00011853571,0.00001661728,0.0000098225655,0.000031999043,0.000037581918,0.0243983,0.00013723946,0.9709192,0.0043077087,0.000005864069],"about_ca_topic_score_codex":0.0012776825,"about_ca_topic_score_gemma":0.0011207899,"teacher_disagreement_score":0.00978926,"about_ca_system_score_codex":0.0014815666,"about_ca_system_score_gemma":0.00062933104,"threshold_uncertainty_score":0.03274834},"labels":[],"label_agreement":null},{"id":"W2903758214","doi":"10.1016/j.disc.2019.05.021","title":"Constructions of optimal orthogonal arrays with repeated rows","year":2019,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Hadamard matrix; Conjecture; Combinatorics; Modulo; Hadamard transform; Row; Matrix (chemical analysis); Construct (python library); Order (exchange); Block (permutation group theory); Orthogonal array; Discrete mathematics; Computer science","score_opus":0.004278981230616464,"score_gpt":0.17707261635291874,"score_spread":0.17279363512230228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903758214","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04522346,0.00032363183,0.9184895,0.00047736018,0.00020066818,0.0000969441,0.00026687753,0.00047556963,0.034446083],"genre_scores_gemma":[0.36541575,0.00076994987,0.6206806,0.00046403523,0.000176393,0.00036289595,0.00047925452,0.0003591197,0.011292119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981462,0.00064728456,0.000115520925,0.00021933479,0.0005741674,0.00029760282],"domain_scores_gemma":[0.99795294,0.00092896156,0.00026797756,0.00038876128,0.00033550363,0.00012582119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009858941,0.0010084102,0.0009022128,0.0010040987,0.0006432373,0.0018308496,0.00093945814,0.0008371933,0.005207883],"category_scores_gemma":[0.004647659,0.0010305198,0.00080941844,0.0013926266,0.0010452564,0.0015160504,0.0024703508,0.0014143552,0.0016466123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027572754,0.00013227231,0.0005192775,0.0001937098,0.00006167316,0.00019190251,0.00020730065,0.0446849,0.026261939,0.84113026,0.0059805396,0.080360524],"study_design_scores_gemma":[0.00019307177,0.00028983975,0.00039220796,0.000115708084,0.00008190719,0.00045903874,0.00022212954,0.2619198,0.03413764,0.68168116,0.020422757,0.00008475304],"about_ca_topic_score_codex":0.00020721264,"about_ca_topic_score_gemma":0.00046884175,"teacher_disagreement_score":0.005207883,"about_ca_system_score_codex":0.0006325018,"about_ca_system_score_gemma":0.0009845218,"threshold_uncertainty_score":0.01742214},"labels":[],"label_agreement":null},{"id":"W2904851722","doi":"10.1016/j.disc.2018.10.008","title":"Oriented colourings of graphs with maximum degree three and four","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Degree (music); Graph; Discrete mathematics; Orientation (vector space)","score_opus":0.026081442622298667,"score_gpt":0.22886300690060454,"score_spread":0.20278156427830588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904851722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9096113,0.00039598334,0.056261737,0.0009201916,0.00016296092,0.000048542162,0.00046916615,0.00018363193,0.0319465],"genre_scores_gemma":[0.95756406,0.0003373165,0.031910546,0.00039464512,0.00007974967,0.000063966356,0.00060807023,0.00015418546,0.00888745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941874,0.00016200813,0.000036041467,0.000118536496,0.00010006899,0.00016453945],"domain_scores_gemma":[0.99546045,0.0023947435,0.00072964095,0.00043540268,0.0003115063,0.0006681818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005717202,0.00057326275,0.00047956,0.0015804943,0.0014313305,0.002453294,0.0010193081,0.0011450617,0.004341679],"category_scores_gemma":[0.0029224325,0.00074157584,0.00062763534,0.0012980718,0.001888245,0.0024462813,0.0014651442,0.0013723171,0.0004115753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044651062,0.00008583041,0.0037403672,0.00012767455,0.00003116066,0.00029786854,0.001045128,0.007543043,0.012962609,0.95152336,0.003539914,0.018656505],"study_design_scores_gemma":[0.00007000208,0.00003848674,0.0025641804,0.00004462386,0.00003584281,0.00018165908,0.0005183644,0.0113378465,0.0043427125,0.9747772,0.006059268,0.000029943421],"about_ca_topic_score_codex":0.0018219295,"about_ca_topic_score_gemma":0.0030055244,"teacher_disagreement_score":0.004341679,"about_ca_system_score_codex":0.0013357094,"about_ca_system_score_gemma":0.0005332134,"threshold_uncertainty_score":0.0145244},"labels":[],"label_agreement":null},{"id":"W2907328673","doi":"10.1016/j.disc.2019.111607","title":"A relative bound for independence","year":2019,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Upper and lower bounds; Independence number; Independence (probability theory); Eigenvalues and eigenvectors; Mathematics; Combinatorics; Graph; Physics; Statistics; Mathematical analysis","score_opus":0.06587805643236033,"score_gpt":0.3537486403950447,"score_spread":0.2878705839626844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907328673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036472894,0.006158534,0.7137216,0.01329199,0.0013453059,0.00010385328,0.001728249,0.00077517406,0.22640242],"genre_scores_gemma":[0.75420487,0.0057509663,0.13096823,0.006183464,0.0068660323,0.00087258755,0.0029756129,0.0018769345,0.0903013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.991422,0.0024329203,0.00035059085,0.002645354,0.0022350783,0.00091420545],"domain_scores_gemma":[0.9701286,0.020368453,0.0010870992,0.004516157,0.0020770766,0.001822654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059304587,0.0023362327,0.0035488433,0.0063582268,0.0052545425,0.007911313,0.005960063,0.0045641074,0.03550598],"category_scores_gemma":[0.028966157,0.0020846098,0.0036523512,0.008804911,0.009051192,0.037212476,0.011123508,0.021047719,0.0060818987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055649398,0.000027661572,0.0001437974,0.00008571906,0.000020035577,0.000025215037,0.00014726783,0.00095045235,0.00027869476,0.9884476,0.004065013,0.0057527875],"study_design_scores_gemma":[0.0000107163305,0.000014309911,0.00018300186,0.000029810568,0.000030906194,0.00008302134,0.000032616997,0.005438554,0.00032847884,0.9884289,0.0054053734,0.000014429656],"about_ca_topic_score_codex":0.00094330194,"about_ca_topic_score_gemma":0.0007864832,"teacher_disagreement_score":0.03550598,"about_ca_system_score_codex":0.0040401453,"about_ca_system_score_gemma":0.001152296,"threshold_uncertainty_score":0.11877936},"labels":[],"label_agreement":null},{"id":"W2911106712","doi":"10.1016/j.disc.2018.12.024","title":"Modified Erdös–Ginzburg–Ziv constants for <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" overflow=\"scroll\" id=\"d1e22\" altimg=\"si12.gif\"><mml:mi mathvariant=\"double-struck\">Z</mml:mi><mml:mo>∕</mml:mo><mml:mi>n</mml:mi><mml:mi mathvariant=\"double-struck\">Z</mml:mi></mml:math> and <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" overflow=\"scroll\" id=\"d1e33\" altimg=\"si13.gif\"><mml:msup><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant=\"double-struck\">Z</mml:mi><mml:mo>∕</mml:mo><mml:mi>n</mml:mi><mml:mi mathvariant=\"double-struck\">Z</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:math>","year":2019,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Sanitarium Association; University of Minnesota Duluth","keywords":"Scroll; Mathematics; Combinatorics; Discrete mathematics; Computer graphics (images); Computer science; Theology; Philosophy","score_opus":0.021009833591813968,"score_gpt":0.24561769744811865,"score_spread":0.22460786385630468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911106712","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011382603,0.0035381478,0.21438701,0.0060391636,0.00622094,0.00022167308,0.011400903,0.0053505255,0.741459],"genre_scores_gemma":[0.17200549,0.004714623,0.17212966,0.0032727576,0.0015967283,0.000891361,0.017138548,0.017753676,0.6104971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992617,0.00016412325,0.00003981381,0.00011439765,0.00032136435,0.000098604236],"domain_scores_gemma":[0.9993617,0.00011496022,0.00005661042,0.00016754855,0.00024470064,0.000054544034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013000099,0.0014282464,0.0010867044,0.0024887174,0.0014382374,0.003110639,0.00269577,0.0016223467,0.17684807],"category_scores_gemma":[0.003600478,0.0005937885,0.0011093069,0.0022322885,0.0009546143,0.0046279603,0.0017945819,0.0034134067,0.095224336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052931024,0.000036290632,0.00018727919,0.00019850962,0.000018472056,0.00008553081,0.00022355848,0.0013069888,0.0011340964,0.73399913,0.23093143,0.031825706],"study_design_scores_gemma":[0.000053271662,0.000025646703,0.0006842067,0.0001139791,0.000017462216,0.0002095575,0.00017646798,0.0089107985,0.0026195827,0.41530195,0.57180405,0.000082935876],"about_ca_topic_score_codex":0.0043005026,"about_ca_topic_score_gemma":0.0054748044,"teacher_disagreement_score":0.17684807,"about_ca_system_score_codex":0.0031803285,"about_ca_system_score_gemma":0.0015244358,"threshold_uncertainty_score":0.59161574},"labels":[],"label_agreement":null},{"id":"W2916265538","doi":"10.1016/j.disc.2020.112025","title":"On the existence of dense substructures in finite groups","year":2020,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Quadratic growth; Conjecture; Mathematics; Quadratic equation; Combinatorics; Span (engineering); Group (periodic table); Set (abstract data type); Upper and lower bounds; Finite set; Pure mathematics; Mathematical analysis; Geometry; Physics; Computer science","score_opus":0.06572966962262852,"score_gpt":0.30803539816314485,"score_spread":0.24230572854051632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2916265538","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8154352,0.0028782052,0.0942228,0.003996038,0.00019678642,0.000046046203,0.00041034937,0.00016790048,0.08264679],"genre_scores_gemma":[0.9795218,0.0011982212,0.010876336,0.0002521373,0.00021873399,0.00004616196,0.00030280353,0.000043178825,0.007540672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930835,0.00022122929,0.00004486747,0.00014259547,0.00018197895,0.000100894445],"domain_scores_gemma":[0.9921572,0.005727693,0.0004657805,0.00050107914,0.0004903799,0.0006578507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017243623,0.0005860433,0.00089794875,0.002851608,0.0018707375,0.0030185233,0.0014275128,0.0015254043,0.0050625317],"category_scores_gemma":[0.008511038,0.0006417441,0.00064476527,0.0018680334,0.005768918,0.010472129,0.0043471367,0.0029383444,0.00037733043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055445915,0.000033450684,0.0007755479,0.000060232767,0.000008748171,0.000084814084,0.0006091689,0.0008515274,0.0005902629,0.9921657,0.00044077597,0.0043243095],"study_design_scores_gemma":[0.00000782806,0.000012521068,0.00027786664,0.000014745154,0.0000044320545,0.000052245305,0.00018092513,0.0018073939,0.0002089599,0.9968232,0.0006056503,0.0000042362813],"about_ca_topic_score_codex":0.0010711745,"about_ca_topic_score_gemma":0.0010169477,"teacher_disagreement_score":0.0050625317,"about_ca_system_score_codex":0.0013361985,"about_ca_system_score_gemma":0.00052130874,"threshold_uncertainty_score":0.016935825},"labels":[],"label_agreement":null},{"id":"W2920900590","doi":"10.1016/j.disc.2019.02.010","title":"Corrigendum to “Enumeration of eulerian and unicursal planar maps” [Discrete Math. 282 (2004) 208–221]","year":2019,"lang":"en","type":"erratum","venue":"Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Enumeration; Mathematics; Eulerian path; Planar; Combinatorics; Discrete mathematics; Pure mathematics; Computer science; Lagrangian; Computer graphics (images)","score_opus":0.01874557788561455,"score_gpt":0.25190424745218987,"score_spread":0.23315866956657533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920900590","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033691907,0.010544101,0.0042444207,0.06343377,0.87227803,0.00009934109,0.0020093026,0.0007896895,0.04626452],"genre_scores_gemma":[0.015465426,0.025399543,0.009113001,0.060381282,0.22100829,0.0004041961,0.005420905,0.002340554,0.66046673],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.995135,0.0009312491,0.0005232904,0.0008440225,0.0021677832,0.00039863895],"domain_scores_gemma":[0.98772544,0.002668399,0.0004150602,0.0010194412,0.0076585575,0.00051306986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026896503,0.0027519725,0.0035847572,0.0067584394,0.004153973,0.0040818583,0.005341647,0.0047776927,0.114670105],"category_scores_gemma":[0.022459498,0.0012903179,0.0028276986,0.0051568043,0.002970246,0.0054026656,0.0027424595,0.006257552,0.05799192],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032600467,0.000010851831,0.000039474562,0.00018618094,0.000015894062,0.000062832565,0.000019262121,0.000105064515,0.00005910843,0.0042034844,0.98862725,0.0066379965],"study_design_scores_gemma":[0.00003911053,0.00003962858,0.0011615534,0.00027571822,0.000055720015,0.00026178,0.00006520185,0.00084671885,0.0005393829,0.01976826,0.976872,0.00007485367],"about_ca_topic_score_codex":0.032745693,"about_ca_topic_score_gemma":0.03720676,"teacher_disagreement_score":0.114670105,"about_ca_system_score_codex":0.008026682,"about_ca_system_score_gemma":0.0031303999,"threshold_uncertainty_score":0.3836097},"labels":[],"label_agreement":null},{"id":"W2921699086","doi":"10.1016/j.disc.2020.111811","title":"On rich and poor directions determined by a subset of a finite plane","year":2020,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Iterated function; Cardinality (data modeling); Multiplicity (mathematics); Mathematics; Combinatorics; Line (geometry); Polynomial; Plane (geometry); Discrete mathematics; Geometry; Computer science; Mathematical analysis","score_opus":0.037212368150733977,"score_gpt":0.30159311182162984,"score_spread":0.26438074367089587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921699086","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9119652,0.00058129395,0.055728316,0.0005539883,0.000076972,0.00004140339,0.0006040824,0.00006931938,0.030379409],"genre_scores_gemma":[0.96890223,0.00052402826,0.020588698,0.00010801196,0.00010994343,0.00008287901,0.0005660491,0.00007138801,0.009046741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995427,0.00011710536,0.000022964125,0.00008645701,0.00013947806,0.00009118574],"domain_scores_gemma":[0.9975533,0.001012432,0.0005192686,0.00017265455,0.00031333877,0.00042893505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006647637,0.00090031157,0.0010041336,0.003045147,0.0015302247,0.0033145817,0.00088149734,0.00088919763,0.0034751513],"category_scores_gemma":[0.0026772756,0.0005356904,0.0004597045,0.0014239224,0.0023080267,0.0027367754,0.0017659132,0.0012674641,0.00041134373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040656337,0.00004517142,0.0023403303,0.00006434693,0.000025721705,0.00033664762,0.00037546677,0.008303797,0.0052369,0.9762176,0.001072092,0.005575302],"study_design_scores_gemma":[0.00007528695,0.000066956876,0.0032022598,0.000041826843,0.000020153397,0.00056254305,0.0006178689,0.045638368,0.001493292,0.94486684,0.0033748369,0.00003991621],"about_ca_topic_score_codex":0.0012592132,"about_ca_topic_score_gemma":0.0013369197,"teacher_disagreement_score":0.0034751513,"about_ca_system_score_codex":0.0008431588,"about_ca_system_score_gemma":0.00035139607,"threshold_uncertainty_score":0.011625588},"labels":[],"label_agreement":null},{"id":"W2946625573","doi":"10.1016/j.disc.2019.04.022","title":"Corrigendum to “Colorings and spectral radius of digraphs” [Discrete Math. 339 (1) (2016) 327–332]","year":2019,"lang":"en","type":"erratum","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Natural Science Foundation of China-Shandong Joint Fund for Marine Science Research Centers","keywords":"Mathematics; Spectral radius; Combinatorics; RADIUS; Order (exchange); Discrete mathematics; Eigenvalues and eigenvectors; Computer science; Physics","score_opus":0.031839465290369476,"score_gpt":0.2884899560437913,"score_spread":0.25665049075342183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946625573","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021340583,0.0063937553,0.002473957,0.076149665,0.8859083,0.00004968859,0.00198241,0.00056972896,0.026259115],"genre_scores_gemma":[0.013851978,0.023392,0.007750645,0.09223798,0.33179572,0.0003068939,0.0055513442,0.0020752938,0.52303815],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99587977,0.00074947265,0.0004573472,0.0008488339,0.0017711812,0.000293444],"domain_scores_gemma":[0.9844242,0.003923854,0.0005232932,0.0012719732,0.009223485,0.0006332984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025887438,0.0023892554,0.0029801556,0.0063329837,0.0033511226,0.00435151,0.0043643457,0.004651307,0.11585852],"category_scores_gemma":[0.028072909,0.0011087169,0.002654497,0.004878713,0.0026646256,0.005470769,0.0023901602,0.0066923313,0.060925946],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015808413,0.000006757929,0.000033246535,0.00010699972,0.00000931421,0.000037366433,0.000011584858,0.000065591834,0.00003368103,0.003372859,0.99249214,0.003814631],"study_design_scores_gemma":[0.00003808127,0.000028222648,0.0010736386,0.0003186095,0.00005126614,0.00022284761,0.000055676417,0.0006771175,0.00029934416,0.025337199,0.9718322,0.000065739194],"about_ca_topic_score_codex":0.026915032,"about_ca_topic_score_gemma":0.029780952,"teacher_disagreement_score":0.11585852,"about_ca_system_score_codex":0.0072560147,"about_ca_system_score_gemma":0.0031178733,"threshold_uncertainty_score":0.3875854},"labels":[],"label_agreement":null},{"id":"W2949500475","doi":"10.1016/j.disc.2019.05.002","title":"On the reliability roots of simplicial complexes and matroids","year":2019,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Matroid; Mathematics; h-vector; Combinatorics; Abstract simplicial complex; Simplicial complex; Simplicial homology; Reliability (semiconductor); Simplicial approximation theorem; Discrete mathematics; Simplicial set; Pure mathematics","score_opus":0.023838984940373703,"score_gpt":0.2936747050196915,"score_spread":0.2698357200793178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949500475","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35398403,0.008086273,0.46487856,0.009986441,0.00068876037,0.00010305864,0.0006894978,0.00033096445,0.16125244],"genre_scores_gemma":[0.92680186,0.0041667973,0.038518142,0.00052483584,0.0010900857,0.00007752888,0.00030946554,0.00025782845,0.028253376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986929,0.00047317424,0.000052445186,0.00022183945,0.00041583198,0.00014371864],"domain_scores_gemma":[0.98622686,0.009853767,0.0011790295,0.00098905,0.0009858002,0.00076548144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020310634,0.0008423625,0.0014200074,0.0026532512,0.0014558661,0.0036107,0.0015913426,0.0016655679,0.011616952],"category_scores_gemma":[0.018238023,0.0008824731,0.00073201564,0.002178784,0.0047971243,0.008467758,0.0028317876,0.004774008,0.0014926112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017302287,0.000009019419,0.00020451407,0.00004358897,0.000005983401,0.00003221469,0.00025445077,0.0025925254,0.0003424783,0.9900197,0.0012740508,0.005204221],"study_design_scores_gemma":[0.0000053501426,0.000005122499,0.00016615704,0.000011909689,0.000003892794,0.00003579631,0.000057395566,0.005235209,0.00008685005,0.99248815,0.0018972058,0.0000070093893],"about_ca_topic_score_codex":0.0016264104,"about_ca_topic_score_gemma":0.0014313563,"teacher_disagreement_score":0.011616952,"about_ca_system_score_codex":0.0015018085,"about_ca_system_score_gemma":0.0004928445,"threshold_uncertainty_score":0.038862526},"labels":[],"label_agreement":null},{"id":"W2952034745","doi":"10.1016/j.disc.2016.12.019","title":"Cops and Robbers ordinals of cop-win trees","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Characterization (materials science); Discrete mathematics; Graph; Product (mathematics); Geometry","score_opus":0.13995372355013674,"score_gpt":0.42885959388119516,"score_spread":0.2889058703310584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952034745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4334953,0.0012264308,0.48125362,0.001677365,0.00019040426,0.0001879082,0.00084478135,0.0003145166,0.08080969],"genre_scores_gemma":[0.93474185,0.00046166952,0.04700707,0.00016159208,0.0001857639,0.00024315655,0.00045664783,0.00015407434,0.016588226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99742764,0.0008941253,0.0001435185,0.0003996549,0.00059387065,0.0005411282],"domain_scores_gemma":[0.9894917,0.00637457,0.0010086261,0.00059098226,0.00090959406,0.00162457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024947168,0.00065007916,0.001737973,0.0037643802,0.0029128334,0.0063921204,0.0016475572,0.001409918,0.010021506],"category_scores_gemma":[0.015816743,0.0011239487,0.0013114786,0.0027990737,0.004250817,0.008269575,0.0029286903,0.0036688957,0.000715498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004585816,0.00002590435,0.00067583047,0.00004108363,0.0000115055145,0.00004880668,0.00037662135,0.0027452032,0.00024740095,0.9907301,0.0006515176,0.0044002826],"study_design_scores_gemma":[0.000011613453,0.000014199101,0.0005057456,0.000021547414,0.000013388896,0.000051689363,0.00015390059,0.01450054,0.00013161343,0.9829427,0.0016410992,0.0000119069555],"about_ca_topic_score_codex":0.0015989168,"about_ca_topic_score_gemma":0.002002339,"teacher_disagreement_score":0.010021506,"about_ca_system_score_codex":0.0017532436,"about_ca_system_score_gemma":0.0009033629,"threshold_uncertainty_score":0.033525288},"labels":[],"label_agreement":null},{"id":"W2954485064","doi":"10.1016/j.disc.2019.06.030","title":"The maximum multiplicity of the largest <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e100\" altimg=\"si3.svg\"> <mml:mi>k</mml:mi> </mml:math> -th eigenvalue in a matrix whose graph is acyclic or unicyclic","year":2019,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"FP7 People: Marie-Curie Actions; Seventh Framework Programme; Natural Sciences and Engineering Research Council of Canada; Palestine Polytechnic University; Research Executive Agency; Bundesministerium für Bildung und Forschung; Universität Konstanz; Deutscher Akademischer Austauschdienst","keywords":"Mathematics; Eigenvalues and eigenvectors; Combinatorics; Multiplicity (mathematics); Inverse; Graph; Discrete mathematics; Mathematical analysis","score_opus":0.02253368435304887,"score_gpt":0.2810905412138136,"score_spread":0.25855685686076474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954485064","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6797285,0.0016468577,0.17806241,0.003751324,0.0011091818,0.00014687818,0.006564074,0.0011069527,0.12788375],"genre_scores_gemma":[0.95625955,0.0005054585,0.022741508,0.00018827934,0.0002939764,0.00011361114,0.0011265684,0.00031120656,0.018459944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991265,0.00014885305,0.00005577126,0.00028958276,0.00016584725,0.00021354877],"domain_scores_gemma":[0.9925218,0.0032630377,0.0012838312,0.0006658683,0.0010197217,0.001245771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006541621,0.0007281902,0.000758742,0.0024203795,0.0014944901,0.0021892365,0.001377213,0.0011742327,0.020527972],"category_scores_gemma":[0.007540198,0.0003210464,0.0004739092,0.0011748748,0.0020924609,0.0023761322,0.0013548512,0.0011411079,0.0037155503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012329253,0.00024129298,0.012730828,0.00105218,0.0001441299,0.0017657042,0.0017688855,0.014310863,0.05541965,0.8208063,0.029309887,0.061217394],"study_design_scores_gemma":[0.000099533325,0.0002345998,0.015092052,0.00024612405,0.000092720955,0.0035158654,0.0012113806,0.03968367,0.035606448,0.8799953,0.023962565,0.00025982718],"about_ca_topic_score_codex":0.00057625165,"about_ca_topic_score_gemma":0.00075649016,"teacher_disagreement_score":0.020527972,"about_ca_system_score_codex":0.0007902928,"about_ca_system_score_gemma":0.0006889261,"threshold_uncertainty_score":0.068672836},"labels":[],"label_agreement":null},{"id":"W2962803950","doi":"10.1016/j.disc.2018.09.025","title":"DP-3-coloring of some planar graphs","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; National Sanitarium Association","keywords":"Mathematics; Combinatorics; Planar graph; Planar; List coloring; Edge coloring; Discrete mathematics; Graph coloring; Graph; Computer science; Line graph; Graph power","score_opus":0.03146660688058853,"score_gpt":0.3079936122252469,"score_spread":0.27652700534465835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962803950","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70804965,0.0005656609,0.16096225,0.002767944,0.00028096352,0.00019312807,0.0030176335,0.00063788,0.12352484],"genre_scores_gemma":[0.89445084,0.0005066867,0.06560616,0.00071974326,0.0001566348,0.00018868985,0.0037508877,0.00031526637,0.034305144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941015,0.00011884755,0.000023817161,0.00015497554,0.000101420585,0.00019087546],"domain_scores_gemma":[0.9983889,0.00054525275,0.00018926222,0.00023159588,0.00029256922,0.0003524629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037673645,0.0007385172,0.0007276068,0.0010755366,0.0022042044,0.0020885277,0.0015259578,0.0009800536,0.009483142],"category_scores_gemma":[0.0019082087,0.00064091955,0.0011365094,0.0016422785,0.0013008992,0.0017198437,0.0012958032,0.0024819518,0.0009153944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040673354,0.00018521814,0.002561959,0.00036276507,0.000082876955,0.0008190852,0.00081223337,0.015472377,0.013886203,0.9220807,0.01582135,0.027508387],"study_design_scores_gemma":[0.00009462473,0.000058188016,0.0024944304,0.000031117033,0.00007631192,0.00054967694,0.0005221711,0.034012083,0.004680839,0.9412883,0.016156243,0.000035911118],"about_ca_topic_score_codex":0.005782173,"about_ca_topic_score_gemma":0.0054426943,"teacher_disagreement_score":0.009483142,"about_ca_system_score_codex":0.0018578945,"about_ca_system_score_gemma":0.0010583809,"threshold_uncertainty_score":0.031724215},"labels":[],"label_agreement":null},{"id":"W2962823499","doi":"10.1016/j.disc.2017.08.041","title":"Ideal ramp schemes and related combinatorial objects","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ideal (ethics); Mathematics; Equivalence (formal languages); Orthogonal array; Scheme (mathematics); Term (time); Discrete mathematics; Algorithm; Combinatorics; Topology (electrical circuits); Mathematical analysis; Statistics","score_opus":0.013044044360356671,"score_gpt":0.2564547124330966,"score_spread":0.24341066807273992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962823499","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39810163,0.003475314,0.1923361,0.0048315567,0.0006762253,0.0001634365,0.000854291,0.0005630279,0.3989985],"genre_scores_gemma":[0.9389446,0.0014871185,0.018869368,0.0003441542,0.00055034726,0.000069002774,0.00042167984,0.00013055597,0.03918313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991067,0.00019828245,0.000049225862,0.00017050636,0.00027519866,0.0002000939],"domain_scores_gemma":[0.9983935,0.0006115667,0.0003157396,0.00030636697,0.0001342235,0.00023852581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095641194,0.0006156141,0.0007451469,0.003086254,0.002980279,0.0050467816,0.0016640566,0.0013570975,0.01761697],"category_scores_gemma":[0.0032291505,0.00055732817,0.00078711065,0.0040687523,0.0062617254,0.011372346,0.0037049549,0.0040535294,0.001404221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007986619,0.0000047814738,0.00003720119,0.0000082447705,7.78731e-7,0.000014069344,0.000056397887,0.00014269177,0.000047988266,0.99860805,0.0002328283,0.0008390341],"study_design_scores_gemma":[0.000007651481,0.0000068775876,0.00011199517,0.000009370286,0.0000045295146,0.000086203625,0.000091380854,0.0011580252,0.00018618384,0.9939831,0.0043464815,0.000008201368],"about_ca_topic_score_codex":0.00056285044,"about_ca_topic_score_gemma":0.00040076388,"teacher_disagreement_score":0.01761697,"about_ca_system_score_codex":0.0016806289,"about_ca_system_score_gemma":0.00053829874,"threshold_uncertainty_score":0.05893457},"labels":[],"label_agreement":null},{"id":"W2962843004","doi":"10.1016/j.disc.2017.09.009","title":"On a class of quaternary complex Hadamard matrices","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Japan Society for the Promotion of Science; Soochow University; Universities Space Research Association","keywords":"Mathematics; Hadamard transform; Complex Hadamard matrix; Class (philosophy); Combinatorics; Complex matrix; Association scheme; Derangement; Unit (ring theory); Skew; Complex conjugate; Discrete mathematics; Hadamard matrix; Algebra over a field; Pure mathematics","score_opus":0.025179432586805526,"score_gpt":0.2555797424418448,"score_spread":0.23040030985503926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962843004","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46389112,0.0025524292,0.41099375,0.0020783823,0.0006743401,0.00008114411,0.0005032626,0.00025176318,0.11897378],"genre_scores_gemma":[0.95120174,0.0014764784,0.022120398,0.00047185147,0.00057809916,0.000056553177,0.0002573069,0.000080760685,0.023756852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953616,0.000102032565,0.00001585502,0.00009148539,0.00015464824,0.00009978464],"domain_scores_gemma":[0.9985398,0.0006223821,0.00025581804,0.00013464039,0.00028128826,0.00016604127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047787937,0.00086415524,0.00077333476,0.00201945,0.0014315513,0.002423548,0.0006883236,0.0012213947,0.004936128],"category_scores_gemma":[0.002199239,0.000312359,0.00052171934,0.0017064763,0.0017048409,0.0018161114,0.000795036,0.0013417917,0.0007050006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026801297,0.00001812652,0.00016236759,0.000026944146,0.0000061406463,0.00011839121,0.00009814405,0.0039842026,0.0016295024,0.98987716,0.001062744,0.0029895203],"study_design_scores_gemma":[0.000018127117,0.000030457019,0.00037166986,0.000021512857,0.0000054351017,0.00028643516,0.000064495594,0.05217764,0.0007080227,0.9422347,0.0040579415,0.000023610695],"about_ca_topic_score_codex":0.0013996463,"about_ca_topic_score_gemma":0.0009431235,"teacher_disagreement_score":0.004936128,"about_ca_system_score_codex":0.0009965252,"about_ca_system_score_gemma":0.0006134728,"threshold_uncertainty_score":0.01651299},"labels":[],"label_agreement":null},{"id":"W2963210532","doi":"10.1016/j.disc.2014.08.023","title":"Almost all <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> -cop-win graphs contain a dominating set of cardinality <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"> <mml:mi>k</mml:mi> </mml:math>","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Cardinality (data modeling); Vertex (graph theory); Graph; Discrete mathematics; Database; Computer science","score_opus":0.022176361831512063,"score_gpt":0.2696133685318904,"score_spread":0.24743700670037833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963210532","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0838286,0.0021123735,0.34864634,0.0064591854,0.00091530563,0.00033711252,0.030229403,0.010838768,0.5166329],"genre_scores_gemma":[0.463854,0.0044681523,0.153223,0.0025486993,0.0006013516,0.0005644246,0.05232424,0.007197038,0.31521904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924684,0.000105860025,0.00004640104,0.00023527074,0.00023415244,0.00013137054],"domain_scores_gemma":[0.9963559,0.0013172274,0.0003282696,0.0009834634,0.00074143877,0.00027372528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065403647,0.0007364524,0.00076933065,0.0011104548,0.0011206121,0.00330773,0.0014375137,0.00076744484,0.054420553],"category_scores_gemma":[0.004979561,0.00060792116,0.00070834643,0.0021370386,0.0007739397,0.004532683,0.0011927548,0.0010663911,0.026413674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000514688,0.00017472243,0.0024648344,0.0011296518,0.00010801537,0.00055207725,0.0010076468,0.004952955,0.019854879,0.49281725,0.29136798,0.18505539],"study_design_scores_gemma":[0.00006222123,0.00004928173,0.0025947022,0.00012344832,0.000045471515,0.00096936227,0.0004569126,0.006291308,0.013492617,0.4452892,0.5305777,0.000047788315],"about_ca_topic_score_codex":0.0021958828,"about_ca_topic_score_gemma":0.0035561316,"teacher_disagreement_score":0.054420553,"about_ca_system_score_codex":0.0012943742,"about_ca_system_score_gemma":0.0008352017,"threshold_uncertainty_score":0.18205494},"labels":[],"label_agreement":null},{"id":"W2963285256","doi":"10.1016/j.disc.2018.09.006","title":"Connected <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" overflow=\"scroll\" id=\"d1e220\" altimg=\"si33.gif\"><mml:mi>k</mml:mi></mml:math>-dominating graphs","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Integer (computer science); Dominating set; Cardinality (data modeling); Discrete mathematics; Database; Computer science","score_opus":0.020859113087897004,"score_gpt":0.276190103456706,"score_spread":0.255330990368809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963285256","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021017573,0.00037591872,0.18882899,0.0029078338,0.0013170015,0.0003548458,0.2321567,0.12614502,0.445812],"genre_scores_gemma":[0.029343864,0.001178959,0.09409979,0.0020081007,0.00048441935,0.0007184434,0.3873734,0.090727955,0.39406502],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993401,0.00009420593,0.000063454456,0.00015636279,0.00025997526,0.00008590744],"domain_scores_gemma":[0.99789125,0.0005417268,0.000115411705,0.0005581534,0.00072101236,0.0001724405],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006074312,0.0015131911,0.0010594926,0.0024377913,0.0013565252,0.0053598555,0.0028587175,0.0017628605,0.56047827],"category_scores_gemma":[0.0046032774,0.0011554984,0.0010861207,0.004080978,0.0006215557,0.0064688292,0.003103716,0.0021569703,0.41516647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081786064,0.000030568302,0.00018529504,0.00034164183,0.000010542334,0.000074461524,0.00013649816,0.00060498377,0.0016307721,0.048392992,0.91262203,0.035888515],"study_design_scores_gemma":[0.000037916194,0.000007251299,0.00026672886,0.00008129769,0.000007989006,0.0001076124,0.000053942433,0.0026173296,0.0032016013,0.030788625,0.96280444,0.000025274665],"about_ca_topic_score_codex":0.006583089,"about_ca_topic_score_gemma":0.008914021,"teacher_disagreement_score":0.56047827,"about_ca_system_score_codex":0.0018612833,"about_ca_system_score_gemma":0.0014553969,"threshold_uncertainty_score":0.6269244},"labels":[],"label_agreement":null},{"id":"W2963299192","doi":"10.1016/j.disc.2019.04.013","title":"The Hamilton–Waterloo Problem with even cycle lengths","year":2019,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Hamiltonian path; Discrete mathematics; Graph","score_opus":0.0029876957720433657,"score_gpt":0.17190028242807048,"score_spread":0.16891258665602712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963299192","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41146335,0.0031386218,0.36967763,0.012658766,0.00062656915,0.00026815338,0.001776552,0.00039229126,0.19999811],"genre_scores_gemma":[0.8620449,0.0023597488,0.068560384,0.0015026901,0.0005171701,0.00024651835,0.0008606889,0.00022791744,0.06368002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994318,0.00016083993,0.00002288423,0.00012205603,0.00011674659,0.0001456221],"domain_scores_gemma":[0.99740654,0.0017212374,0.00024974535,0.00022222154,0.00016882362,0.00023142119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005828625,0.0005539757,0.0007600493,0.0009584137,0.0013577318,0.0020260795,0.0015559033,0.002038624,0.013149779],"category_scores_gemma":[0.0048733847,0.00052017206,0.00049997045,0.0014506667,0.0014610398,0.003834186,0.0015639106,0.002201949,0.0009226464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011050723,0.0000501827,0.00031568398,0.00016541187,0.000026372345,0.00016322613,0.00014952468,0.016555864,0.0014070302,0.94766015,0.009948924,0.02344705],"study_design_scores_gemma":[0.00003309969,0.000009768651,0.00011996223,0.000015235583,0.00000662482,0.00003405227,0.00006884746,0.024028841,0.0004745048,0.97195375,0.0032446953,0.000010606542],"about_ca_topic_score_codex":0.0054753497,"about_ca_topic_score_gemma":0.0059199883,"teacher_disagreement_score":0.013149779,"about_ca_system_score_codex":0.0013972983,"about_ca_system_score_gemma":0.0017252022,"threshold_uncertainty_score":0.043990374},"labels":[],"label_agreement":null},{"id":"W2963423082","doi":"10.1016/j.disc.2016.09.028","title":"Decompositions of edge-colored infinite complete graphs into monochromatic paths","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Monochromatic color; Colored; Combinatorics; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Optics","score_opus":0.029825100914368602,"score_gpt":0.29478857743477654,"score_spread":0.26496347652040797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963423082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3945166,0.00077073905,0.5691022,0.00029169957,0.00007714593,0.00012534996,0.00072644785,0.0005013004,0.03388858],"genre_scores_gemma":[0.8087213,0.00061148,0.17489886,0.00020426711,0.0000706558,0.0002561573,0.0012859772,0.00021870337,0.013732574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993311,0.00015704555,0.00003905554,0.0002092584,0.00013109713,0.00013244539],"domain_scores_gemma":[0.9986304,0.0004483962,0.00020180408,0.00035156342,0.0001761594,0.00019169484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046786756,0.00050030276,0.00041722687,0.0010450383,0.00082377734,0.0013507226,0.00092653354,0.00031755873,0.004209875],"category_scores_gemma":[0.002032008,0.00048535032,0.00059,0.0012109356,0.0011265895,0.0025420068,0.001508626,0.0010370768,0.00042846464],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015748956,0.00004988318,0.0008284401,0.00013228325,0.000026280873,0.00018586578,0.0006459779,0.015410902,0.0065416526,0.9433848,0.0021617687,0.030474517],"study_design_scores_gemma":[0.000031168303,0.00004724896,0.0007769089,0.00003961738,0.000027363576,0.00018836839,0.00021990805,0.03511942,0.0025921909,0.95070356,0.010236134,0.00001801758],"about_ca_topic_score_codex":0.0016096644,"about_ca_topic_score_gemma":0.0020314762,"teacher_disagreement_score":0.004209875,"about_ca_system_score_codex":0.0009565846,"about_ca_system_score_gemma":0.0004008464,"threshold_uncertainty_score":0.014083445},"labels":[],"label_agreement":null},{"id":"W2963525585","doi":"10.1016/j.disc.2018.10.021","title":"Balancedly splittable Hadamard matrices","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Japan Society for the Promotion of Science; Soochow University","keywords":"Mathematics; Hadamard transform; Complex Hadamard matrix; Hadamard product; Combinatorics; Association scheme; Hadamard matrix; Hadamard's inequality; Diagonalizable matrix; Hadamard three-lines theorem; Connection (principal bundle); Discrete mathematics; Eigenvalues and eigenvectors; Symmetric matrix; Geometry; Mathematical analysis","score_opus":0.007210121603247261,"score_gpt":0.21108673985639514,"score_spread":0.20387661825314787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963525585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2036404,0.0007569078,0.70830923,0.0014905885,0.00053643226,0.00012336306,0.0007726489,0.000396744,0.08397375],"genre_scores_gemma":[0.86085725,0.00060558494,0.0994993,0.00070865,0.0002926216,0.00015876103,0.0005117225,0.00009982555,0.037266318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945587,0.00013640018,0.000023203924,0.000120127326,0.00017516286,0.00008921054],"domain_scores_gemma":[0.99881124,0.00035874054,0.00015752573,0.00022408298,0.00033485584,0.00011357997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043955038,0.00067678484,0.0004337152,0.0011373038,0.00071988313,0.0016707168,0.00060950476,0.00089079654,0.011922355],"category_scores_gemma":[0.0022923367,0.00031508194,0.0002372891,0.0010933804,0.0008395731,0.0019069831,0.0007698818,0.001029137,0.0017080609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001982603,0.000045226367,0.00021395138,0.000045296252,0.000017765253,0.00012916677,0.00010314921,0.009695264,0.014274586,0.9523355,0.0031244012,0.019817524],"study_design_scores_gemma":[0.00004924893,0.00008969697,0.00029659495,0.000023951276,0.000012387469,0.00024337349,0.00009725804,0.07248355,0.007831078,0.9102544,0.0085852975,0.00003301089],"about_ca_topic_score_codex":0.0005497437,"about_ca_topic_score_gemma":0.00075979985,"teacher_disagreement_score":0.011922355,"about_ca_system_score_codex":0.00060309115,"about_ca_system_score_gemma":0.00056323124,"threshold_uncertainty_score":0.03988427},"labels":[],"label_agreement":null},{"id":"W2963542394","doi":"10.1016/j.disc.2019.111773","title":"Block-avoiding point sequencings of directed triple systems","year":2019,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Permutation (music); Combinatorics; Mathematics; Block (permutation group theory); Order (exchange); Directed graph; Graph; Transitive relation; Discrete mathematics; Physics","score_opus":0.026001093610206177,"score_gpt":0.2602901764056131,"score_spread":0.23428908279540692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963542394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36386845,0.0002579073,0.6046615,0.00022785737,0.00013621681,0.000121796584,0.00049170747,0.0006327672,0.029601807],"genre_scores_gemma":[0.86993676,0.00031860828,0.107988805,0.00014177745,0.000047507663,0.0001868559,0.0008014633,0.00036624895,0.0202119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931574,0.00014461103,0.000054236792,0.00012560071,0.00022047649,0.00013931094],"domain_scores_gemma":[0.997621,0.0010148064,0.0002579658,0.00034123965,0.00048939674,0.00027566453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005904337,0.00043023727,0.0005546916,0.0016003662,0.0011553939,0.0016031777,0.0007957463,0.00093904376,0.007864226],"category_scores_gemma":[0.0038438728,0.00052686816,0.0006155461,0.0011283057,0.001043988,0.0018951884,0.0015627422,0.0013495224,0.0013716135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013324353,0.000048575832,0.00080929004,0.00008240419,0.000016503958,0.0003271568,0.00033559947,0.020099478,0.007864424,0.94553685,0.0015133695,0.023233118],"study_design_scores_gemma":[0.000021399499,0.000047993006,0.0002464671,0.000030510168,0.000015067345,0.0001782116,0.00015141856,0.10064624,0.004752851,0.8898774,0.0040096524,0.00002281898],"about_ca_topic_score_codex":0.001276857,"about_ca_topic_score_gemma":0.0014168682,"teacher_disagreement_score":0.007864226,"about_ca_system_score_codex":0.00079648016,"about_ca_system_score_gemma":0.00072067487,"threshold_uncertainty_score":0.026308477},"labels":[],"label_agreement":null},{"id":"W2963607496","doi":"10.1016/j.disc.2017.10.007","title":"On the unimodality of independence polynomials of very well-covered graphs","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Unimodality; Mathematics; Combinatorics; Discrete mathematics; Graph; Independent set","score_opus":0.04967600486227844,"score_gpt":0.33161046863166177,"score_spread":0.28193446376938336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963607496","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77280605,0.0014311952,0.16296336,0.0034564245,0.00018840613,0.000053575237,0.0008238904,0.0002715461,0.05800558],"genre_scores_gemma":[0.98241925,0.0010866722,0.007685763,0.00037415253,0.0006578214,0.000054625285,0.00056128873,0.00012499739,0.007035507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847716,0.0004644915,0.000040244664,0.00030113175,0.00037514427,0.00034182201],"domain_scores_gemma":[0.9801404,0.014685169,0.0016671171,0.0008082318,0.0010937012,0.0016053019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020530547,0.0008449898,0.0014285416,0.0034947677,0.0017981302,0.0031782298,0.002225747,0.001154274,0.0078116674],"category_scores_gemma":[0.015220828,0.0010625796,0.0011178661,0.0029345038,0.005148408,0.0065418743,0.0024062777,0.00499648,0.0006670102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015741684,0.000084736705,0.001342408,0.00012368971,0.000035389872,0.00010820422,0.0005515761,0.0076439255,0.0017939924,0.97431153,0.0033422734,0.010504751],"study_design_scores_gemma":[0.000020614181,0.000016840859,0.0011162515,0.00001779993,0.000016880189,0.00011059414,0.000099837845,0.020580731,0.00034682226,0.9768337,0.0008197246,0.000020184183],"about_ca_topic_score_codex":0.0023556275,"about_ca_topic_score_gemma":0.0022800865,"teacher_disagreement_score":0.0078116674,"about_ca_system_score_codex":0.0018946797,"about_ca_system_score_gemma":0.00088053953,"threshold_uncertainty_score":0.026132643},"labels":[],"label_agreement":null},{"id":"W2964123572","doi":"10.1016/j.disc.2019.07.003","title":"On representations of graphs as two-distance sets","year":2019,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Mathematics; Combinatorics; Adjacency matrix; Eigenvalues and eigenvectors; Euclidean geometry; Complement (music); Orthonormal basis; Euclidean distance; Graph; Adjacency list; Simple (philosophy); Matrix (chemical analysis); Discrete mathematics; Geometry","score_opus":0.031216660095504285,"score_gpt":0.35023527059811066,"score_spread":0.3190186105026064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964123572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16878271,0.003053105,0.6909771,0.0045367223,0.00070289616,0.000098178316,0.0005734208,0.00034659565,0.13092926],"genre_scores_gemma":[0.8394496,0.003388629,0.121323936,0.0010620813,0.0007044931,0.00016291584,0.000921289,0.00027621965,0.03271087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990283,0.00039760297,0.000051780873,0.0001562316,0.00025508108,0.00011099714],"domain_scores_gemma":[0.9975272,0.0013119269,0.000269084,0.00037677414,0.00027630499,0.00023871806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001110277,0.0009795709,0.00085504807,0.0028397255,0.0012239434,0.004206328,0.001702918,0.0017945033,0.00753362],"category_scores_gemma":[0.005930976,0.00041406165,0.0010276664,0.0032815682,0.0031949482,0.00771285,0.003012611,0.0033871166,0.0010189619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065306003,0.0000061597416,0.000034089244,0.000012549849,0.0000021656779,0.000010559428,0.00009660051,0.0010011655,0.00008833834,0.9956142,0.0003972654,0.002730364],"study_design_scores_gemma":[0.000003140472,0.000004812418,0.00003633444,0.000009548701,0.0000020351968,0.000018488216,0.000044583994,0.005996278,0.000037233494,0.99251467,0.0013293938,0.00000347935],"about_ca_topic_score_codex":0.0016286046,"about_ca_topic_score_gemma":0.0011474212,"teacher_disagreement_score":0.00753362,"about_ca_system_score_codex":0.001617992,"about_ca_system_score_gemma":0.00041256228,"threshold_uncertainty_score":0.025202453},"labels":[],"label_agreement":null},{"id":"W2964533042","doi":"10.1016/j.disc.2019.06.036","title":"Characterizations of graphs <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e25\" altimg=\"si20.svg\"><mml:mi>G</mml:mi></mml:math> having all <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e30\" altimg=\"si21.svg\"><mml:mrow><mml:mo>[</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>k</mml:mi><mml:mo>]</mml:mo></mml:mrow></mml:math>-factors in <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e44\" altimg=\"si22.svg\"><mml:mrow><mml:mi>k</mml:mi><mml:mi>G</mml:mi></mml:mrow></mml:math>","year":2019,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.02091355520300997,"score_gpt":0.2545854632087166,"score_spread":0.23367190800570664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964533042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09734988,0.0019544242,0.7056601,0.0044747023,0.0004445729,0.00069247733,0.020751318,0.006755465,0.16191712],"genre_scores_gemma":[0.5076132,0.004248764,0.28167018,0.0021121905,0.0008064348,0.0016245772,0.0758499,0.0046221875,0.121452585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976801,0.00045260167,0.00029252443,0.0007972953,0.0005270951,0.00025035453],"domain_scores_gemma":[0.993745,0.0022654443,0.0010334874,0.0010282082,0.0014815873,0.00044620177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010849512,0.0015839881,0.0006530757,0.0052503794,0.0016797284,0.0056879213,0.0015791752,0.0014704157,0.029192902],"category_scores_gemma":[0.006762141,0.00067044154,0.0017958652,0.0049796375,0.0015824023,0.008312837,0.0018657987,0.0018100429,0.009860354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002546113,0.00017011228,0.0030620783,0.0009252268,0.00009521563,0.000671157,0.002490041,0.01312558,0.010669627,0.74977344,0.06769558,0.15106733],"study_design_scores_gemma":[0.00004597047,0.00015070967,0.0034092772,0.00046617805,0.00011434834,0.0013266132,0.0019211984,0.034668945,0.011886758,0.692202,0.2536921,0.000115948416],"about_ca_topic_score_codex":0.0037805012,"about_ca_topic_score_gemma":0.004417124,"teacher_disagreement_score":0.029192902,"about_ca_system_score_codex":0.0021134687,"about_ca_system_score_gemma":0.0011870277,"threshold_uncertainty_score":0.097659945},"labels":[],"label_agreement":null},{"id":"W2979458541","doi":"10.1016/j.disc.2020.111886","title":"Set systems related to a house allocation problem","year":2020,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Research, Development and Innovation Office; Nemzeti Kutatási Fejlesztési és Innovációs Hivatal; Institute for Basic Science; Mount Allison University; Magyar Tudományos Akadémia; Korea Basic Science Institute","keywords":"Injective function; Cardinality (data modeling); Preference; Set (abstract data type); Combinatorics; Pareto principle; Mathematics; Mathematical economics; Revealed preference; Discrete mathematics; Computer science; Mathematical optimization; Statistics; Econometrics","score_opus":0.05044665340150343,"score_gpt":0.3165084038017139,"score_spread":0.26606175040021046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979458541","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49066615,0.0016014477,0.37932438,0.0051647294,0.00036010277,0.00015605801,0.00082067255,0.00018582378,0.1217207],"genre_scores_gemma":[0.9302599,0.00071971706,0.040198736,0.00029037351,0.00031352043,0.00018193376,0.00041944667,0.000081463564,0.027534975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891114,0.00044729162,0.000056253888,0.00020649197,0.00023490611,0.00014389846],"domain_scores_gemma":[0.9963658,0.0022936908,0.000470392,0.00023676603,0.00029229678,0.00034112294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011080471,0.0005448971,0.0012249314,0.0017813364,0.0024273056,0.0045915945,0.0018883941,0.0029183978,0.013080902],"category_scores_gemma":[0.005766509,0.00062359276,0.0010371306,0.0027750283,0.0027317659,0.005883774,0.0027800591,0.002664576,0.00055866095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000133371705,0.000020393878,0.0001230077,0.00002199347,0.0000073469505,0.000047792317,0.00008021359,0.007545926,0.00019742601,0.98952764,0.0007615052,0.0016534377],"study_design_scores_gemma":[0.000012115179,0.0000049360397,0.000078507896,0.0000064807573,0.00000408229,0.000038339313,0.00007172248,0.032981873,0.000119335695,0.9657449,0.0009318457,0.000005876665],"about_ca_topic_score_codex":0.0022954359,"about_ca_topic_score_gemma":0.0018832119,"teacher_disagreement_score":0.013080902,"about_ca_system_score_codex":0.0023507022,"about_ca_system_score_gemma":0.0009343592,"threshold_uncertainty_score":0.043759942},"labels":[],"label_agreement":null},{"id":"W2982273608","doi":"10.1016/j.disc.2019.111784","title":"Divisible design Cayley digraphs","year":2019,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Hrvatska Zaklada za Znanost; University of Lethbridge","keywords":"Cayley graph; Combinatorics; Digraph; Cayley transform; Characterization (materials science); Mathematics; Discrete mathematics; Physics; Voltage graph; Graph","score_opus":0.022734619903903488,"score_gpt":0.22585510259647767,"score_spread":0.20312048269257418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982273608","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19526917,0.00081657263,0.6688158,0.0011208574,0.00031094794,0.00015126338,0.0006749229,0.00046209406,0.13237837],"genre_scores_gemma":[0.85870785,0.00078679784,0.08324683,0.00068160094,0.00015947981,0.00016176955,0.00047618186,0.00007654421,0.0557029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963856,0.00012111,0.000014175574,0.00009825967,0.000083833496,0.000043985197],"domain_scores_gemma":[0.99897325,0.0004272508,0.00010308411,0.00018271878,0.00020406861,0.00010949475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002983456,0.0004813369,0.0003217916,0.0007167807,0.00055620127,0.0011222173,0.00056763913,0.0006528321,0.012588872],"category_scores_gemma":[0.0014934451,0.00028026843,0.00021905972,0.00065582665,0.00048393,0.0010704023,0.00062120927,0.0009948924,0.0011843989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053678406,0.00004561157,0.00033901638,0.00006549889,0.000014340291,0.000079801546,0.00006457739,0.00792608,0.003427489,0.958516,0.0028614986,0.026606519],"study_design_scores_gemma":[0.00005036093,0.000080852566,0.0003573138,0.000030806284,0.000017716156,0.00019526105,0.000056471,0.040856123,0.0028250976,0.93256915,0.022943772,0.000017016577],"about_ca_topic_score_codex":0.0004148787,"about_ca_topic_score_gemma":0.0008451826,"teacher_disagreement_score":0.012588872,"about_ca_system_score_codex":0.00079441204,"about_ca_system_score_gemma":0.00045033876,"threshold_uncertainty_score":0.0421139},"labels":[],"label_agreement":null},{"id":"W3005139504","doi":"10.1016/j.disc.2020.111837","title":"Disjoint cycles and chorded cycles in a graph with given minimum degree","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Science Foundation","keywords":"Mathematics; Combinatorics; Degree (music); Disjoint sets; Graph; Discrete mathematics","score_opus":0.02041939034260443,"score_gpt":0.20803890247721818,"score_spread":0.18761951213461375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005139504","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82838756,0.0009094209,0.1452254,0.0011069683,0.00011338489,0.00014246411,0.0013645027,0.00018310628,0.022567216],"genre_scores_gemma":[0.9307084,0.00071361096,0.06022308,0.00013812247,0.00006997805,0.00013212724,0.0006418097,0.00006562179,0.0073072542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995017,0.000091979746,0.000033657805,0.00016135452,0.000113063135,0.00009833658],"domain_scores_gemma":[0.9976453,0.0012063065,0.00038480494,0.00018870906,0.00027681276,0.00029796426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003206903,0.0005479559,0.00076896383,0.0016270129,0.0012935571,0.0022566358,0.0011657114,0.0011356403,0.0036623667],"category_scores_gemma":[0.003583294,0.0004425417,0.0004983271,0.0022396648,0.0010441467,0.0025738727,0.0011149268,0.0008302887,0.0002785632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008343739,0.00013521279,0.0045981905,0.00055415137,0.000108878965,0.00070846,0.0012166053,0.05659667,0.018212825,0.8676452,0.0033190697,0.046070408],"study_design_scores_gemma":[0.0001466553,0.00014967594,0.0023486898,0.000108033346,0.00008326058,0.00094239815,0.0008478818,0.124221355,0.007853984,0.8528914,0.010359547,0.00004719348],"about_ca_topic_score_codex":0.002040773,"about_ca_topic_score_gemma":0.0026916375,"teacher_disagreement_score":0.0036623667,"about_ca_system_score_codex":0.00127628,"about_ca_system_score_gemma":0.00085632724,"threshold_uncertainty_score":0.012251854},"labels":[],"label_agreement":null},{"id":"W3012606778","doi":"10.1016/j.disc.2021.112368","title":"An efficiently generated family of binary de Bruijn sequences","year":2021,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Nanyang Technological University","keywords":"De Bruijn sequence; Successor cardinal; Binary number; Shift register; Class (philosophy); Combinatorics; Discrete mathematics; Mathematics; Function (biology); State space; Computer science; Pseudorandom binary sequence; State (computer science); Sequence (biology); Algorithm; Arithmetic; Artificial intelligence; Statistics; Telecommunications","score_opus":0.0204393012070907,"score_gpt":0.2677536446587591,"score_spread":0.24731434345166842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012606778","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4894001,0.0023112549,0.38144913,0.0021084875,0.00059984677,0.00020848324,0.0013962672,0.0012635449,0.12126289],"genre_scores_gemma":[0.92248225,0.0006714936,0.044831175,0.00032957818,0.00013725426,0.000186946,0.00067169656,0.00026049558,0.030429147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989588,0.00025228562,0.00005358771,0.00022199759,0.00035079505,0.00016249034],"domain_scores_gemma":[0.9978097,0.0012600756,0.0001961788,0.00032167384,0.0002516673,0.00016072553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008048406,0.00063168065,0.0005013862,0.0009857528,0.0011508316,0.0017690867,0.0006001896,0.0007645182,0.0059182406],"category_scores_gemma":[0.0035021636,0.00043840485,0.00042837602,0.00092449697,0.00082469196,0.0016169293,0.0012224534,0.0013805085,0.0012295663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035526624,0.00008832588,0.0007228627,0.00016313276,0.000030269795,0.00071047724,0.00034450632,0.011875804,0.017775474,0.92166424,0.004309026,0.041960597],"study_design_scores_gemma":[0.00014829657,0.00016808388,0.00078208576,0.00013284398,0.00004608011,0.0021132876,0.00012124433,0.07321101,0.030313771,0.84726995,0.045604266,0.00008907537],"about_ca_topic_score_codex":0.0002338857,"about_ca_topic_score_gemma":0.00026692974,"teacher_disagreement_score":0.0059182406,"about_ca_system_score_codex":0.0008519601,"about_ca_system_score_gemma":0.0006997802,"threshold_uncertainty_score":0.019798458},"labels":[],"label_agreement":null},{"id":"W3016468461","doi":"10.1016/j.disc.2021.112309","title":"Reflexive coloring complexes for 3-edge-colorings of cubic graphs","year":2021,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Canada Excellence Research Chairs, Government of Canada","keywords":"Combinatorics; Graph coloring; Edge coloring; Mathematics; Cubic graph; Complete coloring; Discrete mathematics; Graph; 1-planar graph; Line graph; Graph power; Voltage graph","score_opus":0.07047065590626489,"score_gpt":0.3604143091718357,"score_spread":0.2899436532655708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016468461","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6583999,0.00087261276,0.17618416,0.0016322327,0.0006702889,0.00021098912,0.0008057022,0.00076410675,0.16045997],"genre_scores_gemma":[0.92766017,0.00046236507,0.032825585,0.00046042327,0.00019247261,0.00016286685,0.0005511722,0.00044265384,0.037242398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986457,0.00028175063,0.00009134211,0.00028675632,0.00038811346,0.00030632285],"domain_scores_gemma":[0.99623626,0.0015667995,0.00054333307,0.000378894,0.00050318526,0.00077149586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089401327,0.0008683355,0.0007928262,0.002176025,0.0023497238,0.0057107867,0.0019301348,0.0013272106,0.015471715],"category_scores_gemma":[0.003366419,0.0010307609,0.0011715156,0.0014954958,0.002417841,0.0033091372,0.0025554614,0.0033179973,0.0016249972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000701292,0.00004870112,0.00032730124,0.000047670645,0.000010325883,0.00014995322,0.00065123074,0.0013437086,0.0024243356,0.987176,0.0020105848,0.005740042],"study_design_scores_gemma":[0.000050260263,0.000026385313,0.0005274381,0.000026785565,0.000015170838,0.00022830743,0.00038028762,0.010039498,0.0025020787,0.9770891,0.009081162,0.00003355865],"about_ca_topic_score_codex":0.0038813483,"about_ca_topic_score_gemma":0.0041002505,"teacher_disagreement_score":0.015471715,"about_ca_system_score_codex":0.002773254,"about_ca_system_score_gemma":0.0009309496,"threshold_uncertainty_score":0.05175811},"labels":[],"label_agreement":null},{"id":"W3023517918","doi":"10.1016/j.disc.2021.112780","title":"Investigating the discrepancy property of de Bruijn sequences","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"De Bruijn sequence; Substring; Mathematics; Combinatorics; String (physics); Upper and lower bounds; Binary number; Discrete mathematics; De Bruijn graph; Simple (philosophy); Data structure; Arithmetic; Computer science; Mathematical analysis","score_opus":0.02649436287000227,"score_gpt":0.25102502956612394,"score_spread":0.22453066669612168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023517918","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8987263,0.00068458676,0.06303953,0.0018171004,0.00014360945,0.000024579484,0.00013248532,0.00008940756,0.035342548],"genre_scores_gemma":[0.9867395,0.00023756242,0.008956275,0.00012434229,0.00008149894,0.00001640973,0.00014473191,0.000049687205,0.003649916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993005,0.00024153278,0.000028592342,0.00010159357,0.00021351,0.00011429762],"domain_scores_gemma":[0.9902862,0.007309589,0.0008457744,0.0006493559,0.000545681,0.00036354005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014960513,0.00034441767,0.000544324,0.0011388551,0.0009822925,0.0015854464,0.0008153687,0.0012730265,0.0031298911],"category_scores_gemma":[0.015188392,0.00043084103,0.00027691142,0.00088575634,0.0018105686,0.003994945,0.0013656261,0.0019320217,0.00031131844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014948461,0.0000517533,0.0018617734,0.00005792989,0.000007965166,0.00014837098,0.0002634543,0.01806162,0.004920644,0.9683021,0.00078233035,0.0053926897],"study_design_scores_gemma":[0.00003252529,0.00005830176,0.00068032887,0.000027978107,0.000005244592,0.00022841828,0.00021935871,0.123232864,0.0034934403,0.86970603,0.0022933888,0.000022139873],"about_ca_topic_score_codex":0.00082022825,"about_ca_topic_score_gemma":0.0005995141,"teacher_disagreement_score":0.0031298911,"about_ca_system_score_codex":0.00071492343,"about_ca_system_score_gemma":0.0005735456,"threshold_uncertainty_score":0.010470569},"labels":[],"label_agreement":null},{"id":"W3025609620","doi":"10.1016/j.disc.2020.111958","title":"Sum-free sets generated by the period-<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e22\" altimg=\"si8.svg\"><mml:mi>k</mml:mi></mml:math>-folding sequences and some Sturmian sequences","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"China Scholarship Council; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Sequence (biology); Generalization; Period (music); Folding (DSP implementation); Set (abstract data type); Discrete mathematics; Algorithm; Computer science; Mathematical analysis","score_opus":0.022021716403563683,"score_gpt":0.24535637632110602,"score_spread":0.22333465991754234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3025609620","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42260003,0.0011187239,0.39805758,0.0011005417,0.0006585893,0.00011317539,0.0019879465,0.0010632757,0.1733002],"genre_scores_gemma":[0.8848902,0.0003748413,0.047746908,0.0003049741,0.00021669998,0.00022605444,0.0016688913,0.0003218497,0.064249545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994343,0.000121925696,0.00005042229,0.00014621082,0.00014510677,0.000102066064],"domain_scores_gemma":[0.99878746,0.0004888635,0.000120678895,0.00015871537,0.00029037485,0.00015383308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006392517,0.0005114051,0.00042255843,0.001560725,0.0015647992,0.0019549532,0.0007242133,0.00048556665,0.012147576],"category_scores_gemma":[0.0018215352,0.00031828313,0.0007403684,0.00082415616,0.0012817774,0.0020718982,0.0013253613,0.000828604,0.0023661316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000918955,0.000022113994,0.0005133919,0.00007317443,0.000017515278,0.00023225683,0.0004891836,0.0011019602,0.0041555353,0.97694457,0.0023499874,0.014008423],"study_design_scores_gemma":[0.000022608765,0.000036316487,0.00072587107,0.000031936877,0.000019948911,0.00046050263,0.00020546006,0.006523349,0.0062934095,0.9732238,0.012428498,0.000028368106],"about_ca_topic_score_codex":0.00030895366,"about_ca_topic_score_gemma":0.0004895553,"teacher_disagreement_score":0.012147576,"about_ca_system_score_codex":0.00077485404,"about_ca_system_score_gemma":0.00052377145,"threshold_uncertainty_score":0.040637672},"labels":[],"label_agreement":null},{"id":"W3037080634","doi":"10.1016/j.disc.2020.112022","title":"Efficient universal cycle constructions for weak orders","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Science and ICT, South Korea","keywords":"Mathematics; Transitive relation; Combinatorics; Rank (graph theory); Order (exchange); Construct (python library); Discrete mathematics; Event (particle physics); Computer science","score_opus":0.017558851393745693,"score_gpt":0.24588546281322898,"score_spread":0.2283266114194833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037080634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15932462,0.001366219,0.78214633,0.0016881642,0.00027247824,0.00028550706,0.0009613514,0.0021068451,0.051848408],"genre_scores_gemma":[0.7620946,0.0012646494,0.20922573,0.0005696059,0.00017826601,0.0004386061,0.0014917941,0.0012001023,0.023536606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986405,0.0002723462,0.00009809588,0.00019845791,0.00048283837,0.00030776425],"domain_scores_gemma":[0.99683565,0.0013354394,0.00013126306,0.0010897466,0.00039448324,0.00021334908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012304866,0.00089533284,0.0010743933,0.001872494,0.0017086425,0.003159387,0.0016022215,0.0009852026,0.009592341],"category_scores_gemma":[0.005458089,0.0007010183,0.0011271101,0.0027146898,0.0022215713,0.0075688125,0.005477573,0.002871934,0.0014356825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013624199,0.000051418927,0.00031429974,0.0001312908,0.000011936739,0.000041330455,0.0002859015,0.0041409424,0.0024659615,0.94229627,0.0035543388,0.046569966],"study_design_scores_gemma":[0.000022391983,0.000031065105,0.00009276246,0.00005115243,0.000020336787,0.000038766222,0.00011097767,0.01612475,0.004887113,0.96784556,0.010755684,0.000019405925],"about_ca_topic_score_codex":0.0009189261,"about_ca_topic_score_gemma":0.0017947074,"teacher_disagreement_score":0.009592341,"about_ca_system_score_codex":0.001850567,"about_ca_system_score_gemma":0.0012547163,"threshold_uncertainty_score":0.03208965},"labels":[],"label_agreement":null},{"id":"W3038218193","doi":"10.1016/j.disc.2020.112043","title":"Counting independent sets in Riordan graphs","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"National Research Foundation of Korea; Ministry of Education; Ministry of Science, ICT and Future Planning; National Research Foundation","keywords":"Mathematics; Toeplitz matrix; Combinatorics; Enumeration; Discrete mathematics; Indifference graph; Pathwidth; 1-planar graph; Generalization; Graph; Chordal graph; Line graph","score_opus":0.0475157165945729,"score_gpt":0.3164951199427309,"score_spread":0.268979403348158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3038218193","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5900363,0.002106057,0.23679538,0.0036288486,0.00039743382,0.00017311425,0.0006507092,0.00052658655,0.16568561],"genre_scores_gemma":[0.90958345,0.0010597522,0.05986966,0.0007720913,0.00040182885,0.00020491345,0.0007120128,0.0002460615,0.027150156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789006,0.00076821866,0.0001013759,0.000384845,0.0005835728,0.00027194616],"domain_scores_gemma":[0.99083745,0.0060520605,0.0009424905,0.0008059957,0.00075303303,0.0006090326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024617666,0.0009470504,0.0015624958,0.0050595566,0.0029052873,0.0052816696,0.004783873,0.0023733466,0.0058181365],"category_scores_gemma":[0.011192302,0.0011849891,0.0014083016,0.0036750522,0.0034680432,0.007602023,0.0026597728,0.0031417666,0.0006527493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050311643,0.000029135477,0.00055702025,0.00006784436,0.000019697456,0.000056392168,0.00019889684,0.0022502807,0.000563887,0.9905757,0.0013722313,0.004258497],"study_design_scores_gemma":[0.000015552932,0.00000821355,0.00037490128,0.000026263815,0.000024690506,0.00008148369,0.00008118096,0.01819844,0.00043969313,0.9790371,0.0016998677,0.000012705779],"about_ca_topic_score_codex":0.002800425,"about_ca_topic_score_gemma":0.004596435,"teacher_disagreement_score":0.0058181365,"about_ca_system_score_codex":0.0029358813,"about_ca_system_score_gemma":0.0009511277,"threshold_uncertainty_score":0.021301448},"labels":[],"label_agreement":null},{"id":"W3041462746","doi":"10.1016/j.disc.2022.113229","title":"Atomic weights and the combinatorial game of bipass","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Indian Institute of Technology Bombay; Killam Trusts","keywords":"Mathematics; Integer (computer science); Combinatorics; Surjective function; Function (biology); Combinatorial game theory; Simple (philosophy); STRIPS; Discrete mathematics; Game theory; Sequential game; Mathematical economics; Computer science; Algorithm","score_opus":0.01681235723702562,"score_gpt":0.2571901889042398,"score_spread":0.24037783166721416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041462746","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31663403,0.0008665895,0.25708586,0.0043872516,0.0005529937,0.0001784249,0.00036820638,0.00023243422,0.41969427],"genre_scores_gemma":[0.93537086,0.00038053855,0.026604392,0.00030775188,0.00012617026,0.00016154605,0.00021316638,0.00008745444,0.036748014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987218,0.00055860355,0.000063197855,0.00013653639,0.00030534365,0.00021450978],"domain_scores_gemma":[0.9984091,0.00077073066,0.00013447674,0.00017097036,0.00019158475,0.0003230772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009674338,0.00068331516,0.00077594275,0.0011216582,0.0024410703,0.004181241,0.0016688529,0.0016453828,0.016610024],"category_scores_gemma":[0.0052808304,0.0005388622,0.0005962626,0.0014777045,0.0039416854,0.0052382876,0.0027107538,0.0023943037,0.0012782138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026293392,0.000010684279,0.00008251358,0.000015395326,0.0000049902815,0.000020887863,0.0000813223,0.0012362256,0.00015613576,0.99551755,0.00069033273,0.0021576511],"study_design_scores_gemma":[0.000009501233,0.0000058452,0.00005321915,0.0000049850005,0.0000033613826,0.000016545622,0.00006525921,0.003445871,0.00005855743,0.9942061,0.0021265028,0.0000042506936],"about_ca_topic_score_codex":0.0031421965,"about_ca_topic_score_gemma":0.0026432388,"teacher_disagreement_score":0.016610024,"about_ca_system_score_codex":0.0014671562,"about_ca_system_score_gemma":0.00086925185,"threshold_uncertainty_score":0.055566072},"labels":[],"label_agreement":null},{"id":"W3047886978","doi":"10.1016/j.disc.2021.112402","title":"The threshold strong dimension of a graph","year":2021,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; University of Minnesota","keywords":"Combinatorics; Mathematics; Discrete mathematics; Vertex (graph theory); Graph","score_opus":0.025044511893581728,"score_gpt":0.26067824739411466,"score_spread":0.23563373550053293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047886978","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7390609,0.0027613153,0.18918374,0.013797697,0.00043894077,0.00006146471,0.0016704333,0.00029576445,0.052729774],"genre_scores_gemma":[0.98038864,0.000783855,0.0129423505,0.00048279727,0.00049806637,0.000082319704,0.0003269199,0.00006964829,0.004425456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984907,0.0005293461,0.000069173504,0.00036093968,0.0003143878,0.00023555142],"domain_scores_gemma":[0.9870307,0.008699887,0.0011279054,0.0010394597,0.0006234177,0.0014786076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019480046,0.0006972177,0.0012610225,0.0031098037,0.0019366293,0.0062196474,0.00173508,0.001960396,0.0054234443],"category_scores_gemma":[0.010649295,0.0008283368,0.00075127016,0.002543151,0.006041131,0.012289106,0.0036264667,0.0041453107,0.0003642522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068683505,0.000018706069,0.00085826847,0.000059611953,0.000013817164,0.00002497488,0.00015881215,0.0021497244,0.0008191779,0.99133366,0.0016416537,0.002852938],"study_design_scores_gemma":[0.000012880608,0.000009172493,0.00046205005,0.000016284665,0.000010506461,0.00006098372,0.00007505548,0.01427693,0.00038317151,0.98356646,0.0011157596,0.000010882949],"about_ca_topic_score_codex":0.00073076616,"about_ca_topic_score_gemma":0.0005949036,"teacher_disagreement_score":0.0062196474,"about_ca_system_score_codex":0.0022780849,"about_ca_system_score_gemma":0.00075672485,"threshold_uncertainty_score":0.018143296},"labels":[],"label_agreement":null},{"id":"W3080338863","doi":"10.1016/j.disc.2020.112122","title":"Towards generalizing MacDougall’s conjecture on vertex-magic total labelings","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Norwich University","keywords":"Combinatorics; Conjecture; Mathematics; MAGIC (telescope); Discrete mathematics; Graph; Regular graph; Vertex (graph theory); Degree (music); Line graph; Graph power","score_opus":0.027085922607382854,"score_gpt":0.24275146228219907,"score_spread":0.21566553967481622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080338863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24643357,0.0025584488,0.42932713,0.045128662,0.0018361406,0.00020713624,0.0018956686,0.0021618493,0.2704515],"genre_scores_gemma":[0.8439064,0.0018676841,0.10566223,0.009680841,0.0017557351,0.00034358766,0.0021408938,0.0007816101,0.033861052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976179,0.00068091234,0.000082770115,0.00077716965,0.000481129,0.00036006057],"domain_scores_gemma":[0.98512244,0.009473246,0.0005796111,0.0028524154,0.0012033589,0.0007688594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003707297,0.0014279323,0.0023664515,0.003045522,0.0038670097,0.0058184313,0.0039184624,0.004166462,0.014255698],"category_scores_gemma":[0.017716365,0.0014083526,0.002082603,0.0044067083,0.0069395686,0.019648716,0.0068187057,0.009677032,0.0018030892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006199045,0.00002817669,0.0003403196,0.00007544249,0.000009559183,0.000025436831,0.00020872238,0.0019628224,0.00028821683,0.9861973,0.005608033,0.005193985],"study_design_scores_gemma":[0.000019178418,0.0000053784,0.00008511683,0.000014625236,0.000007353147,0.000017723863,0.00005249104,0.004789683,0.00017375677,0.9915605,0.0032658486,0.000008160815],"about_ca_topic_score_codex":0.0057110228,"about_ca_topic_score_gemma":0.0072121304,"teacher_disagreement_score":0.014255698,"about_ca_system_score_codex":0.0044088513,"about_ca_system_score_gemma":0.0017344756,"threshold_uncertainty_score":0.047690094},"labels":[],"label_agreement":null},{"id":"W3082308132","doi":"10.1016/j.disc.2020.112113","title":"A note on purely imaginary independence roots","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; The Imaginary; Independence (probability theory); Independence number; Combinatorics; Discrete mathematics; Graph; Induced subgraph; Cardinality (data modeling); Computer science","score_opus":0.04075105343456869,"score_gpt":0.32541821535265825,"score_spread":0.28466716191808955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082308132","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026822465,0.005158663,0.073179565,0.04002861,0.01376491,0.000029814846,0.00021831894,0.00030292768,0.8404947],"genre_scores_gemma":[0.6310372,0.0077226995,0.03234311,0.011658783,0.021587817,0.00009875444,0.0002855345,0.0008722945,0.29439384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992623,0.00015192962,0.000025414236,0.0001492917,0.00032172396,0.0000894176],"domain_scores_gemma":[0.99740404,0.001636655,0.00012910886,0.00040614186,0.00024970254,0.00017435807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008447393,0.00089596084,0.0007991452,0.0013520154,0.0025724508,0.0029368878,0.0018064084,0.0020896362,0.017806858],"category_scores_gemma":[0.005391915,0.00036981344,0.0005833705,0.0012678197,0.005201992,0.007436474,0.0032046,0.00845225,0.0036614516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000123382115,0.000007011354,0.000032030915,0.000028955768,0.0000022807035,0.00008567121,0.00008664445,0.00011241513,0.00028466928,0.9851777,0.010504767,0.0036655155],"study_design_scores_gemma":[0.0000061755154,0.000006016247,0.000099528625,0.000017351587,0.0000035781452,0.00019436295,0.000030442152,0.00037421891,0.00022971963,0.9653135,0.03371602,0.000009161415],"about_ca_topic_score_codex":0.0004992865,"about_ca_topic_score_gemma":0.00071482325,"teacher_disagreement_score":0.017806858,"about_ca_system_score_codex":0.0009963196,"about_ca_system_score_gemma":0.00051855156,"threshold_uncertainty_score":0.059569895},"labels":[],"label_agreement":null},{"id":"W3082929499","doi":"10.1016/j.disc.2020.112123","title":"Antimagic orientations of graphs with large maximum degree","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"National Science Foundation","keywords":"Combinatorics; Mathematics; Bijection; Conjecture; Vertex (graph theory); Bipartite graph; Graph; Digraph; Degree (music); Edge-graceful labeling; Complete bipartite graph; Orientation (vector space); Discrete mathematics; Line graph; Graph power; Geometry","score_opus":0.031605313835322016,"score_gpt":0.24652833615189235,"score_spread":0.21492302231657034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082929499","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8718213,0.00084692053,0.0892204,0.002316885,0.00013843668,0.00007941603,0.00097019435,0.00028704418,0.03431941],"genre_scores_gemma":[0.9516119,0.00083232584,0.03761873,0.00036339348,0.00016564493,0.00011115616,0.0011212208,0.0001983051,0.007977445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931514,0.00018962038,0.000041801308,0.00016520667,0.00013004421,0.00015815809],"domain_scores_gemma":[0.9922255,0.004371168,0.001017142,0.00065672374,0.0005227992,0.0012066287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078613544,0.00071063783,0.0010090495,0.0023549353,0.0026198681,0.004985438,0.0014565797,0.00193559,0.0053832578],"category_scores_gemma":[0.0062954007,0.0013308586,0.0007796309,0.0024589216,0.0022456432,0.0054160594,0.0023139822,0.0025903462,0.00083460775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034290837,0.0001298585,0.0036496334,0.00018081172,0.000028158642,0.0002185697,0.0006937795,0.009182784,0.006281946,0.95740354,0.004825429,0.017062645],"study_design_scores_gemma":[0.00004485867,0.00002122106,0.0012481753,0.000028348592,0.000022551345,0.00013478236,0.00042836543,0.016237216,0.0017096397,0.9774825,0.0026263744,0.000016045788],"about_ca_topic_score_codex":0.0020388674,"about_ca_topic_score_gemma":0.0037715253,"teacher_disagreement_score":0.0053832578,"about_ca_system_score_codex":0.0019098422,"about_ca_system_score_gemma":0.00085925666,"threshold_uncertainty_score":0.018008769},"labels":[],"label_agreement":null},{"id":"W3087847018","doi":"10.1016/j.disc.2020.112167","title":"Graded alphabets, circular codes, free Lie algebras and comma-free codes","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Generalization; Mathematical proof; Embedding; Characterization (materials science); Degree (music); Discrete mathematics; Combinatorics; Code (set theory); Pure mathematics; Mathematical analysis; Geometry","score_opus":0.021235000057293535,"score_gpt":0.2294300444318054,"score_spread":0.20819504437451186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3087847018","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5324329,0.0054838923,0.2938351,0.0041147186,0.0010347035,0.00010277564,0.001206648,0.0008397856,0.16094944],"genre_scores_gemma":[0.9506124,0.0012090129,0.017173994,0.00053237856,0.00048565996,0.0000766659,0.0004902878,0.00011007982,0.029309446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990386,0.000201205,0.0000693073,0.00019860332,0.00028985264,0.00020242695],"domain_scores_gemma":[0.9964431,0.0015469525,0.00060730975,0.00043044463,0.0004651332,0.00050693826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007721448,0.0004986107,0.00072067487,0.0019754092,0.0022383812,0.003499502,0.00092448684,0.0012339072,0.006503274],"category_scores_gemma":[0.0033375814,0.0002626682,0.0005180005,0.0022508842,0.004134763,0.0034600482,0.0018083458,0.0016929972,0.0013504976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024474211,0.000009324786,0.00013128361,0.000021277701,0.0000026367366,0.00003857869,0.00014664879,0.00050148455,0.0004059554,0.9953833,0.00052760873,0.0028073513],"study_design_scores_gemma":[0.0000059081945,0.000005768569,0.00007755388,0.000008208084,0.000002939101,0.00003458954,0.0000518134,0.0014512787,0.00031114943,0.9960549,0.001986818,0.000009068701],"about_ca_topic_score_codex":0.0025091744,"about_ca_topic_score_gemma":0.0017298327,"teacher_disagreement_score":0.006503274,"about_ca_system_score_codex":0.0013224089,"about_ca_system_score_gemma":0.0011079388,"threshold_uncertainty_score":0.021755636},"labels":[],"label_agreement":null},{"id":"W3089503945","doi":"10.1016/j.disc.2020.112153","title":"A universal partition result for infinite homogeneous <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e22\" altimg=\"si24.svg\"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math>-free and related graphs","year":2020,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Horizon 2020; European Research Council; Natural Sciences and Engineering Research Council of Canada; Nemzeti Kutatási Fejlesztési és Innovációs Hivatal; Austrian Science Fund; Pacific Institute for the Mathematical Sciences","keywords":"Mathematics; Combinatorics; Partition (number theory); Conjecture; Bipartite graph; Ramsey's theorem; Discrete mathematics; Graph","score_opus":0.020341867125559226,"score_gpt":0.24270227973976274,"score_spread":0.22236041261420353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089503945","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34996912,0.0044663334,0.24619491,0.003501619,0.0005156319,0.000065372384,0.00091548555,0.00079148624,0.39358014],"genre_scores_gemma":[0.9421119,0.0011785239,0.012662836,0.0007889461,0.0003584997,0.00007342843,0.0006217701,0.00049372396,0.041710358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993556,0.00012315292,0.000024627128,0.00016012003,0.0001432748,0.00019314954],"domain_scores_gemma":[0.9972366,0.0016364934,0.00018762758,0.0003272695,0.00029073993,0.0003211995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009929915,0.0007383652,0.00090722635,0.0021011753,0.0025787791,0.002855418,0.0015496425,0.00075873255,0.011300454],"category_scores_gemma":[0.0037248076,0.0004681955,0.001393931,0.0016356846,0.004353618,0.0074500223,0.0034911246,0.0024885174,0.0014825199],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022334505,0.000011223706,0.0001630661,0.00005218859,0.000007812621,0.00003993706,0.00022766794,0.00070145994,0.00026529722,0.99415356,0.0018722643,0.0024831176],"study_design_scores_gemma":[0.000010141508,0.000008119994,0.00016414303,0.000020176261,0.000016931821,0.000052419655,0.00009619518,0.0025906365,0.00043058294,0.9930803,0.0035221316,0.000008034684],"about_ca_topic_score_codex":0.0035320492,"about_ca_topic_score_gemma":0.0035696304,"teacher_disagreement_score":0.011300454,"about_ca_system_score_codex":0.0028042346,"about_ca_system_score_gemma":0.00090769277,"threshold_uncertainty_score":0.03780377},"labels":[],"label_agreement":null},{"id":"W3094133489","doi":"10.1016/j.disc.2022.112971","title":"Laplacian pretty good fractional revival","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; York University","funders":"Natural Sciences and Engineering Research Council of Canada; Fields Institute for Research in Mathematical Sciences","keywords":"Mathematics; Laplace operator; Hamiltonian (control theory); Fractional Laplacian; Laplacian matrix; Quantum; Combinatorics; Discrete mathematics; Mathematical analysis; Quantum mechanics; Physics; Mathematical optimization","score_opus":0.010851490317494947,"score_gpt":0.24079228523005067,"score_spread":0.22994079491255573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094133489","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15433678,0.0017257829,0.07425896,0.02376738,0.005482471,0.00010820389,0.00045255566,0.002096742,0.73777115],"genre_scores_gemma":[0.85432667,0.00080409506,0.013575396,0.004834323,0.002023771,0.00011171437,0.00021991455,0.00079282996,0.1233113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994517,0.00010578059,0.000019061426,0.0000848052,0.00021038308,0.00012819144],"domain_scores_gemma":[0.99880314,0.00031167723,0.00006027221,0.00040360578,0.00020131399,0.00021998648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080715626,0.0006317951,0.001119575,0.0013709919,0.0029026554,0.0030293697,0.0011361901,0.002205815,0.03036288],"category_scores_gemma":[0.0049686343,0.00033063686,0.00068224216,0.00063142664,0.004131038,0.0058495393,0.002749521,0.0034463627,0.0024110933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002155714,0.0000074152435,0.000016854794,0.000017583974,0.000003203773,0.000018350576,0.00004656355,0.00017955642,0.000374814,0.99475807,0.002878481,0.0016774721],"study_design_scores_gemma":[0.000013240015,0.000008856652,0.00004138493,0.0000078607745,0.000003127626,0.000053923595,0.00003141058,0.0014031996,0.0003929799,0.9928678,0.005167885,0.000008280065],"about_ca_topic_score_codex":0.00066709734,"about_ca_topic_score_gemma":0.00066275586,"teacher_disagreement_score":0.03036288,"about_ca_system_score_codex":0.0014074314,"about_ca_system_score_gemma":0.00073806837,"threshold_uncertainty_score":0.101573944},"labels":[],"label_agreement":null},{"id":"W3108030130","doi":"10.1016/j.disc.2022.112883","title":"Broadcasting on paths and cycles","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Broadcasting (networking); Mathematics; Combinatorics; Graph; Discrete mathematics; Computer science; Computer network","score_opus":0.028254784988091426,"score_gpt":0.2694434600879379,"score_spread":0.24118867509984648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108030130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33782664,0.009123698,0.41683054,0.010009304,0.000610999,0.00027136496,0.0014498451,0.00057806284,0.22329949],"genre_scores_gemma":[0.81680286,0.00881412,0.06774765,0.0011069018,0.0007073616,0.00039947528,0.0009144909,0.00044113214,0.10306598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927264,0.00026954152,0.000025205207,0.0001362665,0.00014465555,0.00015166425],"domain_scores_gemma":[0.99414897,0.004331981,0.0004220648,0.00036269653,0.00034023385,0.00039406924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077553437,0.0007488785,0.0013339556,0.0019063232,0.0017181655,0.002949002,0.0014991916,0.0018607324,0.014430508],"category_scores_gemma":[0.011145601,0.00074610894,0.00075528864,0.0035952611,0.0026910538,0.005076026,0.0023861092,0.00269963,0.00088947086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006248061,0.000016418606,0.00013985047,0.00006797047,0.000011036942,0.000042679163,0.00015971942,0.012790697,0.00028181708,0.9714786,0.0037944017,0.011154319],"study_design_scores_gemma":[0.00001802395,0.000010547491,0.00007272343,0.00001971089,0.000008798851,0.000032584318,0.000050675444,0.018991338,0.000117999014,0.97613186,0.004540127,0.0000054483257],"about_ca_topic_score_codex":0.006656863,"about_ca_topic_score_gemma":0.004321726,"teacher_disagreement_score":0.014430508,"about_ca_system_score_codex":0.0027657633,"about_ca_system_score_gemma":0.0014713536,"threshold_uncertainty_score":0.048274815},"labels":[],"label_agreement":null},{"id":"W3122005880","doi":"10.1016/j.disc.2023.113537","title":"Using edge cuts to find Euler tours and Euler families in hypergraphs","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Mathematics; Euler's formula; Traverse; Enhanced Data Rates for GSM Evolution; Combinatorics; Euler characteristic; Discrete mathematics; Computer science; Mathematical analysis; Artificial intelligence","score_opus":0.03766042132327078,"score_gpt":0.2887181465537514,"score_spread":0.2510577252304806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122005880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09939904,0.000587917,0.890594,0.00034279094,0.0000725163,0.00018834678,0.00059429544,0.00042400704,0.0077970554],"genre_scores_gemma":[0.2760747,0.00072375213,0.7123321,0.00016402763,0.000038011403,0.0002157884,0.0013698181,0.0004813446,0.008600406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994803,0.00017477335,0.000024006975,0.000113776754,0.000121244855,0.00008594219],"domain_scores_gemma":[0.997232,0.0019514853,0.00021060139,0.00013312862,0.00026305323,0.00020958038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011045471,0.0012534286,0.0013054494,0.0033640969,0.0011347001,0.0018215072,0.0012645327,0.0014130642,0.0072321985],"category_scores_gemma":[0.0069827945,0.0015843674,0.0012468748,0.0029130562,0.0012904548,0.0033657663,0.0017462932,0.00212905,0.000726348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026221422,0.00020896929,0.002654051,0.00036508657,0.00011284471,0.00016162702,0.00039950648,0.76289785,0.0029112375,0.10501377,0.0065479954,0.11846484],"study_design_scores_gemma":[0.000029415001,0.000041197156,0.00040895102,0.000069219364,0.000022661,0.000036934987,0.00016221865,0.88857996,0.0009671104,0.10769201,0.001972592,0.000017730172],"about_ca_topic_score_codex":0.010447832,"about_ca_topic_score_gemma":0.015344996,"teacher_disagreement_score":0.010447832,"about_ca_system_score_codex":0.0019427543,"about_ca_system_score_gemma":0.0014801472,"threshold_uncertainty_score":0.024194062},"labels":[],"label_agreement":null},{"id":"W3126958331","doi":"10.1016/j.disc.2021.112319","title":"On Aharoni’s rainbow generalization of the Caccetta–Häggkvist conjecture","year":2021,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Horizon 2020 Framework Programme; Rutgers, The State University of New Jersey; Natural Sciences and Engineering Research Council of Canada; Grantová Agentura, Univerzita Karlova; Division of Mathematical Sciences; National Science Foundation","keywords":"Conjecture; Combinatorics; Digraph; Rainbow; Mathematics; Generalization; Graph; Physics","score_opus":0.02114310221355421,"score_gpt":0.2860546249544033,"score_spread":0.2649115227408491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126958331","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32390034,0.004276951,0.10719624,0.03535304,0.002694179,0.000094332674,0.00049707195,0.0005786559,0.52540916],"genre_scores_gemma":[0.9487973,0.0012872022,0.012549073,0.002663962,0.0011296676,0.00007471137,0.00023706596,0.0001462132,0.033114836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990017,0.0002659988,0.00003583269,0.00021923616,0.00026051354,0.00021668238],"domain_scores_gemma":[0.9974152,0.0012156594,0.00021090923,0.00050643616,0.0003604658,0.00029126715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021445826,0.00058410934,0.0013080811,0.0019717426,0.0038491862,0.0029753027,0.0015748454,0.003271931,0.009477366],"category_scores_gemma":[0.008914888,0.00038750548,0.0011512015,0.00171471,0.0073543745,0.010268898,0.00404971,0.004626829,0.0010113134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010533096,0.000006107599,0.000058766942,0.000009639743,0.000001938807,0.000021400314,0.00008582892,0.00022853272,0.00006349805,0.9976386,0.00090621726,0.00096898206],"study_design_scores_gemma":[0.000006665791,0.0000017575063,0.000044199613,0.0000049319397,0.0000011972483,0.000013676728,0.00002692423,0.000731402,0.000034460696,0.99822015,0.00091107964,0.000003449991],"about_ca_topic_score_codex":0.0047782776,"about_ca_topic_score_gemma":0.0027354732,"teacher_disagreement_score":0.009477366,"about_ca_system_score_codex":0.002704077,"about_ca_system_score_gemma":0.0014910828,"threshold_uncertainty_score":0.031704962},"labels":[],"label_agreement":null},{"id":"W3135193972","doi":"10.1016/j.disc.2021.112362","title":"Chordality of locally semicomplete and weakly quasi-transitive digraphs","year":2021,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chordal graph; Transitive relation; Digraph; Mathematics; Combinatorics; Strongly connected component; Discrete mathematics; Graph","score_opus":0.020454960617849585,"score_gpt":0.28865346542544035,"score_spread":0.2681985048075908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135193972","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84164613,0.0004205241,0.09949127,0.00076395547,0.00011391933,0.000106142674,0.0013274981,0.00028527377,0.055845283],"genre_scores_gemma":[0.97642994,0.00032460337,0.00951897,0.00013597844,0.00009301799,0.00008466347,0.0009182179,0.00009458368,0.012400015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988518,0.00020847975,0.000098756485,0.00031809867,0.00025190637,0.00027101542],"domain_scores_gemma":[0.99326587,0.00354483,0.0007149303,0.0005795101,0.00066398346,0.0012308016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009550087,0.00061402173,0.0016490285,0.0026257157,0.003176176,0.00561187,0.0019333151,0.0010529571,0.008101792],"category_scores_gemma":[0.004230386,0.00089509826,0.0013302604,0.0024328157,0.0038568748,0.0056606038,0.003344685,0.0024050807,0.00070730224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117559626,0.000034853012,0.00071760645,0.000054457527,0.000020720387,0.00021979373,0.00068761664,0.0011110251,0.0014015285,0.9925114,0.00039269275,0.0027306427],"study_design_scores_gemma":[0.000051946758,0.000033117634,0.0006490714,0.000018758758,0.00002657833,0.0001532919,0.00035461166,0.0052952883,0.0008574392,0.99115914,0.0013816715,0.000019129508],"about_ca_topic_score_codex":0.0030085493,"about_ca_topic_score_gemma":0.0036430277,"teacher_disagreement_score":0.008101792,"about_ca_system_score_codex":0.0022118716,"about_ca_system_score_gemma":0.0009752528,"threshold_uncertainty_score":0.027103186},"labels":[],"label_agreement":null},{"id":"W3156797889","doi":"10.1016/j.disc.2022.113079","title":"Irredundance trees of diameter 3","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Research Foundation","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Disjoint sets; Graph; Cardinality (data modeling); Discrete mathematics; Computer science","score_opus":0.02566232620976708,"score_gpt":0.29545894767569775,"score_spread":0.26979662146593064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3156797889","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70811915,0.002473329,0.11828211,0.0045885895,0.0004427884,0.0002019139,0.003019787,0.0016996041,0.16117279],"genre_scores_gemma":[0.921475,0.0011157176,0.033822093,0.0008823695,0.00037590237,0.00017057646,0.0019828216,0.00059569033,0.03957994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991831,0.00012429056,0.00004747624,0.00019503255,0.00021315698,0.00023685452],"domain_scores_gemma":[0.99373984,0.0038546263,0.00054017943,0.00052864087,0.00053224695,0.0008044641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008903171,0.00082953507,0.001797082,0.002127189,0.0035702344,0.0036767635,0.0014217198,0.0016013874,0.011221977],"category_scores_gemma":[0.0045436956,0.0010101286,0.0010152183,0.0024150638,0.0022659525,0.0036204706,0.0022200784,0.0036741844,0.001666668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035289137,0.000089413246,0.001521961,0.00017322718,0.00003460564,0.0005171505,0.0010418162,0.0018063446,0.010626622,0.96433574,0.007729896,0.011770279],"study_design_scores_gemma":[0.00008788413,0.000060551087,0.0017857912,0.000039182207,0.000052722404,0.0008061975,0.0003472492,0.0063446863,0.004002276,0.9687136,0.017731113,0.000028821854],"about_ca_topic_score_codex":0.0012067712,"about_ca_topic_score_gemma":0.002012127,"teacher_disagreement_score":0.011221977,"about_ca_system_score_codex":0.0015494536,"about_ca_system_score_gemma":0.00047931526,"threshold_uncertainty_score":0.03754127},"labels":[],"label_agreement":null},{"id":"W3158233228","doi":"10.1016/j.disc.2021.112413","title":"A new infinite class of ideal minimally non-packing clutters","year":2021,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Civil, Mechanical and Manufacturing Innovation; Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Directorate for Education and Human Resources; National Science Foundation","keywords":"Ideal (ethics); Mathematics; Conjecture; Class (philosophy); Combinatorics; Rank (graph theory); Computer science; Artificial intelligence","score_opus":0.009566289660287362,"score_gpt":0.21686219637917176,"score_spread":0.2072959067188844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158233228","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5116599,0.0012784484,0.33193994,0.0012518362,0.0003422495,0.00008283448,0.0005952673,0.001483766,0.15136579],"genre_scores_gemma":[0.94716024,0.0003522061,0.036169626,0.0003584776,0.00028273903,0.0000543052,0.0005002684,0.00020607792,0.014916091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884254,0.00019741333,0.000058000067,0.0002661741,0.00034095036,0.0002950125],"domain_scores_gemma":[0.9965012,0.0013218634,0.00045524872,0.00051252206,0.00041755458,0.0007916893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007765316,0.00078806235,0.0012351813,0.002543411,0.003064394,0.0051679984,0.0015497553,0.0014347975,0.0069965166],"category_scores_gemma":[0.003897671,0.00083109766,0.00083149574,0.0022781335,0.0035070344,0.0039822967,0.0028165383,0.0024646877,0.00083796703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086508284,0.000037526726,0.0009282769,0.00004927181,0.000013081067,0.0002616785,0.00025920392,0.0020509171,0.0018848175,0.9871243,0.0022017767,0.0051025026],"study_design_scores_gemma":[0.00003442513,0.000059860744,0.0011207161,0.000036620484,0.000022410519,0.0014226115,0.00023135725,0.022905516,0.0020689617,0.96260655,0.009445462,0.00004545253],"about_ca_topic_score_codex":0.00055198936,"about_ca_topic_score_gemma":0.00048337656,"teacher_disagreement_score":0.0069965166,"about_ca_system_score_codex":0.00097408105,"about_ca_system_score_gemma":0.0006108616,"threshold_uncertainty_score":0.023405671},"labels":[],"label_agreement":null},{"id":"W3160395046","doi":"10.1016/j.disc.2021.112441","title":"Reconfiguration of homomorphisms to reflexive digraph cycles","year":2021,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Education","keywords":"Homomorphism; Digraph; Mathematics; Combinatorics; Algebraic number; Discrete mathematics; Graph; Path (computing); Computer science","score_opus":0.03565127811538304,"score_gpt":0.3294347344413274,"score_spread":0.2937834563259444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160395046","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67801356,0.00064446393,0.23485151,0.00044614193,0.00036385862,0.0002238058,0.00053083024,0.002931877,0.081994034],"genre_scores_gemma":[0.9603238,0.00031179536,0.023726182,0.00017708223,0.00009939534,0.000089345696,0.00042439,0.00036056864,0.014487414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991491,0.00015295617,0.00005795643,0.00027844167,0.00011511204,0.00024648858],"domain_scores_gemma":[0.99751115,0.0008487989,0.00025481082,0.00062517816,0.00026060408,0.00049932476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044829637,0.00051126594,0.00058251596,0.0014994394,0.0008879199,0.0022667763,0.0009562547,0.0006795767,0.009549061],"category_scores_gemma":[0.0033586223,0.00061418593,0.00078370236,0.0011139765,0.0014055328,0.0033480343,0.0016532495,0.0012156848,0.0011508436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004369244,0.0002342066,0.0013586436,0.00023225325,0.000061357794,0.0010754594,0.0019987135,0.011840076,0.022924718,0.87385356,0.0040675183,0.081916556],"study_design_scores_gemma":[0.00007341686,0.00011556483,0.0010307188,0.00004380193,0.00004763991,0.0005288409,0.00070776313,0.020785896,0.0121223815,0.9501266,0.014372657,0.000044728506],"about_ca_topic_score_codex":0.00084832,"about_ca_topic_score_gemma":0.000895616,"teacher_disagreement_score":0.009549061,"about_ca_system_score_codex":0.0010219392,"about_ca_system_score_gemma":0.00046056724,"threshold_uncertainty_score":0.03194475},"labels":[],"label_agreement":null},{"id":"W3173071419","doi":"10.1016/j.disc.2021.112682","title":"A note on distinguishing trees with the chromatic symmetric function","year":2021,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multiset; Disjoint sets; Chromatic scale; Combinatorics; Mathematics; Function (biology); Tree (set theory); Degree (music); Physics","score_opus":0.035147988713864244,"score_gpt":0.30288689250370254,"score_spread":0.2677389037898383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3173071419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13593946,0.010450664,0.546876,0.013804409,0.009467583,0.00013312088,0.0007550469,0.00073482795,0.28183874],"genre_scores_gemma":[0.766188,0.007761323,0.15101363,0.003924757,0.006698305,0.00012380496,0.0007894949,0.0006558001,0.06284488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985259,0.00044071433,0.00006535427,0.0003760556,0.00041149007,0.00018049264],"domain_scores_gemma":[0.9956298,0.002977661,0.00019361326,0.0006488105,0.00030255274,0.00024767738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019706367,0.0011002503,0.0013103948,0.0019341056,0.0022781498,0.0036452785,0.0020845106,0.0026054955,0.007268391],"category_scores_gemma":[0.00687799,0.00058488175,0.0012666102,0.002736976,0.004673755,0.010870791,0.0040280237,0.0071730777,0.0012991446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038926406,0.000018038249,0.00020589927,0.000044939712,0.0000070093224,0.00006785332,0.00010185815,0.0009028922,0.00088500837,0.9841505,0.003636668,0.009940372],"study_design_scores_gemma":[0.0000062074073,0.000018600913,0.00022083583,0.000014250613,0.000009475606,0.000117717,0.00003916313,0.0035456466,0.0007485882,0.9835091,0.011754749,0.000015562142],"about_ca_topic_score_codex":0.0014885772,"about_ca_topic_score_gemma":0.0017403001,"teacher_disagreement_score":0.007268391,"about_ca_system_score_codex":0.001683852,"about_ca_system_score_gemma":0.00090133765,"threshold_uncertainty_score":0.024315238},"labels":[],"label_agreement":null},{"id":"W317728043","doi":"10.1016/j.disc.2015.03.021","title":"Every 3-colorable graph has a faithful representation in the odd-distance graph","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Burnaby Hospital; Simon Fraser University","funders":"Vietnam Institute for Advanced Study in Mathematics","keywords":"Mathematics; Combinatorics; Graph; Wheel graph; Discrete mathematics; Faithful representation; Enhanced Data Rates for GSM Evolution; Plane (geometry); Geometric graph theory; Graph power; Line graph; Computer science; Geometry; Artificial intelligence","score_opus":0.08234569812872485,"score_gpt":0.33084921438935466,"score_spread":0.24850351626062983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W317728043","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6008342,0.00022468953,0.32186636,0.0018989712,0.00031840612,0.00010462176,0.00087851554,0.0010249311,0.072849385],"genre_scores_gemma":[0.9433723,0.00020729471,0.04212028,0.00058035256,0.000098781806,0.0000802928,0.0006938763,0.0002562926,0.012590584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956614,0.00007397942,0.00002161078,0.00013206722,0.000098660814,0.000107564505],"domain_scores_gemma":[0.9981414,0.0005192438,0.00023422242,0.00047189338,0.00033427533,0.00029900848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039983238,0.0006835773,0.00050324993,0.0009987887,0.0013502018,0.0021898774,0.0012626227,0.0012582324,0.009505433],"category_scores_gemma":[0.001742394,0.00040378512,0.0007762789,0.0008628047,0.0018308042,0.0031893556,0.0013155838,0.0026413037,0.0012008242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001929294,0.00009680406,0.00089139654,0.000083017636,0.0000157632,0.00025202916,0.0005667223,0.0031667997,0.009074084,0.96044433,0.0026465997,0.022569614],"study_design_scores_gemma":[0.000032559663,0.00005245318,0.00069464225,0.00001652084,0.000015254965,0.00023056299,0.00020770715,0.009470448,0.0027390234,0.98059213,0.005920687,0.000028005536],"about_ca_topic_score_codex":0.0017601539,"about_ca_topic_score_gemma":0.0014869367,"teacher_disagreement_score":0.009505433,"about_ca_system_score_codex":0.00071422406,"about_ca_system_score_gemma":0.0004831833,"threshold_uncertainty_score":0.03179878},"labels":[],"label_agreement":null},{"id":"W3180039493","doi":"10.1016/j.disc.2021.112708","title":"Recolouring weakly chordal graphs and the complement of triangle-free graphs","year":2021,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Chordal graph; Mathematics; Vertex (graph theory); Graph; Discrete mathematics; Complement graph; Complement (music); Graph power; Line graph; Biology","score_opus":0.03833882838192034,"score_gpt":0.30540646669135735,"score_spread":0.267067638309437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3180039493","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81688386,0.00055096624,0.119298466,0.0006758774,0.00018987464,0.00008374287,0.00041489862,0.00040690592,0.061495416],"genre_scores_gemma":[0.9483251,0.00038754748,0.030844545,0.00016044342,0.000075280404,0.000033551452,0.00052815286,0.00019668328,0.019448597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994741,0.00010496906,0.000019225343,0.000100856436,0.00015464985,0.0001462267],"domain_scores_gemma":[0.9971667,0.0013500293,0.00024566732,0.00057110464,0.00034064363,0.0003257563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046218943,0.00037238645,0.00058569876,0.00114654,0.0014562246,0.001960452,0.0013011724,0.0007090698,0.008241214],"category_scores_gemma":[0.0041510426,0.00028312844,0.00053970463,0.001063372,0.0016887898,0.0028981364,0.0022009087,0.0015912297,0.0005638567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004691066,0.00009669674,0.0012579999,0.00018763897,0.00002100638,0.00031956565,0.0010963934,0.012017968,0.015068446,0.9002709,0.0041171946,0.065077096],"study_design_scores_gemma":[0.00004739669,0.00009546077,0.0008168265,0.000056492863,0.000023873203,0.00029390163,0.0007691038,0.035469875,0.010767646,0.9380494,0.013584445,0.000025557018],"about_ca_topic_score_codex":0.0027195234,"about_ca_topic_score_gemma":0.0036423665,"teacher_disagreement_score":0.008241214,"about_ca_system_score_codex":0.00084309047,"about_ca_system_score_gemma":0.00055514544,"threshold_uncertainty_score":0.027569592},"labels":[],"label_agreement":null},{"id":"W3187594655","doi":"10.1016/j.disc.2022.113108","title":"Mixing colourings in 2K2-free graphs","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Chromatic scale; Social connectedness; Discrete mathematics","score_opus":0.021336088618649843,"score_gpt":0.28297028056507156,"score_spread":0.26163419194642173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3187594655","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8676859,0.00050406967,0.07277541,0.0019253351,0.00027694012,0.00013386075,0.00083467446,0.00089826674,0.054965626],"genre_scores_gemma":[0.9494032,0.00029440617,0.023577247,0.0005140154,0.000094582254,0.00016789304,0.0008172483,0.00045296617,0.024678288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998466,0.00035036364,0.00009041048,0.0003813976,0.0002879617,0.00042383978],"domain_scores_gemma":[0.99497825,0.0023610184,0.0006781361,0.0007640633,0.0003222911,0.0008962885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008805119,0.0009713443,0.0009628095,0.0019082578,0.0032849088,0.0045394767,0.001760236,0.0029150597,0.016847054],"category_scores_gemma":[0.004312542,0.0013663813,0.001039415,0.0020403233,0.0022998094,0.0051519484,0.003551024,0.0027017659,0.0021087192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006371147,0.00015016753,0.0019850114,0.00021919394,0.000052027688,0.0006843331,0.001616325,0.007909528,0.012057738,0.9516791,0.0053678104,0.017641542],"study_design_scores_gemma":[0.00011741915,0.000049234903,0.0011676541,0.00005673651,0.00004171337,0.00034474136,0.00046969677,0.018115966,0.0050335755,0.9691162,0.0054413807,0.000045702072],"about_ca_topic_score_codex":0.001487094,"about_ca_topic_score_gemma":0.0025594365,"teacher_disagreement_score":0.016847054,"about_ca_system_score_codex":0.0014619102,"about_ca_system_score_gemma":0.00068013516,"threshold_uncertainty_score":0.056358993},"labels":[],"label_agreement":null},{"id":"W3198239652","doi":"10.1016/j.disc.2022.112869","title":"Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Induced subgraph; Hamiltonian path; Distance-hereditary graph; Indifference graph; Pancyclic graph; Induced path; Cograph; Discrete mathematics; Chordal graph; Hamiltonian path problem; Pathwidth; Induced subgraph isomorphism problem; Vertex (graph theory); Longest path problem; Line graph; Graph; Graph power; Voltage graph","score_opus":0.02732548057777925,"score_gpt":0.3102251781203765,"score_spread":0.28289969754259725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198239652","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9634425,0.00027994445,0.011254468,0.00049618905,0.00002975584,0.00006171431,0.0006416588,0.00009971005,0.023694104],"genre_scores_gemma":[0.9890876,0.00015109796,0.0048190434,0.00012787394,0.000035797577,0.00006676907,0.0013836324,0.000036016187,0.0042920858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960154,0.00006890638,0.000020102378,0.00012140038,0.00008753636,0.00010046445],"domain_scores_gemma":[0.99854124,0.00066608394,0.0003046213,0.00010329022,0.00009428156,0.00029049627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002495378,0.0005209429,0.00056960864,0.0016127724,0.0011535996,0.0020870017,0.001285456,0.0010729439,0.008544609],"category_scores_gemma":[0.0013867881,0.00059022446,0.00057324005,0.0010217323,0.00094160304,0.0016098828,0.0010149557,0.00094680773,0.00035041472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011011662,0.0006733522,0.016576666,0.0006197588,0.000141861,0.0024032823,0.0031409494,0.0065204655,0.038750842,0.89011574,0.0075001046,0.032455795],"study_design_scores_gemma":[0.00038906967,0.0001930109,0.042700086,0.00013575106,0.00022145528,0.0027547067,0.0018951012,0.04835307,0.011343119,0.8793634,0.0125947,0.00005668042],"about_ca_topic_score_codex":0.00072957703,"about_ca_topic_score_gemma":0.0013205971,"teacher_disagreement_score":0.008544609,"about_ca_system_score_codex":0.00084820524,"about_ca_system_score_gemma":0.0003514723,"threshold_uncertainty_score":0.02858454},"labels":[],"label_agreement":null},{"id":"W3200990721","doi":"10.1016/j.disc.2023.113341","title":"Strongly cospectral vertices in normal Cayley graphs","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cayley graph; Mathematics; Combinatorics; Pairwise comparison; Upper and lower bounds; Discrete mathematics; Eigenvalues and eigenvectors; Cayley transform; Vertex-transitive graph; Graph; Line graph; Voltage graph","score_opus":0.037653657690925414,"score_gpt":0.3176544382678461,"score_spread":0.2800007805769207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200990721","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81239927,0.0003236091,0.06631803,0.0010156577,0.00038309253,0.000072157454,0.00047425384,0.0004041832,0.11860979],"genre_scores_gemma":[0.96487546,0.0002752564,0.011326694,0.00025581196,0.00018107153,0.000059750128,0.00047618017,0.00015858814,0.0223912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994754,0.00013142402,0.000022354157,0.00012454326,0.00015120654,0.00009504427],"domain_scores_gemma":[0.9978459,0.0007259568,0.00032647597,0.00020493218,0.00036905456,0.0005275322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003854568,0.0008314343,0.00072119944,0.0021093385,0.002050285,0.0036746766,0.00086002913,0.0011451555,0.009631113],"category_scores_gemma":[0.0024726384,0.0007081878,0.00040292193,0.001715377,0.0021291107,0.0030101617,0.0014877717,0.002263146,0.0014761053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009336204,0.000048020906,0.0007696065,0.000032871885,0.000008354355,0.00013628918,0.00029884573,0.0011333042,0.0028581757,0.98749834,0.0016817738,0.005441031],"study_design_scores_gemma":[0.000021878424,0.000020418154,0.00048558554,0.000011480032,0.000009563356,0.00013890158,0.00022835791,0.0066246935,0.0013415997,0.9890904,0.002016131,0.00001106269],"about_ca_topic_score_codex":0.0015091663,"about_ca_topic_score_gemma":0.0027105259,"teacher_disagreement_score":0.009631113,"about_ca_system_score_codex":0.00083346653,"about_ca_system_score_gemma":0.0004982107,"threshold_uncertainty_score":0.03221935},"labels":[],"label_agreement":null},{"id":"W3206226465","doi":"10.1016/j.disc.2021.112679","title":"Serial exchanges in matroids","year":2021,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada; Thompson Rivers University","keywords":"Matroid; Combinatorics; Mathematics; Conjecture; Rank (graph theory); Binary number; Set (abstract data type); Discrete mathematics; Arithmetic; Computer science","score_opus":0.028078970645199982,"score_gpt":0.3088374225669366,"score_spread":0.2807584519217366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206226465","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5373836,0.0010716944,0.24710238,0.0042481623,0.00054785964,0.0001503364,0.0006469688,0.0006990748,0.20814987],"genre_scores_gemma":[0.89925563,0.00080290646,0.025539499,0.0006276525,0.0005121387,0.00013051239,0.00053563045,0.0003324995,0.07226362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988262,0.00042579707,0.0000792503,0.00021275353,0.00028131634,0.00017461632],"domain_scores_gemma":[0.9949451,0.0025393437,0.00073654234,0.00077792373,0.0004395428,0.00056153437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012779484,0.0007317889,0.0010854908,0.0019971118,0.0028155472,0.004201077,0.0014124742,0.0018451043,0.01833886],"category_scores_gemma":[0.005826298,0.00084347615,0.000992113,0.003220812,0.0027415128,0.009496544,0.0025004654,0.0035271186,0.001608955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048435908,0.00003360434,0.00016138716,0.00002527444,0.000005773249,0.00009015202,0.0002079238,0.0013869263,0.0003353869,0.992065,0.001462513,0.0041776192],"study_design_scores_gemma":[0.000015944684,0.000011088697,0.000089927344,0.000007141003,0.0000064667465,0.000074814554,0.00005952315,0.0045731524,0.00023336326,0.9928596,0.0020644723,0.0000045846214],"about_ca_topic_score_codex":0.0008222676,"about_ca_topic_score_gemma":0.0009535685,"teacher_disagreement_score":0.01833886,"about_ca_system_score_codex":0.0013112157,"about_ca_system_score_gemma":0.0005207818,"threshold_uncertainty_score":0.06134957},"labels":[],"label_agreement":null},{"id":"W4205106693","doi":"10.1016/s0012-365x(04)00022-6","title":"Absorbing sets in arc-coloured tournaments*1","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Tournament; Mathematics; Vertex (graph theory); Combinatorics; Monochromatic color; Arc (geometry); Path (computing); Discrete mathematics; Graph; Geometry; Computer science","score_opus":0.02730265602279779,"score_gpt":0.31723079426519624,"score_spread":0.28992813824239844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205106693","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58875465,0.0012198805,0.30041298,0.0023580072,0.0005401311,0.00016082465,0.0008274096,0.0007664763,0.10495958],"genre_scores_gemma":[0.93801415,0.00076904596,0.034125682,0.0005068467,0.00038661854,0.00028472385,0.0009209626,0.00023411679,0.02475779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774456,0.0006858142,0.00013431459,0.0004644533,0.00044855248,0.000522369],"domain_scores_gemma":[0.98867166,0.007939181,0.00087347813,0.0006145897,0.0005776411,0.0013234532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001821378,0.0010594442,0.0018491212,0.002324069,0.0052268277,0.009556317,0.0029345958,0.0028641461,0.010802927],"category_scores_gemma":[0.008554532,0.0016376395,0.0021591512,0.0033156215,0.0037197163,0.0050227274,0.0032792608,0.004975296,0.0011299896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002611853,0.00014283932,0.00088048604,0.0001260388,0.0000622822,0.00024433722,0.0007109022,0.008946916,0.0021200073,0.9739952,0.004173495,0.008336338],"study_design_scores_gemma":[0.00009050794,0.0000534996,0.00047045987,0.00002941646,0.000045819063,0.00017197139,0.00013338514,0.028507221,0.0006640029,0.9672812,0.0025306125,0.00002190121],"about_ca_topic_score_codex":0.0019882047,"about_ca_topic_score_gemma":0.0021090223,"teacher_disagreement_score":0.010802927,"about_ca_system_score_codex":0.0022759107,"about_ca_system_score_gemma":0.0009843174,"threshold_uncertainty_score":0.03613937},"labels":[],"label_agreement":null},{"id":"W4205124066","doi":"10.1016/j.disc.2011.08.017","title":"Preface","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.06796630154342118,"score_gpt":0.2720509617976455,"score_spread":0.2040846602542243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205124066","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014672242,0.017637776,0.01927811,0.04647111,0.30500546,0.0003204243,0.006996798,0.0012043939,0.6016187],"genre_scores_gemma":[0.011212834,0.008692988,0.0049568103,0.007863082,0.05852047,0.00021150378,0.004792097,0.0010094665,0.9027407],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999332,0.000106423366,0.000038561346,0.000119699405,0.00034751676,0.000055752203],"domain_scores_gemma":[0.9965988,0.00060289126,0.00010901376,0.00039508348,0.0018514532,0.000442783],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011502551,0.0011129656,0.0007710669,0.0034612354,0.002349034,0.0026137163,0.0012084346,0.0010254488,0.26947138],"category_scores_gemma":[0.007499638,0.000304312,0.00072532706,0.0024894478,0.0008041967,0.0028727425,0.0016864087,0.003530697,0.1637349],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024084817,0.00002530787,0.00008265543,0.000104494626,0.0000034096327,0.000030675343,0.00004275461,0.00010440269,0.00016721779,0.019403212,0.9399072,0.04010444],"study_design_scores_gemma":[0.000005549873,0.000013599752,0.00029221078,0.00010655309,0.0000040066943,0.000042330972,0.000047630136,0.00008304562,0.00019414729,0.01629904,0.98290414,0.000007745654],"about_ca_topic_score_codex":0.0026702376,"about_ca_topic_score_gemma":0.0040301364,"teacher_disagreement_score":0.7305286,"about_ca_system_score_codex":0.0021721604,"about_ca_system_score_gemma":0.0015057342,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4205253237","doi":"10.1016/s0012-365x(04)00143-8","title":"The structure of strong arc-locally semicomplete digraphs","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Mathematics; Arc (geometry); Digraph; Combinatorics; Vertex (graph theory); Class (philosophy); Generalization; Discrete mathematics; Computer science; Artificial intelligence; Graph","score_opus":0.0176590252653728,"score_gpt":0.2834667429367344,"score_spread":0.26580771767136163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205253237","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8383013,0.0004741436,0.11588694,0.0011635757,0.00006914458,0.000058154485,0.0009698082,0.00036779486,0.042709142],"genre_scores_gemma":[0.9728166,0.00033086387,0.013844018,0.00017769341,0.00005551172,0.00006240951,0.0006665429,0.000052344498,0.011993969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996376,0.000076722376,0.000027864226,0.000090307985,0.000092522525,0.0000749386],"domain_scores_gemma":[0.99599767,0.002060717,0.0005172134,0.00031152315,0.0004947174,0.0006181532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005302775,0.000348337,0.00064952485,0.0018496007,0.0020147352,0.0025543387,0.0010302749,0.0008345005,0.006706966],"category_scores_gemma":[0.0026657614,0.0005945148,0.0004124003,0.0020037917,0.0019694273,0.0031942877,0.0015007728,0.00150715,0.0005980206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004506247,0.000022876087,0.00050846074,0.000053365155,0.00000824895,0.00011095312,0.0003287994,0.0020919233,0.0011915766,0.9911972,0.00063877925,0.0038027605],"study_design_scores_gemma":[0.000026562699,0.000023080935,0.0005354985,0.000018552932,0.000012417102,0.00009273167,0.00015486359,0.00893284,0.00069472555,0.9873139,0.002181929,0.000012829162],"about_ca_topic_score_codex":0.0012432098,"about_ca_topic_score_gemma":0.0022565885,"teacher_disagreement_score":0.006706966,"about_ca_system_score_codex":0.001204158,"about_ca_system_score_gemma":0.0007292982,"threshold_uncertainty_score":0.022436976},"labels":[],"label_agreement":null},{"id":"W4205374221","doi":"10.1016/j.disc.2004.02.004","title":"Ramsey numbers in complete balanced multipartite graphs. Part I: Set numbers","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Multipartite; Mathematics; Combinatorics; Ramsey's theorem; Discrete mathematics; Diagonal; Monochromatic color; Graph","score_opus":0.045755448733489204,"score_gpt":0.3082959021620013,"score_spread":0.2625404534285121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205374221","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5749078,0.012521401,0.19366261,0.0034407314,0.0006268527,0.00008237953,0.0009455192,0.00037984186,0.21343286],"genre_scores_gemma":[0.96660155,0.002606523,0.014689146,0.0002465146,0.0002449368,0.0001245124,0.0002803216,0.000048866877,0.015157504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995308,0.0001122804,0.00002868024,0.00011303235,0.00015259186,0.00006250358],"domain_scores_gemma":[0.99830854,0.000955967,0.0002475252,0.00016034186,0.00017910523,0.00014856349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007681578,0.00038214325,0.00046000257,0.0017467319,0.00088737236,0.002812106,0.000705089,0.00074145786,0.00669377],"category_scores_gemma":[0.0037283006,0.00033838017,0.00035826565,0.0017015574,0.002140461,0.004761794,0.0014181581,0.0013194839,0.0006603657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024903291,0.000010226511,0.00020129111,0.00005862443,0.000005123078,0.000017586373,0.00012393713,0.0014925291,0.0008240182,0.9886203,0.0018544451,0.006766999],"study_design_scores_gemma":[0.000008311773,0.000017520953,0.0005308433,0.000041618237,0.000007765946,0.0001392412,0.00010753037,0.006738873,0.0008206939,0.98519915,0.006379604,0.000008842892],"about_ca_topic_score_codex":0.0003311438,"about_ca_topic_score_gemma":0.00042589655,"teacher_disagreement_score":0.00669377,"about_ca_system_score_codex":0.0011865117,"about_ca_system_score_gemma":0.0003503407,"threshold_uncertainty_score":0.022392929},"labels":[],"label_agreement":null},{"id":"W4205385238","doi":"10.1016/j.disc.2006.03.006","title":"On some applications of graph theory, I","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Fixed Point Theorems Analysis","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics; Graph; Graph theory","score_opus":0.011758298050407687,"score_gpt":0.2710908438253853,"score_spread":0.2593325457749776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205385238","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017410602,0.20865913,0.27169168,0.055989664,0.011693171,0.00008613632,0.00043948338,0.00024095326,0.43378916],"genre_scores_gemma":[0.37217423,0.2018893,0.19069171,0.028852189,0.042800777,0.00056260056,0.00095003203,0.0005938496,0.16148531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993943,0.00029788972,0.000023957178,0.00009349536,0.00013769494,0.00005265116],"domain_scores_gemma":[0.99871385,0.0009183833,0.000056173518,0.00011532941,0.00014282193,0.0000533711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013073195,0.0009277689,0.0010249453,0.0026126662,0.0016786461,0.0029462718,0.0015691104,0.002091795,0.006610343],"category_scores_gemma":[0.0032790783,0.00044608547,0.0017252218,0.0027507572,0.0056658396,0.0042262063,0.001601709,0.004230348,0.001304093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042781517,0.000007903983,0.000071693714,0.00006159149,0.000009418565,0.000023108047,0.00006512987,0.00045853225,0.00011552624,0.98497033,0.009195057,0.0050174035],"study_design_scores_gemma":[0.0000023390567,0.0000061987375,0.000109945904,0.000031340827,0.0000058641253,0.000024801597,0.000037180547,0.00082395953,0.000047065878,0.97700125,0.021906218,0.000003860423],"about_ca_topic_score_codex":0.0021124543,"about_ca_topic_score_gemma":0.0017592725,"teacher_disagreement_score":0.006610343,"about_ca_system_score_codex":0.002365944,"about_ca_system_score_gemma":0.0007338155,"threshold_uncertainty_score":0.02211374},"labels":[],"label_agreement":null},{"id":"W4205747721","doi":"10.1016/s0012-365x(04)00145-1","title":"Ramsey numbers in complete balanced multipartite graphs. Part I: Set numbers","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Research Foundation","keywords":"Multipartite; Mathematics; Combinatorics; Ramsey's theorem; Discrete mathematics; Diagonal; Monochromatic color; Graph","score_opus":0.045755448733489204,"score_gpt":0.3082959021620013,"score_spread":0.2625404534285121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205747721","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5749078,0.012521401,0.19366261,0.0034407314,0.0006268527,0.00008237953,0.0009455192,0.00037984186,0.21343286],"genre_scores_gemma":[0.96660155,0.002606523,0.014689146,0.0002465146,0.0002449368,0.0001245124,0.0002803216,0.000048866877,0.015157504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995308,0.0001122804,0.00002868024,0.00011303235,0.00015259186,0.00006250358],"domain_scores_gemma":[0.99830854,0.000955967,0.0002475252,0.00016034186,0.00017910523,0.00014856349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007681578,0.00038214325,0.00046000257,0.0017467319,0.00088737236,0.002812106,0.000705089,0.00074145786,0.00669377],"category_scores_gemma":[0.0037283006,0.00033838017,0.00035826565,0.0017015574,0.002140461,0.004761794,0.0014181581,0.0013194839,0.0006603657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024903291,0.000010226511,0.00020129111,0.00005862443,0.000005123078,0.000017586373,0.00012393713,0.0014925291,0.0008240182,0.9886203,0.0018544451,0.006766999],"study_design_scores_gemma":[0.000008311773,0.000017520953,0.0005308433,0.000041618237,0.000007765946,0.0001392412,0.00010753037,0.006738873,0.0008206939,0.98519915,0.006379604,0.000008842892],"about_ca_topic_score_codex":0.0003311438,"about_ca_topic_score_gemma":0.00042589655,"teacher_disagreement_score":0.00669377,"about_ca_system_score_codex":0.0011865117,"about_ca_system_score_gemma":0.0003503407,"threshold_uncertainty_score":0.022392929},"labels":[],"label_agreement":null},{"id":"W4205847801","doi":"10.1016/j.disc.2006.03.014","title":"Spanning subgraphs with specified valencies","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Valency; Mathematics; Combinatorics; Discrete mathematics; Vertex (graph theory); Graph factorization; Graph; Spanning tree; Voltage graph; Line graph","score_opus":0.019353913978545932,"score_gpt":0.25991806906105447,"score_spread":0.24056415508250853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205847801","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5972111,0.0003326306,0.32466453,0.0013559295,0.00011300771,0.0002913633,0.0027567921,0.001294819,0.07197986],"genre_scores_gemma":[0.8706059,0.0003258033,0.11149005,0.00030333127,0.00006084825,0.00030853468,0.0025037795,0.00044515726,0.01395673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908876,0.0002273155,0.000073604824,0.00018439583,0.00020559329,0.000220385],"domain_scores_gemma":[0.9954797,0.0024151057,0.0003628251,0.00074091816,0.00056325056,0.0004383244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008933712,0.00076878874,0.00066590187,0.0013646517,0.001259254,0.0022796092,0.0014401226,0.0015949673,0.008564843],"category_scores_gemma":[0.006392784,0.00080607017,0.000733827,0.0020452412,0.0010610067,0.003132448,0.0019006731,0.0014605188,0.0014651819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032873574,0.00014489602,0.0031972546,0.00030023354,0.00006194275,0.00069588906,0.00068887236,0.014219597,0.022406068,0.9203235,0.0059583033,0.03167467],"study_design_scores_gemma":[0.00007215696,0.00007224881,0.0010408945,0.000069152855,0.00007927212,0.0010555977,0.00037585656,0.033991195,0.015742796,0.93803805,0.009433187,0.000029677589],"about_ca_topic_score_codex":0.0002146066,"about_ca_topic_score_gemma":0.00052069046,"teacher_disagreement_score":0.008564843,"about_ca_system_score_codex":0.000638004,"about_ca_system_score_gemma":0.00050507486,"threshold_uncertainty_score":0.028652191},"labels":[],"label_agreement":null},{"id":"W4210323931","doi":"10.1016/j.disc.2004.02.013","title":"Polychromatic cliques","year":2004,"lang":"fr","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Integer (computer science); Enhanced Data Rates for GSM Evolution; Function (biology); Discrete mathematics; Computer science","score_opus":0.022469930234868186,"score_gpt":0.2987121381624522,"score_spread":0.27624220792758397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210323931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30002895,0.0015352272,0.40385836,0.0070966724,0.0004514877,0.00021705919,0.0015207195,0.0006730407,0.28461847],"genre_scores_gemma":[0.88769364,0.0006906803,0.055417985,0.0011377392,0.0006306734,0.00038939127,0.0010740042,0.0002486902,0.052717216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981622,0.0005777687,0.00006386117,0.0006452413,0.0003675482,0.0001833126],"domain_scores_gemma":[0.99168664,0.00511575,0.0006553381,0.0011693634,0.0007571884,0.00061578176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011437971,0.00041487973,0.0011851873,0.0015895988,0.0035001321,0.0040032277,0.0015322325,0.0013840464,0.014785818],"category_scores_gemma":[0.0071214084,0.0008582261,0.0008132465,0.001879401,0.0041317367,0.006757527,0.002681163,0.0037545147,0.0011258567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012806319,0.000010557162,0.00008415037,0.000015592628,0.0000038075145,0.00002039078,0.00009543675,0.00027923586,0.00020662599,0.9964889,0.0011045609,0.0016779192],"study_design_scores_gemma":[0.000011974253,0.000003297366,0.000105814455,0.000004736715,0.000004439415,0.00007599509,0.000043996803,0.002152884,0.00018340588,0.9945176,0.0028915294,0.0000042875745],"about_ca_topic_score_codex":0.0009930525,"about_ca_topic_score_gemma":0.0013707889,"teacher_disagreement_score":0.014785818,"about_ca_system_score_codex":0.0012214716,"about_ca_system_score_gemma":0.0007121375,"threshold_uncertainty_score":0.04946351},"labels":[],"label_agreement":null},{"id":"W4210762532","doi":"10.1016/j.disc.2006.03.011","title":"Tough graphs and hamiltonian circuits","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Hamiltonian path; Graph; Discrete mathematics; Hamiltonian (control theory); Cubic graph; Quartic graph; Graph power; Line graph; Voltage graph","score_opus":0.016694382914690224,"score_gpt":0.2695214490345573,"score_spread":0.2528270661198671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210762532","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39307857,0.008749646,0.12729406,0.021401867,0.001656324,0.000106985965,0.00079194846,0.00039740576,0.44652316],"genre_scores_gemma":[0.9397574,0.0022249166,0.010284104,0.0016480603,0.00090033404,0.000095542055,0.0003597759,0.00009815678,0.044631656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966514,0.000105319756,0.000010881452,0.00006823484,0.00008390099,0.00006661598],"domain_scores_gemma":[0.9983437,0.000983948,0.00018971447,0.00015194884,0.0001237276,0.00020686729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039913374,0.00043912552,0.0005558372,0.0017066427,0.0021206944,0.002655992,0.0008745852,0.0017057648,0.017881183],"category_scores_gemma":[0.0026253136,0.0004829662,0.00049765874,0.0017106419,0.0037337455,0.004732713,0.0017088198,0.0029349045,0.0008024819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006236796,0.0000043968716,0.000042621574,0.000012266833,0.000002089051,0.00001640224,0.000067523724,0.00022654148,0.000097716715,0.9967709,0.0012210611,0.0015321454],"study_design_scores_gemma":[0.0000033959652,0.0000013164781,0.00005671684,0.00000261171,0.0000016708442,0.000016292894,0.000033859225,0.00040658843,0.000028593091,0.9979686,0.0014785203,0.0000018655851],"about_ca_topic_score_codex":0.001180309,"about_ca_topic_score_gemma":0.0016151937,"teacher_disagreement_score":0.017881183,"about_ca_system_score_codex":0.0010244972,"about_ca_system_score_gemma":0.00034514922,"threshold_uncertainty_score":0.059818506},"labels":[],"label_agreement":null},{"id":"W4211103311","doi":"10.1016/j.disc.2005.06.001","title":"Preface","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Lethbridge","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.021165222361376527,"score_gpt":0.2850441144622575,"score_spread":0.263878892100881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211103311","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014690313,0.016428635,0.018565606,0.04315055,0.27285692,0.0003119729,0.0067582796,0.0012010944,0.6392579],"genre_scores_gemma":[0.010141028,0.007725575,0.0042111194,0.006465279,0.047741268,0.00017933881,0.0043382156,0.0008774777,0.9183207],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993992,0.00009450378,0.000034082772,0.00010731889,0.0003140102,0.00005082882],"domain_scores_gemma":[0.9969048,0.00054704095,0.00010032785,0.00037390093,0.0016536623,0.00042026464],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010795554,0.0010965525,0.0007886224,0.0034423203,0.0022474653,0.0026144476,0.0011871216,0.0009950844,0.28415078],"category_scores_gemma":[0.0065763253,0.0003057626,0.00070686353,0.0025165048,0.00075395464,0.0028388724,0.0015720414,0.0032936665,0.17005458],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023586768,0.000025016683,0.00007620396,0.00009560424,0.0000032593148,0.000026871096,0.000038032988,0.00009713888,0.0001608382,0.01792026,0.9419381,0.039595056],"study_design_scores_gemma":[0.000005846826,0.000014000655,0.00030611389,0.00010030166,0.0000041597636,0.00003953349,0.000046437945,0.00008940449,0.00019986116,0.0158462,0.9833409,0.0000073377178],"about_ca_topic_score_codex":0.0024690952,"about_ca_topic_score_gemma":0.0038274804,"teacher_disagreement_score":0.7158492,"about_ca_system_score_codex":0.0021133258,"about_ca_system_score_gemma":0.0013602563,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4211168395","doi":"10.1016/j.disc.2008.03.030","title":"Preface","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.04087345441644402,"score_gpt":0.27466794949584633,"score_spread":0.2337944950794023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211168395","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014506751,0.016599242,0.018390547,0.04516306,0.28356776,0.0003036862,0.006333449,0.0011312456,0.6270603],"genre_scores_gemma":[0.011033851,0.008282201,0.0046058944,0.00739474,0.054114543,0.00019604129,0.004373901,0.00093870267,0.90906006],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99938226,0.00009842297,0.000035133507,0.00011155368,0.0003209076,0.000051680054],"domain_scores_gemma":[0.99694663,0.0005541574,0.00010010851,0.00035973187,0.0016373293,0.00040214317],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010954316,0.0010983815,0.0007759941,0.0033499107,0.0022841436,0.0025646824,0.0011927116,0.0010101402,0.26798612],"category_scores_gemma":[0.0067876945,0.00030271124,0.00069493864,0.0024341934,0.0007950542,0.0028929352,0.0016088722,0.003475396,0.16165975],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022865186,0.000024583906,0.000078133744,0.00009936638,0.0000032468415,0.00002781686,0.00004124575,0.00009653338,0.00016254169,0.020071087,0.9402978,0.039074782],"study_design_scores_gemma":[0.0000056281647,0.00001372105,0.0002960539,0.000103535924,0.0000039764313,0.00004153352,0.00004794052,0.00008640172,0.0001917694,0.016791955,0.9824102,0.0000074428085],"about_ca_topic_score_codex":0.0024227835,"about_ca_topic_score_gemma":0.0036278388,"teacher_disagreement_score":0.7320139,"about_ca_system_score_codex":0.0020895735,"about_ca_system_score_gemma":0.001383244,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4211207573","doi":"10.1016/s0012-365x(00)00143-6","title":"Preface","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"","field":"","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.017098102670636037,"score_gpt":0.26946097604951497,"score_spread":0.2523628733788789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211207573","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013979537,0.016808469,0.016336937,0.045331284,0.2898913,0.00029717156,0.006034465,0.001093157,0.6228093],"genre_scores_gemma":[0.009637598,0.007819322,0.00377738,0.0066937273,0.05227124,0.00016930407,0.003960407,0.0008253496,0.9148457],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99939764,0.00009498215,0.000034396053,0.000107242595,0.00031336382,0.000052365303],"domain_scores_gemma":[0.99681264,0.0005544233,0.00010458566,0.00037998683,0.0016952285,0.00045320415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011120627,0.001113905,0.0007738663,0.0034980308,0.0023159247,0.0026972587,0.0011875887,0.0010301311,0.27438992],"category_scores_gemma":[0.006621735,0.00030165736,0.0006879531,0.002595522,0.0007660219,0.0029198783,0.0015959388,0.0033422522,0.1655884],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024458945,0.000025110232,0.00007597951,0.00009527984,0.0000031035026,0.000025968935,0.000037265785,0.000090466994,0.00015997647,0.016755521,0.9429338,0.039773036],"study_design_scores_gemma":[0.000005696617,0.000013878978,0.00030246223,0.000097115364,0.000003848709,0.000037319212,0.000045310946,0.000084318825,0.00018802045,0.0141479485,0.98506725,0.000006843833],"about_ca_topic_score_codex":0.0025078263,"about_ca_topic_score_gemma":0.0038689629,"teacher_disagreement_score":0.27438992,"about_ca_system_score_codex":0.0021152322,"about_ca_system_score_gemma":0.0013882357,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4213027512","doi":"10.1016/j.disc.2008.11.029","title":"Preface","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.020263602764142997,"score_gpt":0.28783691030822023,"score_spread":0.2675733075440772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213027512","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001478864,0.0172439,0.019516738,0.04425128,0.2957645,0.0003237718,0.006984883,0.0012007678,0.6132353],"genre_scores_gemma":[0.01122729,0.008545285,0.0047968547,0.0072137257,0.054808553,0.00020590355,0.0046773194,0.0009801352,0.9075449],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993643,0.00009892568,0.00003696875,0.0001154403,0.0003319708,0.00005242002],"domain_scores_gemma":[0.9967462,0.0005778747,0.00010396603,0.00037553516,0.0017782421,0.00041818194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011144871,0.001105345,0.0007785607,0.003446317,0.002315644,0.0025590167,0.0012017785,0.00099054,0.2736969],"category_scores_gemma":[0.0071656206,0.00030287,0.0007083214,0.0025075471,0.00078620063,0.0028807442,0.0016412766,0.0034555362,0.16463047],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023565384,0.000024978823,0.000081389364,0.000102469436,0.0000033467666,0.000029496088,0.00004185995,0.00010050915,0.00016880826,0.01914678,0.9398984,0.0403784],"study_design_scores_gemma":[0.000005621077,0.00001368628,0.0002965528,0.000106470856,0.0000041446347,0.000042224066,0.000048026894,0.000086774926,0.0001999522,0.01634238,0.98284644,0.000007692772],"about_ca_topic_score_codex":0.0025839207,"about_ca_topic_score_gemma":0.0038479122,"teacher_disagreement_score":0.2736969,"about_ca_system_score_codex":0.002128276,"about_ca_system_score_gemma":0.0014260373,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4213143469","doi":"10.1016/j.disc.2011.03.022","title":"Preface","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.06796630154342118,"score_gpt":0.2720509617976455,"score_spread":0.2040846602542243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213143469","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014672242,0.017637776,0.01927811,0.04647111,0.30500546,0.0003204243,0.006996798,0.0012043939,0.6016187],"genre_scores_gemma":[0.011212834,0.008692988,0.0049568103,0.007863082,0.05852047,0.00021150378,0.004792097,0.0010094665,0.9027407],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999332,0.000106423366,0.000038561346,0.000119699405,0.00034751676,0.000055752203],"domain_scores_gemma":[0.9965988,0.00060289126,0.00010901376,0.00039508348,0.0018514532,0.000442783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011502551,0.0011129656,0.0007710669,0.0034612354,0.002349034,0.0026137163,0.0012084346,0.0010254488,0.26947138],"category_scores_gemma":[0.007499638,0.000304312,0.00072532706,0.0024894478,0.0008041967,0.0028727425,0.0016864087,0.003530697,0.1637349],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024084817,0.00002530787,0.00008265543,0.000104494626,0.0000034096327,0.000030675343,0.00004275461,0.00010440269,0.00016721779,0.019403212,0.9399072,0.04010444],"study_design_scores_gemma":[0.000005549873,0.000013599752,0.00029221078,0.00010655309,0.0000040066943,0.000042330972,0.000047630136,0.00008304562,0.00019414729,0.01629904,0.98290414,0.000007745654],"about_ca_topic_score_codex":0.0026702376,"about_ca_topic_score_gemma":0.0040301364,"teacher_disagreement_score":0.26947138,"about_ca_system_score_codex":0.0021721604,"about_ca_system_score_gemma":0.0015057342,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4213188790","doi":"10.1016/j.disc.2007.07.031","title":"Pancyclic PBD block-intersection graphs","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Combinatorics; Mathematics; Intersection (aeronautics); Vertex (graph theory); Graph; Pairwise comparison; Discrete mathematics; Block (permutation group theory); Intersection graph; Line graph","score_opus":0.007455798218356486,"score_gpt":0.2132354064206548,"score_spread":0.20577960820229832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213188790","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45684117,0.00080264866,0.2607268,0.0021800045,0.00021246876,0.00033408168,0.0041882773,0.000935453,0.27377906],"genre_scores_gemma":[0.9057393,0.00072359585,0.04913786,0.00061409606,0.00009035659,0.00028971216,0.0023154514,0.00018352635,0.040906034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923134,0.00016929096,0.000034324734,0.00012965093,0.00024271465,0.0001926017],"domain_scores_gemma":[0.99760485,0.0006901091,0.00034845035,0.0005408072,0.0005096031,0.00030614308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004055705,0.00046781564,0.0007853276,0.0015192999,0.0018374649,0.0019921134,0.0013467311,0.00087476097,0.017698077],"category_scores_gemma":[0.0022626282,0.00056176964,0.00040395395,0.002393994,0.0009057745,0.002415489,0.0017775004,0.001947911,0.0023223902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002728256,0.000057760513,0.00054663484,0.00009720413,0.000023883043,0.00017438822,0.00015608047,0.006699104,0.0041665877,0.9639419,0.00832736,0.015536134],"study_design_scores_gemma":[0.00009171496,0.00007369968,0.00089362595,0.000045474477,0.000041540643,0.0006212149,0.00020202063,0.055172663,0.005059179,0.9150321,0.022736982,0.000029742625],"about_ca_topic_score_codex":0.001585192,"about_ca_topic_score_gemma":0.0021214273,"teacher_disagreement_score":0.017698077,"about_ca_system_score_codex":0.00093676377,"about_ca_system_score_gemma":0.000941935,"threshold_uncertainty_score":0.05920595},"labels":[],"label_agreement":null},{"id":"W4213257702","doi":"10.1016/j.disc.2006.05.004","title":"Classification of extremal double circulant self-dual codes of lengths 74–88","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Circulant matrix; Mathematics; Dual (grammatical number); Combinatorics; Discrete mathematics","score_opus":0.022833401465611032,"score_gpt":0.250057329470382,"score_spread":0.22722392800477098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213257702","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.959499,0.00038858145,0.014128699,0.00066233735,0.00013256865,0.00005425446,0.0005533411,0.00021327971,0.024367938],"genre_scores_gemma":[0.9867573,0.0001724227,0.006287464,0.00013073641,0.00012367291,0.000055489472,0.0008843846,0.00007476658,0.0055138576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920577,0.00010593201,0.000057404726,0.00012751206,0.00029789915,0.00020545916],"domain_scores_gemma":[0.99644923,0.0012556709,0.0007660132,0.00044155406,0.0005840298,0.0005033715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006135195,0.00042713483,0.000621846,0.0035589903,0.0018805079,0.0024660537,0.0007896503,0.001324333,0.004588159],"category_scores_gemma":[0.004676657,0.00038180404,0.00040198982,0.0014206404,0.00197482,0.0011699721,0.001120793,0.001524665,0.0006141151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010687794,0.00020031139,0.0151136955,0.00023157948,0.00004462677,0.0009130089,0.00086691877,0.0053633694,0.023684233,0.89361596,0.008217855,0.050679766],"study_design_scores_gemma":[0.00025260742,0.00026971617,0.017473431,0.00020897183,0.000081548074,0.0034938487,0.0006373147,0.05922729,0.02053825,0.87137115,0.026281333,0.00016447688],"about_ca_topic_score_codex":0.0004064772,"about_ca_topic_score_gemma":0.00051115046,"teacher_disagreement_score":0.004588159,"about_ca_system_score_codex":0.0012573089,"about_ca_system_score_gemma":0.00086527213,"threshold_uncertainty_score":0.015348911},"labels":[],"label_agreement":null},{"id":"W4236856137","doi":"10.1016/j.disc.2006.03.022","title":"Limit distribution for the existence of Hamiltonian cycles in a random graph","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Combinatorics; Random graph; Hamiltonian (control theory); Graph; Discrete mathematics; Quartic graph; Random regular graph; Hamiltonian path; Graph power; Line graph; 1-planar graph","score_opus":0.027158081144164525,"score_gpt":0.29091735446524475,"score_spread":0.26375927332108023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236856137","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5997883,0.001851855,0.37377006,0.0047181766,0.00015848965,0.00018227856,0.00064793683,0.00063127535,0.018251693],"genre_scores_gemma":[0.97181714,0.0011296246,0.018975534,0.0003826961,0.00034195755,0.00040382968,0.0004393985,0.0001836639,0.006326228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842215,0.0006409757,0.00006453419,0.0003419111,0.0003283721,0.00020206452],"domain_scores_gemma":[0.95111597,0.037901632,0.002701866,0.0022115961,0.0029773295,0.0030916398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00683919,0.0007243607,0.0016402119,0.0051599853,0.0017527514,0.0034093976,0.003686285,0.0026945996,0.0066458774],"category_scores_gemma":[0.0416034,0.001075655,0.0010686788,0.0018444001,0.006897512,0.008115814,0.0028602649,0.0035116938,0.0005902993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007809277,0.000063092724,0.0012965531,0.000103127895,0.000029148096,0.00012444724,0.00037765846,0.009810412,0.0010353385,0.9824687,0.0011546562,0.0034587134],"study_design_scores_gemma":[0.000044315202,0.000041169293,0.00078800577,0.00005503956,0.00002222099,0.00019842747,0.00016989566,0.1701136,0.0005736785,0.8272589,0.00068729836,0.000047474947],"about_ca_topic_score_codex":0.0014636653,"about_ca_topic_score_gemma":0.0010350548,"teacher_disagreement_score":0.00683919,"about_ca_system_score_codex":0.0025424988,"about_ca_system_score_gemma":0.0009584845,"threshold_uncertainty_score":0.03616953},"labels":[],"label_agreement":null},{"id":"W4240114191","doi":"10.1016/s0012-365x(04)00144-x","title":"Ramsey numbers in complete balanced multipartite graphs. Part II: Size numbers","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Research Foundation","keywords":"Multipartite; Mathematics; Combinatorics; Discrete mathematics; Ramsey's theorem; Diagonal; Monochromatic color; Cardinality (data modeling); Graph; Computer science","score_opus":0.029877456998500543,"score_gpt":0.28952597875345,"score_spread":0.25964852175494946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240114191","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59098524,0.009787236,0.18795566,0.0069411956,0.00060470635,0.00013408206,0.0013544223,0.0005269971,0.20171043],"genre_scores_gemma":[0.9660017,0.0024884536,0.014575904,0.00034101927,0.00039911683,0.00021577081,0.0002998511,0.000097833865,0.015580351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938846,0.00013679886,0.000030235446,0.00013286417,0.00021844744,0.00009307313],"domain_scores_gemma":[0.9953551,0.0030561837,0.00047079404,0.00041888707,0.0003612303,0.0003377687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010876947,0.00038017528,0.00045885428,0.0017592333,0.00083504175,0.0028717373,0.00087407907,0.000912143,0.0073367087],"category_scores_gemma":[0.007083518,0.00045516988,0.00035515917,0.0014066055,0.002307483,0.006360734,0.0014493412,0.0013744457,0.00068083947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048702772,0.000015338723,0.000458993,0.000082402425,0.0000060558855,0.00002270969,0.00014515786,0.003215412,0.0015772297,0.9826999,0.0028616772,0.008866437],"study_design_scores_gemma":[0.000012635127,0.000019037088,0.0007180598,0.000038719612,0.000008541304,0.00015433172,0.000100070974,0.011509886,0.001311809,0.9802807,0.00583444,0.000011740251],"about_ca_topic_score_codex":0.0003182173,"about_ca_topic_score_gemma":0.00041334683,"teacher_disagreement_score":0.0073367087,"about_ca_system_score_codex":0.0012451955,"about_ca_system_score_gemma":0.00046202407,"threshold_uncertainty_score":0.024543703},"labels":[],"label_agreement":null},{"id":"W4248887642","doi":"10.1016/j.disc.2006.03.009","title":"Edmonds polytopes and a hierarchy of combinatorial problems","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Combinatorics; Polytope; Closure (psychology); Polyhedron; Rank (graph theory); Integer (computer science); Bounded function; Discrete mathematics; Integer programming; Order (exchange); Upper and lower bounds; Set (abstract data type); Linear programming; Linear inequality; Inequality; Mathematical optimization","score_opus":0.012975112282765456,"score_gpt":0.26285539803572117,"score_spread":0.2498802857529557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248887642","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35108364,0.011426065,0.26219994,0.017966725,0.00076562003,0.00022982701,0.0016951966,0.00049373135,0.3541392],"genre_scores_gemma":[0.8034398,0.008111641,0.09687988,0.0016181344,0.0010694808,0.00025480182,0.0019405488,0.00022290136,0.08646282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985014,0.00043107185,0.000075637465,0.0002523048,0.00041277343,0.0003268693],"domain_scores_gemma":[0.99528617,0.0030860614,0.00032331946,0.00034685034,0.0003576739,0.0005998955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013241697,0.0009819551,0.0020531632,0.0036971276,0.0041380413,0.0076500066,0.002651725,0.0028107718,0.019985259],"category_scores_gemma":[0.0068671335,0.0012063547,0.0018110529,0.005190562,0.004055133,0.0076657627,0.002886313,0.00748623,0.0014592967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024345416,0.000040785326,0.00020636294,0.000074284486,0.0000109847715,0.000054148975,0.00012726984,0.0032168543,0.00011839186,0.9849097,0.004402258,0.0068147653],"study_design_scores_gemma":[0.000023293862,0.000009564286,0.00020053209,0.000038399998,0.0000100114785,0.00010435961,0.00014392304,0.010614998,0.00008536295,0.9823803,0.0063781044,0.000011075769],"about_ca_topic_score_codex":0.0038697883,"about_ca_topic_score_gemma":0.004487277,"teacher_disagreement_score":0.019985259,"about_ca_system_score_codex":0.004369618,"about_ca_system_score_gemma":0.0013020905,"threshold_uncertainty_score":0.06685734},"labels":[],"label_agreement":null},{"id":"W4286684878","doi":"10.1016/j.disc.2022.113084","title":"The invertible elements of the monoid of dead-ending misère games","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Invertible matrix; Modulo; Mathematics; Combinatorics; Combinatorial game theory; Discrete mathematics; Pure mathematics; Sequential game; Game theory; Mathematical economics","score_opus":0.030726916667810515,"score_gpt":0.28141928171152436,"score_spread":0.25069236504371384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286684878","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3899657,0.0012539569,0.29164365,0.0016180368,0.00072748284,0.00014626229,0.00083866547,0.00054676045,0.31325945],"genre_scores_gemma":[0.905679,0.00045319452,0.026651965,0.00044095944,0.0002265803,0.00010355376,0.00043090858,0.0001733336,0.06584048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900913,0.00025427956,0.00007252124,0.0002003665,0.0002771959,0.00018637389],"domain_scores_gemma":[0.99878496,0.00047694225,0.00010517917,0.00017187565,0.0002678056,0.0001933532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007254471,0.0006132053,0.00067579746,0.0016510818,0.0019151013,0.0031730072,0.0009148617,0.0010366915,0.011537989],"category_scores_gemma":[0.0028395825,0.0004742334,0.00074645894,0.0008144167,0.0025835559,0.0034771285,0.0018923808,0.0019939572,0.0020760747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004137648,0.000014891455,0.000097916316,0.00002239753,0.000005518037,0.000059663435,0.0003082086,0.00033217476,0.00081680506,0.99337524,0.00048921217,0.0044365707],"study_design_scores_gemma":[0.000013628997,0.000020518737,0.00012974079,0.000013670015,0.0000055760574,0.00008362814,0.00011671077,0.0013667708,0.0009197236,0.99151343,0.0058010006,0.00001547393],"about_ca_topic_score_codex":0.00090269215,"about_ca_topic_score_gemma":0.00088562304,"teacher_disagreement_score":0.011537989,"about_ca_system_score_codex":0.0007960969,"about_ca_system_score_gemma":0.0007492129,"threshold_uncertainty_score":0.038598478},"labels":[],"label_agreement":null},{"id":"W4307725203","doi":"10.1016/j.disc.2022.113220","title":"Obstructions for acyclic local tournament orientation completions","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tournament; Directed acyclic graph; Mathematics; Combinatorics; Orientation (vector space); Interval graph; Directed graph; Discrete mathematics; Graph; Class (philosophy); Pathwidth; Computer science; Line graph; Geometry; Artificial intelligence","score_opus":0.035658052615687615,"score_gpt":0.3263953272624663,"score_spread":0.2907372746467787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307725203","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6947897,0.0006873958,0.12911604,0.0032057394,0.000572337,0.00016401788,0.00096543884,0.0010535431,0.1694458],"genre_scores_gemma":[0.9449309,0.0004059508,0.007943103,0.00037972964,0.00038070235,0.00012626218,0.0009832183,0.0003007489,0.044549316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984962,0.00022222364,0.0000647208,0.00027947273,0.00049082586,0.00044647156],"domain_scores_gemma":[0.99622285,0.0013469415,0.00040726335,0.00025419818,0.0002602226,0.0015085591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012280337,0.00087235513,0.0013860586,0.0026796116,0.0036268719,0.0052538672,0.0016014377,0.0014693835,0.020344576],"category_scores_gemma":[0.0041896678,0.00082825316,0.0013781597,0.0020461103,0.0034868508,0.005624046,0.0057217744,0.005423943,0.001769106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007440846,0.000081629485,0.00035683103,0.000041106166,0.000009460064,0.0001030602,0.00031601026,0.0010110063,0.000533215,0.9931292,0.0018841804,0.002459841],"study_design_scores_gemma":[0.00007924491,0.000026352907,0.0005396591,0.000012953819,0.000018392031,0.000113279064,0.00018916259,0.0048134746,0.00042155889,0.98966265,0.0040969173,0.000026449943],"about_ca_topic_score_codex":0.002773585,"about_ca_topic_score_gemma":0.0029101756,"teacher_disagreement_score":0.020344576,"about_ca_system_score_codex":0.0020302364,"about_ca_system_score_gemma":0.00089468725,"threshold_uncertainty_score":0.068059444},"labels":[],"label_agreement":null},{"id":"W4313325064","doi":"10.1016/j.disc.2022.113289","title":"Minimal induced subgraphs of the class of 2-connected non-Hamiltonian wheel-free graphs","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Induced subgraph; Mathematics; Distance-hereditary graph; Hamiltonian path; Pancyclic graph; Discrete mathematics; Factor-critical graph; Induced path; Cograph; Graph; Line graph; Vertex (graph theory); Pathwidth; Graph power","score_opus":0.019883120479224105,"score_gpt":0.2683981368726628,"score_spread":0.24851501639343868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313325064","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9653607,0.00033562808,0.012229298,0.00029816866,0.00002679554,0.000039497667,0.00095148,0.00012124673,0.020637153],"genre_scores_gemma":[0.98916966,0.00019320546,0.0031124398,0.00007426689,0.000036755166,0.000049899434,0.0014577956,0.000036603426,0.0058692046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979454,0.000028723809,0.000008125181,0.00006209747,0.000049097336,0.000057428417],"domain_scores_gemma":[0.9993924,0.00020586298,0.0001570616,0.000057012006,0.000054564072,0.00013317549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014647821,0.00038475927,0.00055746414,0.0012542491,0.0010602075,0.0014795265,0.0009692129,0.00057898834,0.0061466354],"category_scores_gemma":[0.00066306005,0.0003985526,0.00035795773,0.0008921402,0.0006079794,0.0012076095,0.0006634257,0.0006516184,0.0003557902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088393764,0.0005253956,0.021225922,0.0006887367,0.00019790637,0.0020207136,0.0017572744,0.013795481,0.04574333,0.8533835,0.01262433,0.04715339],"study_design_scores_gemma":[0.00021222448,0.00009541745,0.03925474,0.00009480591,0.00016943587,0.0015704808,0.000816608,0.051085778,0.010641698,0.8807387,0.01527724,0.000042811094],"about_ca_topic_score_codex":0.0014220665,"about_ca_topic_score_gemma":0.0020845702,"teacher_disagreement_score":0.0061466354,"about_ca_system_score_codex":0.000616534,"about_ca_system_score_gemma":0.00035589637,"threshold_uncertainty_score":0.02056253},"labels":[],"label_agreement":null},{"id":"W4318953856","doi":"10.1016/j.disc.2023.113342","title":"The r-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Hypergraph; Bounded function; Matching (statistics); Vertex (graph theory); Time complexity; Discrete mathematics; Graph","score_opus":0.01991825721515068,"score_gpt":0.2848979128020826,"score_spread":0.26497965558693193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318953856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41323563,0.0015103254,0.54881555,0.0062182355,0.00025297145,0.0005498792,0.0028939664,0.0010435352,0.0254799],"genre_scores_gemma":[0.7850422,0.001215679,0.19210763,0.0007575066,0.00047027654,0.00048186982,0.002005594,0.00070116523,0.01721803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99692315,0.0013488437,0.00014060369,0.0008136924,0.0003370489,0.0004366929],"domain_scores_gemma":[0.9770289,0.017782686,0.0016738743,0.0012227689,0.00078276504,0.0015088643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037844959,0.0016952383,0.0031647047,0.0018061264,0.0023902012,0.0059956815,0.006275889,0.0042884382,0.011369511],"category_scores_gemma":[0.018466396,0.002001318,0.002301807,0.0037893238,0.0032940062,0.011121137,0.0030299155,0.0032650367,0.0011176032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023611537,0.00091718556,0.003056944,0.0016228241,0.0004105085,0.0005592998,0.0010921928,0.48088545,0.010883215,0.41545585,0.01980539,0.062949955],"study_design_scores_gemma":[0.0002710146,0.000146271,0.00070154364,0.00006478529,0.00008782887,0.00015054313,0.00032010663,0.5405225,0.0028874583,0.45312303,0.0016720325,0.00005284808],"about_ca_topic_score_codex":0.0056832065,"about_ca_topic_score_gemma":0.0054694326,"teacher_disagreement_score":0.011369511,"about_ca_system_score_codex":0.0035183944,"about_ca_system_score_gemma":0.0030870026,"threshold_uncertainty_score":0.038034737},"labels":[],"label_agreement":null},{"id":"W4320890236","doi":"10.1016/j.disc.2023.113369","title":"One-generator quasi-cyclic codes and their dual codes","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; United Arab Emirates University","keywords":"Linear code; Block code; Expander code; Luby transform code; Mathematics; Concatenated error correction code; Reed–Muller code; Discrete mathematics; Hamming code; Group code; Generator (circuit theory); Generator matrix; Algorithm; Quantum mechanics; Decoding methods; Physics","score_opus":0.022398441982459622,"score_gpt":0.2531003522162354,"score_spread":0.23070191023377576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320890236","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7519828,0.0015604508,0.13408814,0.0035893002,0.00076202786,0.000107279906,0.0007279932,0.0002925763,0.106889345],"genre_scores_gemma":[0.9569892,0.00053805846,0.019532884,0.0005976614,0.00048139822,0.00010308141,0.00027236223,0.000079822436,0.021405429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992962,0.0001738512,0.0000319723,0.00010515726,0.00021312296,0.0001797846],"domain_scores_gemma":[0.9979613,0.00082882465,0.00028539254,0.00025305292,0.0003760828,0.0002954344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090022234,0.00044149192,0.00048469313,0.0015294127,0.0012126698,0.002002303,0.00071404804,0.0013872405,0.004733212],"category_scores_gemma":[0.0029284705,0.00029223526,0.00050945673,0.0009350976,0.002517502,0.002007477,0.001381512,0.0019466386,0.00081790745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070934715,0.00001568548,0.00013379108,0.00001573204,0.0000023064397,0.000047023976,0.000091748036,0.00055113167,0.00088808837,0.9946865,0.0005742976,0.002922723],"study_design_scores_gemma":[0.000027677273,0.00003343216,0.00023313527,0.00001834426,0.0000050099843,0.00020941744,0.000054563465,0.008611154,0.0010911184,0.9875629,0.002132213,0.000021049294],"about_ca_topic_score_codex":0.0007216302,"about_ca_topic_score_gemma":0.0005111402,"teacher_disagreement_score":0.004733212,"about_ca_system_score_codex":0.00091847224,"about_ca_system_score_gemma":0.0012121507,"threshold_uncertainty_score":0.015834153},"labels":[],"label_agreement":null},{"id":"W4324357480","doi":"10.1016/j.disc.2023.113404","title":"Block colourings of star systems","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Bipartite graph; Star (game theory); Vertex (graph theory); Block (permutation group theory); Graph; Discrete mathematics; Stars; Astrophysics; Physics","score_opus":0.011800853276043487,"score_gpt":0.2099673878089681,"score_spread":0.1981665345329246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324357480","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6109965,0.00066355354,0.29110622,0.0011494206,0.0003367461,0.00014645066,0.00073581474,0.0005753944,0.09428994],"genre_scores_gemma":[0.92250913,0.00060896453,0.041334417,0.0003174777,0.00015190177,0.0001379297,0.0005492425,0.0002709138,0.034120075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994062,0.0001896335,0.000033420467,0.00008660975,0.00013366657,0.00015040107],"domain_scores_gemma":[0.9970368,0.0013577652,0.00033870823,0.00038773747,0.00043955294,0.00043946324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005191975,0.00038721785,0.00070043,0.0011957011,0.0011634867,0.0019806356,0.0006187255,0.0009092362,0.011898708],"category_scores_gemma":[0.0024768054,0.00047784022,0.0005280436,0.0010132486,0.0012899565,0.0021715043,0.001296568,0.0012710389,0.0013039284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008905772,0.000024570647,0.00020715901,0.0000368397,0.000007638908,0.00005139839,0.00019692534,0.0046187583,0.0033206348,0.98394495,0.0017572114,0.005745033],"study_design_scores_gemma":[0.000029754015,0.000035607874,0.00025735507,0.000014282996,0.000007843935,0.00004844721,0.00008977826,0.026703736,0.0012561027,0.9666449,0.004900009,0.000012252692],"about_ca_topic_score_codex":0.0018825971,"about_ca_topic_score_gemma":0.0022974734,"teacher_disagreement_score":0.011898708,"about_ca_system_score_codex":0.0010142308,"about_ca_system_score_gemma":0.0007229463,"threshold_uncertainty_score":0.039805114},"labels":[],"label_agreement":null},{"id":"W4327630093","doi":"10.1016/j.disc.2023.113405","title":"2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Providence Health Care","keywords":"Combinatorics; Mathematics; Complete coloring; Edge coloring; Injective function; List coloring; Square (algebra); Fractional coloring; Planar graph; Discrete mathematics; Degree (music); Greedy coloring; Graph; Graph power; Geometry; Physics; Line graph","score_opus":0.036004568719994384,"score_gpt":0.2867906976001002,"score_spread":0.25078612888010576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327630093","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87561035,0.0003545227,0.07911215,0.0010613694,0.000095253476,0.00004435075,0.0007309208,0.00055962254,0.042431485],"genre_scores_gemma":[0.9630253,0.0002481211,0.023376793,0.00021469488,0.00005786717,0.00003142423,0.0007461764,0.00012382008,0.0121757295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995086,0.000078816396,0.000021339089,0.00011511207,0.00012488209,0.00015124501],"domain_scores_gemma":[0.9975128,0.0011726242,0.00038901198,0.0002874213,0.00028843732,0.00034971384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031667048,0.00061105634,0.0005253472,0.0008776405,0.00138161,0.0024312956,0.0016975276,0.000835173,0.0056640343],"category_scores_gemma":[0.0025178744,0.0005934324,0.00049754605,0.0011868146,0.0012695913,0.0026980632,0.0016369357,0.0013074484,0.000767747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010727661,0.0003817167,0.0086853225,0.00054735417,0.00008148366,0.0009924597,0.0016572607,0.0509038,0.02594665,0.84495205,0.01095964,0.053819466],"study_design_scores_gemma":[0.00014125006,0.00018874397,0.00485876,0.000048177266,0.000095704905,0.00094182015,0.0010648196,0.092135295,0.015045679,0.87688196,0.008521951,0.000075704476],"about_ca_topic_score_codex":0.0028273773,"about_ca_topic_score_gemma":0.004521142,"teacher_disagreement_score":0.0056640343,"about_ca_system_score_codex":0.0011490312,"about_ca_system_score_gemma":0.00094956945,"threshold_uncertainty_score":0.018948019},"labels":[],"label_agreement":null},{"id":"W4360602557","doi":"10.1016/j.disc.2023.113422","title":"Inverse problems associated with subsequence sums in C ⊕ C II","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Tianjin Municipal Education Commission; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Subsequence; Mathematics; Combinatorics; Sequence (biology); Prime (order theory); Inverse; Abelian group; Longest increasing subsequence; Group (periodic table); Finite group; Discrete mathematics; Bounded function","score_opus":0.047809160837042064,"score_gpt":0.2866357103713065,"score_spread":0.2388265495342644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360602557","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5935069,0.0022416757,0.18821754,0.0062923366,0.0010152891,0.00008234267,0.0002722717,0.0003075114,0.20806418],"genre_scores_gemma":[0.9163258,0.0011939913,0.031771366,0.0007918212,0.00083297124,0.00014289719,0.00034933325,0.00019622337,0.048395507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989956,0.0002948372,0.000064119195,0.00015073235,0.00032909127,0.00016577303],"domain_scores_gemma":[0.9966618,0.002010292,0.00030061518,0.00019601386,0.00036754913,0.0004637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013968427,0.00082989753,0.0012742807,0.0028254096,0.0030946352,0.004319855,0.0016487216,0.0031250743,0.008381737],"category_scores_gemma":[0.0066441554,0.0005745772,0.0012251653,0.001859094,0.004192191,0.0072004735,0.003440124,0.0048622326,0.00072056573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017317048,0.000021648331,0.00007833037,0.000025714233,0.00000405781,0.00006931266,0.00013385093,0.0006884453,0.00024294385,0.9965474,0.0006197379,0.0015513682],"study_design_scores_gemma":[0.000004191504,0.000005873219,0.000047186633,0.0000071789163,0.0000026288312,0.00007325449,0.000081772894,0.0030130288,0.00018970316,0.99605125,0.00051830604,0.000005735503],"about_ca_topic_score_codex":0.00089722994,"about_ca_topic_score_gemma":0.0007299182,"teacher_disagreement_score":0.008381737,"about_ca_system_score_codex":0.0014720451,"about_ca_system_score_gemma":0.00090748316,"threshold_uncertainty_score":0.028039634},"labels":[],"label_agreement":null},{"id":"W4366403216","doi":"10.1016/j.disc.2023.113444","title":"An extension of the Erdős-Ko-Rado theorem to set-wise 2-intersecting families of perfect matchings","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Extension (predicate logic); Matching (statistics); Discrete mathematics; Set (abstract data type); Graph","score_opus":0.032072646748614375,"score_gpt":0.3197794347018787,"score_spread":0.2877067879532643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366403216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26169738,0.0029494765,0.5691344,0.0032658456,0.0006505439,0.00013529946,0.0007878487,0.0005384867,0.16084073],"genre_scores_gemma":[0.9106945,0.002625873,0.0652601,0.00087327656,0.00073648855,0.00016350497,0.0004301563,0.0001815578,0.019034646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844354,0.00038386136,0.00011107201,0.00044114157,0.00039447384,0.00022601195],"domain_scores_gemma":[0.9961867,0.0020578124,0.00042751792,0.0004890946,0.0004696078,0.00036935665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019129936,0.00073871715,0.0014731165,0.0037210155,0.0022885567,0.0028966446,0.0017974201,0.0016394085,0.0072375317],"category_scores_gemma":[0.008503705,0.0007945979,0.001920461,0.0031124344,0.0025212863,0.008450597,0.004503625,0.0031559095,0.0007894487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029589664,0.000016997425,0.00037896412,0.00005076866,0.000013309433,0.00008616115,0.00017954955,0.0020420763,0.0005164118,0.9892492,0.0011155766,0.006321302],"study_design_scores_gemma":[0.000013497478,0.00001758423,0.00028786756,0.00002685221,0.00002093068,0.00022307796,0.00006788257,0.008992512,0.00033958993,0.9857115,0.004283317,0.000015419177],"about_ca_topic_score_codex":0.0010119462,"about_ca_topic_score_gemma":0.00065097195,"teacher_disagreement_score":0.0072375317,"about_ca_system_score_codex":0.0015705408,"about_ca_system_score_gemma":0.0007824837,"threshold_uncertainty_score":0.024211943},"labels":[],"label_agreement":null},{"id":"W4366818668","doi":"10.1016/j.disc.2023.113476","title":"Some new results on skew frame starters in cyclic groups","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Skew; Frame (networking); Mathematics; Property (philosophy); Construct (python library); Combinatorics; Discrete mathematics; Computer science; Telecommunications","score_opus":0.01660319553253778,"score_gpt":0.23144399839805008,"score_spread":0.2148408028655123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366818668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28285244,0.004500502,0.48839682,0.0028238376,0.0017307054,0.00014411677,0.0006358784,0.0005509087,0.21836483],"genre_scores_gemma":[0.7957443,0.004324375,0.088166304,0.0019750984,0.003803819,0.0002317021,0.00081060006,0.00050264143,0.10444129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955446,0.000096589705,0.000026640688,0.00010246808,0.00012461003,0.00009508614],"domain_scores_gemma":[0.99833316,0.0008489954,0.00021761388,0.00014658054,0.0001889141,0.00026473997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000775568,0.001042106,0.00085426663,0.0031158302,0.0018579838,0.0021467162,0.00096080184,0.001084024,0.014137538],"category_scores_gemma":[0.0025899617,0.00048768646,0.0009952342,0.0027186146,0.0023013898,0.00407999,0.002051207,0.0025132657,0.0014550366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006107849,0.000033320637,0.00022352727,0.00006380681,0.0000099791405,0.00014013509,0.00036551003,0.0014724114,0.0018520402,0.9824155,0.0023207366,0.011041812],"study_design_scores_gemma":[0.00001841022,0.00005625779,0.00026933243,0.00002506893,0.000020041052,0.00012812953,0.00015844627,0.005904893,0.001128053,0.9822329,0.0100354655,0.000023033037],"about_ca_topic_score_codex":0.0007097756,"about_ca_topic_score_gemma":0.0011306092,"teacher_disagreement_score":0.014137538,"about_ca_system_score_codex":0.0009325044,"about_ca_system_score_gemma":0.00047634172,"threshold_uncertainty_score":0.047294796},"labels":[],"label_agreement":null},{"id":"W4367046853","doi":"10.1016/j.disc.2023.113419","title":"A cop-winning strategy on strongly cop-win graphs","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Mathematics; Combinatorics; Monotonic function; Graph; Generalization; Discrete mathematics","score_opus":0.04702494367628042,"score_gpt":0.3317302440295708,"score_spread":0.2847053003532904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367046853","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49293616,0.00042140303,0.36619633,0.0046371603,0.00036034372,0.00048233024,0.0011077748,0.0011386322,0.13271986],"genre_scores_gemma":[0.93229026,0.0002625256,0.03685332,0.0006359131,0.00011455351,0.00029984454,0.00075871556,0.0003288762,0.028455969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983065,0.00042919692,0.000076902055,0.00038784213,0.00027650793,0.00052312994],"domain_scores_gemma":[0.99380505,0.0033858733,0.00034949186,0.0006749577,0.00063721504,0.0011473941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013598003,0.001259594,0.0019796754,0.0014413601,0.0034272254,0.005302795,0.0025722953,0.0026637032,0.012154277],"category_scores_gemma":[0.008200842,0.0011379252,0.001521844,0.0016312031,0.002511374,0.005929686,0.004344071,0.0037385323,0.0021087816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000436412,0.00018918359,0.001330692,0.00020008808,0.00010351152,0.00031917437,0.00069159514,0.007990974,0.0038298904,0.9529003,0.01210106,0.019907152],"study_design_scores_gemma":[0.00006234882,0.000038152128,0.00023251539,0.000018689614,0.000036665322,0.00010788136,0.00017986633,0.026847223,0.0009363515,0.96947753,0.002047711,0.000015095006],"about_ca_topic_score_codex":0.0017875572,"about_ca_topic_score_gemma":0.0021026714,"teacher_disagreement_score":0.012154277,"about_ca_system_score_codex":0.0015920654,"about_ca_system_score_gemma":0.0019661,"threshold_uncertainty_score":0.040660143},"labels":[],"label_agreement":null},{"id":"W4367048681","doi":"10.1016/j.disc.2023.113471","title":"The optimal bound on the 3-independence number obtainable from a polynomial-type method","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Discrete mathematics; Independent set; Distance-regular graph; Independence number; Graph; Wheel graph; Upper and lower bounds; Hamming graph; Cubic graph; Graph power; Line graph; Voltage graph; Hamming code; Algorithm","score_opus":0.05090655308444312,"score_gpt":0.35669398881691744,"score_spread":0.3057874357324743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367048681","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05804636,0.0037611092,0.72125345,0.009221827,0.0014270142,0.00017203345,0.001228578,0.0012357278,0.20365398],"genre_scores_gemma":[0.60387444,0.004583225,0.3271439,0.0031110945,0.002639682,0.0009336951,0.0016536536,0.0020591486,0.054001108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99638605,0.0012279908,0.0001080783,0.0006764277,0.00097523915,0.00062621385],"domain_scores_gemma":[0.9864529,0.010249223,0.0003810693,0.0015105742,0.0005519555,0.00085421064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004114311,0.0026126688,0.002284999,0.0026942627,0.0023123755,0.0035738545,0.005156215,0.0033233613,0.02560736],"category_scores_gemma":[0.018044723,0.0012595766,0.0023919882,0.0030731498,0.004903965,0.008477705,0.005755243,0.01234294,0.00551825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011172284,0.0003370694,0.00090982264,0.00083529606,0.0001274201,0.00014692325,0.00029970982,0.030676227,0.009832975,0.8634678,0.028736776,0.06351275],"study_design_scores_gemma":[0.00013218266,0.000077574165,0.0009322453,0.00012044278,0.00011384778,0.00014268451,0.000047358717,0.15505078,0.005384642,0.828789,0.009143665,0.00006554646],"about_ca_topic_score_codex":0.0017200197,"about_ca_topic_score_gemma":0.0036219626,"teacher_disagreement_score":0.02560736,"about_ca_system_score_codex":0.003075665,"about_ca_system_score_gemma":0.0026552824,"threshold_uncertainty_score":0.08566511},"labels":[],"label_agreement":null},{"id":"W4368372142","doi":"10.1016/j.disc.2023.113473","title":"Metric hypergraphs and metric-line equivalences","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; HORIZON EUROPE Framework Programme; Grantová Agentura České Republiky; Univerzita Karlova v Praze","keywords":"Mathematics; Metric space; Combinatorics; Real line; Metric (unit); Equivalence (formal languages); Equivalence relation; Line (geometry); Intrinsic metric; Injective metric space; Discrete mathematics; Geometry","score_opus":0.04917666888456311,"score_gpt":0.3371808582659878,"score_spread":0.2880041893814247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4368372142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32500613,0.0049427375,0.3808987,0.013012228,0.0011603422,0.00011950337,0.001382614,0.00056252413,0.27291512],"genre_scores_gemma":[0.92817676,0.002375716,0.032893877,0.0016955961,0.0011233782,0.00014001995,0.0009032509,0.00021068535,0.032480706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988238,0.0004067062,0.00006775803,0.00030562835,0.00027442086,0.000121584584],"domain_scores_gemma":[0.9968791,0.001362917,0.0005072892,0.00032464278,0.00052071625,0.0004052796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008650709,0.0005802374,0.0007525094,0.0027158016,0.0019402483,0.0040660882,0.0012460172,0.001671047,0.015586538],"category_scores_gemma":[0.004325111,0.00048024938,0.00070516666,0.0033131451,0.0032450054,0.012448675,0.0030360639,0.0035286846,0.0013278655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009402225,0.000011624069,0.0000838155,0.0000140980255,0.0000036631352,0.000026048463,0.000111237605,0.00017117319,0.00011048621,0.9959074,0.0007447095,0.0028064372],"study_design_scores_gemma":[0.0000052024266,0.0000036534516,0.000094361174,0.0000040639443,0.0000032979756,0.00003548645,0.000062137384,0.0006306263,0.00006433314,0.9966756,0.0024178608,0.0000033562267],"about_ca_topic_score_codex":0.0008885352,"about_ca_topic_score_gemma":0.0006833845,"teacher_disagreement_score":0.015586538,"about_ca_system_score_codex":0.0012058367,"about_ca_system_score_gemma":0.00034158703,"threshold_uncertainty_score":0.052142143},"labels":[],"label_agreement":null},{"id":"W4376111567","doi":"10.1016/j.disc.2023.113489","title":"On the equivalence of linear cyclic and constacyclic codes","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Monomial; Discrete mathematics; Equivalence (formal languages); Finite field; Combinatorics; Equivalence relation; Equivalence class (music); Permutation (music); Linear code; Block code; Algorithm","score_opus":0.03003914856210125,"score_gpt":0.2742312853251732,"score_spread":0.24419213676307197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376111567","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4107838,0.0045250827,0.09783347,0.009191528,0.0011836336,0.00009831232,0.00071181625,0.00023468892,0.4754378],"genre_scores_gemma":[0.9631882,0.0019845455,0.008324686,0.0015155033,0.0011418844,0.000080435086,0.00057206245,0.00012378045,0.023068905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979796,0.00056741404,0.00009349826,0.00034964416,0.00059413014,0.00041575535],"domain_scores_gemma":[0.9920664,0.005389364,0.0005149027,0.0008147617,0.00085494824,0.00035962346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001736087,0.0005040935,0.000772727,0.0018850035,0.0021128966,0.0040977257,0.0011875649,0.0018620269,0.009686327],"category_scores_gemma":[0.0102767665,0.00042909494,0.00071726274,0.002118143,0.005551344,0.008161018,0.003862918,0.004554753,0.000977838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051889336,0.000017426142,0.00011891176,0.0000121657795,0.0000021661049,0.00004068675,0.0001739668,0.00047418688,0.00019206866,0.99412715,0.00071865064,0.0040707616],"study_design_scores_gemma":[0.000013612619,0.000014489135,0.00014678975,0.000012288376,0.0000030492624,0.000038838774,0.000055188662,0.0015005568,0.00019302456,0.99598014,0.0020354248,0.0000065005283],"about_ca_topic_score_codex":0.0016250204,"about_ca_topic_score_gemma":0.0010468868,"teacher_disagreement_score":0.009686327,"about_ca_system_score_codex":0.0017794092,"about_ca_system_score_gemma":0.0010844108,"threshold_uncertainty_score":0.032403946},"labels":[],"label_agreement":null},{"id":"W4379618102","doi":"10.1016/j.disc.2023.113549","title":"On Mneimneh's binomial sum involving harmonic numbers","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Mathematical proof; Harmonic number; Hypergeometric distribution; Binomial (polynomial); Binomial coefficient; Identity (music); Combinatorics; Probabilistic logic; Discrete mathematics; Harmonic; Pure mathematics; Riemann hypothesis; Statistics","score_opus":0.05486940662880617,"score_gpt":0.3320730867935207,"score_spread":0.2772036801647145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379618102","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20353085,0.0023710865,0.102717295,0.0058183135,0.0056631193,0.0000843334,0.0003110944,0.00033186944,0.67917204],"genre_scores_gemma":[0.7914574,0.0015612157,0.017780934,0.0016149692,0.0031536447,0.00011229604,0.0002776434,0.00036562007,0.18367623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883145,0.00036837455,0.000048248115,0.00010023715,0.0004196871,0.00023201075],"domain_scores_gemma":[0.9988902,0.00049839605,0.00010897137,0.00010458987,0.0001663597,0.00023152155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00154027,0.0011720976,0.0013469844,0.0042241435,0.0034156395,0.0034539322,0.0020515907,0.0015891796,0.019793913],"category_scores_gemma":[0.004134714,0.0005372272,0.0008604611,0.0027941414,0.003262389,0.0051789978,0.004923926,0.0035342518,0.0030398995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016350772,0.000012387374,0.00006506336,0.000030344076,0.00000468036,0.00012092871,0.00013350364,0.0003567176,0.00026961556,0.99327564,0.0019746851,0.0037400373],"study_design_scores_gemma":[0.000005669786,0.000007467677,0.0001376345,0.000020679254,0.0000075624725,0.00023705527,0.00007103686,0.003735438,0.000276273,0.9912621,0.0042242645,0.0000148727495],"about_ca_topic_score_codex":0.0008514983,"about_ca_topic_score_gemma":0.0009993212,"teacher_disagreement_score":0.019793913,"about_ca_system_score_codex":0.0013706856,"about_ca_system_score_gemma":0.00057462347,"threshold_uncertainty_score":0.066217184},"labels":[],"label_agreement":null},{"id":"W4383221941","doi":"10.1016/j.disc.2023.113585","title":"Coarse geometry of the cops and robber game","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Tokyo Metropolitan University","keywords":"Mathematics; Combinatorics; Transitive relation; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.03729046438638072,"score_gpt":0.3007197937221685,"score_spread":0.2634293293357878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383221941","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4539765,0.0013322111,0.22613591,0.0036787754,0.0002484441,0.00013588564,0.00054392655,0.00017955399,0.31376877],"genre_scores_gemma":[0.9643415,0.00045495539,0.008629532,0.0001943295,0.00013691655,0.000058637706,0.00017273231,0.000046666803,0.025964752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992448,0.00021695743,0.000028809216,0.000120543635,0.00022946522,0.00015948784],"domain_scores_gemma":[0.9992874,0.00026939512,0.00009999364,0.00007513687,0.000090586305,0.00017758786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061018334,0.00072210724,0.0011978687,0.0015548451,0.0017601991,0.00402623,0.0013168079,0.0012052302,0.011061509],"category_scores_gemma":[0.0024204038,0.0005134242,0.00065521005,0.00091197004,0.0036738825,0.004561352,0.0022638158,0.0020073098,0.00067070103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011619883,0.0000044505923,0.00003797842,0.000007889003,0.0000027832907,0.000018833289,0.000047331352,0.0024651396,0.000096444506,0.9962992,0.0003374799,0.0006709023],"study_design_scores_gemma":[0.000009259687,0.00000852626,0.0001299297,0.000004222214,0.0000034129002,0.000021723454,0.0000676064,0.01136082,0.000076781,0.98688203,0.0014296655,0.000006029815],"about_ca_topic_score_codex":0.0064833867,"about_ca_topic_score_gemma":0.003952078,"teacher_disagreement_score":0.011061509,"about_ca_system_score_codex":0.0021272982,"about_ca_system_score_gemma":0.0010702708,"threshold_uncertainty_score":0.03700447},"labels":[],"label_agreement":null},{"id":"W4386516382","doi":"10.1016/j.disc.2023.113685","title":"New bounds for the average genus and average number of faces of a simple graph","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Conjecture; Simple graph; Graph; Simple (philosophy); Degree (music); Upper and lower bounds; Discrete mathematics","score_opus":0.022763598297855937,"score_gpt":0.2775163825757442,"score_spread":0.2547527842778882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386516382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16365963,0.021413812,0.7020146,0.008365188,0.0018529505,0.00015619167,0.002102254,0.0021706037,0.09826467],"genre_scores_gemma":[0.77457774,0.009424285,0.18795985,0.0021651941,0.0048059034,0.0006420292,0.0017954053,0.0019822265,0.016647363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963068,0.00080603344,0.00018416387,0.0010484664,0.0010446548,0.00060982275],"domain_scores_gemma":[0.9539951,0.034796212,0.0024280744,0.0040288237,0.0020395892,0.0027121985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045918953,0.0039563808,0.0035100838,0.0105569875,0.0027176673,0.0074760085,0.007875183,0.0038190938,0.011384774],"category_scores_gemma":[0.03624994,0.0020710998,0.002656078,0.0063792616,0.0060772714,0.021603307,0.008441215,0.0096168835,0.0016344261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005498914,0.0002983046,0.0046289978,0.0007121527,0.00020380219,0.00027225178,0.000654654,0.061115008,0.009337257,0.8438523,0.016093582,0.062281985],"study_design_scores_gemma":[0.000031379528,0.000074198775,0.0027173988,0.00016974617,0.00013400498,0.00039812195,0.00018220035,0.21461664,0.0033407845,0.7684699,0.009742787,0.0001228639],"about_ca_topic_score_codex":0.0013348579,"about_ca_topic_score_gemma":0.002778769,"teacher_disagreement_score":0.011384774,"about_ca_system_score_codex":0.006720583,"about_ca_system_score_gemma":0.001072878,"threshold_uncertainty_score":0.048761487},"labels":[],"label_agreement":null},{"id":"W4386532515","doi":"10.1016/j.disc.2023.113691","title":"Improved bounds for the triangle case of Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Colleges and Universities; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Government of Ontario","keywords":"Conjecture; Rainbow; Generalization; Mathematics; Combinatorics; Collatz conjecture; Discrete mathematics; Mathematical analysis; Physics","score_opus":0.06628404101517356,"score_gpt":0.36973093046163885,"score_spread":0.3034468894464653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386532515","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1770599,0.0130715165,0.29011896,0.03359535,0.0047117565,0.00026210534,0.0015338517,0.0017630524,0.4778835],"genre_scores_gemma":[0.8924928,0.004851586,0.056216538,0.0039957343,0.0046494277,0.0004496339,0.0013674117,0.0010446727,0.034932256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99499655,0.0011584058,0.00019166147,0.0010095127,0.001534959,0.0011088724],"domain_scores_gemma":[0.9731357,0.016753756,0.001377682,0.0038920129,0.002490582,0.0023502484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008331195,0.0029978529,0.00434757,0.007573764,0.0057092006,0.0070805848,0.008293119,0.0046853055,0.028370008],"category_scores_gemma":[0.04189488,0.0012997455,0.0035197309,0.0061287964,0.010650113,0.021566216,0.012110084,0.016149638,0.004971207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026008507,0.000095152,0.00073447905,0.00020307669,0.0000427364,0.00014945846,0.000369258,0.0041132756,0.0008214992,0.9730301,0.011235081,0.008945909],"study_design_scores_gemma":[0.00003495334,0.000015343468,0.00025347102,0.00005336589,0.000031398227,0.00005373015,0.00007213047,0.018125337,0.0003739404,0.9785088,0.002447975,0.000029489041],"about_ca_topic_score_codex":0.0064977375,"about_ca_topic_score_gemma":0.005259572,"teacher_disagreement_score":0.028370008,"about_ca_system_score_codex":0.006127469,"about_ca_system_score_gemma":0.002411901,"threshold_uncertainty_score":0.094907105},"labels":[],"label_agreement":null},{"id":"W4387135103","doi":"10.1016/j.disc.2023.113708","title":"Binary color-coded magic squares: A study of uniqueness under rotation/reflection, PCA, and LDA analysis","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Sensory Analysis and Statistical Methods","field":"Agricultural and Biological Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Mount Saint Vincent University; Université Laval","keywords":"Magic square; Uniqueness; Mathematics; Combinatorics; MAGIC (telescope); Binary number; Arithmetic; Mathematical analysis; Physics","score_opus":0.0726810977640017,"score_gpt":0.3436417287089666,"score_spread":0.2709606309449649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387135103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19384189,0.0004008025,0.8014026,0.00021931084,0.000044818305,0.0000434292,0.000087496956,0.00013136702,0.0038282634],"genre_scores_gemma":[0.799127,0.0004883658,0.1973515,0.000058807153,0.00009383581,0.0000504633,0.00017766995,0.00018152664,0.0024708575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826306,0.0008154468,0.000048549293,0.0002905062,0.000500519,0.00008188971],"domain_scores_gemma":[0.9866969,0.008642138,0.0012551436,0.0014222213,0.0017334234,0.00025018543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033611646,0.00052563293,0.00056951476,0.0014692834,0.00076940114,0.0014890168,0.0012126461,0.0006744839,0.0016526128],"category_scores_gemma":[0.020476846,0.0003663122,0.0005804371,0.0015791579,0.0029620584,0.0023041056,0.00114808,0.0010933299,0.00025445974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011734532,0.00017139952,0.0122554,0.000549545,0.00024595307,0.0004295235,0.001207383,0.10123136,0.082499675,0.56387675,0.0020748158,0.23428471],"study_design_scores_gemma":[0.000024305868,0.00015365503,0.004947875,0.000031642714,0.00005478211,0.000605872,0.00022419062,0.8822608,0.018713359,0.09147942,0.0014213194,0.00008275158],"about_ca_topic_score_codex":0.0011356008,"about_ca_topic_score_gemma":0.0008800917,"teacher_disagreement_score":0.0033611646,"about_ca_system_score_codex":0.00038417376,"about_ca_system_score_gemma":0.0007032268,"threshold_uncertainty_score":0.017775774},"labels":[],"label_agreement":null},{"id":"W4387427243","doi":"10.1016/j.disc.2023.113718","title":"Improved bound for the Gerver-Ramsey collinearity problem","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Collinearity; Combinatorics; Sequence (biology); Upper and lower bounds; Discrete mathematics; Element (criminal law); Statistics; Mathematical analysis","score_opus":0.044815859182103866,"score_gpt":0.29272348703558326,"score_spread":0.2479076278534794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387427243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13816802,0.011004337,0.5685779,0.024848115,0.0023301032,0.00055561145,0.0041716527,0.0036105209,0.2467338],"genre_scores_gemma":[0.7676101,0.0052180504,0.17282405,0.0048606303,0.00234607,0.0010508,0.0044719987,0.0019056406,0.039712746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99372286,0.0014705842,0.0001938839,0.0012639153,0.0018102576,0.0015385179],"domain_scores_gemma":[0.9766226,0.015455758,0.0007872091,0.003913297,0.0017343218,0.0014867492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048467917,0.0029415567,0.0039185314,0.0028943138,0.0032909191,0.0072935885,0.00848855,0.0041169715,0.036158003],"category_scores_gemma":[0.029316574,0.0013020631,0.0024162359,0.005204794,0.0038679335,0.018716095,0.012869604,0.01123489,0.005688819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021386526,0.00071005645,0.002359294,0.0014159755,0.000313307,0.00045212582,0.0007558349,0.07789452,0.006482376,0.7240678,0.087229595,0.09618049],"study_design_scores_gemma":[0.00022216562,0.00014783775,0.00087569887,0.00014039979,0.00016117253,0.000254408,0.00023620891,0.15899383,0.002727778,0.8211581,0.015007268,0.00007507652],"about_ca_topic_score_codex":0.004172122,"about_ca_topic_score_gemma":0.0050186515,"teacher_disagreement_score":0.036158003,"about_ca_system_score_codex":0.005603037,"about_ca_system_score_gemma":0.0042173075,"threshold_uncertainty_score":0.12096053},"labels":[],"label_agreement":null},{"id":"W4388473630","doi":"10.1016/j.disc.2023.113777","title":"On an f-coloring generalization of linear arboricity of multigraphs","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Arboricity; Combinatorics; Mathematics; Multigraph; Conjecture; Degree (music); Simple (philosophy); Generalization; Vertex (graph theory); Edge coloring; Function (biology); Discrete mathematics; Graph; Planar graph; Line graph; Graph power; Biology; Physics","score_opus":0.04239752126348623,"score_gpt":0.3394515713267526,"score_spread":0.29705405006326635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388473630","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.488325,0.0011146057,0.34732428,0.0037193582,0.00073225476,0.00012336565,0.0007493349,0.0006731869,0.1572387],"genre_scores_gemma":[0.89928234,0.0012459913,0.05990598,0.0013183726,0.00093922706,0.00008347833,0.0006526155,0.00030617273,0.036265932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996605,0.00009484263,0.000011568863,0.000108699154,0.000053240423,0.00007116044],"domain_scores_gemma":[0.9980313,0.0010052277,0.00022181324,0.00026007093,0.00020562654,0.00027601238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044092978,0.0005463575,0.00056758884,0.0010838711,0.0014038961,0.0012451202,0.0010949789,0.0008197669,0.007820442],"category_scores_gemma":[0.0022701987,0.00039197883,0.0011186476,0.0015883475,0.0011966486,0.0023454074,0.0012262943,0.0024785378,0.00056363264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007132159,0.000058424885,0.0009124459,0.000084905856,0.00001685455,0.00038716552,0.00035271145,0.0068756673,0.0033481983,0.96730685,0.006733134,0.013852158],"study_design_scores_gemma":[0.000023063378,0.00003025316,0.0008270991,0.000027690205,0.000016398364,0.00030974657,0.00012842353,0.031354927,0.00068193034,0.9605345,0.006049222,0.000016826461],"about_ca_topic_score_codex":0.0041428055,"about_ca_topic_score_gemma":0.004917027,"teacher_disagreement_score":0.007820442,"about_ca_system_score_codex":0.0012309566,"about_ca_system_score_gemma":0.00042422875,"threshold_uncertainty_score":0.026162028},"labels":[],"label_agreement":null},{"id":"W4389678620","doi":"10.1016/j.disc.2023.113829","title":"Comparability digraphs: An analogue of comparability graphs","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Comparability; Digraph; Mathematics; Lemma (botany); Combinatorics; Comparability graph; Discrete mathematics; Cograph; Graph; Chordal graph; 1-planar graph","score_opus":0.06293062498048756,"score_gpt":0.3512163822837604,"score_spread":0.2882857573032728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389678620","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11607804,0.00093673286,0.7054293,0.002859395,0.0007662226,0.00035026795,0.0022472113,0.0008083163,0.17052442],"genre_scores_gemma":[0.7620593,0.0015308892,0.18510681,0.0017565462,0.0007548952,0.00046141088,0.0029025264,0.0005385398,0.044889096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984554,0.00040564127,0.00010574329,0.0005853994,0.00027717653,0.00017062237],"domain_scores_gemma":[0.9941148,0.0025695614,0.0008646532,0.00097425154,0.0007801656,0.00069658784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001091322,0.00074130704,0.00067631545,0.0024492189,0.0019857509,0.00423745,0.0018512963,0.0014850434,0.017904637],"category_scores_gemma":[0.0053179706,0.0006918467,0.00112171,0.0030420187,0.0031354036,0.009394094,0.0020371675,0.0031650325,0.0013859953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024270079,0.000027456734,0.00013715962,0.000052355117,0.000007810436,0.00009893115,0.00014643894,0.00071967015,0.0005976674,0.9916619,0.0008710364,0.005655386],"study_design_scores_gemma":[0.00001687666,0.000016181597,0.00017993223,0.00001413991,0.0000123293075,0.00016903393,0.00009609601,0.002886235,0.00054620573,0.9848668,0.011186341,0.000009793551],"about_ca_topic_score_codex":0.0016347427,"about_ca_topic_score_gemma":0.0013792181,"teacher_disagreement_score":0.017904637,"about_ca_system_score_codex":0.0015277257,"about_ca_system_score_gemma":0.00085302786,"threshold_uncertainty_score":0.059897006},"labels":[],"label_agreement":null},{"id":"W4391155232","doi":"10.1016/j.disc.2024.113872","title":"A Closure Lemma for tough graphs and Hamiltonian degree conditions","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Lemma (botany); Degree (music); Closure (psychology); Combinatorics; Discrete mathematics","score_opus":0.08390284682561662,"score_gpt":0.36928336599470546,"score_spread":0.28538051916908885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391155232","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3299495,0.0017680721,0.32985285,0.008630935,0.0017358914,0.0002603219,0.0014595232,0.0006559063,0.32568696],"genre_scores_gemma":[0.9363781,0.0009609775,0.031368308,0.0015218168,0.0009903893,0.00025270993,0.0008550266,0.00033751506,0.027335156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988912,0.00022306867,0.00005423578,0.000292803,0.00026572746,0.00027307158],"domain_scores_gemma":[0.9961039,0.0022964797,0.00028348004,0.00031201667,0.00036485752,0.000639252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016072417,0.00081715646,0.0014284818,0.002970849,0.0037402818,0.0035329708,0.0018988377,0.0018557645,0.016087214],"category_scores_gemma":[0.0064464407,0.0007627538,0.0017952356,0.0020893926,0.006451534,0.011960968,0.004793652,0.0062634614,0.0009906419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017491619,0.00001455418,0.00006699381,0.000018871835,0.0000032219834,0.000055235458,0.00018161704,0.00014380895,0.00033158946,0.9971603,0.00088349095,0.0011227519],"study_design_scores_gemma":[0.0000149062025,0.0000066554758,0.00009804011,0.000008377266,0.0000051204415,0.00005526813,0.00009814357,0.0010755715,0.00017451738,0.996858,0.0015971111,0.000008297817],"about_ca_topic_score_codex":0.0020638146,"about_ca_topic_score_gemma":0.0018485702,"teacher_disagreement_score":0.016087214,"about_ca_system_score_codex":0.0014945178,"about_ca_system_score_gemma":0.00088560313,"threshold_uncertainty_score":0.053817034},"labels":[],"label_agreement":null},{"id":"W4391197450","doi":"10.1016/j.disc.2024.113902","title":"An upper bound of the number of distinct powers in binary words","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Binary number; Upper and lower bounds; Combinatorics; Discrete mathematics; Arithmetic","score_opus":0.009969578661615004,"score_gpt":0.2774593452152697,"score_spread":0.2674897665536547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391197450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22146131,0.007856663,0.5816106,0.014937841,0.0026434471,0.00025521062,0.002670416,0.0018421503,0.16672227],"genre_scores_gemma":[0.8291588,0.003532572,0.122422606,0.002352758,0.0029802662,0.000491275,0.0016256712,0.0012211436,0.036214832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99037325,0.0024352851,0.00068921834,0.0024728132,0.002321033,0.001708462],"domain_scores_gemma":[0.9106205,0.07261873,0.0020664786,0.008146207,0.002604587,0.003943545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055024778,0.0025032237,0.003352362,0.0032840848,0.004153464,0.010089329,0.0062873126,0.0045915134,0.019936543],"category_scores_gemma":[0.04566629,0.002376492,0.0027905777,0.0031425762,0.007685971,0.023804883,0.008488449,0.008797626,0.004677365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013504067,0.0002861428,0.0022467307,0.0006569392,0.000098308046,0.00054763525,0.0006920039,0.0135438815,0.012417476,0.92493,0.009963103,0.03326743],"study_design_scores_gemma":[0.00005847786,0.00006894918,0.00054407155,0.00010835286,0.00007021814,0.00055980444,0.00008494443,0.03443425,0.0047031255,0.9524022,0.0069065536,0.00005901069],"about_ca_topic_score_codex":0.00053678243,"about_ca_topic_score_gemma":0.0006621564,"teacher_disagreement_score":0.019936543,"about_ca_system_score_codex":0.0026180795,"about_ca_system_score_gemma":0.0016465166,"threshold_uncertainty_score":0.06669432},"labels":[],"label_agreement":null},{"id":"W4391589431","doi":"10.1016/j.disc.2024.113908","title":"New weighing matrices via partitioned group actions","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Combinatorics; Group (periodic table); Group action; Discrete mathematics; Algebra over a field; Pure mathematics","score_opus":0.012719165053318967,"score_gpt":0.23222383439495878,"score_spread":0.2195046693416398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391589431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09710166,0.00031205223,0.8375578,0.0007092546,0.00064336084,0.000114977076,0.00014987944,0.00052353693,0.06288753],"genre_scores_gemma":[0.6692859,0.00054338475,0.26464292,0.0007782688,0.00048055025,0.00021507774,0.00021899313,0.00043273435,0.0634021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962723,0.000109117005,0.000013513407,0.00008494378,0.000114330294,0.000050917373],"domain_scores_gemma":[0.9992324,0.00022976806,0.00009561767,0.00016207124,0.000113478854,0.00016662075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042946322,0.00068327965,0.0005263707,0.0009791254,0.00066655333,0.0012488996,0.0009785505,0.00101994,0.010502626],"category_scores_gemma":[0.0018184789,0.00047076316,0.00047744683,0.0006995328,0.0013383566,0.0020252976,0.0013016175,0.0014128018,0.0018993465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054328848,0.000049122857,0.00008836457,0.000029903771,0.000011034732,0.00007977542,0.00008201041,0.009474451,0.008227837,0.9588118,0.0020693026,0.021022014],"study_design_scores_gemma":[0.000033432985,0.000049464685,0.00013018916,0.000013840134,0.000009856662,0.00013516478,0.00004616274,0.08227693,0.0027526428,0.90755576,0.006971476,0.000025095924],"about_ca_topic_score_codex":0.00029810905,"about_ca_topic_score_gemma":0.0006455985,"teacher_disagreement_score":0.010502626,"about_ca_system_score_codex":0.00042645194,"about_ca_system_score_gemma":0.000360168,"threshold_uncertainty_score":0.035134792},"labels":[],"label_agreement":null},{"id":"W4391629159","doi":"10.1016/j.disc.2024.113915","title":"On a relationship between the characteristic and matching polynomials of a uniform hypertree","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Canadian Stroke Consortium; China Scholarship Council; Natural Science Foundation of Jiangxi Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Hyperbolic tree; Counterexample; Tree (set theory); Exponent; Conjecture; Boundary (topology); Matching (statistics); Discrete mathematics; Pure mathematics; Hyperbolic geometry","score_opus":0.06615074844130979,"score_gpt":0.3378207297208488,"score_spread":0.271669981279539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391629159","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7165669,0.0009932282,0.2417311,0.0020761369,0.00023062358,0.000049411643,0.00035741995,0.0002475044,0.037747655],"genre_scores_gemma":[0.9722014,0.0007324269,0.020499615,0.00024739618,0.00029454267,0.000024155179,0.00014616699,0.00011324236,0.0057410663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934465,0.00019076598,0.000026309779,0.0001582388,0.00012717696,0.00015280968],"domain_scores_gemma":[0.9904621,0.0053970073,0.0017199294,0.0005895791,0.0007625428,0.0010688066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014186032,0.00041526632,0.0008460142,0.0033592018,0.0013704775,0.0025490532,0.001408684,0.0009828265,0.0057669412],"category_scores_gemma":[0.012722343,0.00043860613,0.00061665644,0.0035040127,0.0042023757,0.0074853306,0.0020916117,0.0027986718,0.0005083205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006327445,0.00002424238,0.0009780657,0.00003301809,0.000005378605,0.0000585409,0.00024615257,0.0022103577,0.0010798977,0.9876316,0.00083164405,0.0068379175],"study_design_scores_gemma":[0.0000130992585,0.000033336055,0.0007524489,0.000016793527,0.000011037521,0.00015969216,0.0001588522,0.019653378,0.0004350838,0.9774719,0.0012722005,0.000022236101],"about_ca_topic_score_codex":0.0019208365,"about_ca_topic_score_gemma":0.001874129,"teacher_disagreement_score":0.0057669412,"about_ca_system_score_codex":0.001413085,"about_ca_system_score_gemma":0.000737708,"threshold_uncertainty_score":0.019292295},"labels":[],"label_agreement":null},{"id":"W4392919062","doi":"10.1016/j.disc.2024.113968","title":"On extremal and near-extremal self-dual ternary codes","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Ternary operation; Combinatorics; Dual (grammatical number); Discrete mathematics; Computer science","score_opus":0.012475497688923032,"score_gpt":0.24352448114496758,"score_spread":0.23104898345604455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392919062","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62489134,0.00080215087,0.3215471,0.00049480435,0.00010678548,0.00010813154,0.00068486086,0.0003087428,0.051056158],"genre_scores_gemma":[0.8627208,0.00083614996,0.12956473,0.00014015536,0.00010526243,0.0001275162,0.0008330995,0.00008918916,0.0055830106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994848,0.0001377011,0.000036143672,0.000060975144,0.00019259726,0.00008787164],"domain_scores_gemma":[0.99830914,0.0009786307,0.00018897622,0.00022286641,0.00021995716,0.000080442216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005494174,0.00042919515,0.00044432824,0.0026901094,0.0009327822,0.001569886,0.00059809815,0.0006274203,0.0040084464],"category_scores_gemma":[0.004186683,0.00024336114,0.00044667203,0.0017116577,0.0010567729,0.0017053158,0.0011838271,0.00081465655,0.000558448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026140385,0.00015258374,0.0029449866,0.0002600021,0.000023640938,0.00031246347,0.00029797392,0.058996852,0.01465908,0.8343234,0.0027251963,0.08504244],"study_design_scores_gemma":[0.000023741517,0.00009776753,0.00096752116,0.00010766804,0.000022678958,0.0006228698,0.00021644511,0.294521,0.014439056,0.68466973,0.0042656395,0.000045854325],"about_ca_topic_score_codex":0.0002742023,"about_ca_topic_score_gemma":0.00060006895,"teacher_disagreement_score":0.0040084464,"about_ca_system_score_codex":0.00061208045,"about_ca_system_score_gemma":0.0005999846,"threshold_uncertainty_score":0.013409555},"labels":[],"label_agreement":null},{"id":"W4393216900","doi":"10.1016/j.disc.2024.114005","title":"A note on highly connected K2,-minor free graphs","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Combinatorics; Minor (academic); Discrete mathematics","score_opus":0.022923630332942358,"score_gpt":0.30634562913222824,"score_spread":0.28342199879928587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393216900","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3489698,0.015237137,0.17543267,0.043614347,0.008199584,0.00015476866,0.0017615311,0.0016098513,0.4050203],"genre_scores_gemma":[0.8575473,0.006875264,0.046036832,0.0046905535,0.005258672,0.00006678768,0.0009560961,0.0004773362,0.07809119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997861,0.00004771452,0.000009849293,0.00006836452,0.000057863832,0.00003001833],"domain_scores_gemma":[0.998865,0.0006792539,0.000081404,0.00014018602,0.00010274339,0.00013133837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003558073,0.0006938365,0.0005075282,0.00076819595,0.0017939549,0.0014521858,0.0009557702,0.00080023764,0.0064316513],"category_scores_gemma":[0.0020560806,0.00027854595,0.00043858838,0.0012374783,0.0012263551,0.0031326269,0.0016010398,0.0018406073,0.0010602837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026703125,0.00006755613,0.0018874098,0.0005453477,0.000043822987,0.0014122033,0.0007117519,0.008417939,0.015670562,0.84142363,0.07907383,0.050478823],"study_design_scores_gemma":[0.000023668259,0.000057855417,0.002512968,0.00004188517,0.00003481548,0.0009797231,0.00025424964,0.009161197,0.0032706866,0.9051039,0.07853087,0.000028243307],"about_ca_topic_score_codex":0.0017444729,"about_ca_topic_score_gemma":0.0030368532,"teacher_disagreement_score":0.0064316513,"about_ca_system_score_codex":0.0006823263,"about_ca_system_score_gemma":0.00031330623,"threshold_uncertainty_score":0.021515965},"labels":[],"label_agreement":null},{"id":"W4394742206","doi":"10.1016/j.disc.2024.114029","title":"Wickets in 3-uniform hypergraphs","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund","keywords":"Hypergraph; Mathematics; Combinatorics; Vertex (graph theory); Conjecture; Row; Discrete mathematics; Graph; Computer science","score_opus":0.026816762002405025,"score_gpt":0.31156306649351023,"score_spread":0.2847463044911052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394742206","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5271712,0.0027090157,0.2135711,0.0034686069,0.0010125064,0.00008265172,0.0005186193,0.00069168274,0.25077465],"genre_scores_gemma":[0.9162193,0.0011768824,0.024359357,0.0008193252,0.0006292723,0.00013878618,0.00027532893,0.0003687034,0.056013107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990038,0.00037293264,0.000061003022,0.00017508747,0.00019238952,0.00019481445],"domain_scores_gemma":[0.99786586,0.0008563089,0.00030556825,0.00021075757,0.00025093637,0.00051052216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011282832,0.00086169917,0.0012218708,0.0031785513,0.0032737383,0.0049546203,0.0015317067,0.0015926288,0.0108001195],"category_scores_gemma":[0.0033538516,0.000929118,0.0009774682,0.0025880667,0.0040645245,0.009099683,0.0030998734,0.003308763,0.0014511725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008773962,0.000008120619,0.000040027237,0.00000882235,0.0000022005513,0.00003010103,0.00009380749,0.0002199666,0.00013827722,0.9983891,0.000294586,0.0007662067],"study_design_scores_gemma":[0.0000040039677,0.0000030961457,0.000048337366,0.0000068649083,0.0000024345816,0.000041714506,0.0000648487,0.0011719754,0.000097004486,0.9976452,0.00091029046,0.000004102427],"about_ca_topic_score_codex":0.0018773242,"about_ca_topic_score_gemma":0.0021252858,"teacher_disagreement_score":0.0108001195,"about_ca_system_score_codex":0.0015432832,"about_ca_system_score_gemma":0.000597897,"threshold_uncertainty_score":0.03613001},"labels":[],"label_agreement":null},{"id":"W4396815724","doi":"10.1016/j.disc.2024.114332","title":"Bivariate P- and Q-polynomial structures of the association schemes based on attenuated spaces","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Canadian Nautical Research Society; Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Bivariate analysis; Univariate; Polynomial; Kravchuk polynomials; Eigenvalues and eigenvectors; Association scheme; Pure mathematics; Algebra over a field; Orthogonal polynomials; Combinatorics; Discrete mathematics; Difference polynomials; Macdonald polynomials; Multivariate statistics; Mathematical analysis; Statistics","score_opus":0.01673573007617401,"score_gpt":0.2759600894853987,"score_spread":0.25922435940922467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396815724","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57832307,0.00033364273,0.3734496,0.00045796623,0.00013438257,0.00011485859,0.00027081306,0.00016948066,0.046746206],"genre_scores_gemma":[0.9435298,0.0003274467,0.039840482,0.0000779514,0.00010867936,0.00007595499,0.00021504525,0.00006204257,0.015762731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987398,0.00025560393,0.000077333105,0.00020923652,0.0004715029,0.00024649478],"domain_scores_gemma":[0.9975097,0.00055513496,0.0006172211,0.00046677244,0.0005046017,0.00034656582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011160981,0.0004253533,0.00044847504,0.002260457,0.0015775701,0.003002875,0.0008380086,0.0004902563,0.0068448377],"category_scores_gemma":[0.0036637695,0.00037260112,0.0006939701,0.0016442796,0.0032669012,0.005703965,0.002188491,0.0018381121,0.0011827878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018420686,0.000012361627,0.00018307018,0.000011364868,0.0000020709106,0.000031699226,0.00015049323,0.0009766625,0.000882889,0.9938719,0.0001348808,0.0037241324],"study_design_scores_gemma":[0.000013322149,0.00006808556,0.0007283504,0.000022202894,0.000013304463,0.0002559009,0.00025642762,0.023785103,0.0033832118,0.96511245,0.0063186833,0.000042959542],"about_ca_topic_score_codex":0.00074585807,"about_ca_topic_score_gemma":0.00061172235,"teacher_disagreement_score":0.0068448377,"about_ca_system_score_codex":0.0011704654,"about_ca_system_score_gemma":0.00079006585,"threshold_uncertainty_score":0.022898316},"labels":[],"label_agreement":null},{"id":"W4399425163","doi":"10.1016/j.disc.2024.114103","title":"Circular external difference families, graceful labellings and cyclotomy","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.01264351024282437,"score_gpt":0.23448091944222596,"score_spread":0.2218374091994016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399425163","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42622668,0.00060953526,0.5311974,0.0010981779,0.00015530488,0.00010828759,0.00052154314,0.0006020388,0.039481066],"genre_scores_gemma":[0.9436374,0.00025451346,0.04702761,0.00026281527,0.000051158724,0.0001033339,0.0002755229,0.00010193036,0.008285738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991605,0.00014210482,0.00006374089,0.00020777692,0.00022575383,0.00020022418],"domain_scores_gemma":[0.99758685,0.0011273207,0.00030451687,0.00060917775,0.0002006587,0.00017144746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008565318,0.0003025191,0.00034802148,0.0007902827,0.001138571,0.0014436617,0.0005215928,0.0007346376,0.0037253224],"category_scores_gemma":[0.0035578841,0.0002002602,0.00056995463,0.0008439815,0.0025440701,0.0028587244,0.0017884448,0.001383964,0.00053178536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010331471,0.000020451953,0.0005648207,0.00005126633,0.000005378553,0.00009511482,0.00025275646,0.0036741146,0.0041739317,0.97110206,0.00080703537,0.01914966],"study_design_scores_gemma":[0.0000308866,0.00008225515,0.00035435765,0.00004121417,0.000013234491,0.0003774687,0.00015501112,0.017291108,0.013725238,0.9556283,0.012263945,0.000037103247],"about_ca_topic_score_codex":0.0003996746,"about_ca_topic_score_gemma":0.00033236557,"teacher_disagreement_score":0.0037253224,"about_ca_system_score_codex":0.0013173305,"about_ca_system_score_gemma":0.00056735787,"threshold_uncertainty_score":0.012462437},"labels":[],"label_agreement":null},{"id":"W4399763050","doi":"10.1016/j.disc.2024.114139","title":"Some progress on the Aharoni–Korman conjecture","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Defence Academy","keywords":"Conjecture; Mathematics; Combinatorics; Mathematical economics; Discrete mathematics","score_opus":0.035538812438107525,"score_gpt":0.3289845647392108,"score_spread":0.29344575230110326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399763050","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11234529,0.056575194,0.085049324,0.11288747,0.017864889,0.000054092412,0.0008102584,0.0005160001,0.6138975],"genre_scores_gemma":[0.8291301,0.028806634,0.03959686,0.01261995,0.025694499,0.00013922759,0.0011052367,0.00035088678,0.062556535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750936,0.0008532185,0.00016054511,0.00046986982,0.0006718643,0.00033519816],"domain_scores_gemma":[0.9906536,0.0059615276,0.00050539104,0.0013239029,0.0010091653,0.0005463647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00789499,0.0014743163,0.0022497817,0.0026514034,0.00425835,0.005006176,0.002354134,0.0033407947,0.009090882],"category_scores_gemma":[0.015317059,0.0007237028,0.0015827488,0.002952161,0.0096933,0.019163935,0.005586515,0.009534893,0.0026105188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056000776,0.00002451472,0.000120830104,0.00009651606,0.000009992528,0.000053054406,0.00015834242,0.0004053759,0.00012454898,0.98738396,0.005738344,0.00582851],"study_design_scores_gemma":[0.000014062984,0.000005177046,0.00006878197,0.000027216864,0.0000040563896,0.0000225145,0.00003719565,0.0007630473,0.00009017832,0.9922456,0.006713923,0.000008233644],"about_ca_topic_score_codex":0.0019638033,"about_ca_topic_score_gemma":0.0011981906,"teacher_disagreement_score":0.009090882,"about_ca_system_score_codex":0.0037578782,"about_ca_system_score_gemma":0.0019360865,"threshold_uncertainty_score":0.041753232},"labels":[],"label_agreement":null},{"id":"W4400720472","doi":"10.1016/j.disc.2024.114154","title":"A closure for Hamilton-connectedness in {K1,3,Γ3}-free graphs","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Grantová Agentura České Republiky","keywords":"Mathematics; Closure (psychology); Social connectedness; Combinatorics; Discrete mathematics","score_opus":0.025501284242576465,"score_gpt":0.31533044034136765,"score_spread":0.2898291560987912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400720472","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80516404,0.0005988948,0.1015609,0.001925807,0.00028969583,0.00023991468,0.0017896551,0.0007205115,0.087710686],"genre_scores_gemma":[0.96771127,0.00026119803,0.01579147,0.0004261654,0.00013501357,0.00017062611,0.0013874028,0.00022778881,0.013889134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928635,0.00008838405,0.0000461057,0.00024625316,0.00013341977,0.0001995383],"domain_scores_gemma":[0.9970855,0.0013655601,0.00037842224,0.00020121942,0.0002927351,0.0006764834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066551747,0.00074521545,0.0010475762,0.0022130578,0.0035984002,0.004641403,0.00167477,0.0016022559,0.012949677],"category_scores_gemma":[0.0025970528,0.00073821854,0.0013539187,0.0014228935,0.0032725127,0.0046363235,0.0026764888,0.0032854134,0.0010315385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023864294,0.00008744456,0.00072264334,0.00012658238,0.000020914646,0.00040048463,0.0015038626,0.0007634368,0.0040457523,0.98358786,0.0024633573,0.0060388814],"study_design_scores_gemma":[0.00006841369,0.000033621433,0.0006025457,0.000038400325,0.000021316228,0.00023631046,0.0005879437,0.0038019752,0.0015328837,0.9894509,0.0036028095,0.000023004111],"about_ca_topic_score_codex":0.0033391295,"about_ca_topic_score_gemma":0.0026971316,"teacher_disagreement_score":0.012949677,"about_ca_system_score_codex":0.0014003956,"about_ca_system_score_gemma":0.00092177297,"threshold_uncertainty_score":0.043320954},"labels":[],"label_agreement":null},{"id":"W4400956666","doi":"10.1016/j.disc.2024.114179","title":"m-Distance-regular graphs and their relation to multivariate P-polynomial association schemes","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique; Agence Nationale de la Recherche; American Heart Association","keywords":"Mathematics; Association scheme; Combinatorics; Relation (database); Multivariate statistics; Discrete mathematics; Polynomial; Statistics; Computer science","score_opus":0.010421698671277943,"score_gpt":0.23907503008408365,"score_spread":0.2286533314128057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400956666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33553597,0.00074110815,0.6211408,0.0012579935,0.00012808705,0.000097473334,0.0005794484,0.00034917728,0.040170018],"genre_scores_gemma":[0.90722215,0.00068084785,0.0810274,0.00030454464,0.0001815949,0.00008543336,0.0003613451,0.000110854715,0.010025879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984719,0.00039099948,0.00008308799,0.0004352067,0.0003865327,0.00023229448],"domain_scores_gemma":[0.99430674,0.0020070954,0.0011560997,0.0012627075,0.0007141118,0.0005531891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012658879,0.00036882816,0.0004803199,0.0017558626,0.0014681184,0.0021646617,0.0010888708,0.0008043545,0.0043257126],"category_scores_gemma":[0.0062220707,0.00036144824,0.00060776796,0.002625245,0.0026294508,0.0048137233,0.00233374,0.0020586692,0.0007251253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028751921,0.000010636213,0.00041404206,0.000024272947,0.000004995048,0.000054240467,0.00015686725,0.002641247,0.00077944394,0.98904955,0.00056544127,0.006270494],"study_design_scores_gemma":[0.000013693917,0.000030461415,0.0006419569,0.000017850596,0.000013624759,0.00028257837,0.00014429953,0.023195734,0.0010813153,0.9635965,0.010956016,0.000025973854],"about_ca_topic_score_codex":0.001060501,"about_ca_topic_score_gemma":0.00071893324,"teacher_disagreement_score":0.0043257126,"about_ca_system_score_codex":0.0012957428,"about_ca_system_score_gemma":0.0006334816,"threshold_uncertainty_score":0.0144709945},"labels":[],"label_agreement":null},{"id":"W4401581634","doi":"10.1016/j.disc.2024.114204","title":"Cut-down de Bruijn sequences","year":2024,"lang":"nl","type":"article","venue":"Discrete Mathematics","topic":"Fractal and DNA sequence analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Prince Edward Island","funders":"","keywords":"De Bruijn sequence; Mathematics; Combinatorics; Discrete mathematics; De Bruijn graph","score_opus":0.011619641876331518,"score_gpt":0.27638293973404293,"score_spread":0.2647632978577114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401581634","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59079075,0.0015997561,0.3270201,0.0011057656,0.00041530107,0.00007887939,0.0005161166,0.00045650342,0.0780168],"genre_scores_gemma":[0.9267609,0.0006705361,0.044894684,0.00031673897,0.00020408024,0.000066348926,0.00039583573,0.00018207618,0.026508793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949455,0.000097197095,0.000026154406,0.00010308431,0.00019154737,0.000087291424],"domain_scores_gemma":[0.9977824,0.001207,0.0002204859,0.00027509718,0.00032265956,0.00019227914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043684422,0.00043717204,0.00041609965,0.0020365529,0.0007622804,0.0014756486,0.000436522,0.0007435672,0.005570799],"category_scores_gemma":[0.0037120075,0.00031870123,0.00043766722,0.00079178193,0.0011823379,0.001723746,0.0009430957,0.0013802989,0.0008427021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008173766,0.000025394565,0.00035118236,0.00005665129,0.0000104486,0.00020677567,0.00019130553,0.004754951,0.009599817,0.9675886,0.0015452099,0.015587942],"study_design_scores_gemma":[0.000018208088,0.000045793593,0.0005874174,0.000027449874,0.000010900348,0.00048325327,0.00006972462,0.030088384,0.007352556,0.9528646,0.008430221,0.000021644426],"about_ca_topic_score_codex":0.00035790468,"about_ca_topic_score_gemma":0.00043690126,"teacher_disagreement_score":0.005570799,"about_ca_system_score_codex":0.0005725051,"about_ca_system_score_gemma":0.0002965678,"threshold_uncertainty_score":0.018636167},"labels":[],"label_agreement":null},{"id":"W4401872514","doi":"10.1016/j.disc.2024.114220","title":"Pursuit-evasion in graphs: Zombies, lazy zombies and a survivor","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Gothic Literature and Media Analysis","field":"Social Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Ottawa; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Evasion (ethics); Pursuit-evasion; Combinatorics; Discrete mathematics; Mathematical optimization","score_opus":0.017848020287703395,"score_gpt":0.303472337255579,"score_spread":0.2856243169678756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401872514","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.721917,0.0039646174,0.1994167,0.017936613,0.00016051931,0.00008676587,0.0002686638,0.0002721847,0.055976916],"genre_scores_gemma":[0.98961335,0.0005906002,0.0053659678,0.00016272189,0.000045431796,0.000019810599,0.000031290725,0.000023294533,0.00414755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930656,0.0003353155,0.00001965697,0.00012589373,0.00007994618,0.00013260114],"domain_scores_gemma":[0.9929155,0.004514282,0.0009953172,0.00076422904,0.00035027965,0.0004604603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016747031,0.0004280401,0.0009435954,0.0014124002,0.0021985131,0.0031142535,0.0010312245,0.0019230911,0.0059733465],"category_scores_gemma":[0.013549576,0.00035827525,0.0006353844,0.0016672759,0.005915997,0.0058138436,0.002657746,0.0022520765,0.00025565055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108853725,0.000028100796,0.0015286803,0.0000928193,0.00004236867,0.00008302576,0.0011501648,0.01047527,0.00029028155,0.97084934,0.0032497984,0.012101337],"study_design_scores_gemma":[0.00004233474,0.000027189202,0.00062057894,0.000034895784,0.000027038634,0.000086781045,0.0008137671,0.032714244,0.00013979427,0.96255034,0.0029262162,0.00001686547],"about_ca_topic_score_codex":0.004986919,"about_ca_topic_score_gemma":0.003958431,"teacher_disagreement_score":0.0059733465,"about_ca_system_score_codex":0.0013233123,"about_ca_system_score_gemma":0.0008770014,"threshold_uncertainty_score":0.019982815},"labels":[],"label_agreement":null},{"id":"W4401978764","doi":"10.1016/j.disc.2025.114957","title":"A power sum expansion for the Kromatic symmetric function","year":2025,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Function (biology); Power (physics); Physics; Thermodynamics","score_opus":0.04934159758442348,"score_gpt":0.3407955983862778,"score_spread":0.29145400080185435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401978764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2108969,0.00087634224,0.68416965,0.00086527516,0.0005028829,0.000105300045,0.00027990981,0.00039365867,0.101910114],"genre_scores_gemma":[0.8107714,0.0011783671,0.15501195,0.00047005175,0.000502199,0.00015401884,0.00021812218,0.0003860135,0.03130786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999757,0.00004855902,0.000007928047,0.00004164174,0.00009772551,0.000047147045],"domain_scores_gemma":[0.9996393,0.00015739839,0.000033761782,0.000046248308,0.00008618661,0.000037176018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046956807,0.0006175684,0.000335459,0.0014290158,0.0005667312,0.0009181057,0.00074983685,0.00044972743,0.0039936514],"category_scores_gemma":[0.0017429471,0.00018756227,0.0003931239,0.0011142939,0.0020192782,0.0023181536,0.00096642546,0.0022290067,0.0013377806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026111771,0.000017128436,0.00021726434,0.000034653527,0.000002802978,0.000103329716,0.00014302142,0.0024171134,0.0045350473,0.9697308,0.001675601,0.021097122],"study_design_scores_gemma":[0.000012919157,0.000054195447,0.0005794177,0.000038576873,0.0000097793,0.00035746113,0.00009149446,0.053606838,0.008384515,0.9202935,0.016526496,0.000044851],"about_ca_topic_score_codex":0.00052457035,"about_ca_topic_score_gemma":0.0005078771,"teacher_disagreement_score":0.0039936514,"about_ca_system_score_codex":0.0007671754,"about_ca_system_score_gemma":0.00034286777,"threshold_uncertainty_score":0.013360143},"labels":[],"label_agreement":null},{"id":"W4402137504","doi":"10.1016/j.disc.2024.114195","title":"Induced subgraphs and tree decompositions VI. Graphs with 2-cutsets","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Government of Ontario; National Science Foundation","keywords":"Treewidth; Combinatorics; Mathematics; Partial k-tree; Tree-depth; Clique-sum; 1-planar graph; Tree decomposition; Discrete mathematics; Chordal graph; Bounded function; Pathwidth; Clique-width; Graph; Line graph; Voltage graph","score_opus":0.020182274357420475,"score_gpt":0.29895184390847096,"score_spread":0.2787695695510505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402137504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4040571,0.007789752,0.4121468,0.0035553642,0.0006342278,0.0002652186,0.0032266576,0.00060529466,0.1677195],"genre_scores_gemma":[0.7946732,0.0036623352,0.14419904,0.0007500641,0.00042359388,0.0001667678,0.003565666,0.0002705257,0.05228876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996333,0.00007621595,0.000022331735,0.0001045377,0.00009716702,0.00006651382],"domain_scores_gemma":[0.9992306,0.0002804844,0.0001785515,0.00008157752,0.00011675805,0.000112053094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027233709,0.000500766,0.00044530394,0.0018733962,0.000758352,0.002274245,0.00058613933,0.0008974851,0.009560627],"category_scores_gemma":[0.0013302421,0.00055721344,0.00079577917,0.0018630445,0.0009725041,0.0019581574,0.0009926453,0.0018339613,0.0013090078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009103332,0.00005913045,0.00092236436,0.00024424074,0.000047774683,0.00034357185,0.00047258526,0.004670454,0.0072182803,0.9435721,0.008558463,0.03379999],"study_design_scores_gemma":[0.000015012972,0.000018113229,0.0013417238,0.00006654769,0.000033248387,0.00046047708,0.00023870287,0.010963011,0.0015912463,0.9733257,0.011933552,0.000012635272],"about_ca_topic_score_codex":0.0013030041,"about_ca_topic_score_gemma":0.0016901394,"teacher_disagreement_score":0.009560627,"about_ca_system_score_codex":0.0007270271,"about_ca_system_score_gemma":0.0003361034,"threshold_uncertainty_score":0.031983435},"labels":[],"label_agreement":null},{"id":"W4402455871","doi":"10.1016/j.disc.2024.114253","title":"Adversarial graph burning densities","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; University of Manitoba","keywords":"Mathematics; Combinatorics; Adversarial system; Graph; Discrete mathematics; Artificial intelligence; Computer science","score_opus":0.010629957919076755,"score_gpt":0.23862935155523418,"score_spread":0.22799939363615743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402455871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10591947,0.00057315297,0.86892533,0.0015027684,0.00014035722,0.0001975946,0.00043492648,0.00076231,0.02154399],"genre_scores_gemma":[0.9096173,0.000551738,0.06799741,0.0004987698,0.000098629585,0.0002917951,0.00048818876,0.00023290615,0.020223236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983481,0.0005242436,0.00006283663,0.0004310778,0.0003481806,0.00028549254],"domain_scores_gemma":[0.9866881,0.009531248,0.0008928365,0.0015350686,0.00068544503,0.00066718436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002636985,0.0011587704,0.0016216742,0.00093581906,0.0011180089,0.0018655412,0.003757173,0.0023772405,0.008745988],"category_scores_gemma":[0.021011716,0.00075592013,0.0011948,0.00068171695,0.0027509835,0.0051201913,0.0031730537,0.0033609744,0.0010421586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023182371,0.00008585262,0.001266802,0.00011062766,0.000053616066,0.00020513503,0.00021742337,0.66300404,0.0027512163,0.3157581,0.004095196,0.012220176],"study_design_scores_gemma":[0.00001789207,0.000033032284,0.0001596573,0.000016775008,0.000013962093,0.00007318174,0.000032586635,0.91183335,0.00079384947,0.085835606,0.0011756388,0.000014529776],"about_ca_topic_score_codex":0.0033443752,"about_ca_topic_score_gemma":0.0035604802,"teacher_disagreement_score":0.008745988,"about_ca_system_score_codex":0.0027857863,"about_ca_system_score_gemma":0.0010804341,"threshold_uncertainty_score":0.029258251},"labels":[],"label_agreement":null},{"id":"W4403088534","doi":"10.1016/j.disc.2024.114278","title":"Linear colouring of binomial random graphs","year":2024,"lang":"ca","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Binomial (polynomial); Discrete mathematics; Statistics","score_opus":0.027235953647663784,"score_gpt":0.32104101288585546,"score_spread":0.29380505923819167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403088534","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90863967,0.000560058,0.079450116,0.0009167635,0.00007542001,0.000059096306,0.00015950055,0.00029777744,0.009841583],"genre_scores_gemma":[0.99269366,0.00020189026,0.0044777174,0.000117546006,0.000042251675,0.00004377411,0.00009549991,0.000041802385,0.0022859313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993229,0.00029147044,0.000010780341,0.0001113173,0.00008272762,0.00018090219],"domain_scores_gemma":[0.9928342,0.004613966,0.0008780362,0.00037875533,0.00049974635,0.0007953151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014453703,0.00032732828,0.00041867877,0.0014986878,0.0007909389,0.0011475191,0.0010378031,0.00055012456,0.002808],"category_scores_gemma":[0.00790089,0.00035409423,0.00034897585,0.0005305343,0.002704301,0.0015311218,0.0009245648,0.00088793266,0.00029003806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006041404,0.00015828326,0.01602439,0.0002409337,0.00008254372,0.0005966659,0.00059433747,0.14241031,0.019708425,0.80084896,0.0052901288,0.013440875],"study_design_scores_gemma":[0.00007767488,0.0001085859,0.0041207466,0.00003816583,0.000022481898,0.00026354572,0.00015622207,0.7081417,0.003188154,0.28255576,0.0012736785,0.000053319225],"about_ca_topic_score_codex":0.003689486,"about_ca_topic_score_gemma":0.0038169788,"teacher_disagreement_score":0.003689486,"about_ca_system_score_codex":0.0018280143,"about_ca_system_score_gemma":0.00054840004,"threshold_uncertainty_score":0.013263226},"labels":[],"label_agreement":null},{"id":"W4403094255","doi":"10.1016/j.disc.2024.114272","title":"The hat guessing game on cactus graphs and cycles","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Cactus; Combinatorics; Discrete mathematics; Biology","score_opus":0.01584206968029182,"score_gpt":0.2596635021553093,"score_spread":0.2438214324750175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403094255","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8448182,0.00052760256,0.12868193,0.0013615298,0.000067493456,0.0001568118,0.00040192046,0.0002884609,0.023696078],"genre_scores_gemma":[0.96722925,0.00027215565,0.026697025,0.00019330131,0.00003958159,0.00007334904,0.00032334146,0.00006476982,0.0051072473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985121,0.0005219717,0.0000783173,0.0002981023,0.00019050219,0.00039909824],"domain_scores_gemma":[0.99009025,0.0073248683,0.00081001496,0.0006676314,0.00037054977,0.0007365577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011556911,0.0008662579,0.0009866294,0.0012005366,0.0016427798,0.002171348,0.0015771316,0.001717334,0.0039594127],"category_scores_gemma":[0.010127353,0.00053422136,0.0007407015,0.001154086,0.003158405,0.0048919567,0.0016876694,0.0016138346,0.0003618585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009069778,0.00016555924,0.0076813176,0.00024021784,0.00009142265,0.00047150618,0.0012531253,0.140589,0.005262935,0.8106755,0.005455567,0.027206995],"study_design_scores_gemma":[0.000093732684,0.0001104935,0.001198346,0.000054260217,0.000038275077,0.00022910959,0.00034900906,0.33301064,0.00268131,0.6588727,0.0033082536,0.00005380906],"about_ca_topic_score_codex":0.006657922,"about_ca_topic_score_gemma":0.004329849,"teacher_disagreement_score":0.006657922,"about_ca_system_score_codex":0.0029459149,"about_ca_system_score_gemma":0.0010178374,"threshold_uncertainty_score":0.021374226},"labels":[],"label_agreement":null},{"id":"W4403196330","doi":"10.1016/j.disc.2024.114275","title":"Turán numbers and switching","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Heilbronn Institute for Mathematical Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.02275104926666183,"score_gpt":0.3144958308490341,"score_spread":0.29174478158237227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403196330","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70830923,0.0019133029,0.12671597,0.0014096211,0.00030786797,0.000041236064,0.000248672,0.00033607704,0.1607181],"genre_scores_gemma":[0.9836663,0.0003243185,0.009680986,0.00016694676,0.00020599746,0.00004688078,0.00011236155,0.000045085362,0.0057510054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993705,0.00014584778,0.000028002076,0.0001349529,0.00015597258,0.00016475227],"domain_scores_gemma":[0.99804,0.00091981096,0.00027687816,0.00024713078,0.00020346948,0.00031278716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061670115,0.00047192976,0.0005100189,0.0020550976,0.0011026006,0.0018755274,0.0006656227,0.00067247206,0.0050327554],"category_scores_gemma":[0.0030560596,0.00023434332,0.0005587297,0.00085625466,0.00296845,0.0021657126,0.0013684715,0.0015510102,0.00048396876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022320697,0.000010415846,0.00034514753,0.000021293114,0.0000045348543,0.000030979347,0.00011382594,0.0029787067,0.0010066198,0.98871267,0.0007986667,0.00595478],"study_design_scores_gemma":[0.000009240049,0.000028401051,0.0010345118,0.000020556485,0.0000054182287,0.000096539676,0.000071724484,0.023523493,0.0009317441,0.96937144,0.0048885127,0.000018530403],"about_ca_topic_score_codex":0.00081897166,"about_ca_topic_score_gemma":0.00068884075,"teacher_disagreement_score":0.0050327554,"about_ca_system_score_codex":0.0011479176,"about_ca_system_score_gemma":0.0002632785,"threshold_uncertainty_score":0.016836226},"labels":[],"label_agreement":null},{"id":"W4403603865","doi":"10.1016/j.disc.2024.114295","title":"On the size and structure of t-representable sumsets","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.019409441234399576,"score_gpt":0.29332305517473106,"score_spread":0.2739136139403315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403603865","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88838583,0.00089682284,0.060684714,0.003322388,0.00013856532,0.000038323942,0.00074758404,0.00026097687,0.045524888],"genre_scores_gemma":[0.9823976,0.0005454774,0.00915486,0.00022183494,0.00024986616,0.000077601835,0.0003880332,0.00012291767,0.0068417317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886465,0.00030283284,0.00007545133,0.00023156132,0.00033445246,0.00019100905],"domain_scores_gemma":[0.9755697,0.01870498,0.0019274093,0.0012940952,0.0010373605,0.0014664915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001909337,0.0005237712,0.0013975118,0.0025900158,0.0021048177,0.0062452615,0.0023723363,0.0016372809,0.0075511066],"category_scores_gemma":[0.015125933,0.00073266396,0.0009126568,0.002838061,0.0053882794,0.011190703,0.0030914033,0.0029557832,0.00050537876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110390465,0.000033945227,0.0005202826,0.000046125988,0.000011164896,0.000070198505,0.00036996513,0.0031755185,0.0012079237,0.9899182,0.00082380977,0.0037124688],"study_design_scores_gemma":[0.000013303375,0.000014648318,0.00025837676,0.000015159049,0.000010041502,0.00008341161,0.000102505604,0.0073869484,0.00043319742,0.99111485,0.0005566648,0.0000108512],"about_ca_topic_score_codex":0.0008925548,"about_ca_topic_score_gemma":0.00075677066,"teacher_disagreement_score":0.0075511066,"about_ca_system_score_codex":0.0016990039,"about_ca_system_score_gemma":0.00093085115,"threshold_uncertainty_score":0.025260985},"labels":[],"label_agreement":null},{"id":"W4403733504","doi":"10.1016/j.disc.2024.114288","title":"Large matchings in maximal 1-planar graphs","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics; Planar; Planar graph; Chordal graph; Graph; Computer science","score_opus":0.018123747558879955,"score_gpt":0.30189577878873863,"score_spread":0.28377203122985867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403733504","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7012649,0.0036706105,0.23354393,0.00367178,0.00013826057,0.00024932073,0.0012442461,0.001410454,0.054806475],"genre_scores_gemma":[0.93680626,0.001536482,0.05303045,0.0006682115,0.00016815584,0.00016532527,0.00091209775,0.00022933625,0.00648374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980914,0.00035016873,0.00009815233,0.0006559527,0.00041990963,0.0003844025],"domain_scores_gemma":[0.98473245,0.01106735,0.0020067676,0.00082341867,0.00047019063,0.00089990057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001632872,0.0009210574,0.0010108284,0.0015941595,0.0012804173,0.0023656026,0.0018656417,0.0015727056,0.0108999675],"category_scores_gemma":[0.015243224,0.0009828364,0.00082798884,0.002182651,0.0019515045,0.007841375,0.0027771986,0.0016179279,0.001084122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017877733,0.00042522524,0.008958875,0.002011082,0.00026414584,0.0013632255,0.0013086847,0.09517919,0.058208875,0.73044425,0.012563744,0.087484956],"study_design_scores_gemma":[0.00015202834,0.00022513699,0.0026056129,0.00011484744,0.00014279778,0.0008881082,0.00049935986,0.0686686,0.018653158,0.8944893,0.013501431,0.000059674305],"about_ca_topic_score_codex":0.0011405151,"about_ca_topic_score_gemma":0.0018496678,"teacher_disagreement_score":0.0108999675,"about_ca_system_score_codex":0.0015290232,"about_ca_system_score_gemma":0.00069724064,"threshold_uncertainty_score":0.036463976},"labels":[],"label_agreement":null},{"id":"W4403986936","doi":"10.1016/j.disc.2024.114298","title":"On finding the largest minimum distance of locally recoverable codes: A graph theory approach","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics; Graph theory; Graph","score_opus":0.019490960527396996,"score_gpt":0.2627805352785573,"score_spread":0.24328957475116034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403986936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07378812,0.0029456927,0.9044933,0.0040691267,0.00017065709,0.00018039686,0.0006181566,0.00061652815,0.013118038],"genre_scores_gemma":[0.47713158,0.0038274133,0.5039012,0.001774027,0.0008344713,0.0006688366,0.0020675287,0.0007451765,0.009049795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99703574,0.0010835872,0.00012818706,0.0008224218,0.0006244388,0.0003054929],"domain_scores_gemma":[0.9757699,0.02003881,0.0012768237,0.001631977,0.00074107974,0.0005413903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023941319,0.0020007237,0.002490925,0.003095602,0.0015741646,0.0024418624,0.0038514924,0.0034360997,0.004627734],"category_scores_gemma":[0.024831219,0.0009914223,0.0015590837,0.0036030945,0.0038497054,0.007306412,0.0041918945,0.006222404,0.0010809215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003551685,0.0003626236,0.0018490733,0.0012048754,0.00020770844,0.0002832677,0.0006759809,0.49473727,0.0070689227,0.3868216,0.014164,0.092269555],"study_design_scores_gemma":[0.00007635721,0.00013369296,0.00041590162,0.000094659765,0.00004033412,0.0001842596,0.00019039928,0.45272547,0.0020106963,0.54065347,0.0034199066,0.000054831857],"about_ca_topic_score_codex":0.0016416118,"about_ca_topic_score_gemma":0.001595151,"teacher_disagreement_score":0.004627734,"about_ca_system_score_codex":0.0026374753,"about_ca_system_score_gemma":0.0015469225,"threshold_uncertainty_score":0.01913631},"labels":[],"label_agreement":null},{"id":"W4404204827","doi":"10.1016/j.disc.2024.114316","title":"On combinatorial and hypergeometric approaches toward second-order difference equations","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Killam Trusts","keywords":"Mathematics; Hypergeometric distribution; Order (exchange); Combinatorial analysis; Hypergeometric function; Basic hypergeometric series; Combinatorics; Generalized hypergeometric function; Discrete mathematics; Pure mathematics","score_opus":0.04607739107835068,"score_gpt":0.2513396514244652,"score_spread":0.2052622603461145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404204827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07092817,0.0059394496,0.7915352,0.0071887732,0.0017694968,0.00006138077,0.00018872182,0.00019477638,0.122194014],"genre_scores_gemma":[0.73935324,0.00889133,0.17235109,0.002452037,0.004070631,0.00021907709,0.00040805654,0.00041210616,0.07184245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989091,0.00055249885,0.00004663566,0.00012033742,0.00027843454,0.00009301589],"domain_scores_gemma":[0.99607277,0.0023824195,0.00032611532,0.0003077802,0.0005688011,0.00034216998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029855245,0.0015556775,0.0013346296,0.003521616,0.001796722,0.003571958,0.0021587794,0.0017971847,0.006969176],"category_scores_gemma":[0.011537613,0.0007057253,0.0013909182,0.0027808365,0.0062314984,0.0075519495,0.0034610135,0.0055916933,0.00089396467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004027372,0.000007256733,0.00005179365,0.000010571342,0.0000026006815,0.000010520772,0.000042094653,0.001037527,0.000063646374,0.99701786,0.00031469445,0.0014373432],"study_design_scores_gemma":[0.0000034844993,0.000003817395,0.000041282274,0.000007097865,0.0000020074037,0.000012175583,0.00001556381,0.0120303435,0.000039239967,0.98682225,0.0010178282,0.0000047984895],"about_ca_topic_score_codex":0.002311591,"about_ca_topic_score_gemma":0.0027679433,"teacher_disagreement_score":0.006969176,"about_ca_system_score_codex":0.0022671558,"about_ca_system_score_gemma":0.0010885083,"threshold_uncertainty_score":0.023314238},"labels":[],"label_agreement":null},{"id":"W4404738330","doi":"10.1016/j.disc.2024.114334","title":"Caps and wickets","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.02655525774016084,"score_gpt":0.3126294069531486,"score_spread":0.2860741492129878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404738330","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068889454,0.011505371,0.10306962,0.01683188,0.0026104283,0.000047522863,0.00048548658,0.0004695709,0.7960906],"genre_scores_gemma":[0.83399886,0.0047690156,0.013626703,0.0027185394,0.00294999,0.00013074912,0.00036425272,0.00035629497,0.14108565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900323,0.00038886844,0.000044841756,0.00021211451,0.00023079969,0.000120063996],"domain_scores_gemma":[0.99855846,0.0006286019,0.00014405043,0.00023836557,0.00020963071,0.00022088985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009904348,0.0007755177,0.0010324277,0.0023515455,0.0033421938,0.0065729436,0.0011071907,0.0017229979,0.017049855],"category_scores_gemma":[0.004305148,0.0005521307,0.0007230951,0.0021077131,0.009699482,0.012492351,0.0032647077,0.004630786,0.0024464617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013677222,0.0000014582117,0.000009125522,0.00000359069,6.40193e-7,0.0000048940938,0.00004587124,0.000033634962,0.000013260156,0.9988844,0.00058741675,0.00041447315],"study_design_scores_gemma":[0.0000013318389,0.0000010132783,0.000011043719,0.0000031903453,8.048153e-7,0.000017124985,0.000042438907,0.00011635664,0.000021234768,0.9954336,0.0043501663,0.0000015592527],"about_ca_topic_score_codex":0.0013344034,"about_ca_topic_score_gemma":0.00087212026,"teacher_disagreement_score":0.017049855,"about_ca_system_score_codex":0.0017445724,"about_ca_system_score_gemma":0.00083781534,"threshold_uncertainty_score":0.057037413},"labels":[],"label_agreement":null},{"id":"W4405493072","doi":"10.1016/j.disc.2024.114364","title":"The intersection density of non-quasiprimitive groups of degree 3p","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; University of Regina","funders":"","keywords":"Mathematics; Degree (music); Intersection (aeronautics); Combinatorics; Discrete mathematics","score_opus":0.07298299375134096,"score_gpt":0.35644083075092725,"score_spread":0.28345783699958627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405493072","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9783579,0.0002553249,0.013848613,0.00024154503,0.00000858592,0.000011231736,0.000094433104,0.0000858496,0.007096398],"genre_scores_gemma":[0.99727976,0.0001166226,0.0017646842,0.000017043682,0.00002189684,0.000022518632,0.00012699323,0.0000137750685,0.0006366864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988373,0.00023975347,0.000057354668,0.00022371471,0.00037035003,0.0002715284],"domain_scores_gemma":[0.9965636,0.001767413,0.0006067892,0.00032262615,0.0003307577,0.0004087677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095189834,0.00027467535,0.00061412796,0.0023441883,0.0011439109,0.0020445425,0.0008025369,0.00050131785,0.0024419276],"category_scores_gemma":[0.0042300927,0.00041264112,0.0004931086,0.0011079388,0.003321056,0.0025244926,0.0020219984,0.0008472137,0.000235217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062288344,0.00009288165,0.03374837,0.00014153027,0.000057635905,0.00051358977,0.0037648424,0.005540735,0.014538429,0.91904336,0.00123436,0.020701269],"study_design_scores_gemma":[0.000076934004,0.0002655207,0.04047997,0.000068715366,0.0001081196,0.0016238719,0.0025523468,0.082605146,0.027158123,0.8367125,0.00826975,0.0000790676],"about_ca_topic_score_codex":0.0011350807,"about_ca_topic_score_gemma":0.00069799554,"teacher_disagreement_score":0.0024419276,"about_ca_system_score_codex":0.0014502661,"about_ca_system_score_gemma":0.00040233464,"threshold_uncertainty_score":0.010522485},"labels":[],"label_agreement":null},{"id":"W4405695073","doi":"10.1016/j.disc.2024.114372","title":"Existential closure in uniform hypergraphs","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Closure (psychology); Combinatorics; Discrete mathematics; Hypergraph; Existentialism","score_opus":0.02157182862074907,"score_gpt":0.305390688148636,"score_spread":0.28381885952788694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405695073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4826525,0.0009910215,0.4849116,0.0011590476,0.00009102875,0.00011170032,0.0006229939,0.0007145811,0.028745571],"genre_scores_gemma":[0.9302389,0.0004145206,0.061934292,0.00042043603,0.00006993394,0.00022175926,0.00040327923,0.0001938148,0.0061030434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975078,0.0009399873,0.00014594515,0.00070856186,0.00039786007,0.0002998864],"domain_scores_gemma":[0.98827565,0.0077095455,0.0008246109,0.0016982754,0.0007716795,0.0007203539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024686581,0.0004976136,0.00064625224,0.0009594131,0.0015480334,0.0021386538,0.00096952333,0.0009826336,0.0032701418],"category_scores_gemma":[0.012829014,0.00076365646,0.00096998806,0.00086431124,0.004039165,0.0045696846,0.0034541488,0.0021216704,0.0003657544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098799464,0.000030973748,0.0013778076,0.00009947375,0.00001902597,0.00014960903,0.00059469906,0.0058240816,0.004184821,0.97480214,0.0009376586,0.011880962],"study_design_scores_gemma":[0.00003644191,0.000058095502,0.0007170427,0.000053173062,0.000029354484,0.00038765164,0.0002050107,0.02184672,0.0045887907,0.9650776,0.0069692866,0.000030789557],"about_ca_topic_score_codex":0.00070316176,"about_ca_topic_score_gemma":0.0005304258,"teacher_disagreement_score":0.0032701418,"about_ca_system_score_codex":0.0015872681,"about_ca_system_score_gemma":0.00058312673,"threshold_uncertainty_score":0.013055682},"labels":[],"label_agreement":null},{"id":"W4406171432","doi":"10.1016/j.disc.2024.114383","title":"The sandwich problem for odd-hole-free and even-hole-free graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.016880662444144736,"score_gpt":0.29887521204873435,"score_spread":0.28199454960458964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406171432","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58268756,0.0020059112,0.39177436,0.005048358,0.00020194509,0.00038995803,0.0025471528,0.00069456303,0.014650242],"genre_scores_gemma":[0.90825397,0.0010098525,0.08392258,0.0005940451,0.00019527918,0.00021732593,0.002133366,0.0001405717,0.0035330658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852496,0.00040941776,0.00015460646,0.0005041186,0.00017455584,0.00023240031],"domain_scores_gemma":[0.9855354,0.011247837,0.0008862089,0.00127391,0.00036914225,0.00068750576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026429736,0.0010152298,0.0013412418,0.0006026031,0.0017401833,0.0028717278,0.002048865,0.0021994999,0.0037992462],"category_scores_gemma":[0.010645839,0.0008582752,0.0016883557,0.0011433188,0.0026734625,0.011199836,0.0030073852,0.0027298422,0.0005055279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026661565,0.00073322555,0.009979293,0.0017962041,0.00039402596,0.0019885886,0.0024204697,0.14277373,0.017340465,0.6939579,0.019934062,0.1060159],"study_design_scores_gemma":[0.00018482916,0.00021451704,0.0013436667,0.00007069402,0.00009648086,0.0010314016,0.00080470246,0.09156436,0.006261139,0.8929185,0.0054518706,0.00005783606],"about_ca_topic_score_codex":0.0013416538,"about_ca_topic_score_gemma":0.0009703735,"teacher_disagreement_score":0.0037992462,"about_ca_system_score_codex":0.0012052275,"about_ca_system_score_gemma":0.0012151223,"threshold_uncertainty_score":0.013977528},"labels":[],"label_agreement":null},{"id":"W4408707386","doi":"10.1016/j.disc.2025.114487","title":"Combinatorics on words and generating Dirichlet series of automatic sequences","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS","keywords":"Mathematics; Combinatorics; Series (stratigraphy); Dirichlet distribution; Dirichlet series; Discrete mathematics","score_opus":0.011094295410950547,"score_gpt":0.2498030594622259,"score_spread":0.23870876405127534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408707386","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5982208,0.0018779059,0.2622476,0.0032575792,0.00070422015,0.00011273143,0.0005753304,0.00046930235,0.13253462],"genre_scores_gemma":[0.943461,0.0011077882,0.023533069,0.00044626347,0.0010171582,0.00020738241,0.00048574278,0.00025165264,0.029489921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980683,0.0006622189,0.00013520652,0.00033592887,0.0004913441,0.00030704806],"domain_scores_gemma":[0.99172723,0.0056098374,0.0007528953,0.0006019269,0.00063051865,0.0006776633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023697456,0.001243801,0.0017093291,0.0051519214,0.003227348,0.0068009873,0.0021424845,0.0017964047,0.011484826],"category_scores_gemma":[0.009227295,0.0010718589,0.001753893,0.00378263,0.0062374542,0.008781454,0.0034357097,0.00352093,0.0013406575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015475238,0.000013713295,0.00010845053,0.00001601561,0.0000033200515,0.00004351282,0.0001812137,0.0004580568,0.00024601736,0.99689,0.00023987188,0.0017844535],"study_design_scores_gemma":[0.0000076177294,0.0000056913295,0.00007120186,0.000006982712,0.0000035022058,0.000060404323,0.000047887446,0.0020838042,0.00018023083,0.9969644,0.0005600174,0.000008328942],"about_ca_topic_score_codex":0.00086932356,"about_ca_topic_score_gemma":0.000897129,"teacher_disagreement_score":0.011484826,"about_ca_system_score_codex":0.002563486,"about_ca_system_score_gemma":0.000944413,"threshold_uncertainty_score":0.038420618},"labels":[],"label_agreement":null},{"id":"W4408911910","doi":"10.1016/j.disc.2025.114501","title":"Quaternary Legendre pairs II","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Austrian Science Fund","keywords":"Mathematics; Combinatorics; Quaternary; Legendre polynomials; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.028610582531910733,"score_gpt":0.3253448939372837,"score_spread":0.296734311405373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408911910","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1181753,0.0007770853,0.048870213,0.0027383002,0.002887123,0.00011249718,0.00048367184,0.00048205207,0.8254738],"genre_scores_gemma":[0.711898,0.00096623803,0.019136027,0.0025165007,0.0015803314,0.00017642963,0.00069024554,0.0006126374,0.26242346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946624,0.00011321471,0.000021828668,0.00009534534,0.0001597299,0.00014360352],"domain_scores_gemma":[0.9995297,0.000076574186,0.000058920017,0.00007160817,0.00012907764,0.00013417765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005190423,0.0012322189,0.0009310977,0.002512241,0.003940367,0.0044440255,0.001039927,0.0015802875,0.028383793],"category_scores_gemma":[0.0015364914,0.00048520463,0.0007087495,0.001495429,0.002890536,0.0029488828,0.0019893185,0.003719674,0.0068602427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000140402435,0.0000066098833,0.000031674474,0.000009110103,0.0000018170472,0.000032518547,0.000060774895,0.00008339153,0.0003750587,0.9958015,0.002082702,0.0015008143],"study_design_scores_gemma":[0.000013478277,0.000022111868,0.00017048274,0.000016070135,0.000005654247,0.00021307802,0.00010564457,0.00087494345,0.0010601112,0.9800371,0.017465034,0.000016337406],"about_ca_topic_score_codex":0.00077238143,"about_ca_topic_score_gemma":0.00056403974,"teacher_disagreement_score":0.028383793,"about_ca_system_score_codex":0.0013892296,"about_ca_system_score_gemma":0.0007650549,"threshold_uncertainty_score":0.09495324},"labels":[],"label_agreement":null},{"id":"W4409115157","doi":"10.1016/j.disc.2025.114500","title":"The graph of a family of functions over quadratic extensions of finite fields","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Finite field; Quadratic equation; Combinatorics; Graph; Discrete mathematics; Finite graph","score_opus":0.0159986512985675,"score_gpt":0.26208359964935496,"score_spread":0.24608494835078745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409115157","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8467952,0.00035957588,0.12877758,0.0007433144,0.000045164124,0.000054785363,0.00027643592,0.00027470273,0.022673236],"genre_scores_gemma":[0.966888,0.00021273368,0.026166,0.00010793039,0.000041280047,0.000051779447,0.00021348403,0.000073082316,0.006245854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998134,0.000052856758,0.0000058844157,0.00004248383,0.00004977874,0.000035604928],"domain_scores_gemma":[0.9988319,0.000553701,0.00013127316,0.0001227139,0.0001930988,0.0001672923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033639863,0.00024368295,0.00019222916,0.0011647562,0.00096266274,0.0006435479,0.00045013533,0.0005121253,0.0022857254],"category_scores_gemma":[0.0017968366,0.0002060086,0.00035556927,0.00059124804,0.0012912811,0.0013280918,0.00037213342,0.00065647793,0.00019255752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015255607,0.0000566112,0.003449022,0.000084718384,0.000020313726,0.0004605121,0.0006585745,0.021303274,0.019838942,0.9193009,0.002326463,0.03234811],"study_design_scores_gemma":[0.000035759396,0.00021428318,0.008087488,0.000045428016,0.000023554892,0.0012839286,0.0004303397,0.12457517,0.010660081,0.8395366,0.015041929,0.00006534626],"about_ca_topic_score_codex":0.0013753991,"about_ca_topic_score_gemma":0.001075655,"teacher_disagreement_score":0.0022857254,"about_ca_system_score_codex":0.0007252065,"about_ca_system_score_gemma":0.00032181278,"threshold_uncertainty_score":0.007646501},"labels":[],"label_agreement":null},{"id":"W4411279523","doi":"10.1016/j.disc.2025.114644","title":"Hopping forcing number in random d-regular graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Forcing (mathematics); Discrete mathematics; Random graph; Graph; Mathematical analysis","score_opus":0.014393945943673759,"score_gpt":0.3071972158539919,"score_spread":0.29280326991031813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411279523","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71022,0.0011309957,0.2579514,0.0013436185,0.000119871256,0.00015121071,0.0005195601,0.00095625134,0.027607052],"genre_scores_gemma":[0.9777951,0.00041801308,0.018837815,0.00014892453,0.000038574613,0.00012596176,0.00019271624,0.000096972035,0.0023459091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929297,0.00021466112,0.00003228266,0.00017114457,0.00013222605,0.0001567276],"domain_scores_gemma":[0.9766757,0.019502431,0.0011567782,0.0010600408,0.00040785555,0.0011973014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019135535,0.0006519933,0.0007845971,0.0019081287,0.0009587996,0.0013548073,0.0016628499,0.0011062588,0.0032966046],"category_scores_gemma":[0.019187244,0.0005254724,0.00058643415,0.0007899672,0.0030592605,0.0022243243,0.0016045697,0.0012500559,0.00039305724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000667585,0.00018562144,0.005665039,0.00040422185,0.00007106018,0.0007464197,0.00043073104,0.39944437,0.0129775945,0.55942315,0.004240362,0.015743917],"study_design_scores_gemma":[0.00006930158,0.000119087104,0.001313057,0.00008502789,0.000027621658,0.00030632422,0.000105945845,0.7676154,0.0032510469,0.22583485,0.0012192519,0.000053241278],"about_ca_topic_score_codex":0.0010874429,"about_ca_topic_score_gemma":0.0014474468,"teacher_disagreement_score":0.0032966046,"about_ca_system_score_codex":0.0018884958,"about_ca_system_score_gemma":0.0009139555,"threshold_uncertainty_score":0.013702095},"labels":[],"label_agreement":null},{"id":"W4411496001","doi":"10.1016/j.disc.2025.114646","title":"Out of the parking lot and into the forest: Parking functions, bond lattices, and unimodal forests","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"National Science Foundation","keywords":"Mathematics; Parking lot; Combinatorics; Engineering; Civil engineering","score_opus":0.026799152434090825,"score_gpt":0.30541797029131035,"score_spread":0.27861881785721954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411496001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42536023,0.008143271,0.48841423,0.0032038162,0.0004337995,0.000058212074,0.00025256694,0.0002732515,0.07386064],"genre_scores_gemma":[0.91934955,0.0018132852,0.07032386,0.00037961284,0.0003174547,0.000055947366,0.00008591568,0.000056781493,0.0076175574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996784,0.00011819845,0.0000140035945,0.00006161235,0.000073983916,0.00005378396],"domain_scores_gemma":[0.99903417,0.0005222004,0.0001147946,0.0000782458,0.00009517225,0.00015542067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007629589,0.0003302418,0.00039876444,0.0012792862,0.0011078613,0.0019016041,0.00068454084,0.00095764006,0.0029270353],"category_scores_gemma":[0.002207563,0.00028324372,0.00053251727,0.0011395415,0.0033327693,0.005150218,0.00110853,0.0015914488,0.00032026376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001470483,0.000012958231,0.00026547507,0.000017090142,0.00000155668,0.000050879564,0.00016008203,0.0011089473,0.00039999408,0.99185103,0.00038757606,0.005729604],"study_design_scores_gemma":[0.000004389633,0.000008741899,0.00016414598,0.000010318183,0.0000024211222,0.0001222593,0.00007977849,0.009213984,0.00036559495,0.98795086,0.0020670686,0.000010409587],"about_ca_topic_score_codex":0.0010443904,"about_ca_topic_score_gemma":0.0013077055,"teacher_disagreement_score":0.0029270353,"about_ca_system_score_codex":0.000750844,"about_ca_system_score_gemma":0.0004686456,"threshold_uncertainty_score":0.009791911},"labels":[],"label_agreement":null},{"id":"W4411673352","doi":"10.1016/j.disc.2025.114648","title":"The forb-flex method for odd coloring and proper conflict-free coloring of planar graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Combinatorics Foundation; National Research Foundation of Korea; Ministry of Education; University of Wyoming; Division of Mathematical Sciences; National Science Foundation","keywords":"Mathematics; Combinatorics; Graph coloring; Discrete mathematics; List coloring; Chordal graph; Graph; Line graph","score_opus":0.03852087644603635,"score_gpt":0.35095695988294967,"score_spread":0.3124360834369133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411673352","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019182844,0.00012783874,0.9691924,0.00022639186,0.00012677495,0.00007475507,0.00013336985,0.0006508087,0.010284869],"genre_scores_gemma":[0.26879606,0.000268989,0.7148195,0.00033208742,0.00012414977,0.00021195541,0.000455804,0.0009435125,0.014048006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921906,0.00024775474,0.000031453874,0.00015550088,0.00020194537,0.00014434534],"domain_scores_gemma":[0.99792576,0.0007711544,0.00008851085,0.00074053556,0.0002926927,0.00018141323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014031676,0.00072679744,0.0007101281,0.0013671318,0.0011007001,0.0013167829,0.0020606844,0.00063963473,0.008840534],"category_scores_gemma":[0.0045035244,0.0004913824,0.0010712959,0.0010947698,0.0012228709,0.0021448806,0.0023450337,0.0026556295,0.001418426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063859235,0.00027049475,0.002182826,0.0004550556,0.00007983897,0.00022095769,0.0004633911,0.064128526,0.011180141,0.5273553,0.016841087,0.37618375],"study_design_scores_gemma":[0.00009528875,0.00006768335,0.00045586357,0.0000528539,0.000055343735,0.00016737338,0.00013825348,0.38849142,0.006425505,0.5905599,0.013445846,0.000044757428],"about_ca_topic_score_codex":0.002854955,"about_ca_topic_score_gemma":0.005681469,"teacher_disagreement_score":0.008840534,"about_ca_system_score_codex":0.0008478598,"about_ca_system_score_gemma":0.0018781438,"threshold_uncertainty_score":0.029574513},"labels":[],"label_agreement":null},{"id":"W4412018875","doi":"10.1016/j.disc.2025.114668","title":"Proportion of blocking curves in a pencil","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Pencil (optics); Blocking (statistics); Combinatorics; Discrete mathematics; Statistics; Physics; Optics","score_opus":0.05819766605879346,"score_gpt":0.38512914693829836,"score_spread":0.3269314808795049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412018875","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74867487,0.0011227161,0.081889376,0.001811019,0.0001855044,0.00011949591,0.0011392918,0.001201672,0.16385591],"genre_scores_gemma":[0.95409715,0.0007322591,0.0117574325,0.00023652577,0.00015385596,0.00016251171,0.0010626712,0.00051050703,0.031287044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975465,0.00049482955,0.00011434874,0.00048312425,0.000797466,0.0005636268],"domain_scores_gemma":[0.986668,0.0070054196,0.0012846116,0.0015861582,0.0015517646,0.001903987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001524453,0.0009271168,0.0016059667,0.0035460368,0.0025437132,0.0055823443,0.00241686,0.0017785431,0.033559598],"category_scores_gemma":[0.017295962,0.0008469405,0.0006027366,0.002330417,0.0026889418,0.0045968234,0.0023337945,0.001949712,0.0051036933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007806345,0.00013492974,0.005534966,0.00022429356,0.00004610294,0.00017889218,0.0003867485,0.010201693,0.007091289,0.9356799,0.007242156,0.03249829],"study_design_scores_gemma":[0.00012673197,0.00022397819,0.005517693,0.00015075867,0.000092038536,0.0014397455,0.0006217939,0.07663753,0.013776622,0.87810653,0.023219984,0.00008650781],"about_ca_topic_score_codex":0.000919704,"about_ca_topic_score_gemma":0.00037155472,"teacher_disagreement_score":0.033559598,"about_ca_system_score_codex":0.0016932164,"about_ca_system_score_gemma":0.00085473486,"threshold_uncertainty_score":0.11226803},"labels":[],"label_agreement":null},{"id":"W4412429706","doi":"10.1016/j.disc.2025.114680","title":"On optimal placement delivery arrays","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Discrete mathematics; Mathematical optimization","score_opus":0.013573838745498203,"score_gpt":0.2442872188727287,"score_spread":0.2307133801272305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412429706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03298977,0.0026685137,0.9093048,0.0028467688,0.00044823284,0.00010989688,0.00045008754,0.00053313957,0.05064886],"genre_scores_gemma":[0.59840214,0.009433666,0.31441185,0.0016574506,0.0012824702,0.00055611617,0.0010800372,0.0011184362,0.07205778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986739,0.00051310804,0.00005585898,0.00018756176,0.00036688507,0.0002027218],"domain_scores_gemma":[0.99413764,0.0043163863,0.000386909,0.0004503289,0.0005070814,0.00020154672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013267644,0.0015831414,0.0020590425,0.0016997983,0.0011312077,0.0026578761,0.0020245153,0.0018450095,0.01583014],"category_scores_gemma":[0.013849561,0.0011527555,0.0007915429,0.0038317626,0.0018999821,0.004582002,0.002889904,0.0025872374,0.00203201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002740908,0.00013079551,0.0004362431,0.00022087924,0.000033493114,0.000087455424,0.0001466326,0.34603482,0.0026785831,0.5677932,0.020472454,0.061691485],"study_design_scores_gemma":[0.000042090134,0.00007479494,0.00016776976,0.0000540763,0.000021504735,0.00009012051,0.00008846984,0.5711924,0.0011407579,0.41891256,0.008194384,0.000021023814],"about_ca_topic_score_codex":0.0024132964,"about_ca_topic_score_gemma":0.0019908443,"teacher_disagreement_score":0.01583014,"about_ca_system_score_codex":0.0025359641,"about_ca_system_score_gemma":0.0015682866,"threshold_uncertainty_score":0.052957058},"labels":[],"label_agreement":null},{"id":"W4412720278","doi":"10.1016/j.disc.2025.114687","title":"The e-positivity of the chromatic symmetric function for twinned paths and cycles","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Combinatorics Foundation; National Security Agency; National Sleep Foundation; Danmarks Frie Forskningsfond; National Science Foundation","keywords":"Mathematics; Chromatic scale; Combinatorics; Function (biology); Symmetric function; Discrete mathematics","score_opus":0.017250909404816297,"score_gpt":0.2997031027622832,"score_spread":0.2824521933574669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412720278","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65652394,0.001275371,0.17903139,0.0030791992,0.0007665179,0.000071629445,0.0004003958,0.00017608487,0.15867546],"genre_scores_gemma":[0.9643631,0.0007917725,0.012240423,0.00040688372,0.0004171727,0.00007886544,0.0001956969,0.00012550021,0.021380594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992848,0.00020142816,0.000036875565,0.00017393379,0.00014497027,0.00015794169],"domain_scores_gemma":[0.99695575,0.0012585559,0.00041649677,0.00022145864,0.0004973047,0.00065052643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014803748,0.00094446965,0.0007323219,0.0032489793,0.0021687928,0.0034649905,0.001548573,0.0016273941,0.010483995],"category_scores_gemma":[0.0061817835,0.0006508813,0.00082963624,0.0019443978,0.005838272,0.00783655,0.0026085726,0.0028572294,0.00080266007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036383175,0.000009645345,0.00017591532,0.00002018554,0.000003867058,0.000042838143,0.000101133315,0.000520122,0.0006638557,0.9954946,0.0005559535,0.0023754854],"study_design_scores_gemma":[0.000010059052,0.000010025189,0.00020319295,0.000011686246,0.0000036638442,0.000086677624,0.000049459726,0.0037497017,0.00030567433,0.9945643,0.0009933801,0.000012019515],"about_ca_topic_score_codex":0.001478392,"about_ca_topic_score_gemma":0.0010520166,"teacher_disagreement_score":0.010483995,"about_ca_system_score_codex":0.0014547998,"about_ca_system_score_gemma":0.0009297344,"threshold_uncertainty_score":0.035072505},"labels":[],"label_agreement":null},{"id":"W4412806721","doi":"10.1016/j.disc.2025.114705","title":"Linear independence over naturally-ordered semirings with applications to dimension arguments in extremal combinatorics","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Dimension (graph theory); Combinatorics; Extremal combinatorics; Independence (probability theory); Algebraic combinatorics; Enumerative combinatorics; Discrete mathematics; Statistics","score_opus":0.008895538497888881,"score_gpt":0.2632374750934048,"score_spread":0.2543419365955159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412806721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28525522,0.0012517616,0.6731501,0.0025481016,0.00009264193,0.00004312142,0.00024842928,0.00036756546,0.03704303],"genre_scores_gemma":[0.9339619,0.00039465594,0.062142685,0.00018138261,0.00017794986,0.000051748546,0.00011532657,0.000060960094,0.0029133884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978264,0.00093453383,0.00013623263,0.0003905854,0.00049112755,0.00022110481],"domain_scores_gemma":[0.9931993,0.0047918265,0.00043075878,0.00075882656,0.00042372957,0.00039551267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025421956,0.00041949493,0.0006059279,0.0017519823,0.0012361894,0.0023613707,0.00078453694,0.00039543642,0.0019897295],"category_scores_gemma":[0.005507628,0.0004730999,0.0008685813,0.0017039436,0.0042411485,0.0053117615,0.003526879,0.0024675028,0.00019484862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022272809,0.0000111515965,0.000541987,0.000027489717,0.0000065150616,0.0000370525,0.00019183257,0.0011947948,0.0005813674,0.9919899,0.00026643855,0.0051292507],"study_design_scores_gemma":[0.0000096021495,0.000020162635,0.00050710986,0.000016634944,0.000014537497,0.00012278251,0.00012045361,0.016862035,0.0021504124,0.97637546,0.00378156,0.000019312522],"about_ca_topic_score_codex":0.0006086569,"about_ca_topic_score_gemma":0.0005726309,"teacher_disagreement_score":0.0025421956,"about_ca_system_score_codex":0.0020967915,"about_ca_system_score_gemma":0.0004049551,"threshold_uncertainty_score":0.015213311},"labels":[],"label_agreement":null},{"id":"W4413431503","doi":"10.1016/j.disc.2025.114746","title":"Oriented colouring graphs of bounded degree and degeneracy","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Illinois at Urbana-Champaign","keywords":"Mathematics; Degree (music); Bounded function; Degeneracy (biology); Combinatorics; Discrete mathematics","score_opus":0.02541250570613969,"score_gpt":0.3095260943351586,"score_spread":0.2841135886290189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413431503","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71898615,0.0022912587,0.2105138,0.0010268816,0.00007537266,0.00005583173,0.0004993282,0.00057118986,0.06598018],"genre_scores_gemma":[0.9567178,0.0012971446,0.035571575,0.00037901613,0.000086954584,0.00004893113,0.00040707155,0.00016122093,0.005330357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990596,0.00012051646,0.00003867862,0.00022114387,0.00033316624,0.00022695579],"domain_scores_gemma":[0.9945608,0.003223146,0.00060426124,0.0008034179,0.00033974403,0.00046858878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006218265,0.00077553256,0.00058051734,0.0014452559,0.001082787,0.0014768111,0.0012300214,0.00068299676,0.0034554212],"category_scores_gemma":[0.0058048214,0.0006424243,0.00048848416,0.0017167225,0.0023641672,0.003840281,0.002910203,0.0020185085,0.0005099027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006682009,0.0002082041,0.014080036,0.00055812177,0.00009532505,0.0007227665,0.00086502294,0.19807747,0.04327555,0.6573119,0.0037864805,0.080350876],"study_design_scores_gemma":[0.00004903727,0.0000836534,0.004035864,0.00007721211,0.000043351574,0.00061970094,0.00017603108,0.155679,0.006432085,0.8238839,0.008870916,0.00004921258],"about_ca_topic_score_codex":0.0026956827,"about_ca_topic_score_gemma":0.0035502175,"teacher_disagreement_score":0.0034554212,"about_ca_system_score_codex":0.0023147913,"about_ca_system_score_gemma":0.0007338543,"threshold_uncertainty_score":0.01679504},"labels":[],"label_agreement":null},{"id":"W4413575656","doi":"10.1016/j.disc.2025.114741","title":"Murnaghan–Nakayama rules for symplectic, orthogonal and orthosymplectic Schur functions","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Symplectic geometry; Symplectic matrix; Algebra over a field; Combinatorics; Pure mathematics; Symplectic representation; Moment map","score_opus":0.029620420704520867,"score_gpt":0.3373833707304011,"score_spread":0.3077629500258802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413575656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3290263,0.00096449733,0.42559135,0.0008811315,0.0010220095,0.00031268926,0.00031037352,0.0006034703,0.24128824],"genre_scores_gemma":[0.79862696,0.0007577037,0.15678528,0.00051397155,0.00029586174,0.00029843257,0.0002158673,0.0005001908,0.04200573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988918,0.00016920599,0.000098108205,0.00016357693,0.000513488,0.00016385561],"domain_scores_gemma":[0.99913234,0.00022532156,0.00009444719,0.00017531852,0.00027375322,0.000098933844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011333427,0.00042250403,0.00041803284,0.0014549729,0.0012751453,0.0017943128,0.0009259229,0.0005973115,0.004655598],"category_scores_gemma":[0.0024204566,0.00035777298,0.0006923216,0.0005427439,0.00226912,0.0023293088,0.0014115161,0.0017968374,0.0016758579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020249649,0.000018728791,0.000273485,0.000030290672,0.0000045814095,0.00026657456,0.00037918173,0.00065204693,0.0037867385,0.98033285,0.0011909163,0.013044323],"study_design_scores_gemma":[0.00002258366,0.000054026994,0.000761431,0.000039631363,0.000015105348,0.0008030018,0.00023645104,0.010266613,0.015289297,0.94082636,0.031629838,0.00005566571],"about_ca_topic_score_codex":0.000780011,"about_ca_topic_score_gemma":0.0015997756,"teacher_disagreement_score":0.004655598,"about_ca_system_score_codex":0.00054728496,"about_ca_system_score_gemma":0.0005209781,"threshold_uncertainty_score":0.015574515},"labels":[],"label_agreement":null},{"id":"W4413947799","doi":"10.1016/j.disc.2025.114767","title":"On connections between association schemes and analyses of polyhedral and positive semidefinite lift-and-project relaxations","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Saskatchewan","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Lift (data mining); Association scheme; Combinatorics; Association (psychology); Discrete mathematics; Computer science; Data mining","score_opus":0.03317771164768675,"score_gpt":0.3412643082010908,"score_spread":0.3080865965534041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413947799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03022873,0.0009866887,0.9511831,0.0021589268,0.00022724399,0.00010828943,0.00017809763,0.00015714002,0.014771848],"genre_scores_gemma":[0.60505927,0.003601054,0.3619196,0.0021324484,0.0012301998,0.0007041829,0.0009924758,0.0009801958,0.023380537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946114,0.0031508442,0.00022491936,0.0006875529,0.000883123,0.0004421955],"domain_scores_gemma":[0.9499609,0.039426193,0.0029882921,0.0032394757,0.0021894067,0.0021956963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018755358,0.0028557668,0.0026360545,0.0036562835,0.0026331337,0.005173365,0.005254214,0.0036185875,0.0102613885],"category_scores_gemma":[0.06060564,0.0018384053,0.0031982025,0.00410664,0.009775121,0.016854892,0.011536782,0.013574326,0.000955012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008350727,0.00009214218,0.00044077757,0.00011960747,0.000026184298,0.000039051192,0.00032656823,0.03583026,0.00036271193,0.9533713,0.0015599331,0.0077478853],"study_design_scores_gemma":[0.00001797229,0.000050272036,0.0001813514,0.00007693686,0.00001800104,0.000023219842,0.00011059801,0.21301459,0.00023751211,0.7845395,0.0017057605,0.000024173569],"about_ca_topic_score_codex":0.0024739453,"about_ca_topic_score_gemma":0.0027175196,"teacher_disagreement_score":0.018755358,"about_ca_system_score_codex":0.0033524942,"about_ca_system_score_gemma":0.0029242742,"threshold_uncertainty_score":0.09918904},"labels":[],"label_agreement":null},{"id":"W4414402051","doi":"10.1016/j.disc.2025.114798","title":"Hamiltonicity of transitive graphs whose automorphism group has <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.svg\"> <mml:msub> <mml:mrow> <mml:mi mathvariant=\"double-struck\">Z</mml:mi> </mml:mrow> <mml:mrow> <mml:mi>p</mml:mi> </mml:mrow> </mml:msub> </mml:math> as commutator subgroups","year":2025,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Lethbridge","funders":"","keywords":"Commutator subgroup; Transitive relation; Automorphism; Automorphism group; Prime (order theory); Commutator; Cayley graph; Graph automorphism","score_opus":0.030278809385671346,"score_gpt":0.2732105888983955,"score_spread":0.24293177951272416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414402051","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9487166,0.00025639124,0.02237632,0.00032564375,0.00003553936,0.000038418562,0.00023514076,0.00010419551,0.027911844],"genre_scores_gemma":[0.9934163,0.0001291233,0.002044219,0.000049918905,0.000026459216,0.00002199787,0.00023840838,0.000016353386,0.004057233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997652,0.000051226936,0.00001436123,0.00007815981,0.000037543927,0.000053519994],"domain_scores_gemma":[0.9991161,0.00039603346,0.00022847144,0.000092815746,0.00005973127,0.00010674635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018072386,0.00017860359,0.00020632488,0.000588184,0.00063358806,0.0010155516,0.00028489632,0.00035131216,0.0034353032],"category_scores_gemma":[0.0011440379,0.00022031399,0.0003349453,0.00043694544,0.0014985637,0.0009901597,0.0005662693,0.00041940316,0.0002591192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022140263,0.00006788602,0.0050940965,0.000110927314,0.00002857976,0.0007973802,0.0012726433,0.0040691434,0.014324435,0.9570362,0.0018060304,0.015171239],"study_design_scores_gemma":[0.000067502966,0.00009939064,0.0041201054,0.000027129168,0.00003722474,0.0005456868,0.000548741,0.01480557,0.009322264,0.9648371,0.0055653206,0.000024109444],"about_ca_topic_score_codex":0.002126104,"about_ca_topic_score_gemma":0.0021297864,"teacher_disagreement_score":0.0034353032,"about_ca_system_score_codex":0.00062686444,"about_ca_system_score_gemma":0.00051075546,"threshold_uncertainty_score":0.011492252},"labels":[],"label_agreement":null},{"id":"W4414474364","doi":"10.1016/j.disc.2025.114809","title":"On the structure of perfectly divisible graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Clique number; Induced subgraph; Graph; Perfect graph; Divisibility rule; Bounded function; Split graph; Clique graph","score_opus":0.014469867531054576,"score_gpt":0.29108378401340207,"score_spread":0.2766139164823475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414474364","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78242785,0.0008089427,0.17723551,0.0022441624,0.00005927663,0.00011081063,0.0011268662,0.00049389777,0.03549259],"genre_scores_gemma":[0.95938486,0.00039627397,0.03235327,0.0002620273,0.00007552405,0.00006211574,0.0010389945,0.000079916856,0.0063470206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936646,0.00010911559,0.000033917197,0.00023697752,0.00014103352,0.00011239649],"domain_scores_gemma":[0.9952981,0.0021409402,0.00083845865,0.00092421786,0.00038858977,0.00040973607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043682964,0.00030253408,0.00041554627,0.0010787041,0.0014372187,0.0017980472,0.0012136346,0.0007515032,0.00434424],"category_scores_gemma":[0.003683435,0.00057922077,0.000347223,0.0013763634,0.002198736,0.005090442,0.002013952,0.0014975687,0.00038367856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029986846,0.000079077225,0.005682822,0.00024091112,0.00003609391,0.00061832543,0.0017567782,0.03114479,0.014051385,0.8990473,0.004572006,0.042470615],"study_design_scores_gemma":[0.00001942989,0.000042547472,0.0016239872,0.000038604852,0.000014052734,0.0003796752,0.00030230192,0.033088583,0.002554776,0.95417917,0.0077379993,0.000018760358],"about_ca_topic_score_codex":0.0010823656,"about_ca_topic_score_gemma":0.0011378651,"teacher_disagreement_score":0.00434424,"about_ca_system_score_codex":0.0011159584,"about_ca_system_score_gemma":0.00043560672,"threshold_uncertainty_score":0.014532983},"labels":[],"label_agreement":null},{"id":"W4414750135","doi":"10.1016/j.disc.2025.114822","title":"Applications of sparse hypergraph colorings","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Karlsruhe Institute of Technology","keywords":"Hypergraph; Independence number; Upper and lower bounds; Binary logarithm; Extremal combinatorics; Ramsey's theorem; Independence (probability theory)","score_opus":0.017813932260969702,"score_gpt":0.3013916045296683,"score_spread":0.28357767226869857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414750135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07800317,0.0034769285,0.8157921,0.0043316553,0.00084536825,0.00007723615,0.00028424966,0.000578104,0.09661117],"genre_scores_gemma":[0.7233223,0.005410323,0.23945716,0.0010950457,0.0016800808,0.00020157844,0.00044822428,0.00042655153,0.027958801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897265,0.00047653672,0.000031612453,0.00017772267,0.00026903383,0.000072544186],"domain_scores_gemma":[0.99362177,0.0040461468,0.00040378378,0.0008133027,0.00068245456,0.00043255294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010290311,0.000693979,0.0008730129,0.0018532535,0.0011481544,0.0017237879,0.001391156,0.0011052308,0.0069341613],"category_scores_gemma":[0.009389565,0.00060959853,0.00074608624,0.0026237273,0.0025373031,0.0034363414,0.003071104,0.002614108,0.0007052675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020858379,0.000024380823,0.00023225427,0.00007034958,0.000009200782,0.00003634735,0.00012268763,0.012041359,0.0006891528,0.9642326,0.002120093,0.020400716],"study_design_scores_gemma":[0.000007360008,0.000007204187,0.000060397924,0.000017858121,0.000005054949,0.00004530689,0.000043199165,0.034019925,0.00033771692,0.9610277,0.0044223946,0.0000058425694],"about_ca_topic_score_codex":0.0018192597,"about_ca_topic_score_gemma":0.00215124,"teacher_disagreement_score":0.0069341613,"about_ca_system_score_codex":0.0015770542,"about_ca_system_score_gemma":0.0009051455,"threshold_uncertainty_score":0.023197114},"labels":[],"label_agreement":null},{"id":"W4414961962","doi":"10.1016/j.disc.2025.114832","title":"Quantum walks on join graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; University of Manitoba","keywords":"Adjacency matrix; Join (topology); Vertex (graph theory); Adjacency list; Graph; Laplacian matrix; Laplace operator","score_opus":0.010692196613908026,"score_gpt":0.2534811998179653,"score_spread":0.24278900320405727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414961962","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85943615,0.00013289844,0.12469374,0.00021701168,0.00003201701,0.0000448719,0.00013310708,0.00018908322,0.015121098],"genre_scores_gemma":[0.9819416,0.00006513265,0.015042951,0.000047042045,0.000019665515,0.00003994684,0.000110794164,0.000048243943,0.0026845962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996309,0.000106212334,0.00001280278,0.00007667358,0.00009101255,0.00008237454],"domain_scores_gemma":[0.9982798,0.0008269567,0.00021683496,0.00025936676,0.000119059274,0.00029806193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046083733,0.00020388425,0.00038149385,0.00064696494,0.0009937217,0.0011613508,0.00055327883,0.00069324527,0.0038921505],"category_scores_gemma":[0.002548727,0.0002737107,0.00042505417,0.00040590257,0.0013801326,0.0017205259,0.0012567826,0.00070009707,0.00023899453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019506598,0.00006115738,0.001378201,0.00004918757,0.00002538855,0.00037550394,0.00039122306,0.04210995,0.016550332,0.9316393,0.0008144218,0.006410226],"study_design_scores_gemma":[0.000036398418,0.00010739407,0.0017838662,0.000014150969,0.000014294855,0.0002609411,0.00029890024,0.36913517,0.0054027485,0.62024313,0.0026776297,0.000025424639],"about_ca_topic_score_codex":0.0007652784,"about_ca_topic_score_gemma":0.0007042694,"teacher_disagreement_score":0.0038921505,"about_ca_system_score_codex":0.0005227029,"about_ca_system_score_gemma":0.00028571265,"threshold_uncertainty_score":0.013020575},"labels":[],"label_agreement":null},{"id":"W4415614171","doi":"10.1016/j.disc.2025.114861","title":"The weak version of the graph complement conjecture and partial results for the delta conjecture","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences; American Institute of Mathematics","keywords":"Conjecture; Complement (music); Graph; Degeneracy (biology); Rank (graph theory); Graph property; Complement graph; Graph minor","score_opus":0.025283000083536362,"score_gpt":0.29180350875645966,"score_spread":0.2665205086729233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415614171","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3999225,0.004721727,0.21222176,0.064955354,0.0027167452,0.00010616639,0.0015321436,0.00058218755,0.3132414],"genre_scores_gemma":[0.9492546,0.0024168827,0.012984709,0.0043642116,0.0019247617,0.000084440915,0.0013369237,0.00015292768,0.027480628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982638,0.00048035794,0.00008973655,0.00047494183,0.00041980756,0.00027134968],"domain_scores_gemma":[0.9893992,0.0063490784,0.0005260437,0.0015281884,0.0013917484,0.0008058165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026044075,0.00080748706,0.001480843,0.0022095796,0.0032245433,0.004720217,0.0024140887,0.0025932414,0.017337164],"category_scores_gemma":[0.010441755,0.0006361045,0.0012380743,0.002735559,0.00770465,0.019135788,0.005326892,0.0063229543,0.0018087116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012683497,0.0000335538,0.00066296395,0.00011821011,0.000014707368,0.000076458266,0.00014399669,0.0007899127,0.000416827,0.987645,0.0041402485,0.0058312933],"study_design_scores_gemma":[0.000012522592,0.000006387728,0.00014483959,0.000015664336,0.000007845016,0.000041680076,0.000072161645,0.0011926543,0.00024066112,0.995998,0.0022617993,0.000005717546],"about_ca_topic_score_codex":0.002198713,"about_ca_topic_score_gemma":0.0016637818,"teacher_disagreement_score":0.017337164,"about_ca_system_score_codex":0.0017236826,"about_ca_system_score_gemma":0.0010811393,"threshold_uncertainty_score":0.057998598},"labels":[],"label_agreement":null},{"id":"W4415875756","doi":"10.1016/j.disc.2025.114872","title":"Hermitian adjacency matrices with at most three distinct eigenvalues","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Hermitian matrix; Eigenvalues and eigenvectors; Adjacency matrix; Adjacency list; Characterization (materials science); Matrix (chemical analysis)","score_opus":0.02290136173924493,"score_gpt":0.29697962776304593,"score_spread":0.274078266023801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415875756","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9200771,0.00025319267,0.063767105,0.00022442432,0.00005783879,0.000024975043,0.00012314643,0.000107218744,0.015365027],"genre_scores_gemma":[0.99091387,0.00008866158,0.006680826,0.000042003325,0.00002734499,0.000023054277,0.000058802707,0.000018096807,0.0021472585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964964,0.000083351566,0.000015279269,0.00007184895,0.0000674171,0.00011247488],"domain_scores_gemma":[0.99842936,0.00065559905,0.0004586143,0.00013285494,0.00012908464,0.00019439872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002448516,0.00045481665,0.0003292588,0.0007384581,0.0006318541,0.0009657683,0.00044630302,0.0005565006,0.0030291968],"category_scores_gemma":[0.0017845988,0.0001933466,0.0002706915,0.0006827862,0.0011114262,0.0009492452,0.0006366407,0.0005640881,0.00038661106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023957236,0.00014223054,0.0075137406,0.00016147693,0.00008977042,0.0018794737,0.0005834625,0.020798225,0.042437155,0.8994698,0.0034705105,0.023214713],"study_design_scores_gemma":[0.00008877648,0.00018738859,0.006067889,0.00004169084,0.000049077833,0.0017785693,0.00085747516,0.13616708,0.014345039,0.8345175,0.0058263643,0.00007313468],"about_ca_topic_score_codex":0.00031646347,"about_ca_topic_score_gemma":0.0005143682,"teacher_disagreement_score":0.0030291968,"about_ca_system_score_codex":0.00024648677,"about_ca_system_score_gemma":0.00014994503,"threshold_uncertainty_score":0.010133684},"labels":[],"label_agreement":null},{"id":"W4416176824","doi":"10.1016/j.disc.2025.114860","title":"Spherical codes attached to complex weighing matrices","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Bent molecular geometry; Dimension (graph theory); RADIUS; Sequence (biology); Code (set theory); Upper and lower bounds; Order (exchange)","score_opus":0.029401637998103643,"score_gpt":0.3311629728494699,"score_spread":0.30176133485136625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416176824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0977206,0.00048543187,0.84141797,0.0008480208,0.0010926834,0.00007216423,0.00032513213,0.00054342806,0.057494596],"genre_scores_gemma":[0.7683519,0.0012750403,0.13669139,0.0009532564,0.0011089195,0.00017897761,0.00059252145,0.00083973777,0.09000823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990097,0.00022911148,0.000055579712,0.0001378816,0.00042616823,0.00014136905],"domain_scores_gemma":[0.9969035,0.0008357841,0.0005511935,0.0005295263,0.00089278567,0.00028732247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064267695,0.0010973309,0.00063201337,0.002489364,0.0007903151,0.0023865406,0.0009272727,0.0020776421,0.011108265],"category_scores_gemma":[0.005418405,0.00044884798,0.00047581532,0.0020104675,0.001866743,0.001838899,0.0021000938,0.0020440521,0.003704431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004295664,0.00001526271,0.00017925008,0.000037792393,0.000007457358,0.000105532476,0.00011138407,0.005131841,0.0055873096,0.9656751,0.0023241893,0.020781826],"study_design_scores_gemma":[0.000017019436,0.000048061982,0.00057419925,0.000041506766,0.000009727615,0.000415473,0.00014114245,0.074047804,0.0073757796,0.9024645,0.014795693,0.00006902015],"about_ca_topic_score_codex":0.00090118137,"about_ca_topic_score_gemma":0.00076057564,"teacher_disagreement_score":0.011108265,"about_ca_system_score_codex":0.00081438484,"about_ca_system_score_gemma":0.0005394699,"threshold_uncertainty_score":0.037160873},"labels":[],"label_agreement":null},{"id":"W4416938455","doi":"10.1016/j.disc.2025.114918","title":"On subsequence sums of index-1-free sequences over cyclic groups","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Subsequence; Counterexample; Generator (circuit theory); Conjecture; Order (exchange); Sequence (biology); Longest increasing subsequence","score_opus":0.02714832407634999,"score_gpt":0.2968632602162857,"score_spread":0.2697149361399357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416938455","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.768284,0.0029849592,0.12749271,0.00088338624,0.0005579694,0.00007843482,0.0002636445,0.00039140295,0.09906353],"genre_scores_gemma":[0.94735694,0.0012792299,0.02009583,0.00027010805,0.00071330223,0.00008877706,0.00035729707,0.00016610051,0.0296724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883145,0.00030336823,0.00009101212,0.0001576245,0.00038476713,0.00023190877],"domain_scores_gemma":[0.9971027,0.001359146,0.00046380825,0.00019639102,0.0003630211,0.00051491364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017678292,0.0010453635,0.0011871866,0.0032753805,0.0021075285,0.0025447698,0.0013965865,0.0010403363,0.0069030738],"category_scores_gemma":[0.005411595,0.00049200695,0.0008958345,0.0020444656,0.0023066183,0.007078282,0.0034740614,0.001514009,0.00080032076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007961619,0.000038645987,0.0006386402,0.000059638358,0.000016022432,0.00026052567,0.00048328986,0.0013627156,0.0013324928,0.98728555,0.00063099514,0.007811836],"study_design_scores_gemma":[0.000009483916,0.000041457755,0.00043027164,0.000026617765,0.000015624946,0.00021501018,0.00011158688,0.004703163,0.0008498357,0.99165326,0.0019276238,0.00001603403],"about_ca_topic_score_codex":0.0004653226,"about_ca_topic_score_gemma":0.00065476337,"teacher_disagreement_score":0.0069030738,"about_ca_system_score_codex":0.0012144453,"about_ca_system_score_gemma":0.0005712248,"threshold_uncertainty_score":0.023093104},"labels":[],"label_agreement":null},{"id":"W603134616","doi":"10.1016/j.disc.2015.05.002","title":"Characterization of the finite C-MH-homogeneous graphs","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Combinatorics; Homomorphism; Finite graph; Homogeneous; Discrete mathematics; Graph; Monomorphism; Isomorphism (crystallography); Injective function; Chemistry","score_opus":0.034794152584167154,"score_gpt":0.27989089660593613,"score_spread":0.24509674402176898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W603134616","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7620748,0.00042564762,0.11689664,0.0012720301,0.000096292744,0.00011336387,0.0013392371,0.0003952187,0.117386706],"genre_scores_gemma":[0.98185045,0.00015862762,0.006951885,0.00017423631,0.00012774538,0.000049564234,0.00070062187,0.000066276974,0.009920602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997012,0.000052844072,0.000012523397,0.000087432534,0.00006565585,0.00008035673],"domain_scores_gemma":[0.9979761,0.00082479627,0.0003101178,0.00018608832,0.0002968393,0.0004060186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032417275,0.00037228726,0.00043875645,0.0023207876,0.001155881,0.0016997011,0.0011495803,0.0005092113,0.010427825],"category_scores_gemma":[0.0017799989,0.00022815204,0.00044893078,0.0010816942,0.001754237,0.0018723737,0.0011186274,0.0011828408,0.000591734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008499156,0.000032587915,0.0006838816,0.00006418534,0.000009393529,0.00011607079,0.0003379604,0.0011535813,0.0048981598,0.9859158,0.0010869399,0.005616456],"study_design_scores_gemma":[0.00002709168,0.000036188292,0.0022834826,0.000035590463,0.000028409173,0.00027833786,0.00044829096,0.014597741,0.005379656,0.97141,0.005451571,0.00002344536],"about_ca_topic_score_codex":0.001604905,"about_ca_topic_score_gemma":0.0010987013,"teacher_disagreement_score":0.010427825,"about_ca_system_score_codex":0.0011806446,"about_ca_system_score_gemma":0.00045480992,"threshold_uncertainty_score":0.034884572},"labels":[],"label_agreement":null},{"id":"W7116654097","doi":"10.1016/j.disc.2025.114959","title":"New results in vertex sedentariness","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"University of Manitoba","keywords":"Vertex (graph theory); Bipartite graph; Graph; Neighbourhood (mathematics); Laplace operator","score_opus":0.008692868903677434,"score_gpt":0.2550048605322539,"score_spread":0.24631199162857648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116654097","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45071685,0.0022793028,0.47132328,0.0015786559,0.00023203279,0.00005456428,0.00035428532,0.0007271117,0.07273378],"genre_scores_gemma":[0.9530068,0.00085977954,0.037179463,0.00032758992,0.00014429753,0.00006374188,0.00025153486,0.00021305081,0.007953811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912816,0.00014341742,0.000038929815,0.00028201527,0.00024948857,0.0001579889],"domain_scores_gemma":[0.99588937,0.0021543212,0.00039810958,0.00079763803,0.00031808362,0.00044256105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086769613,0.00053183903,0.0007172009,0.001533961,0.0016858653,0.0016913111,0.0014854621,0.00109586,0.005557365],"category_scores_gemma":[0.00462764,0.00042327828,0.0009369418,0.0012336129,0.0026980487,0.0044510327,0.0023557195,0.0024344018,0.00053636276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006821802,0.000037079906,0.0011381836,0.000109111934,0.000017984841,0.0001536666,0.00042496578,0.010417419,0.0047426377,0.9725557,0.0014627444,0.008872307],"study_design_scores_gemma":[0.000010009406,0.00006148896,0.0006042261,0.000038875092,0.000027072832,0.00029242618,0.00015810906,0.043216176,0.003592692,0.9458266,0.006148708,0.000023688184],"about_ca_topic_score_codex":0.0005641685,"about_ca_topic_score_gemma":0.00065287686,"teacher_disagreement_score":0.005557365,"about_ca_system_score_codex":0.001128554,"about_ca_system_score_gemma":0.00033208716,"threshold_uncertainty_score":0.018591225},"labels":[],"label_agreement":null},{"id":"W7116751422","doi":"10.1016/j.disc.2025.114953","title":"A new conjecture on the inertia of graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Conjecture; Adjacency matrix; Lonely runner conjecture; Graph; Collatz conjecture; Line graph","score_opus":0.025653915212671467,"score_gpt":0.30642017992593595,"score_spread":0.2807662647132645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116751422","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43931898,0.0039826185,0.18827114,0.047640722,0.0051035113,0.00009951244,0.0015241166,0.0012758637,0.3127835],"genre_scores_gemma":[0.94294536,0.001388925,0.01590956,0.0039835377,0.0066439486,0.000105337895,0.00096340047,0.000386824,0.027673012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830925,0.00034075175,0.00007792417,0.0006226987,0.00033868718,0.00031064646],"domain_scores_gemma":[0.9896287,0.005891049,0.00089405273,0.0016379686,0.00073583494,0.0012125071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017467579,0.0008146418,0.0015764056,0.0029990317,0.0020874,0.0041506956,0.0019419241,0.0030596314,0.017257659],"category_scores_gemma":[0.009112053,0.0007878138,0.0015529556,0.0019518704,0.008766027,0.012048443,0.004079738,0.0051111635,0.0016300428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056950652,0.000022050168,0.000377201,0.000047240817,0.0000062416157,0.00006539115,0.00031538287,0.0005001424,0.00046151306,0.98853123,0.0058379904,0.0037786565],"study_design_scores_gemma":[0.000027764063,0.000017688875,0.00037769426,0.000017330669,0.000006834989,0.00007123865,0.00008666706,0.0019150556,0.00016595265,0.9927735,0.004528674,0.0000117578265],"about_ca_topic_score_codex":0.0010879044,"about_ca_topic_score_gemma":0.0006582826,"teacher_disagreement_score":0.017257659,"about_ca_system_score_codex":0.0014056339,"about_ca_system_score_gemma":0.0006160664,"threshold_uncertainty_score":0.05773264},"labels":[],"label_agreement":null},{"id":"W754424760","doi":"10.1016/j.disc.2015.06.022","title":"Edge coloring multigraphs without small dense subsets","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multigraph; Edge coloring; Combinatorics; Mathematics; Conjecture; Statement (logic); Vertex (graph theory); Chromatic scale; Brooks' theorem; Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; 1-planar graph; Computer science; Chordal graph; Line graph; Artificial intelligence","score_opus":0.09607106585995495,"score_gpt":0.32043644204658683,"score_spread":0.22436537618663188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W754424760","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45300308,0.0014091011,0.43601695,0.0025459668,0.0002437731,0.00012829376,0.0009864871,0.00063190324,0.10503452],"genre_scores_gemma":[0.865015,0.0009283764,0.09582042,0.0010111702,0.00024640546,0.00029024162,0.00081032835,0.00027814155,0.035599854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919516,0.00022721985,0.000044201708,0.00024037223,0.00015742391,0.00013554569],"domain_scores_gemma":[0.9934204,0.003818228,0.00050475064,0.0010980875,0.00049968297,0.00065886445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008219829,0.0007061428,0.0009617913,0.0017446514,0.0021784615,0.002656103,0.001623086,0.0010761649,0.007927629],"category_scores_gemma":[0.004357735,0.001091015,0.0006705192,0.0018646518,0.0020320127,0.006257303,0.0026653772,0.0031727355,0.0007889122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005934067,0.000043481195,0.00048197253,0.000069061534,0.000013432951,0.00011400882,0.00027186246,0.0011763155,0.0019807473,0.9860547,0.0018993561,0.0078357635],"study_design_scores_gemma":[0.000015194515,0.000012286706,0.00029963578,0.000017246992,0.000012043098,0.00019418287,0.000110995694,0.005715634,0.00086895155,0.9898683,0.0028796669,0.0000058981673],"about_ca_topic_score_codex":0.0007003323,"about_ca_topic_score_gemma":0.0014085177,"teacher_disagreement_score":0.007927629,"about_ca_system_score_codex":0.0009282915,"about_ca_system_score_gemma":0.0004600225,"threshold_uncertainty_score":0.02652055},"labels":[],"label_agreement":null},{"id":"W762650586","doi":"10.1016/j.disc.2015.06.005","title":"Join colourings of chordal graphs","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Council","keywords":"Chordal graph; Combinatorics; Mathematics; Partition (number theory); Discrete mathematics; Pathwidth; Cograph; Split graph; Indifference graph; Graph; Line graph; 1-planar graph","score_opus":0.04375043402777048,"score_gpt":0.31112911825039025,"score_spread":0.2673786842226198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W762650586","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76472974,0.0005166604,0.15269147,0.001013148,0.0003421237,0.00016579014,0.000999535,0.00060823874,0.07893329],"genre_scores_gemma":[0.93024963,0.00043340214,0.04114377,0.00026797404,0.00018168971,0.00010686295,0.0012728171,0.00028729605,0.026056627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991892,0.00014290503,0.00004250228,0.00017902063,0.00026404602,0.00018228951],"domain_scores_gemma":[0.99477756,0.0026030627,0.0005571687,0.00055775594,0.0005135738,0.0009908556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006208408,0.00040381882,0.000717176,0.001300714,0.0019882605,0.0033734497,0.0012464842,0.001021312,0.011216418],"category_scores_gemma":[0.0037184567,0.000511644,0.0005370396,0.0015032529,0.0016617917,0.0030998515,0.0024355415,0.00204067,0.0011363849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038740874,0.00008044458,0.001192638,0.00012506345,0.000024108393,0.00025281106,0.0014781673,0.002560337,0.009591551,0.95756257,0.0032588914,0.023485936],"study_design_scores_gemma":[0.00007123775,0.000069085254,0.0011238331,0.000030165804,0.00003307809,0.00017112287,0.0007319044,0.008159741,0.0038122116,0.9740559,0.011720906,0.000020755877],"about_ca_topic_score_codex":0.0011367823,"about_ca_topic_score_gemma":0.002018738,"teacher_disagreement_score":0.011216418,"about_ca_system_score_codex":0.0009460805,"about_ca_system_score_gemma":0.00051834126,"threshold_uncertainty_score":0.037522674},"labels":[],"label_agreement":null},{"id":"W929955757","doi":"10.1016/j.disc.2015.06.024","title":"Dichotomy for finite tournaments of mixed-type","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Mathematics; Unary operation; Tournament; Combinatorics; Conjecture; Constraint satisfaction problem; Congruence (geometry); Singleton; Type (biology); Discrete mathematics; Algebraic number; Statistics","score_opus":0.07072933088438883,"score_gpt":0.3471430431633135,"score_spread":0.2764137122789247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W929955757","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75188047,0.001177335,0.12752925,0.0078625195,0.0004969213,0.00010338789,0.0013220442,0.00057710137,0.10905101],"genre_scores_gemma":[0.97569704,0.0002815706,0.0089858845,0.00071661285,0.000409025,0.00015463059,0.00074910687,0.00011283696,0.012893239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974317,0.00072986627,0.00011878615,0.00055808335,0.0005538288,0.00060770416],"domain_scores_gemma":[0.99122614,0.004972463,0.00091096346,0.00048507954,0.0005694231,0.0018359222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023356748,0.00091664813,0.0021203181,0.0026938643,0.0048425477,0.011885591,0.0029541238,0.0031669135,0.014647486],"category_scores_gemma":[0.0091006635,0.0011215305,0.0018984708,0.0020946066,0.005262574,0.008577372,0.0043399213,0.0062864334,0.0008433612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016252606,0.000045023266,0.00058429094,0.00004017059,0.000021439377,0.00006140174,0.00022409909,0.00087383407,0.0003876715,0.9945686,0.0014115777,0.0016192964],"study_design_scores_gemma":[0.000080703176,0.000024220306,0.0003549103,0.000018429475,0.000017775672,0.00008179305,0.00013545497,0.008171326,0.00013759635,0.99022865,0.000732621,0.000016560343],"about_ca_topic_score_codex":0.0016729524,"about_ca_topic_score_gemma":0.0017486089,"teacher_disagreement_score":0.014647486,"about_ca_system_score_codex":0.004057732,"about_ca_system_score_gemma":0.0014480712,"threshold_uncertainty_score":0.04900074},"labels":[],"label_agreement":null}]}