{"meta":{"query_hash":"0497af5d4c81","filters":{"venue":"Discrete Mathematics Algorithms and Applications"},"cohort_total":42,"direct_labels_cover":0,"predictions_cover":42,"exported":42,"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/0497af5d4c81","api":"https://metacan.xera.ac/api/v1/cohort?venue=Discrete+Mathematics+Algorithms+and+Applications"},"results":[{"id":"W2008562682","doi":"10.1142/s179383091250036x","title":"BOUNDED LENGTH, 2-EDGE AUGMENTATION OF GEOMETRIC PLANAR GRAPHS","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Carleton University; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Planar graph; Combinatorics; Geometric graph theory; Mathematics; Line graph; Planar straight-line graph; 1-planar graph; Discrete mathematics; Spanning tree; Outerplanar graph; Pathwidth; Graph; Graph power","score_opus":0.02056900812021606,"score_gpt":0.2729444623559385,"score_spread":0.25237545423572244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008562682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40692586,0.00047213043,0.5637405,0.00075113715,0.00006917308,0.000377043,0.0008464977,0.001486211,0.025331471],"genre_scores_gemma":[0.6943868,0.00057322584,0.29819337,0.00016420675,0.00006142925,0.0003490066,0.0012136708,0.00013762328,0.0049207984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991873,0.00020779773,0.00005302838,0.0001610781,0.00029298282,0.000097802185],"domain_scores_gemma":[0.99737537,0.0010384972,0.0006383715,0.0005032358,0.00027041257,0.00017415894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003023556,0.00088178343,0.0004945516,0.00060250686,0.0005633926,0.0007616658,0.0013631061,0.0006472816,0.0024383618],"category_scores_gemma":[0.0037270712,0.00051482185,0.0006245748,0.00090867194,0.00089047913,0.0022097372,0.0018617236,0.00112538,0.0005985886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084011897,0.00024907585,0.0038391072,0.0006192407,0.00007321204,0.0011862963,0.00041311092,0.61029947,0.1020822,0.13627143,0.0042489124,0.13987787],"study_design_scores_gemma":[0.0001259137,0.0008579824,0.003395884,0.00009677618,0.000112152535,0.0017149785,0.0003114258,0.71812415,0.04969814,0.19250445,0.03298301,0.00007518242],"about_ca_topic_score_codex":0.0006094687,"about_ca_topic_score_gemma":0.00081461656,"teacher_disagreement_score":0.0024383618,"about_ca_system_score_codex":0.0005421232,"about_ca_system_score_gemma":0.00040969145,"threshold_uncertainty_score":0.008157134},"labels":[],"label_agreement":null},{"id":"W2018403223","doi":"10.1142/s1793830910000899","title":"A SUCCINCT 3D VISIBILITY SKELETON","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; McGill University","funders":"","keywords":"Visibility; Skeleton (computer programming); Set (abstract data type); Computer science; Rest (music); Theoretical computer science; Algorithm; Artificial intelligence; Geography","score_opus":0.00903917616466114,"score_gpt":0.2646601547034648,"score_spread":0.25562097853880367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018403223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049519222,0.00024938158,0.92858523,0.0003785147,0.000074392,0.00019783345,0.0050394707,0.010668803,0.005287128],"genre_scores_gemma":[0.4098468,0.00027409327,0.5726739,0.00014737225,0.00004384256,0.00030517983,0.012863521,0.0009804668,0.0028648141],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987507,0.00014026946,0.00012130607,0.0002516295,0.0006296353,0.00010650255],"domain_scores_gemma":[0.99622226,0.00068167126,0.00020367224,0.0023247118,0.00044731726,0.00012032993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007197655,0.0006061768,0.001140551,0.0010284533,0.00065509515,0.001729841,0.0018024183,0.0010849502,0.0063622836],"category_scores_gemma":[0.006132291,0.000695258,0.0011677564,0.0016977934,0.0010329448,0.0035228576,0.003722331,0.0012389112,0.0018724157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010190915,0.00037601942,0.0054813493,0.00087049167,0.000114469156,0.00054144574,0.0005599618,0.14668866,0.10495351,0.13974798,0.037015673,0.56263137],"study_design_scores_gemma":[0.00021158096,0.0004031143,0.0018855677,0.00011815718,0.00006518343,0.0010185848,0.00019128059,0.75531954,0.06842386,0.124713436,0.04754964,0.00010011329],"about_ca_topic_score_codex":0.0012321566,"about_ca_topic_score_gemma":0.001605352,"teacher_disagreement_score":0.0063622836,"about_ca_system_score_codex":0.00045150876,"about_ca_system_score_gemma":0.0012079172,"threshold_uncertainty_score":0.021283984},"labels":[],"label_agreement":null},{"id":"W2022437016","doi":"10.1142/s1793830911001346","title":"TIME OPTIMAL ALGORITHMS FOR BLACK HOLE SEARCH IN RINGS","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Toronto Metropolitan University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Asynchronous communication; Focus (optics); Computer science; Black hole (networking); Algorithm; Ring (chemistry); Upper and lower bounds; Task (project management); Mathematics; Computer network; Engineering; Routing (electronic design automation); Physics","score_opus":0.045002723913948876,"score_gpt":0.2952494002916094,"score_spread":0.2502466763776605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022437016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043495607,0.00075669243,0.9462867,0.00046014617,0.00007247753,0.00022364887,0.00011829811,0.0013571245,0.0072293743],"genre_scores_gemma":[0.39456272,0.0005749652,0.59863585,0.00020534125,0.00010022757,0.00054533157,0.00031986166,0.00034901118,0.0047066775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975804,0.000759244,0.00015607361,0.000492674,0.00045269457,0.0005588388],"domain_scores_gemma":[0.99383074,0.004290299,0.0006943106,0.00062632933,0.0003080378,0.000250389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028939105,0.001344119,0.0014431078,0.0011896855,0.0011753254,0.0019540212,0.0026001958,0.0018696693,0.005224044],"category_scores_gemma":[0.011353426,0.00069860177,0.0010315512,0.0013282436,0.0015185797,0.0042385673,0.0026193412,0.0013715827,0.0012007802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008437643,0.0003238825,0.001376987,0.00038275713,0.000110120985,0.0001124022,0.00048476065,0.75026566,0.0045939703,0.10914975,0.0072746216,0.12508132],"study_design_scores_gemma":[0.00018282652,0.000118326716,0.00017409015,0.000022441438,0.000025830554,0.000062281346,0.00007830487,0.9319283,0.0015730585,0.064173155,0.0016414924,0.000019948335],"about_ca_topic_score_codex":0.002562818,"about_ca_topic_score_gemma":0.0029164806,"teacher_disagreement_score":0.005224044,"about_ca_system_score_codex":0.0018124526,"about_ca_system_score_gemma":0.0026789429,"threshold_uncertainty_score":0.017476201},"labels":[],"label_agreement":null},{"id":"W2024836278","doi":"10.1142/s1793830912500085","title":"BOUNDED SEARCH TREE ALGORITHMS FOR PARAMETRIZED COGRAPH DELETION: EFFICIENT BRANCHING RULES BY EXPLOITING STRUCTURES OF SPECIAL GRAPH CLASSES","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Bounded function; Mathematics; Algorithm; Vertex (graph theory); Combinatorics; Treewidth; Tree-depth; Graph; Discrete mathematics; Theoretical computer science; Computer science; Pathwidth; Line graph","score_opus":0.03785958332532282,"score_gpt":0.3017967662122005,"score_spread":0.2639371828868777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024836278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021598486,0.00023381604,0.97339094,0.00021947123,0.000024326113,0.00016370397,0.00015261596,0.0014059896,0.0028106815],"genre_scores_gemma":[0.16576342,0.0002693141,0.82910585,0.00023388062,0.00004457734,0.0004448449,0.0010544567,0.0007221661,0.0023613642],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997872,0.00061272504,0.00014016757,0.000490746,0.0005771272,0.00030723252],"domain_scores_gemma":[0.9923465,0.0051955925,0.00036220922,0.0015692981,0.000352242,0.00017401112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020551737,0.0010675474,0.0013560343,0.0015095349,0.0009281894,0.001841041,0.0033726576,0.0015089178,0.006340775],"category_scores_gemma":[0.014531808,0.00074587006,0.0017374733,0.0024820536,0.0015304893,0.005318226,0.0031368092,0.0031193262,0.0015813804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000620703,0.00042964672,0.002426459,0.0005191666,0.00009663535,0.00023875797,0.00061475416,0.26672763,0.01514455,0.22034273,0.011176891,0.48166206],"study_design_scores_gemma":[0.0001298952,0.000085700136,0.0002250947,0.000039090195,0.000038136488,0.00013229859,0.000069645015,0.7963997,0.0051201256,0.19397792,0.003757076,0.000025407457],"about_ca_topic_score_codex":0.0026891655,"about_ca_topic_score_gemma":0.0039840103,"teacher_disagreement_score":0.006340775,"about_ca_system_score_codex":0.0015013881,"about_ca_system_score_gemma":0.0021520539,"threshold_uncertainty_score":0.021211982},"labels":[],"label_agreement":null},{"id":"W2026680711","doi":"10.1142/s179383091100136x","title":"DIAMETER-CONSTRAINED STEINER TREES","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Steiner tree problem; Combinatorics; Mathematics; Bounded function; Gomory–Hu tree; Tree (set theory); k-minimum spanning tree; Connected dominating set; Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; K-ary tree; Minimum spanning tree; Topology (electrical circuits); Tree structure; Computer science; Binary tree; Telecommunications","score_opus":0.034321574150032993,"score_gpt":0.28542185600936626,"score_spread":0.25110028185933325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026680711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11634204,0.00080625556,0.86865526,0.0004441048,0.00007544574,0.00018122741,0.0016964757,0.00049664953,0.011302576],"genre_scores_gemma":[0.5101765,0.0011444242,0.47904274,0.00014553434,0.00007250812,0.00023151607,0.002722628,0.00021642531,0.0062477426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954885,0.00010377477,0.00003401357,0.00012628468,0.00012011479,0.0000670478],"domain_scores_gemma":[0.99918336,0.00032294996,0.00015188775,0.00016549707,0.000097898104,0.000078458055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040858146,0.00065168145,0.00085456955,0.00067745475,0.000608784,0.0009969705,0.0013330678,0.00088831893,0.0039203353],"category_scores_gemma":[0.0031525807,0.00058452814,0.0006324403,0.0015648796,0.00035516662,0.0021971245,0.0013429226,0.000608654,0.000644753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060538534,0.00011066227,0.0019601705,0.000652555,0.000114039256,0.000529323,0.00032090337,0.6480113,0.026243655,0.15503447,0.0153662255,0.15105133],"study_design_scores_gemma":[0.00007053762,0.00016790598,0.0010331458,0.00007029345,0.000045394037,0.0006000488,0.00015452567,0.7753725,0.005434002,0.20389746,0.013124277,0.000029805875],"about_ca_topic_score_codex":0.0009288329,"about_ca_topic_score_gemma":0.0015307224,"teacher_disagreement_score":0.0039203353,"about_ca_system_score_codex":0.00066204654,"about_ca_system_score_gemma":0.0006062066,"threshold_uncertainty_score":0.01311487},"labels":[],"label_agreement":null},{"id":"W2029070879","doi":"10.1142/s1793830912500231","title":"LINEAR COHERENT BI-CLUSTERING VIA BEAM SEARCHING AND SAMPLE SET CLUSTERING","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University; University of Alberta","funders":"","keywords":"Cluster analysis; Correlation clustering; CURE data clustering algorithm; Sample (material); Data mining; Set (abstract data type); Computer science; Canopy clustering algorithm; Single-linkage clustering; Pattern recognition (psychology); Exploit; Clustering high-dimensional data; Fuzzy clustering; Artificial intelligence; Physics","score_opus":0.027382099627840162,"score_gpt":0.30621284681234523,"score_spread":0.27883074718450507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029070879","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.0023781618,0.00006895948,0.9970202,0.00004164347,0.000007654977,0.000023210685,0.000025534531,0.00024611922,0.00018850126],"genre_scores_gemma":[0.042909052,0.00009125221,0.9554218,0.00012227069,0.00002254037,0.00025955006,0.0003077613,0.00013746372,0.00072830846],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99601513,0.0015688617,0.00019381604,0.0007103184,0.0013166475,0.00019524882],"domain_scores_gemma":[0.9957425,0.0019452081,0.0003338885,0.0008208555,0.0010186089,0.00013888974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039154096,0.0010253242,0.0017013241,0.0026793033,0.0012094134,0.0016710066,0.0035883458,0.0016514191,0.002348108],"category_scores_gemma":[0.009926919,0.0010323053,0.0014228176,0.004415028,0.0016592155,0.0021964514,0.0035906143,0.0017366251,0.0016912661],"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.00063665275,0.00022440353,0.0037159647,0.00045439813,0.0004663118,0.00013600271,0.0007243669,0.35798442,0.0423861,0.08811452,0.0063604717,0.49879637],"study_design_scores_gemma":[0.00004013068,0.000058393583,0.00048695414,0.000010928762,0.00002418073,0.000053575255,0.00003800881,0.97121507,0.007539106,0.018526994,0.0019638538,0.000042745298],"about_ca_topic_score_codex":0.0029827892,"about_ca_topic_score_gemma":0.0041136313,"teacher_disagreement_score":0.0039154096,"about_ca_system_score_codex":0.0010046891,"about_ca_system_score_gemma":0.0018363808,"threshold_uncertainty_score":0.020706952},"labels":[],"label_agreement":null},{"id":"W2031081173","doi":"10.1142/s1793830911001218","title":"ON \"THE POWER OF VERIFICATION QUERIES\" IN UNCONDITIONALLY SECURE MESSAGE AUTHENTICATION","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Cryptography and Data Security","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 Calgary","funders":"","keywords":"Computer science; Adversary; Oracle; Computer security; Random oracle; Authentication (law); Adversary model; Message authentication code; Theoretical computer science; Public-key cryptography; Cryptography; Encryption; Programming language","score_opus":0.017666047169443325,"score_gpt":0.23920205292428304,"score_spread":0.22153600575483973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031081173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11993312,0.0013326822,0.8372766,0.007193133,0.0002763551,0.0002205513,0.00016504295,0.00031462565,0.033287887],"genre_scores_gemma":[0.95159113,0.00093132246,0.040901087,0.0008764582,0.00040446027,0.00017949648,0.0000728745,0.00010981989,0.0049333745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9818413,0.010287655,0.000662934,0.0013948117,0.003449954,0.002363204],"domain_scores_gemma":[0.9122926,0.075478494,0.0032455507,0.005028298,0.0026120997,0.0013429788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012780348,0.0015054445,0.0016244721,0.0016700434,0.0023684911,0.005044519,0.0028779376,0.004030014,0.004264017],"category_scores_gemma":[0.04947172,0.00082562293,0.0019038002,0.0018526113,0.017143447,0.024461683,0.0068360427,0.0070805075,0.00065344205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016567872,0.000040417308,0.0003722904,0.000051364288,0.000016468084,0.000102873724,0.00030483998,0.02091948,0.0006384905,0.9715066,0.00066351297,0.005217971],"study_design_scores_gemma":[0.0000512469,0.00009986916,0.000108475615,0.000034402325,0.000024362957,0.000090880756,0.00008033472,0.19337817,0.0009035714,0.8039253,0.001269171,0.000034270688],"about_ca_topic_score_codex":0.0021854371,"about_ca_topic_score_gemma":0.0010592287,"teacher_disagreement_score":0.012780348,"about_ca_system_score_codex":0.0039641187,"about_ca_system_score_gemma":0.003007644,"threshold_uncertainty_score":0.06758976},"labels":[],"label_agreement":null},{"id":"W2050463416","doi":"10.1142/s1793830915500093","title":"Searching for majority with k-tuple queries","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Oracle; Tuple; Computer science; Colored; Set (abstract data type); Sequence (biology); Theoretical computer science; Property (philosophy); Ball (mathematics); Algorithm; Mathematics; Discrete mathematics; Programming language","score_opus":0.03332369886006615,"score_gpt":0.2834356569589292,"score_spread":0.25011195809886305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050463416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21173985,0.0007504116,0.78048074,0.0012036513,0.000092340626,0.00023406191,0.00036760545,0.0031599205,0.0019713503],"genre_scores_gemma":[0.71696204,0.00019152234,0.2795125,0.00044499268,0.000118947275,0.00019237243,0.00071812765,0.00037658447,0.0014829163],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99091804,0.0029619152,0.0011316983,0.0018858778,0.0019209892,0.0011815435],"domain_scores_gemma":[0.9619114,0.027215935,0.0026377891,0.00525918,0.0022804402,0.0006952702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006763393,0.0014668774,0.0038628464,0.0013444383,0.0015388913,0.004053579,0.0044099772,0.0028051308,0.0026112527],"category_scores_gemma":[0.03880521,0.00090569584,0.0017781993,0.0018661319,0.0018249464,0.008809676,0.0047387388,0.0017989915,0.0013217523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006139163,0.00092787086,0.024834847,0.0010816851,0.0007068901,0.0013100185,0.0023076464,0.38471738,0.0410908,0.06266193,0.008818546,0.4654032],"study_design_scores_gemma":[0.00019135285,0.00043166062,0.00080983306,0.000039957707,0.00013129308,0.00047539664,0.0005689801,0.8767795,0.022354664,0.096251026,0.0018917024,0.00007468258],"about_ca_topic_score_codex":0.0012720986,"about_ca_topic_score_gemma":0.0011014359,"teacher_disagreement_score":0.006763393,"about_ca_system_score_codex":0.000958863,"about_ca_system_score_gemma":0.0018154217,"threshold_uncertainty_score":0.035768688},"labels":[],"label_agreement":null},{"id":"W2081214899","doi":"10.1142/s1793830914500542","title":"A combinatorial approach to quantum error correcting codes","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Calgary","funders":"","keywords":"Quantum algorithm; Quantum computer; Quantum; Quantum convolutional code; Quantum error correction; Error detection and correction; Sequence (biology); Graph","score_opus":0.014254556871088467,"score_gpt":0.25764662273326366,"score_spread":0.2433920658621752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081214899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011570567,0.0005961982,0.963025,0.0015861122,0.00025068238,0.000050414037,0.00011546624,0.00013603302,0.022669595],"genre_scores_gemma":[0.360164,0.0019768698,0.6196125,0.0010336569,0.001245233,0.0003311862,0.00026701196,0.00024325236,0.015126278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986743,0.0004658836,0.00006317557,0.00023048531,0.00043881754,0.00012731036],"domain_scores_gemma":[0.9970945,0.0016690346,0.00018480529,0.0005441324,0.00036713685,0.00014031531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010031697,0.00078725023,0.00078556186,0.00223993,0.0015414467,0.003033555,0.0025626374,0.0018248257,0.006765184],"category_scores_gemma":[0.0049978197,0.00048661663,0.001128007,0.0025061734,0.005001724,0.0047282525,0.0021989474,0.0037048159,0.00105511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006398648,0.000014587908,0.000058844067,0.000031854594,0.000004632485,0.000026101516,0.000030257102,0.01732503,0.0005733679,0.977071,0.0005379589,0.004320027],"study_design_scores_gemma":[0.0000073813326,0.000016348913,0.00004618026,0.000013340996,0.000004480674,0.000046094414,0.000022750117,0.08418762,0.000496561,0.91146755,0.003680411,0.000011340965],"about_ca_topic_score_codex":0.0011250671,"about_ca_topic_score_gemma":0.0011607507,"teacher_disagreement_score":0.006765184,"about_ca_system_score_codex":0.0016616675,"about_ca_system_score_gemma":0.0011965254,"threshold_uncertainty_score":0.022631824},"labels":[],"label_agreement":null},{"id":"W2083681472","doi":"10.1142/s1793830911001292","title":"BREAKING AND REPAIRING AN APPROXIMATE MESSAGE AUTHENTICATION SCHEME","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Hash function; Hash chain; Hash-based message authentication code; Computer science; Message authentication code; Cryptographic hash function; Scheme (mathematics); Theoretical computer science; Function (biology); Authentication (law); Collision resistance; Double hashing; Algorithm; Cryptography; Mathematics; Computer security","score_opus":0.027082068466530673,"score_gpt":0.26921254888997115,"score_spread":0.2421304804234405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083681472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15653114,0.00032558173,0.8393486,0.0004260251,0.00014383442,0.00010974042,0.000063042244,0.0006189761,0.0024330323],"genre_scores_gemma":[0.78826445,0.00021605066,0.20769563,0.0001564968,0.00008608042,0.00010244379,0.00011131372,0.000056819772,0.0033107076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958626,0.0009779045,0.00038708773,0.00063166895,0.0016150798,0.0005255677],"domain_scores_gemma":[0.99257326,0.0018968483,0.00094038266,0.003689582,0.00073241413,0.0001674179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024136743,0.0006073212,0.0012058498,0.00080364384,0.0010293061,0.0012977237,0.0015763809,0.001800758,0.0015080638],"category_scores_gemma":[0.009105137,0.00046760766,0.0009407677,0.0009129381,0.0017608519,0.0038624352,0.0033730152,0.0019094234,0.00069165224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016088263,0.00021123073,0.0042529497,0.00042404392,0.00026669542,0.001507074,0.0016945798,0.1135401,0.19832474,0.402968,0.0025814972,0.27262026],"study_design_scores_gemma":[0.00024507326,0.0010730198,0.0017777851,0.00008392823,0.00023122091,0.0027984388,0.00031205016,0.6551516,0.16132873,0.1549183,0.021848002,0.00023181019],"about_ca_topic_score_codex":0.00044075144,"about_ca_topic_score_gemma":0.00022167369,"teacher_disagreement_score":0.0024136743,"about_ca_system_score_codex":0.0008302986,"about_ca_system_score_gemma":0.0010309784,"threshold_uncertainty_score":0.012764871},"labels":[],"label_agreement":null},{"id":"W2088251771","doi":"10.1142/s1793830909000245","title":"DISTRIBUTED ENERGY-EFFICIENT ALGORITHMS FOR COVERAGE PROBLEM IN ADJUSTABLE SENSING RANGES WIRELESS SENSOR NETWORKS","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Wireless sensor network; Computer science; Algorithm; Scheduling (production processes); Energy consumption; Range (aeronautics); Efficient energy use; Set cover problem; Real-time computing; Distributed computing; Set (abstract data type); Mathematical optimization; Computer network; Mathematics; Engineering","score_opus":0.011814897034426217,"score_gpt":0.241267969559039,"score_spread":0.22945307252461278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088251771","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011535059,0.00056273816,0.9853799,0.00023763272,0.00004513428,0.00008300752,0.000035460576,0.0002502714,0.0018707532],"genre_scores_gemma":[0.5261775,0.0012906232,0.4676426,0.00021252931,0.00019123216,0.0006541447,0.0002591431,0.00012636239,0.0034458116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882454,0.0003524693,0.00006765515,0.00029031056,0.00031506093,0.0001499925],"domain_scores_gemma":[0.99779415,0.0014987456,0.00021107087,0.00019224692,0.0002112636,0.00009252601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014539695,0.0011087825,0.0012491661,0.0009425868,0.00075193204,0.0010744511,0.002689401,0.0013479044,0.0019393611],"category_scores_gemma":[0.0058686007,0.0004550686,0.0006825039,0.0016756696,0.0009851692,0.0022120925,0.0021047124,0.0016034602,0.00031951413],"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.00019107068,0.00011205129,0.0006005861,0.0001829298,0.0000355098,0.00007224193,0.00023061241,0.8713052,0.0029403928,0.03188657,0.002703352,0.089739345],"study_design_scores_gemma":[0.00003921487,0.00004443046,0.00006839266,0.000007352174,0.0000071045156,0.00003186277,0.000021640548,0.9884829,0.00046011107,0.010043614,0.0007872154,0.000006147297],"about_ca_topic_score_codex":0.0021497204,"about_ca_topic_score_gemma":0.0016630342,"teacher_disagreement_score":0.002689401,"about_ca_system_score_codex":0.0011038076,"about_ca_system_score_gemma":0.0010837286,"threshold_uncertainty_score":0.0080087185},"labels":[],"label_agreement":null},{"id":"W2104626533","doi":"10.1142/s1793830914500517","title":"The number of shortest paths in the (n, k)-star graph","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Combinatorics; Mathematics; Discrete mathematics; Voltage graph; Hypercube graph; Butterfly graph; Path graph; Star (game theory); Graph; Graph power; Complement graph; Line graph","score_opus":0.011004096710846642,"score_gpt":0.25656988590816376,"score_spread":0.2455657891973171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104626533","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61125135,0.00096575654,0.37127566,0.00071394286,0.00019480177,0.00008033972,0.0023282468,0.0003062354,0.012883574],"genre_scores_gemma":[0.75696117,0.00092673406,0.23289575,0.00008532911,0.00012490893,0.00013915196,0.001941417,0.00013064154,0.006794978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923694,0.00015405797,0.00010200494,0.00024153701,0.00016466335,0.0001008452],"domain_scores_gemma":[0.9964194,0.0017727546,0.00071347476,0.0003130775,0.0004453592,0.0003359373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061812164,0.0006055759,0.0006789817,0.0018988377,0.0007828041,0.0012285098,0.00093597337,0.0006540013,0.0033830532],"category_scores_gemma":[0.004404922,0.00024345929,0.00039092908,0.0018540414,0.0010956367,0.003711542,0.0007795384,0.00052950147,0.00053754967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011573433,0.00020352493,0.02153069,0.0013135603,0.00027565876,0.00059016707,0.0008269018,0.16535775,0.055081036,0.5389595,0.011615369,0.20308857],"study_design_scores_gemma":[0.000055534467,0.00036752192,0.0073743393,0.0000910013,0.00011129431,0.0015543969,0.00050754944,0.28849947,0.019694094,0.6637416,0.017889503,0.00011367569],"about_ca_topic_score_codex":0.0005675617,"about_ca_topic_score_gemma":0.0010042771,"teacher_disagreement_score":0.0033830532,"about_ca_system_score_codex":0.00056785124,"about_ca_system_score_gemma":0.00053918664,"threshold_uncertainty_score":0.011317372},"labels":[],"label_agreement":null},{"id":"W2106734202","doi":"10.1142/s1793830910000486","title":"AN IMPROVED LINE-SEPARABLE ALGORITHM FOR DISCRETE UNIT DISK COVER","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of New Brunswick; University of Waterloo","funders":"","keywords":"Cover (algebra); Separable space; Cardinality (data modeling); Unit disk; Combinatorics; Line (geometry); Plane (geometry); Unit (ring theory); Mathematics; Set (abstract data type); Set cover problem; Algorithm; Discrete mathematics; Computer science; Geometry; Mathematical analysis; Database","score_opus":0.015063564027802068,"score_gpt":0.29526947229923023,"score_spread":0.28020590827142816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106734202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03485919,0.00042569754,0.94984174,0.00036312838,0.00006882181,0.00022573338,0.00034917184,0.00572768,0.008138795],"genre_scores_gemma":[0.16217189,0.00016822112,0.8290039,0.00015642085,0.000051909894,0.00033004134,0.0013084373,0.0004417876,0.006367477],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899226,0.00012996673,0.00006660481,0.00019711893,0.00045436993,0.0001597108],"domain_scores_gemma":[0.9987943,0.00035228956,0.00009365154,0.0004411562,0.00023686173,0.00008173452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004513739,0.0010349099,0.0013995937,0.0016855972,0.0008636358,0.0012658095,0.0027315565,0.0012001633,0.014946636],"category_scores_gemma":[0.002680973,0.00047194416,0.00074581435,0.0028140093,0.00064904836,0.0024331617,0.0026654343,0.0012258838,0.0044176695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001070027,0.0004570227,0.00083869364,0.0002915101,0.000052053627,0.00029564335,0.0003068036,0.12024221,0.018127482,0.023340678,0.02128603,0.81369185],"study_design_scores_gemma":[0.0001974881,0.00013492897,0.00020472199,0.000015359832,0.000017730757,0.00020373103,0.00007026067,0.96545714,0.008330769,0.014301048,0.011042029,0.000024808065],"about_ca_topic_score_codex":0.0036009792,"about_ca_topic_score_gemma":0.004216791,"teacher_disagreement_score":0.014946636,"about_ca_system_score_codex":0.0012165038,"about_ca_system_score_gemma":0.0013261391,"threshold_uncertainty_score":0.050001502},"labels":[],"label_agreement":null},{"id":"W2118546815","doi":"10.1142/s1793830912500401","title":"OPTIMIZING DATA THROUGHPUT IN CLIENT/SERVER SYSTEMS BY KEEPING QUEUE SIZES BALANCED","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Carleton University","funders":"","keywords":"Server; Computer science; Computer network; Throughput; Queue; Client–server model; Server farm; Network packet; Service (business); Operating system; Wireless","score_opus":0.01945101131439236,"score_gpt":0.2631627647524371,"score_spread":0.24371175343804474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118546815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14822379,0.000919073,0.83989465,0.0006914133,0.00009345213,0.00031050845,0.0002877001,0.0034719228,0.0061075194],"genre_scores_gemma":[0.734352,0.00050391786,0.25909364,0.00017555305,0.00007546908,0.00027528717,0.00030143818,0.00036947525,0.004853237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730754,0.0006524164,0.00015302614,0.00046832563,0.00061475823,0.0008039789],"domain_scores_gemma":[0.9969675,0.0016015376,0.00033433305,0.00031563704,0.0004698464,0.0003111783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035359971,0.0016549204,0.0016730363,0.0012737475,0.001794827,0.002994551,0.00353793,0.0016243422,0.0027071806],"category_scores_gemma":[0.0069172354,0.0010431191,0.00046382667,0.0031682237,0.001518164,0.0035020292,0.0016912628,0.0014939621,0.0012008265],"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.0007314949,0.00027972064,0.0011678156,0.000116436444,0.000047762634,0.0001053335,0.00018593593,0.9107011,0.017466716,0.008961378,0.0024964346,0.057739995],"study_design_scores_gemma":[0.00006860202,0.00006190883,0.00020513347,0.000005015794,0.000019157986,0.000030409816,0.00006838294,0.9849268,0.007266388,0.00653756,0.00079713046,0.000013456439],"about_ca_topic_score_codex":0.013124136,"about_ca_topic_score_gemma":0.010632073,"teacher_disagreement_score":0.013124136,"about_ca_system_score_codex":0.004856509,"about_ca_system_score_gemma":0.004502133,"threshold_uncertainty_score":0.035236597},"labels":[],"label_agreement":null},{"id":"W2140185923","doi":"10.1142/s1793830909000415","title":"LOCAL CONSTRUCTION AND COLORING OF SPANNERS OF LOCATION AWARE UNIT DISK GRAPHS","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Spanner; Unit disk graph; Vertex (graph theory); Combinatorics; Bipartite graph; Mathematics; Graph; Locality; Computer science; Database","score_opus":0.013291419705873185,"score_gpt":0.25607892269689475,"score_spread":0.24278750299102156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140185923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2875836,0.00022346336,0.7059284,0.00010003816,0.000029424351,0.00012316222,0.0001676123,0.0011244756,0.0047198725],"genre_scores_gemma":[0.64330494,0.00018306554,0.35161325,0.00004807702,0.000022832586,0.00018053394,0.0006807167,0.00018903668,0.003777519],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950576,0.00012740384,0.000026972795,0.00013658313,0.0001007241,0.00010261535],"domain_scores_gemma":[0.99874073,0.00033883308,0.00017343274,0.00046431378,0.0001459499,0.00013672427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035185114,0.0005534273,0.0007004638,0.00060696626,0.0005808405,0.0007321788,0.0012067914,0.0005574732,0.0036594137],"category_scores_gemma":[0.0022872265,0.00035284573,0.00046841332,0.0009226763,0.0006599938,0.0015711818,0.0016867298,0.000679495,0.0007579896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007396867,0.00035506045,0.0068168123,0.0005378785,0.000095918534,0.0006156586,0.00083150767,0.5287324,0.07550014,0.10016306,0.004400526,0.28121138],"study_design_scores_gemma":[0.000052802636,0.0002915456,0.0013546466,0.000041483465,0.00003170992,0.00037263302,0.00038292224,0.88177854,0.041743577,0.06863135,0.0052879113,0.00003086867],"about_ca_topic_score_codex":0.00089578377,"about_ca_topic_score_gemma":0.0014798943,"teacher_disagreement_score":0.0036594137,"about_ca_system_score_codex":0.00056393945,"about_ca_system_score_gemma":0.00041793843,"threshold_uncertainty_score":0.012242019},"labels":[],"label_agreement":null},{"id":"W2154649555","doi":"10.1142/s1793830912500383","title":"STRONG CONNECTIVITY IN SENSOR NETWORKS WITH GIVEN NUMBER OF DIRECTIONAL ANTENNAE OF BOUNDED ANGLE","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Concordia University; Carleton University","funders":"","keywords":"Omnidirectional antenna; Antenna (radio); Computer science; Range (aeronautics); Directional antenna; Transmission (telecommunications); Set (abstract data type); Orientation (vector space); Wireless sensor network; Bounded function; Throughput; Topology (electrical circuits); Computer network; Telecommunications; Wireless; Electrical engineering; Mathematics; Engineering; Geometry; Aerospace engineering","score_opus":0.012690487256631367,"score_gpt":0.2593403503057864,"score_spread":0.24664986304915504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154649555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07553751,0.00059865596,0.91653925,0.0008432083,0.000054020085,0.00017189239,0.00013058825,0.00034123095,0.0057836995],"genre_scores_gemma":[0.7990132,0.0013296085,0.19537729,0.00028145692,0.00010962724,0.0005041843,0.00029690022,0.00009756486,0.0029900677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977506,0.00091809186,0.00013773066,0.00044370498,0.00049047946,0.0002593848],"domain_scores_gemma":[0.98602444,0.010585742,0.0013636514,0.0009404753,0.0006317115,0.00045399784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022769473,0.0008581133,0.00080651813,0.0009157477,0.0008243588,0.0017428832,0.0016030014,0.0010926005,0.0022140257],"category_scores_gemma":[0.017711593,0.00078179437,0.0008663793,0.0013105196,0.0026747545,0.0050592204,0.0026608594,0.0018106418,0.00040515297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045903193,0.00009810446,0.0028316383,0.0005488363,0.00007986888,0.00047694732,0.00045813646,0.7121241,0.009244759,0.2376709,0.0024009328,0.03360674],"study_design_scores_gemma":[0.000059987637,0.00025677274,0.0005471498,0.000057897996,0.00004093084,0.00030020977,0.00018262747,0.8719175,0.0023327386,0.121068485,0.0032117767,0.00002402222],"about_ca_topic_score_codex":0.00072162435,"about_ca_topic_score_gemma":0.0010457708,"teacher_disagreement_score":0.0022769473,"about_ca_system_score_codex":0.0011227016,"about_ca_system_score_gemma":0.0008771168,"threshold_uncertainty_score":0.012041748},"labels":[],"label_agreement":null},{"id":"W2157039077","doi":"10.1142/s1793830911001425","title":"FUZZY UNIVERSAL HASHING AND APPROXIMATE AUTHENTICATION","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Chaos-based Image/Signal Encryption","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Hash function; Authentication (law); Computer science; Universal hashing; Construct (python library); Fuzzy logic; Message authentication code; Theoretical computer science; Cryptography; Data mining; Computer security; Double hashing; Artificial intelligence; Hash table; Computer network","score_opus":0.02397353003186539,"score_gpt":0.2403646152375851,"score_spread":0.2163910852057197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157039077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067462124,0.0010263755,0.9253352,0.00034694272,0.00008001053,0.000034846507,0.000052679672,0.0001427172,0.0055190767],"genre_scores_gemma":[0.9324601,0.00067484076,0.06284318,0.00011630998,0.00013830897,0.00004646841,0.00005918744,0.000018321936,0.003643325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988054,0.00034407468,0.000071202034,0.00021014118,0.0004364312,0.00013284516],"domain_scores_gemma":[0.9983376,0.00063234544,0.00022707919,0.0005043226,0.00024553537,0.000053052256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000981595,0.0003045924,0.00051572046,0.0007224955,0.00047661198,0.0008162537,0.00050416315,0.0007230889,0.001563522],"category_scores_gemma":[0.0039776294,0.00017544639,0.0005012235,0.00077478867,0.0028211153,0.0025818187,0.0014698242,0.0008789829,0.0003199583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001328,0.000017971499,0.0005758994,0.00009294075,0.000032200678,0.00011677008,0.00021909848,0.06289229,0.006016898,0.88442636,0.0005640569,0.04491281],"study_design_scores_gemma":[0.000022542963,0.00013885622,0.0005602335,0.000025129648,0.000020571888,0.00028585232,0.00008795099,0.4065541,0.00561953,0.5820096,0.004629274,0.000046299818],"about_ca_topic_score_codex":0.000991957,"about_ca_topic_score_gemma":0.00041315594,"teacher_disagreement_score":0.001563522,"about_ca_system_score_codex":0.0008517644,"about_ca_system_score_gemma":0.00053245487,"threshold_uncertainty_score":0.006180048},"labels":[],"label_agreement":null},{"id":"W2196944838","doi":"10.1142/s1793830916500099","title":"On the graph of nilpotent matrix group of length one","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Combinatorics; Mathematics; Cayley graph; Adjacency matrix; Laplacian matrix; Multiplicative function; Graph; Nilpotent; Degree matrix; Nilpotent group; Discrete mathematics; Graph power; Line graph","score_opus":0.05179355761883672,"score_gpt":0.30713388040848066,"score_spread":0.2553403227896439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2196944838","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80834395,0.0011063358,0.14034484,0.0008991659,0.0003142388,0.000057772537,0.0003893695,0.00045305266,0.048091207],"genre_scores_gemma":[0.9594806,0.00073804666,0.026244687,0.00032471961,0.00020659674,0.000054241824,0.00045305424,0.00012177856,0.012376263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999793,0.00004947889,0.000005785355,0.00006649914,0.000051710616,0.000033527656],"domain_scores_gemma":[0.99960977,0.000102441016,0.00008800265,0.0000380042,0.00007789668,0.00008381342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001098707,0.00039697462,0.00035582544,0.0011099846,0.0008681576,0.0006906896,0.0005494928,0.0003915878,0.004426249],"category_scores_gemma":[0.00052843406,0.0001403932,0.000290395,0.0005274747,0.0008348115,0.0012552459,0.00065330666,0.00059796334,0.00063863304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079670994,0.00003454523,0.0007872783,0.00012856108,0.00001655268,0.00050267647,0.00040143036,0.0040636244,0.011757578,0.9684092,0.002264823,0.011554179],"study_design_scores_gemma":[0.000025142115,0.000102921076,0.0011313455,0.000027922324,0.000018792556,0.00075657316,0.0002786403,0.03178082,0.004877179,0.9515986,0.009365741,0.00003642251],"about_ca_topic_score_codex":0.00064892776,"about_ca_topic_score_gemma":0.0006820952,"teacher_disagreement_score":0.004426249,"about_ca_system_score_codex":0.000345485,"about_ca_system_score_gemma":0.00022755635,"threshold_uncertainty_score":0.014807224},"labels":[],"label_agreement":null},{"id":"W2315491415","doi":"10.1142/s1793830916500385","title":"Linear layouts of weakly triangulated graphs","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Combinatorics; Quadrilateral; Mathematics; Graph; Discrete mathematics","score_opus":0.01998284194362755,"score_gpt":0.29938829212707935,"score_spread":0.2794054501834518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2315491415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3530261,0.00034499532,0.62805593,0.00020661498,0.00007950947,0.00018049311,0.00093313574,0.0014560926,0.015717192],"genre_scores_gemma":[0.71552086,0.0003503181,0.26906464,0.00012189074,0.00004633833,0.0002387725,0.0021559554,0.0005153764,0.011985776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993231,0.00011105192,0.000047896985,0.00019157991,0.00019639973,0.00012986491],"domain_scores_gemma":[0.9984187,0.00035977032,0.00040655272,0.00032122558,0.0002826823,0.00021107432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026654394,0.00057964376,0.00047952755,0.0016495836,0.0008584432,0.0013064805,0.0013249435,0.00059467286,0.0070734504],"category_scores_gemma":[0.002948911,0.0008053458,0.0007433553,0.0014473522,0.0014157324,0.001894504,0.0016190213,0.0009946717,0.0016210743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004683418,0.0001375467,0.00525745,0.00049577124,0.000059694223,0.00085919315,0.0014326519,0.17120838,0.042443477,0.5992364,0.0056734206,0.17272758],"study_design_scores_gemma":[0.00007398393,0.00020905944,0.0020382833,0.00007408475,0.000044700024,0.00046071725,0.00061619305,0.24055846,0.023392584,0.7169006,0.015540651,0.000090755915],"about_ca_topic_score_codex":0.0023419522,"about_ca_topic_score_gemma":0.0029068664,"teacher_disagreement_score":0.0070734504,"about_ca_system_score_codex":0.0010474025,"about_ca_system_score_gemma":0.00048811646,"threshold_uncertainty_score":0.023663104},"labels":[],"label_agreement":null},{"id":"W2345197515","doi":"10.1142/s1793830916500427","title":"Survivability of bouncing robots","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Université du Québec en Outaouais","funders":"","keywords":"Robot; Survivability; Swarm behaviour; Position (finance); Trajectory; Swarm robotics; Mobile robot; Computer science; Robotics; Control theory (sociology); Artificial intelligence; Physics; Control (management)","score_opus":0.02190954584372441,"score_gpt":0.27330321417213055,"score_spread":0.25139366832840615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2345197515","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.919101,0.0006773448,0.07170769,0.00021878818,0.000043320622,0.00003595689,0.000099756886,0.00020088661,0.007915181],"genre_scores_gemma":[0.9929923,0.0002249961,0.00450807,0.000033921384,0.00000935874,0.000039830236,0.00016795468,0.000017709486,0.0020059813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996934,0.000034437748,0.000017596496,0.00007182277,0.00009393827,0.0000888442],"domain_scores_gemma":[0.9991074,0.00023121771,0.00022921147,0.00013941001,0.0001256584,0.00016713317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027702417,0.0005159776,0.00057313463,0.0005118491,0.0008879314,0.00066051044,0.00080127874,0.0004711939,0.001643113],"category_scores_gemma":[0.001764311,0.0003088267,0.00043138716,0.0003214102,0.0014821303,0.0009991184,0.001807264,0.00056234637,0.00018585626],"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.0011057314,0.0001539632,0.033411045,0.0006469032,0.00018571081,0.0038900648,0.0018272672,0.66147065,0.09246599,0.123987645,0.0029832618,0.07787179],"study_design_scores_gemma":[0.000050021237,0.00068008964,0.010002216,0.00008163691,0.00007434756,0.001255926,0.0009551971,0.86777085,0.025140498,0.085117504,0.008803247,0.000068416],"about_ca_topic_score_codex":0.0022944969,"about_ca_topic_score_gemma":0.0009732789,"teacher_disagreement_score":0.0022944969,"about_ca_system_score_codex":0.00046444184,"about_ca_system_score_gemma":0.00029428187,"threshold_uncertainty_score":0.0054968},"labels":[],"label_agreement":null},{"id":"W2586542999","doi":"10.1142/s1793830917500203","title":"Random graph languages","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Computer science; Undirected graph; Comparability graph; Voltage graph; Null graph; Graph; Discrete mathematics; Mathematics; Line graph; Theoretical computer science","score_opus":0.012106860808956496,"score_gpt":0.2792503952538275,"score_spread":0.267143534444871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2586542999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078999944,0.005307015,0.79689175,0.00855216,0.0009695718,0.000312341,0.0023211911,0.0019724818,0.104673594],"genre_scores_gemma":[0.770687,0.003925391,0.17441484,0.0038612753,0.0013620553,0.0008176483,0.0024627885,0.00066854584,0.04180046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958401,0.0014364191,0.00032027863,0.0012709333,0.00079662405,0.00033570995],"domain_scores_gemma":[0.993101,0.003987671,0.00071924203,0.00091149437,0.00095672306,0.00032393006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021821475,0.0006757598,0.0008517535,0.002473063,0.0013000476,0.0034244105,0.0014294717,0.00139418,0.009477428],"category_scores_gemma":[0.008574088,0.00041471404,0.0014833658,0.0017912774,0.0036049695,0.0075404183,0.0019908745,0.0019449579,0.0022703013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012164943,0.000008375135,0.00014954612,0.000057994424,0.000008985722,0.00009065484,0.00027862846,0.0008952181,0.00046097283,0.99188447,0.0016509277,0.0045019477],"study_design_scores_gemma":[0.000011419558,0.000016120692,0.000102342456,0.000032634023,0.000009213218,0.00033647005,0.00014368136,0.0071528493,0.00038023602,0.97562784,0.016167236,0.000019844834],"about_ca_topic_score_codex":0.00069537095,"about_ca_topic_score_gemma":0.0004692417,"teacher_disagreement_score":0.009477428,"about_ca_system_score_codex":0.0015511046,"about_ca_system_score_gemma":0.0009553258,"threshold_uncertainty_score":0.0317052},"labels":[],"label_agreement":null},{"id":"W2751727209","doi":"10.1142/s1793830917500653","title":"Disjoint dominating sets with a perfect matching","year":2017,"lang":"en","type":"preprint","venue":"Discrete Mathematics Algorithms and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada; Mount Allison University","keywords":"Combinatorics; Disjoint sets; Mathematics; Independence number; Discrete mathematics; Graph; Cardinality (data modeling); Matching (statistics); Computer science","score_opus":0.02575959521276084,"score_gpt":0.32599605541480425,"score_spread":0.3002364602020434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751727209","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25756252,0.002281898,0.68445426,0.0022950296,0.0002385576,0.0003212123,0.0017243553,0.00045476138,0.050667316],"genre_scores_gemma":[0.8361393,0.001037298,0.14534505,0.00060382107,0.00026729165,0.00026769802,0.00098898,0.00013498006,0.01521554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966768,0.0008315573,0.00020979096,0.0010710844,0.00084892,0.00036175895],"domain_scores_gemma":[0.992724,0.003768508,0.0010334174,0.0014259767,0.00042016397,0.00062810566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023415433,0.0011516601,0.0013804178,0.0011250167,0.001417584,0.0025661073,0.0018237568,0.0012778504,0.0046739806],"category_scores_gemma":[0.011727269,0.0008101194,0.0012615895,0.002281382,0.0020056847,0.00649554,0.0031010527,0.0017653754,0.0008925199],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000379787,0.00013092908,0.0016707109,0.00040509936,0.00013529358,0.00045123367,0.00049627636,0.09011653,0.0043783276,0.85892767,0.0047570844,0.038150992],"study_design_scores_gemma":[0.000085161024,0.00011976302,0.0005428852,0.000051262443,0.000079046265,0.0006671581,0.00011740918,0.1319883,0.0034350336,0.8468564,0.016024917,0.000032689408],"about_ca_topic_score_codex":0.0008560548,"about_ca_topic_score_gemma":0.000728261,"teacher_disagreement_score":0.0046739806,"about_ca_system_score_codex":0.0020330912,"about_ca_system_score_gemma":0.0010414991,"threshold_uncertainty_score":0.015636027},"labels":[],"label_agreement":null},{"id":"W2786984082","doi":"10.1142/s1793830918500258","title":"Asymptotically optimal scheduling of random malleable demands in smart grid","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Scheduling (production processes); Mathematics; Time horizon; Regular polygon; Bounded function; Grid; Computer science","score_opus":0.015262041106588185,"score_gpt":0.27295208666951287,"score_spread":0.2576900455629247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786984082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31850165,0.0009336455,0.67311144,0.0012218014,0.00010562033,0.000081570535,0.00027687533,0.00039304252,0.0053743552],"genre_scores_gemma":[0.97171974,0.0003196271,0.025913065,0.0000980193,0.00004659694,0.00005594887,0.00012181889,0.0000670405,0.0016582139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993098,0.00027878594,0.00003312972,0.00010882238,0.000103917206,0.00016566094],"domain_scores_gemma":[0.99596894,0.0030423442,0.00047412462,0.00013712254,0.0001973318,0.00018022457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015364125,0.0006936167,0.0013105434,0.0003916854,0.00031965005,0.0007262702,0.0007774897,0.0008196661,0.0017365391],"category_scores_gemma":[0.006727188,0.00058695866,0.00041602392,0.00077013095,0.00083781214,0.0012794714,0.0005898831,0.00087898166,0.00016862847],"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.00013718105,0.00003625353,0.0004022922,0.00005420162,0.00001565567,0.00004404724,0.000021977494,0.98558515,0.000765687,0.009086794,0.00044690716,0.0034038336],"study_design_scores_gemma":[0.0000135038745,0.000021924952,0.00009967351,0.0000020928467,0.000003108413,0.000006901684,0.000009114055,0.9938877,0.00015147823,0.005711432,0.000090525915,0.00000247682],"about_ca_topic_score_codex":0.004512555,"about_ca_topic_score_gemma":0.0028323545,"teacher_disagreement_score":0.004512555,"about_ca_system_score_codex":0.0014808282,"about_ca_system_score_gemma":0.00096830114,"threshold_uncertainty_score":0.010744214},"labels":[],"label_agreement":null},{"id":"W2948073045","doi":"10.1142/s1793830920500391","title":"A separator-based method for generating weakly chordal graphs","year":2020,"lang":"en","type":"preprint","venue":"Discrete Mathematics Algorithms and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Chordal graph; Combinatorics; Interval graph; Mathematics; Treewidth; Graph; Block graph; Outerplanar graph; Discrete mathematics; Computer science; Pathwidth; Algorithm; Line graph; 1-planar graph","score_opus":0.044234334651032416,"score_gpt":0.36754259478659695,"score_spread":0.3233082601355645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948073045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011521112,0.0000915701,0.9785366,0.00012997296,0.000059599155,0.00021975451,0.0005181559,0.0053288047,0.0035943612],"genre_scores_gemma":[0.08406052,0.00009508304,0.90789306,0.00010356464,0.000030537252,0.00029639967,0.0017568035,0.0010575044,0.00470649],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998429,0.00022157872,0.00014753289,0.00038542066,0.0006738408,0.00014263015],"domain_scores_gemma":[0.9964204,0.00089553813,0.0002631908,0.0016653822,0.0005853601,0.00017007743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008524931,0.0009093271,0.00088089413,0.0017025125,0.0010735353,0.0015402054,0.0026283793,0.0009110282,0.011519405],"category_scores_gemma":[0.0044804104,0.00077350944,0.0012412032,0.0025783917,0.0011008737,0.003827633,0.003220651,0.0015136935,0.005306154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009406166,0.000326131,0.001889134,0.0008776027,0.00010495694,0.0003933542,0.0007068312,0.02552395,0.096236326,0.1374495,0.021205237,0.71434635],"study_design_scores_gemma":[0.0004381847,0.0007533735,0.0009136743,0.000107002816,0.00012939195,0.0010462628,0.00046196504,0.43467507,0.20905097,0.24595934,0.106238164,0.0002266115],"about_ca_topic_score_codex":0.00094560464,"about_ca_topic_score_gemma":0.001600571,"teacher_disagreement_score":0.011519405,"about_ca_system_score_codex":0.000898182,"about_ca_system_score_gemma":0.0014240281,"threshold_uncertainty_score":0.03853625},"labels":[],"label_agreement":null},{"id":"W2949808087","doi":"10.1142/s1793830920500056","title":"Plane and planarity thresholds for random geometric graphs","year":2019,"lang":"en","type":"preprint","venue":"Discrete Mathematics Algorithms and Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Windsor","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Planarity testing; Random geometric graph; Euclidean geometry; Unit square; Plane (geometry); Clique; Spatial network; Square (algebra); Graph; Random graph; Euclidean distance; Unit disk graph; Discrete mathematics; Geometry; Line graph; Computer science","score_opus":0.022007980558606647,"score_gpt":0.2754168138140871,"score_spread":0.25340883325548047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949808087","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.668217,0.002572923,0.28286397,0.0038215797,0.0001356075,0.00019601363,0.0011324289,0.0008897544,0.040170744],"genre_scores_gemma":[0.97110534,0.0006725292,0.023302602,0.0003423102,0.00012024552,0.00018453664,0.0006029134,0.000178695,0.0034907782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980811,0.00047175307,0.00008733539,0.00049130095,0.0005366718,0.00033177066],"domain_scores_gemma":[0.9775344,0.014629129,0.0033178683,0.0016518513,0.0012477565,0.0016190528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017222374,0.00061501504,0.0010307173,0.003096585,0.00093293464,0.0027075114,0.0018585684,0.001547164,0.005385],"category_scores_gemma":[0.02426153,0.0005933588,0.0007984271,0.0016995448,0.0028301023,0.0042503085,0.002590113,0.0022062873,0.00062741584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053685927,0.000138864,0.004195656,0.00024264432,0.000066516055,0.00026808324,0.00039870493,0.10891938,0.0077513447,0.85221684,0.0053193267,0.019945791],"study_design_scores_gemma":[0.00008764568,0.00014470176,0.0031831125,0.000060796723,0.00005358629,0.0004882346,0.00019922161,0.32734638,0.0052751144,0.6591259,0.0039713145,0.00006387382],"about_ca_topic_score_codex":0.0010839404,"about_ca_topic_score_gemma":0.0006184157,"teacher_disagreement_score":0.005385,"about_ca_system_score_codex":0.0023636646,"about_ca_system_score_gemma":0.00056058785,"threshold_uncertainty_score":0.01801467},"labels":[],"label_agreement":null},{"id":"W2952313717","doi":"10.1142/s1793830911001280","title":"AVERAGE-CASE ANALYSIS OF PERFECT SORTING BY REVERSALS","year":2011,"lang":"en","type":"preprint","venue":"Discrete Mathematics Algorithms and Applications","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Agence Nationale de la Recherche","keywords":"Permutation (music); Sorting; Mathematics; Combinatorics; Sequence (biology); Interval (graph theory); Class (philosophy); Identity (music); Discrete mathematics; Computer science; Algorithm; Physics","score_opus":0.01799824759812478,"score_gpt":0.2727716805417889,"score_spread":0.2547734329436641,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952313717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3111788,0.0025422198,0.6473604,0.0021532,0.00018510914,0.00016309545,0.0014729272,0.0010968384,0.03384741],"genre_scores_gemma":[0.94947857,0.0011708799,0.039878298,0.00040425494,0.0003263896,0.00015757332,0.00083531113,0.00032165958,0.0074270912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99487466,0.0012566423,0.00029433644,0.0010669628,0.0013103564,0.0011969274],"domain_scores_gemma":[0.96009046,0.027627815,0.0035090372,0.0041674525,0.002627488,0.0019777603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077491067,0.0012695713,0.0023755673,0.00236683,0.0015106379,0.0046880324,0.0043062847,0.0024135273,0.011439625],"category_scores_gemma":[0.050237343,0.0009289985,0.0016825179,0.0030644697,0.003087861,0.010134697,0.0023938846,0.0029033606,0.001270176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005845347,0.00019825577,0.0053157574,0.00024903036,0.00013196566,0.0006166186,0.00022324185,0.39083812,0.003869474,0.5727582,0.00550521,0.019709613],"study_design_scores_gemma":[0.000034986864,0.00007549454,0.0005902916,0.000019692106,0.000035031764,0.00026556954,0.00006872834,0.72044283,0.0011911005,0.27594605,0.0012942906,0.000035891673],"about_ca_topic_score_codex":0.0025147398,"about_ca_topic_score_gemma":0.0015891598,"teacher_disagreement_score":0.011439625,"about_ca_system_score_codex":0.0028435437,"about_ca_system_score_gemma":0.0019300871,"threshold_uncertainty_score":0.04098171},"labels":[],"label_agreement":null},{"id":"W2962947731","doi":"10.1142/s1793830909000312","title":"CLASSIFICATION OF NEAR-NORMAL SEQUENCES","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Geology","score_opus":0.01773718719294016,"score_gpt":0.2653631227996698,"score_spread":0.24762593560672963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962947731","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7606328,0.0011528458,0.17207555,0.000891335,0.00052491465,0.00015226565,0.00090996624,0.00037416338,0.063286066],"genre_scores_gemma":[0.9220723,0.0010174478,0.05071235,0.00033537936,0.00046936763,0.00016848366,0.0025538346,0.0001412796,0.022529539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872416,0.0001911903,0.000119706376,0.00027063498,0.000465114,0.0002291655],"domain_scores_gemma":[0.99701023,0.0006228197,0.00043784225,0.00031796098,0.0009741178,0.00063704513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000977085,0.00051223324,0.0005983659,0.0038934909,0.0015953887,0.0023375233,0.000833513,0.00096706435,0.0061820354],"category_scores_gemma":[0.004965368,0.00022691372,0.00042224498,0.001781361,0.002197985,0.004361177,0.0022301588,0.001732741,0.0013339816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021840693,0.00010474594,0.0058517894,0.00009035539,0.000008672301,0.00019843307,0.00063226116,0.0021751064,0.007964359,0.92573667,0.0025115157,0.05450775],"study_design_scores_gemma":[0.000025700894,0.00014536435,0.0030664478,0.00008062415,0.0000114852755,0.0009865611,0.0004533859,0.02108196,0.005487249,0.94349855,0.025115475,0.00004725374],"about_ca_topic_score_codex":0.0004073113,"about_ca_topic_score_gemma":0.00026590683,"teacher_disagreement_score":0.0061820354,"about_ca_system_score_codex":0.0009516018,"about_ca_system_score_gemma":0.0005367758,"threshold_uncertainty_score":0.020681024},"labels":[],"label_agreement":null},{"id":"W3006001508","doi":"10.1142/s179383092150049x","title":"Semi-dynamic algorithms for strongly chordal graphs","year":2020,"lang":"en","type":"preprint","venue":"Discrete Mathematics Algorithms and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Chordal graph; Interval graph; Combinatorics; Enhanced Data Rates for GSM Evolution; Dynamic problem; Shortest path problem; Mathematics; Pathwidth; Graph; Computer science; Treewidth; Algorithm; Discrete mathematics; Line graph; 1-planar graph","score_opus":0.03345199863854946,"score_gpt":0.33286946492678504,"score_spread":0.29941746628823557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006001508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02284162,0.00063179753,0.96635777,0.0007112181,0.00009878449,0.00023524999,0.00038771372,0.0015221894,0.0072136144],"genre_scores_gemma":[0.40219888,0.0009543078,0.58622473,0.0006156438,0.00019302023,0.00043587515,0.0017349537,0.00046287317,0.0071797594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996865,0.00064247136,0.00026726225,0.0007993874,0.001093026,0.00033289057],"domain_scores_gemma":[0.98823524,0.0058633666,0.00074199383,0.0035046753,0.0012519148,0.00040286046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016458451,0.00074400165,0.00092754455,0.0011136481,0.0011074339,0.0026809794,0.0030185822,0.0012037285,0.005214261],"category_scores_gemma":[0.014748605,0.00049625203,0.00096619636,0.0018054019,0.0014415735,0.0072224448,0.0046258983,0.0022693651,0.0014134605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000576371,0.00031855752,0.0016065121,0.000657442,0.00009404404,0.00019496695,0.00048916833,0.13340084,0.015829068,0.51441646,0.016088836,0.31632778],"study_design_scores_gemma":[0.00009399191,0.00011249133,0.0002971481,0.00003524058,0.00002835584,0.00033211603,0.0001534596,0.35288814,0.006026116,0.6252143,0.014783412,0.000035346875],"about_ca_topic_score_codex":0.0014913292,"about_ca_topic_score_gemma":0.0021274611,"teacher_disagreement_score":0.005214261,"about_ca_system_score_codex":0.0017890732,"about_ca_system_score_gemma":0.001994294,"threshold_uncertainty_score":0.017443478},"labels":[],"label_agreement":null},{"id":"W3006791922","doi":"10.1142/s1793830920500354","title":"Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Planar graph; Edge coloring; Graph; Discrete mathematics; Line graph; Graph power","score_opus":0.027274697744840797,"score_gpt":0.25649152647945705,"score_spread":0.22921682873461627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006791922","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.710759,0.00059258606,0.21949959,0.0005431104,0.00009919975,0.00017676444,0.001017341,0.0007347758,0.066577636],"genre_scores_gemma":[0.91118395,0.00045817002,0.08111315,0.00020417383,0.000043867673,0.00011196181,0.0010973029,0.00013944948,0.0056479922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995116,0.000062681516,0.000027712846,0.00014093904,0.00012228928,0.00013473108],"domain_scores_gemma":[0.9985959,0.00052049645,0.0002841646,0.00026698638,0.000208937,0.00012353728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026040582,0.0004642816,0.0004199042,0.000917036,0.0009529077,0.0011837719,0.0008066707,0.0004631454,0.0048296624],"category_scores_gemma":[0.0020980393,0.00032847526,0.0005431623,0.0013894645,0.001037732,0.0016942144,0.0011255157,0.0011293826,0.00054329226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003873996,0.00019405894,0.005976673,0.00046815307,0.000049220966,0.0004412911,0.0006026008,0.04859324,0.049839225,0.77879006,0.006884795,0.107773334],"study_design_scores_gemma":[0.00007698448,0.00022840725,0.006270496,0.00006229336,0.00010161866,0.00096865697,0.0005040388,0.14959368,0.035094026,0.77325106,0.03375186,0.00009692138],"about_ca_topic_score_codex":0.001958558,"about_ca_topic_score_gemma":0.0026006275,"teacher_disagreement_score":0.0048296624,"about_ca_system_score_codex":0.0012444064,"about_ca_system_score_gemma":0.00083387335,"threshold_uncertainty_score":0.016156852},"labels":[],"label_agreement":null},{"id":"W3030282785","doi":"10.1142/s1793830920500482","title":"Starter sequences and M-fold starter sequences: How can you begin?","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Starter; Mathematics; Combinatorics; Fold (higher-order function); Biology; Computer science; Food science; Programming language","score_opus":0.015639134198053867,"score_gpt":0.21258263772387728,"score_spread":0.1969435035258234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030282785","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.038280122,0.068153135,0.6427799,0.07410369,0.018012373,0.0001801727,0.00044290177,0.0023987815,0.15564893],"genre_scores_gemma":[0.41841477,0.06512634,0.3565613,0.029862925,0.01619672,0.00046105133,0.000827506,0.0017235082,0.11082576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993843,0.00021319157,0.00004398064,0.00014152918,0.00013786016,0.00007917843],"domain_scores_gemma":[0.99770665,0.0011627437,0.00018755622,0.0002790127,0.00041842443,0.0002456244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016627247,0.0012408178,0.0010762413,0.0016462369,0.001429968,0.0027293193,0.0014032759,0.0031067124,0.0113151735],"category_scores_gemma":[0.006057284,0.00053793227,0.0007392516,0.001309219,0.0058868504,0.020255448,0.0031801458,0.00594634,0.0044653374],"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.00005918662,0.0000297079,0.00024003065,0.00021825192,0.0000071913696,0.00020293245,0.0005107266,0.00045857052,0.0010147108,0.94548494,0.013475805,0.038297947],"study_design_scores_gemma":[0.000008734557,0.000058542006,0.00017957315,0.00018597125,0.0000053931035,0.00037256395,0.00031939938,0.0013809452,0.0013433096,0.91416794,0.08193849,0.000039033253],"about_ca_topic_score_codex":0.0006820201,"about_ca_topic_score_gemma":0.00076940807,"teacher_disagreement_score":0.0113151735,"about_ca_system_score_codex":0.00095724745,"about_ca_system_score_gemma":0.0007339015,"threshold_uncertainty_score":0.037853003},"labels":[],"label_agreement":null},{"id":"W3103538977","doi":"10.1142/s1793830922500975","title":"An instance-based algorithm for deciding the bias of a coin","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics; Algorithm","score_opus":0.03360502915633542,"score_gpt":0.2895113734225701,"score_spread":0.2559063442662347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3103538977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030750133,0.0006749946,0.95329005,0.0017079115,0.00029997012,0.00051770016,0.0007535288,0.0059455745,0.0060601756],"genre_scores_gemma":[0.23224816,0.00033000798,0.7601659,0.0010791289,0.0002830621,0.0005437773,0.0016544817,0.00048192337,0.0032135088],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99493355,0.0015033107,0.00048081495,0.0011697254,0.0013372985,0.0005753542],"domain_scores_gemma":[0.98703337,0.008563675,0.00065114006,0.0022278007,0.0011588094,0.00036524047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00439026,0.0013423535,0.0022852449,0.001426677,0.0011494894,0.0034018203,0.0037853513,0.003309573,0.007713072],"category_scores_gemma":[0.023452487,0.00082124694,0.0018508373,0.0019416921,0.0016012912,0.0053054364,0.0028893077,0.004056316,0.0022596181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027743888,0.00070858764,0.005436379,0.00072756194,0.00044785376,0.00032830457,0.00030108684,0.09165172,0.017657436,0.09835144,0.031438395,0.7501768],"study_design_scores_gemma":[0.0006014288,0.00030977375,0.0010301826,0.00012946293,0.00022116172,0.0004735476,0.00010610828,0.8136661,0.017995983,0.15562855,0.009742942,0.00009466708],"about_ca_topic_score_codex":0.002107717,"about_ca_topic_score_gemma":0.0030771054,"teacher_disagreement_score":0.007713072,"about_ca_system_score_codex":0.0020529209,"about_ca_system_score_gemma":0.005221423,"threshold_uncertainty_score":0.02580285},"labels":[],"label_agreement":null},{"id":"W3130492185","doi":"10.1142/s1793830921500890","title":"Star chromatic number of some graphs","year":2021,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Iran National Science Foundation","keywords":"Mathematics; Combinatorics; Star (game theory); Cartesian product; Chromatic scale; Vertex (graph theory); Graph; Brooks' theorem; Edge coloring; Star product; Discrete mathematics; 1-planar graph; Chordal graph; Graph power; Line graph","score_opus":0.017198585531656225,"score_gpt":0.30707402447920484,"score_spread":0.28987543894754864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3130492185","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80358326,0.0006178664,0.07910588,0.0017697975,0.00025208277,0.000096354954,0.0010132728,0.0004308116,0.11313074],"genre_scores_gemma":[0.9683717,0.0004606819,0.018295124,0.00022617902,0.00010554385,0.00006238755,0.0005489364,0.000101598926,0.011827889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996506,0.00005865287,0.000013936193,0.00009521154,0.00010411803,0.000077488716],"domain_scores_gemma":[0.999,0.00041490878,0.00011282342,0.00009809358,0.00022443674,0.00014979181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031539027,0.00026930092,0.00024431618,0.0011569617,0.0010738806,0.0012500457,0.00039288582,0.00039539384,0.0067895427],"category_scores_gemma":[0.001281203,0.00021677792,0.00032910216,0.0012162484,0.0012330484,0.0013309023,0.00048270568,0.00070146547,0.0004221522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026567324,0.00006959218,0.0037853795,0.00018513898,0.000028928449,0.00025819475,0.00047527402,0.01181234,0.015477665,0.9434088,0.008294058,0.015938966],"study_design_scores_gemma":[0.0000674112,0.000104053746,0.004375096,0.00003521565,0.0000489533,0.0004714148,0.00033713283,0.09958919,0.013064358,0.8518748,0.029980104,0.00005228744],"about_ca_topic_score_codex":0.0024569961,"about_ca_topic_score_gemma":0.002580093,"teacher_disagreement_score":0.0067895427,"about_ca_system_score_codex":0.0015345366,"about_ca_system_score_gemma":0.00095907954,"threshold_uncertainty_score":0.022713244},"labels":[],"label_agreement":null},{"id":"W3178936237","doi":"10.1142/s1793830922501270","title":"A note on hyperopic cops and robber","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University; St. Francis Xavier University; Acadia University","funders":"","keywords":"Cardinality (data modeling); Combinatorics; Mathematics; Cartesian product; Graph; Discrete mathematics; Computer science; Data mining","score_opus":0.023094449330576805,"score_gpt":0.2868035390969812,"score_spread":0.2637090897664044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3178936237","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1485063,0.0059944727,0.6486768,0.017063288,0.0016283665,0.0001267823,0.00020808828,0.00044686865,0.17734912],"genre_scores_gemma":[0.8842451,0.002691362,0.09502269,0.0025643236,0.0013047889,0.00019312782,0.00012146987,0.00046607255,0.01339111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966365,0.0014113043,0.000093678726,0.00080069917,0.00071498204,0.00034288334],"domain_scores_gemma":[0.9867764,0.009864657,0.0006932321,0.0010918935,0.00056891295,0.0010049292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002645154,0.0010163008,0.001610493,0.0011171896,0.0022214097,0.0031004602,0.0031851153,0.0021767323,0.0068292185],"category_scores_gemma":[0.016421976,0.00074682035,0.001205073,0.0010576975,0.008330258,0.014288689,0.00520009,0.0052041044,0.00074309536],"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.000054503882,0.000016417664,0.00032358192,0.00006656959,0.000017068902,0.00013930761,0.00022958175,0.008199925,0.00069824833,0.98329747,0.0031211567,0.0038362318],"study_design_scores_gemma":[0.00003466089,0.00008947421,0.00043034132,0.00006806683,0.000023367827,0.00025362356,0.00022119816,0.06142046,0.0011393551,0.9185586,0.017701589,0.000059350885],"about_ca_topic_score_codex":0.002043174,"about_ca_topic_score_gemma":0.0014452945,"teacher_disagreement_score":0.0068292185,"about_ca_system_score_codex":0.0018493464,"about_ca_system_score_gemma":0.00061032,"threshold_uncertainty_score":0.022846043},"labels":[],"label_agreement":null},{"id":"W3213789197","doi":"10.1142/s1793830922500306","title":"Optimal rendezvous on a line by location-aware robots in the presence of spies*","year":2021,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Optimization and Search 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; Université du Québec en Outaouais; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rendezvous; Robot; Competitive analysis; Computer science; Mobile robot; Set (abstract data type); Bounded function; Task (project management); Line (geometry); Algorithm; Artificial intelligence; Mathematics; Upper and lower bounds; Engineering","score_opus":0.024908221509958816,"score_gpt":0.2950486309745702,"score_spread":0.2701404094646114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213789197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22085683,0.00066290173,0.767189,0.0004306034,0.00006954863,0.00021376365,0.00016346946,0.0019638527,0.008450042],"genre_scores_gemma":[0.78940356,0.00021699394,0.20505111,0.0000862507,0.000022435173,0.00013144639,0.00029947935,0.0001807183,0.004607963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886835,0.00019885715,0.00005320437,0.00034916698,0.00021017987,0.0003202731],"domain_scores_gemma":[0.9970396,0.0017452389,0.00034672886,0.0003956884,0.00023124827,0.00024145377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010214234,0.0013451544,0.0016639275,0.00080914306,0.0018566162,0.0012569095,0.0026104776,0.0018965969,0.0024147318],"category_scores_gemma":[0.0044223466,0.0005747799,0.0009494826,0.001008223,0.0020510938,0.0020253556,0.0021792557,0.0011225642,0.0005497804],"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.0008595042,0.00013379609,0.0012343655,0.00015701489,0.000096655865,0.00035075762,0.000421901,0.90841466,0.012666909,0.021974498,0.002198095,0.051491957],"study_design_scores_gemma":[0.000077737954,0.00014167352,0.00026469107,0.000011742633,0.000021458847,0.00017340698,0.00014065979,0.97882974,0.0063505205,0.012354098,0.0016068771,0.000027483426],"about_ca_topic_score_codex":0.0126946485,"about_ca_topic_score_gemma":0.00911046,"teacher_disagreement_score":0.0126946485,"about_ca_system_score_codex":0.0018673553,"about_ca_system_score_gemma":0.001527973,"threshold_uncertainty_score":0.025241554},"labels":[],"label_agreement":null},{"id":"W4377822168","doi":"10.1142/s1793830923500568","title":"A constructive proof of the Fulkerson–Ryser characterization of digraphic sequences","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Digraph; Constructive; Vertex (graph theory); Combinatorics; Mathematics; Constructive proof; Characterization (materials science); Inequality; Graph; Discrete mathematics; Computer science; Physics; Process (computing)","score_opus":0.018277324969393504,"score_gpt":0.2813524692736935,"score_spread":0.2630751443043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377822168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0128291445,0.0027761776,0.88603497,0.004762159,0.0018421109,0.0003627551,0.0011077755,0.0006445828,0.08964034],"genre_scores_gemma":[0.30587083,0.0057743727,0.64739865,0.0038359251,0.0022022026,0.0010548156,0.0014407841,0.0004754882,0.031946875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997869,0.0005728566,0.00017063523,0.0004217557,0.00077641173,0.00018934689],"domain_scores_gemma":[0.991667,0.0051554875,0.0003795749,0.0006097779,0.0017076513,0.0004806027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00364964,0.0020686374,0.0014451838,0.0038141825,0.0016289419,0.0029064585,0.0017221039,0.0016825836,0.015388734],"category_scores_gemma":[0.013212194,0.0009688658,0.0025492157,0.0026519254,0.00405821,0.0049410765,0.0050844015,0.0082770055,0.0027391373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029446079,0.000057250687,0.00017784954,0.0003398929,0.000028071208,0.0003173148,0.00042203444,0.0031458377,0.004904347,0.9640058,0.006144428,0.020427726],"study_design_scores_gemma":[0.000040875024,0.000058949805,0.0004918656,0.00015676966,0.00004035958,0.00061330287,0.00017861566,0.0112358695,0.00461612,0.9227316,0.059757356,0.00007834249],"about_ca_topic_score_codex":0.0015322194,"about_ca_topic_score_gemma":0.0020087548,"teacher_disagreement_score":0.015388734,"about_ca_system_score_codex":0.0023215052,"about_ca_system_score_gemma":0.0019607767,"threshold_uncertainty_score":0.051480412},"labels":[],"label_agreement":null},{"id":"W4392784336","doi":"10.1142/s1793830924300017","title":"Proposed theoretical value for TSP constant","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Constant (computer programming); Value (mathematics); Mathematics; Computer science; Statistics","score_opus":0.012324863491558058,"score_gpt":0.28830243177306103,"score_spread":0.275977568281503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392784336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01953814,0.006113616,0.78956175,0.010560289,0.001507663,0.00017332817,0.00094962557,0.0018127387,0.16978289],"genre_scores_gemma":[0.72902566,0.010197871,0.21887334,0.0048990315,0.0039027603,0.0012897496,0.0015821314,0.0012728486,0.028956635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99567956,0.0009724132,0.00010572501,0.0011143016,0.0016396944,0.000488301],"domain_scores_gemma":[0.97528857,0.01709594,0.00083140674,0.0029117332,0.0032352048,0.0006372422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040974068,0.0015626969,0.0015266387,0.0034726192,0.0023184502,0.0053252806,0.0049961885,0.0035620942,0.026969884],"category_scores_gemma":[0.05513583,0.0007853979,0.001258993,0.0038177767,0.004037489,0.008785821,0.0031819209,0.005870206,0.0066887094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005050079,0.00005477341,0.00061138574,0.00017370122,0.000018340445,0.00010259766,0.00011776393,0.02966526,0.00085544086,0.92867297,0.012293832,0.027383456],"study_design_scores_gemma":[0.00002466194,0.000057124314,0.0004649211,0.00019434672,0.00003796676,0.0005743933,0.00010524891,0.23169045,0.0013932245,0.73803145,0.027368594,0.000057625137],"about_ca_topic_score_codex":0.0023138213,"about_ca_topic_score_gemma":0.0013072572,"teacher_disagreement_score":0.026969884,"about_ca_system_score_codex":0.005820669,"about_ca_system_score_gemma":0.0028150654,"threshold_uncertainty_score":0.09022325},"labels":[],"label_agreement":null},{"id":"W4401198955","doi":"10.1142/s1793830924500708","title":"LCD codes over finite fields","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Finite field; Mathematics; Liquid-crystal display; Discrete mathematics; Combinatorics; Computer science; Operating system","score_opus":0.012987680429652744,"score_gpt":0.2692800756832095,"score_spread":0.25629239525355674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401198955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37816232,0.002264739,0.54866576,0.0012932195,0.00031266513,0.00015781172,0.0005559334,0.00091420993,0.067673326],"genre_scores_gemma":[0.91663486,0.0008837947,0.07273462,0.00030414536,0.00016958777,0.0001333014,0.00029118868,0.0000899854,0.008758392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932265,0.000111883266,0.000043085343,0.00014486919,0.00025039178,0.00012703087],"domain_scores_gemma":[0.99830914,0.00057764445,0.0002230282,0.000458633,0.00029441633,0.00013709388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038428913,0.00032629515,0.00034533237,0.0011062109,0.00082709815,0.00093397393,0.0004746228,0.0005515211,0.0033238083],"category_scores_gemma":[0.0025729856,0.00020243725,0.00035610117,0.001039477,0.0014258159,0.001267554,0.0015766646,0.0010397547,0.0006666092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009024884,0.000029081426,0.0009805406,0.0001469893,0.000011171404,0.0002600871,0.00031510906,0.008569929,0.01336979,0.93055964,0.0013489006,0.04431843],"study_design_scores_gemma":[0.00004931804,0.000086463464,0.0006955692,0.00009697505,0.000019965875,0.0012856581,0.00015213194,0.0793724,0.025292207,0.8599499,0.032944784,0.00005473789],"about_ca_topic_score_codex":0.0006704221,"about_ca_topic_score_gemma":0.000596573,"teacher_disagreement_score":0.0033238083,"about_ca_system_score_codex":0.0011703616,"about_ca_system_score_gemma":0.00081990595,"threshold_uncertainty_score":0.011119306},"labels":[],"label_agreement":null},{"id":"W4403453813","doi":"10.1142/s1793830924501076","title":"A polynomial-time exact algorithm for the connected k-facility location problem on trees","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Mathematics; Time complexity; Facility location problem; Algorithm; Combinatorics; Discrete mathematics; Mathematical optimization","score_opus":0.019278077842967405,"score_gpt":0.2526821950377509,"score_spread":0.23340411719478352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403453813","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053825676,0.0019901143,0.8947581,0.0022397768,0.0003736063,0.0010282296,0.002642401,0.011457877,0.031684276],"genre_scores_gemma":[0.26779053,0.0009807493,0.71094257,0.0005915654,0.00022783659,0.0008092212,0.006409362,0.0011367747,0.011111374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981832,0.00026946727,0.00011141399,0.0005995641,0.00030539065,0.00053105014],"domain_scores_gemma":[0.99750286,0.0013741265,0.0002040648,0.0004759636,0.0002314581,0.00021155068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008913136,0.002505612,0.0025103993,0.0014429531,0.0020722926,0.0029621653,0.0047104377,0.0027910715,0.021975633],"category_scores_gemma":[0.0049836715,0.0009818658,0.0019644296,0.0045764116,0.0010993881,0.007518846,0.0032876926,0.0029089956,0.0057310155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001164337,0.00095355284,0.0014433104,0.0018913093,0.00022032854,0.00057427736,0.0005591595,0.44121563,0.00688536,0.06923811,0.07414426,0.40171042],"study_design_scores_gemma":[0.00047831255,0.0002097771,0.00038971883,0.00007535702,0.00008417738,0.00035576572,0.00030311043,0.8714808,0.0017098876,0.113951504,0.010912532,0.000049003585],"about_ca_topic_score_codex":0.011598794,"about_ca_topic_score_gemma":0.013274943,"teacher_disagreement_score":0.021975633,"about_ca_system_score_codex":0.002963012,"about_ca_system_score_gemma":0.0047115106,"threshold_uncertainty_score":0.07351583},"labels":[],"label_agreement":null},{"id":"W4407819673","doi":"10.1142/s1793830925500430","title":"Machine learning predictions of China commodity price indices","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Market Dynamics and Volatility","field":"Economics, Econometrics and Finance","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Commodity; Mathematics; China; Econometrics; Economics; Mathematical economics; Geography","score_opus":0.013016530253975239,"score_gpt":0.23977884398298752,"score_spread":0.2267623137290123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407819673","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9730272,0.00036504611,0.02087917,0.00075425446,0.00009360116,0.000024330639,0.0009130171,0.00032919215,0.0036141672],"genre_scores_gemma":[0.9938805,0.00014188196,0.0038048655,0.000044674907,0.000029862653,0.0000121455605,0.0011808503,0.000017021686,0.0008881621],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997063,0.00007862349,0.000019251866,0.00008510246,0.000056089877,0.00005453907],"domain_scores_gemma":[0.9988709,0.0005983504,0.0001317622,0.00009250245,0.00024824607,0.00005814721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015414872,0.0006615694,0.00040327274,0.0011693281,0.00023351095,0.00086971495,0.0005697365,0.00053545355,0.0014070275],"category_scores_gemma":[0.004684868,0.00022049407,0.0005518639,0.00073051377,0.00027786323,0.00086320424,0.00041650003,0.0008612416,0.00034468787],"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.00013748548,0.00011973229,0.060222343,0.000040156425,0.00008178741,0.00012383697,0.000058616843,0.8853414,0.000839307,0.003928493,0.0040368787,0.04507004],"study_design_scores_gemma":[0.0000035298433,0.000005767707,0.002969971,0.0000027889291,0.0000033168728,0.00000234306,0.000005396101,0.9961027,0.00015331383,0.0006238354,0.00012393268,0.0000031823915],"about_ca_topic_score_codex":0.031832516,"about_ca_topic_score_gemma":0.018988738,"teacher_disagreement_score":0.031832516,"about_ca_system_score_codex":0.0010841561,"about_ca_system_score_gemma":0.0012968403,"threshold_uncertainty_score":0.06329447},"labels":[],"label_agreement":null},{"id":"W4409341382","doi":"10.1142/s179383092550079x","title":"Strong edge coloring algorithm for K4-minor free graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Graph Labeling and Dimension Problems","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":"St. Francis Xavier University","funders":"","keywords":"Mathematics; Combinatorics; Minor (academic); Edge coloring; Greedy coloring; Graph coloring; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Algorithm; Graph; Computer science; Line graph; Artificial intelligence","score_opus":0.016258947904050584,"score_gpt":0.2693119762721733,"score_spread":0.2530530283681227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409341382","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.1930121,0.00053520605,0.7569739,0.0018841751,0.00031447466,0.0005477129,0.0024128216,0.0078113163,0.036508303],"genre_scores_gemma":[0.37690932,0.0002348718,0.5978503,0.00057232735,0.000088159235,0.00032966587,0.0040492015,0.00089318544,0.019072944],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924445,0.00012538997,0.000051961175,0.00022266223,0.00016605628,0.00018958634],"domain_scores_gemma":[0.9984862,0.00041453523,0.000105044375,0.0005437408,0.0002912406,0.00015911298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005233435,0.0009382273,0.00075578544,0.0010931997,0.0014537424,0.0016633716,0.0017183814,0.0008712765,0.012498707],"category_scores_gemma":[0.0019119495,0.00050216314,0.001181035,0.0016023741,0.0008070201,0.0020882336,0.0027107128,0.00153946,0.0033049202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018797311,0.000856401,0.0038844175,0.00078875344,0.00016453204,0.00036848738,0.0007899971,0.06253841,0.050454184,0.21959957,0.057675894,0.60099965],"study_design_scores_gemma":[0.00042491348,0.00032997283,0.0020653268,0.0000702041,0.00011843977,0.00039822824,0.0003413537,0.4900911,0.03513355,0.43260005,0.03832832,0.000098578275],"about_ca_topic_score_codex":0.002543861,"about_ca_topic_score_gemma":0.0046482217,"teacher_disagreement_score":0.012498707,"about_ca_system_score_codex":0.0016483763,"about_ca_system_score_gemma":0.0024046504,"threshold_uncertainty_score":0.04181236},"labels":[],"label_agreement":null},{"id":"W4415683583","doi":"10.1142/s1793830925501563","title":"Orthogonal Latin squares of order 10 with two relations: A SAT investigation","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"graph theory and CDMA systems","field":"Engineering","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 Windsor; Carleton University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Backtracking; Solver; Enumeration; Satisfiability; Orthogonal array; Correctness; Boolean satisfiability problem; Simple (philosophy); Relation (database)","score_opus":0.007072878004715721,"score_gpt":0.22397373028427445,"score_spread":0.21690085227955871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415683583","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4564802,0.0019781496,0.27523327,0.00820575,0.00059980806,0.00048525044,0.002888877,0.0012424953,0.25288618],"genre_scores_gemma":[0.70670456,0.0009462799,0.25090024,0.0017166876,0.0002451692,0.00030820604,0.0028106982,0.00035663205,0.03601153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836344,0.0005662276,0.00007058502,0.0003608665,0.00042657848,0.00021230498],"domain_scores_gemma":[0.9921869,0.006256113,0.0003990071,0.0006257008,0.0004073101,0.00012493637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011241442,0.00065120554,0.0006010583,0.0005860315,0.0013373417,0.002174659,0.0012555616,0.0012107695,0.016494632],"category_scores_gemma":[0.008325127,0.00067608606,0.0015923983,0.0013191999,0.0023000762,0.0048253485,0.0016396171,0.0024534096,0.0018687067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034793146,0.0003521849,0.0045383237,0.0006353206,0.000084144995,0.0012429417,0.0005697536,0.042728323,0.004086519,0.87330407,0.020717537,0.05139296],"study_design_scores_gemma":[0.0003289246,0.0002742032,0.0022019078,0.00027497884,0.00012708716,0.0011193408,0.0009433721,0.25986534,0.01227836,0.64127016,0.08122333,0.00009304299],"about_ca_topic_score_codex":0.0037535643,"about_ca_topic_score_gemma":0.0074332263,"teacher_disagreement_score":0.016494632,"about_ca_system_score_codex":0.0013814823,"about_ca_system_score_gemma":0.0019503401,"threshold_uncertainty_score":0.055180013},"labels":[],"label_agreement":null},{"id":"W7117706614","doi":"10.1142/s1793830925501952","title":"Hamiltonicity in generalized quasi-dihedral groups","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Geometric and Algebraic Topology","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","funders":"","keywords":"Dihedral group; Cayley graph; Free product; Dihedral angle; Quartic graph; Graph; Semidirect product; Hamiltonian (control theory); Cyclic group","score_opus":0.02290419757695057,"score_gpt":0.3173159408806792,"score_spread":0.29441174330372866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117706614","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84619266,0.00096032454,0.094794475,0.0010214654,0.00013541992,0.000059331272,0.00021114027,0.0001805555,0.056444723],"genre_scores_gemma":[0.98205733,0.00035249777,0.009237397,0.00011289532,0.00006171245,0.000042355212,0.00011312133,0.000017950237,0.008004745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977285,0.000051831226,0.000013299407,0.000060908318,0.000055423607,0.000045605346],"domain_scores_gemma":[0.9996525,0.00011576214,0.000062339146,0.000052800897,0.00005218127,0.00006442322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019388991,0.00021390672,0.0002443961,0.0005611412,0.0005508833,0.0009903173,0.00036497557,0.0002967137,0.0033134478],"category_scores_gemma":[0.0007494646,0.00018420667,0.00026599888,0.00050573464,0.001452912,0.0012158586,0.00088924717,0.00048062927,0.0003155431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023829372,0.000008546711,0.00037507497,0.000028727707,0.0000049392684,0.000120403,0.00026827457,0.0014437604,0.0019733966,0.99045837,0.00055228255,0.0047424412],"study_design_scores_gemma":[0.000022485174,0.000023728204,0.0003120631,0.0000065059503,0.0000046467517,0.000082812854,0.00012890736,0.0065268753,0.0008205595,0.9884548,0.0036093502,0.0000072991643],"about_ca_topic_score_codex":0.0015656069,"about_ca_topic_score_gemma":0.0016051639,"teacher_disagreement_score":0.0033134478,"about_ca_system_score_codex":0.0006259182,"about_ca_system_score_gemma":0.000327114,"threshold_uncertainty_score":0.011084616},"labels":[],"label_agreement":null}]}