{"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0140516255,0.00047278838,0.98372936,0.00013416227,0.00006740726,0.0003366994,0.00002049672,0.000047909096,0.0011395621],"genre_scores_gemma":[0.5920753,0.00011547867,0.40725574,0.00005167787,0.00010384241,0.0001772963,0.00007530779,0.000009910264,0.00013547842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990987,0.000016793498,0.00030192974,0.00017565294,0.00023404222,0.00017283809],"domain_scores_gemma":[0.99921924,0.00013941355,0.00017388765,0.00027417205,0.00008958533,0.00010373243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028554103,0.00011030297,0.00014417198,0.00025316133,0.00017074798,0.000073709714,0.00021439565,0.000041120595,0.000007830284],"category_scores_gemma":[0.000017595337,0.000102177844,0.000048148075,0.0009198013,0.000045025117,0.0003733847,0.00006122772,0.00005476931,0.000013463709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.4459675e-7,0.00017411688,0.00011582663,0.000062026644,0.000027082971,8.211344e-8,0.0008619697,0.00005320726,0.0006197257,0.94717133,0.00011933789,0.05079467],"study_design_scores_gemma":[0.0017971252,0.00022975894,0.015707124,0.000076284596,0.00018796952,0.000093974886,0.0014483127,0.29514697,0.020944962,0.6403438,0.022836974,0.0011867732],"about_ca_topic_score_codex":0.000005921385,"about_ca_topic_score_gemma":6.0705344e-7,"teacher_disagreement_score":0.5780236,"about_ca_system_score_codex":0.000015114149,"about_ca_system_score_gemma":0.000021296677,"threshold_uncertainty_score":0.41666916},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013518671,0.00004068669,0.9830445,0.0005758885,0.000075724485,0.00035040366,0.0000112508205,0.00010478886,0.0022780814],"genre_scores_gemma":[0.25365967,0.00001576317,0.745465,0.0001111538,0.00021196745,0.00021715218,0.000030873452,0.000009643333,0.00027878242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911124,0.0000108817,0.00023072172,0.00032091775,0.00018031785,0.00014594592],"domain_scores_gemma":[0.99909157,0.00011575461,0.00008532337,0.00050140737,0.000100010904,0.00010591779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028414433,0.0001152194,0.00012053801,0.00006903502,0.00024589506,0.00019998834,0.00030350927,0.000052229378,0.000021246651],"category_scores_gemma":[0.000027328075,0.00010126842,0.000040660103,0.00033823913,0.000047629896,0.00020916887,0.0001367026,0.00013800764,0.000032634714],"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":[3.8915528e-7,0.00012380807,0.000041763724,0.000034507186,0.0000107278975,4.6698742e-7,0.00030056006,0.0000670241,0.0028862625,0.81739575,0.000089832014,0.17904893],"study_design_scores_gemma":[0.00023936013,0.000032919488,0.0018115992,0.000006998482,0.000014642418,0.00003653404,0.000040999388,0.7629975,0.0014032684,0.19972797,0.033408422,0.00027977696],"about_ca_topic_score_codex":0.0000071780973,"about_ca_topic_score_gemma":0.000009239053,"teacher_disagreement_score":0.7629305,"about_ca_system_score_codex":0.000007358518,"about_ca_system_score_gemma":0.000036500365,"threshold_uncertainty_score":0.41296065},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010299816,0.000037817044,0.9934662,0.00030958393,0.000011539983,0.0011101718,0.000029338044,0.0000925435,0.0039128396],"genre_scores_gemma":[0.0064816717,0.00006542185,0.99129534,0.000070725335,0.000043441796,0.0006996539,0.000026274138,0.000024749861,0.0012927235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998749,0.000018489574,0.00032105125,0.00038465174,0.00019406354,0.00033272232],"domain_scores_gemma":[0.99913657,0.00009355567,0.00007190149,0.00043446454,0.00011866593,0.00014486874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044994664,0.00014960962,0.00019561202,0.00014324591,0.000156711,0.00014926298,0.0005297836,0.00006603293,0.00003350728],"category_scores_gemma":[0.000013971808,0.00013715115,0.00005297912,0.0003928651,0.00014480382,0.00027157718,0.00022021329,0.00011697433,0.00007517805],"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.0000068918,0.0008691594,0.00004519851,0.00033653845,0.00006091823,0.000004072031,0.022691714,0.006130714,0.00039831785,0.89528,0.0004490627,0.07372741],"study_design_scores_gemma":[0.00035920722,0.000055474993,0.00006244279,0.000021126274,0.0000052768073,0.0000027658648,0.000309943,0.98368675,0.0003642524,0.013425265,0.0015224126,0.00018507677],"about_ca_topic_score_codex":0.0000145617005,"about_ca_topic_score_gemma":0.0000013640773,"teacher_disagreement_score":0.97755605,"about_ca_system_score_codex":0.000020200727,"about_ca_system_score_gemma":0.000040469622,"threshold_uncertainty_score":0.5592862},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023953501,0.00077249855,0.97304565,0.00018457448,0.00015619367,0.0010880553,0.00028090688,0.00011261282,0.00040603295],"genre_scores_gemma":[0.14437336,0.00014846896,0.85404545,0.000049043276,0.0006564842,0.00054515986,0.000118716234,0.00003683556,0.000026501437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977067,0.000053203774,0.00066825317,0.00047724423,0.0005099708,0.00058460835],"domain_scores_gemma":[0.99795645,0.0007031219,0.00031602816,0.00059571373,0.00019737064,0.00023129034],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069117866,0.00031032896,0.00047062722,0.0003076465,0.00069177966,0.0003107311,0.0007000445,0.000111400244,0.000011345966],"category_scores_gemma":[0.000053310618,0.00028168623,0.00024275848,0.0008635105,0.00032738215,0.00029556674,0.00024633986,0.00020197954,0.0000025489544],"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.0000061912497,0.0004420167,0.000060026032,0.00026480397,0.000113685004,2.5591734e-7,0.0024516333,0.00007770349,0.00093509175,0.8530604,0.00020955429,0.14237861],"study_design_scores_gemma":[0.002124767,0.00020512684,0.0007747399,0.00014575613,0.00016332729,0.000049978258,0.0037581488,0.50837153,0.009663441,0.46571004,0.007882068,0.0011510781],"about_ca_topic_score_codex":0.000017638196,"about_ca_topic_score_gemma":0.0000017294775,"teacher_disagreement_score":0.5082938,"about_ca_system_score_codex":0.000023467475,"about_ca_system_score_gemma":0.00003595034,"threshold_uncertainty_score":0.9999635},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084052497,0.00009694803,0.98691136,0.00011713418,0.000014395229,0.0003981974,0.000017889955,0.00012841304,0.011475153],"genre_scores_gemma":[0.11013757,0.0000475186,0.8886672,0.000050344617,0.000041567895,0.0004889341,0.0000061018254,0.000019359433,0.00054136704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902457,0.000019340308,0.0002225756,0.00031616254,0.00017443937,0.00024291841],"domain_scores_gemma":[0.99894625,0.00011256828,0.00007898645,0.0006610471,0.00006478653,0.00013635849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021009408,0.00013689316,0.00015606216,0.00010026025,0.00017411691,0.00009144992,0.00057396607,0.000039704024,0.000028313301],"category_scores_gemma":[0.000017725546,0.00011144895,0.00005230215,0.00034569224,0.00018717624,0.00023937594,0.00021886962,0.00009835496,0.000035897167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.9003463e-7,0.00007832289,0.000023015118,0.000016928767,0.00001593386,0.0000014444149,0.0009532555,0.000001438209,0.00037525938,0.9338393,0.0000130243225,0.06468148],"study_design_scores_gemma":[0.00029158205,0.00007395642,0.00039870598,0.000020026871,0.000014852504,0.000029225796,0.0004856212,0.05877356,0.002075222,0.9352109,0.0023108383,0.00031550642],"about_ca_topic_score_codex":0.0000054631337,"about_ca_topic_score_gemma":0.000002656087,"teacher_disagreement_score":0.109297045,"about_ca_system_score_codex":0.000007868444,"about_ca_system_score_gemma":0.000017968201,"threshold_uncertainty_score":0.45447564},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054475043,0.00061873934,0.94391745,0.00012984581,0.000036874888,0.00039113426,0.000056347555,0.000021369575,0.00035321835],"genre_scores_gemma":[0.91577935,0.00047119128,0.08232397,0.000101548074,0.00045692798,0.00040549508,0.00019865758,0.000039583876,0.00022327562],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925274,0.000014715834,0.0001920263,0.00022676538,0.00010217284,0.00021156402],"domain_scores_gemma":[0.9994286,0.000028335679,0.00008326943,0.0002755199,0.000032457916,0.00015183807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017475168,0.00013210285,0.000114972776,0.00003832336,0.0002043633,0.000048998696,0.000091517526,0.00006903912,0.00001091208],"category_scores_gemma":[0.000018920426,0.00011825875,0.000031704927,0.00007172116,0.00005744637,0.000010040122,0.00019283332,0.00007234143,0.000003937791],"study_design_candidate":"bench_or_experimental","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.00001975113,0.0002675852,0.0019412559,0.00056177715,0.00012879148,2.469632e-7,0.002540756,0.0003658645,0.8635253,0.0021040237,0.00050501135,0.12803969],"study_design_scores_gemma":[0.0026635784,0.00037403664,0.009191143,0.00030543355,0.0002697121,0.00019603343,0.008119606,0.47948027,0.15495281,0.007266107,0.33478692,0.0023943458],"about_ca_topic_score_codex":0.000014450541,"about_ca_topic_score_gemma":0.0000054398997,"teacher_disagreement_score":0.8615935,"about_ca_system_score_codex":0.000008422126,"about_ca_system_score_gemma":0.000010859982,"threshold_uncertainty_score":0.48224518},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017536398,0.000064530475,0.97729677,0.00043667603,0.000020489148,0.0004972252,0.000099535726,0.000036081696,0.0040123044],"genre_scores_gemma":[0.91949105,0.000031539974,0.08001153,0.00006934507,0.000008715733,0.00032683508,0.000044952583,0.000006856674,0.000009150104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921525,0.000023873507,0.00027077194,0.00021748825,0.00016842238,0.00010417143],"domain_scores_gemma":[0.9990017,0.00013849571,0.00015348956,0.00060534343,0.0000626216,0.000038395443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028063802,0.00009617078,0.00010908091,0.000086540036,0.000105386905,0.00004086925,0.0003978752,0.00004365951,0.000044457072],"category_scores_gemma":[0.000023451983,0.000072301555,0.000039422604,0.0003972902,0.00011311755,0.00017488982,0.00007065054,0.00008853265,0.0000093455155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011069056,0.00015233243,0.000028392782,0.000017354865,0.00000746432,1.599198e-7,0.0034878068,9.3633344e-7,0.0001498258,0.99527603,0.00004895056,0.0008296208],"study_design_scores_gemma":[0.00014687488,0.00004010419,0.0067563374,0.000035543653,0.000010282152,0.0000029940045,0.00077988586,0.00946167,0.0010809943,0.98083353,0.00071339315,0.00013839432],"about_ca_topic_score_codex":0.000013365261,"about_ca_topic_score_gemma":0.0000062745085,"teacher_disagreement_score":0.90195465,"about_ca_system_score_codex":0.000008386114,"about_ca_system_score_gemma":0.000020419628,"threshold_uncertainty_score":0.29483718},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00070350314,0.00007265113,0.9953265,0.00052824616,0.000043050695,0.00056170323,0.000011067942,0.000085109605,0.0026681258],"genre_scores_gemma":[0.17279342,0.000012340449,0.8244715,0.000094742456,0.00031007943,0.001314475,0.000018616309,0.000022760449,0.000962077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992905,0.000012343192,0.00017326756,0.00021858202,0.00014256914,0.00016269815],"domain_scores_gemma":[0.9992511,0.000091689326,0.00007804179,0.00031588424,0.00014551092,0.00011777592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033097292,0.00009769316,0.00014022482,0.000036871512,0.00021543592,0.00025832764,0.00023041063,0.000030902662,0.0000010156604],"category_scores_gemma":[0.000012405731,0.00007108777,0.000029215642,0.00015221602,0.00004478745,0.00018784699,0.0000758306,0.00005967252,0.000005029799],"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.0000015112616,0.000030063457,0.000018537368,0.000045943463,0.000015573032,2.8207376e-7,0.0014170653,0.00012272595,0.000012133648,0.9887143,0.0002603959,0.009361515],"study_design_scores_gemma":[0.0004150372,0.00012530238,0.00002215687,0.00003892995,0.000012731642,0.000046825215,0.001616667,0.79869556,0.00012721529,0.14252391,0.05614993,0.00022573114],"about_ca_topic_score_codex":0.00003247985,"about_ca_topic_score_gemma":0.00001743347,"teacher_disagreement_score":0.84619033,"about_ca_system_score_codex":0.00001585984,"about_ca_system_score_gemma":0.00003596693,"threshold_uncertainty_score":0.28988752},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005435371,0.000038732036,0.98979896,0.00048219645,0.00019602479,0.0005388721,0.000010044033,0.00027238418,0.0032274167],"genre_scores_gemma":[0.37455142,0.0000041240896,0.6244136,0.00020643321,0.00041829396,0.00029906025,0.000012777358,0.000030410183,0.00006384843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841744,0.000045670324,0.0003455649,0.0005553932,0.00028175433,0.00035417354],"domain_scores_gemma":[0.99861336,0.00025095936,0.00014137226,0.0006693195,0.0000873147,0.00023770062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050003454,0.00023655908,0.00031073528,0.000112810194,0.00049026276,0.00035624453,0.00070691766,0.00006900313,0.0000011763217],"category_scores_gemma":[0.00005263829,0.00020080246,0.00007156573,0.00050211186,0.00006348473,0.00009743735,0.00039052067,0.00019830551,0.000023158656],"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":[7.8170234e-7,0.00016178541,0.000009667859,0.000071588765,0.000016294302,2.662711e-7,0.0015611356,0.000929149,0.00007814797,0.8893386,0.00011768991,0.10771491],"study_design_scores_gemma":[0.00019956204,0.000058610713,0.00005150462,0.000026927813,0.0000107540145,0.000035679714,0.00020454609,0.8789756,0.00010299824,0.11428891,0.0057828818,0.00026207024],"about_ca_topic_score_codex":0.00001865664,"about_ca_topic_score_gemma":9.013595e-7,"teacher_disagreement_score":0.8780464,"about_ca_system_score_codex":0.000015505375,"about_ca_system_score_gemma":0.000024356197,"threshold_uncertainty_score":0.81884867},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005486544,0.000104835795,0.99159944,0.000057756428,0.000009441279,0.00033344975,0.0000049376326,0.0003789735,0.0020246496],"genre_scores_gemma":[0.20106234,0.0000657795,0.7985608,0.000026988386,0.000019762721,0.00022765779,0.000006209111,0.000011822103,0.000018648625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991466,0.000014655293,0.00021969376,0.00034284702,0.00010705013,0.00016920263],"domain_scores_gemma":[0.99917084,0.000025341345,0.00012230179,0.00054984656,0.000041876865,0.000089808294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002465195,0.00013216163,0.00013034775,0.00008342526,0.00027641503,0.00013477127,0.00030639992,0.000051311214,0.0000019910176],"category_scores_gemma":[0.0000046671867,0.000116367766,0.00002902758,0.0001891686,0.000093495735,0.00049274694,0.00018840349,0.00008340023,0.0000011143654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.74176e-7,0.000080813756,0.00015483127,0.00007387194,0.000013740815,9.665812e-7,0.004079262,2.726409e-7,0.00082261476,0.9381212,0.0000025830773,0.056648944],"study_design_scores_gemma":[0.00016522458,0.0000570436,0.0015179233,0.00007464359,0.000024126037,0.000054027078,0.00030566633,0.3030341,0.005141517,0.68841004,0.0008274293,0.00038823605],"about_ca_topic_score_codex":0.000008547854,"about_ca_topic_score_gemma":9.567781e-7,"teacher_disagreement_score":0.30303383,"about_ca_system_score_codex":0.000004602744,"about_ca_system_score_gemma":0.0000056646054,"threshold_uncertainty_score":0.47453398},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015059261,0.00042253957,0.9956547,0.0006794861,0.00006146322,0.0009625032,0.00007021366,0.00022185563,0.00042128295],"genre_scores_gemma":[0.28045294,0.0003331607,0.7178085,0.00026008862,0.0002718846,0.00035110847,0.00025521975,0.000056453853,0.00021068723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756825,0.000045596626,0.0006323496,0.0007464322,0.00031155322,0.0006958083],"domain_scores_gemma":[0.99829656,0.00034421968,0.00027630854,0.0007185804,0.00017209395,0.00019224573],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039713224,0.00036721138,0.00047732377,0.00015890929,0.00037961695,0.00034764234,0.00049378356,0.00017269627,0.0000013005733],"category_scores_gemma":[0.00001308277,0.00034465804,0.000111773144,0.0008879656,0.00008345941,0.00014746861,0.00014289006,0.00019845569,0.0000015026692],"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.000005711005,0.00035081513,0.0000049232017,0.000057349556,0.000024562058,0.0000073201186,0.00038378543,0.59109485,0.00025071835,0.23553517,0.00012056685,0.17216423],"study_design_scores_gemma":[0.0006671245,0.000055011653,0.000043237673,0.00010235367,0.000023068547,0.000023608813,0.0001328985,0.9884307,0.00039113357,0.0076226844,0.0020840573,0.00042417203],"about_ca_topic_score_codex":0.000026291853,"about_ca_topic_score_gemma":0.000009547187,"teacher_disagreement_score":0.3973358,"about_ca_system_score_codex":0.00008373379,"about_ca_system_score_gemma":0.00003705383,"threshold_uncertainty_score":0.9999005},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003266725,0.00007875902,0.98891205,0.0008179972,0.00004935153,0.0003522647,0.0000040645778,0.000019810055,0.006498978],"genre_scores_gemma":[0.97826135,0.00007895576,0.020923764,0.00010914395,0.00010780989,0.00038714896,0.0000030279564,0.000007976857,0.00012080614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921536,0.0000497921,0.0002989453,0.00014671787,0.00015810816,0.00013108044],"domain_scores_gemma":[0.9988596,0.00041594155,0.000115069466,0.0005298372,0.00005387588,0.00002569495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076857477,0.00008105327,0.000116569245,0.00002142662,0.0002292785,0.0001493319,0.00053610676,0.000030014224,0.0000018685049],"category_scores_gemma":[0.000015944703,0.000042823645,0.00004636637,0.00027888548,0.000074788506,0.00006504251,0.000066082735,0.00008463094,0.0000068495146],"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":[1.6503387e-7,0.000029996758,0.00010305711,0.000011210509,0.000005413478,9.777878e-8,0.00096831046,0.000021454089,0.000008746378,0.9873749,0.00013747557,0.011339179],"study_design_scores_gemma":[0.00015615886,0.000026077441,0.0010029807,0.00004099534,0.000010210753,0.000037147856,0.0016156919,0.64872557,0.00003082016,0.31645223,0.031747423,0.00015467132],"about_ca_topic_score_codex":0.000023464185,"about_ca_topic_score_gemma":0.000020964299,"teacher_disagreement_score":0.97499466,"about_ca_system_score_codex":0.000004243571,"about_ca_system_score_gemma":0.0000072808407,"threshold_uncertainty_score":0.17634481},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013591553,0.000053403575,0.9964186,0.00034074183,0.00013403421,0.0009410709,0.00016891459,0.00013590207,0.00044819314],"genre_scores_gemma":[0.02741173,0.000027396352,0.96996546,0.00012852196,0.00043056207,0.0009258134,0.00027796524,0.000026393587,0.00080613076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987057,0.000014301103,0.00034221084,0.00047922687,0.00019065646,0.00026793155],"domain_scores_gemma":[0.9985923,0.0001783689,0.00015714751,0.00065751007,0.00020916316,0.00020550835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033018983,0.00020620672,0.00020521498,0.00010208757,0.00046147313,0.0004225171,0.000507775,0.000094378505,0.000016147793],"category_scores_gemma":[0.00002243699,0.00018288418,0.00007703006,0.00037181276,0.00007193264,0.0004934029,0.00010869408,0.00016053749,0.000017711385],"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.0000025417905,0.00032229567,0.0000102458935,0.000070100155,0.000049351354,5.291732e-7,0.0005325963,0.00083300844,0.012296724,0.50677186,0.00017182497,0.47893894],"study_design_scores_gemma":[0.00032080399,0.00008004874,0.000053958345,0.0000054622237,0.00002341552,0.000011188785,0.000048717196,0.9049895,0.0020425094,0.07287791,0.019300286,0.0002462246],"about_ca_topic_score_codex":0.000009802113,"about_ca_topic_score_gemma":0.00000768193,"teacher_disagreement_score":0.90415645,"about_ca_system_score_codex":0.000008545833,"about_ca_system_score_gemma":0.000063407795,"threshold_uncertainty_score":0.74578005},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023478428,0.004620809,0.9906779,0.000028139744,0.000088344,0.0006224181,0.00013174477,0.00019053227,0.0012922478],"genre_scores_gemma":[0.6582942,0.0028624486,0.33634388,0.000036215268,0.0003903352,0.00080562016,0.0010380419,0.00013443767,0.00009481201],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988893,0.000013115302,0.00038720787,0.00023487092,0.00013517507,0.0003403213],"domain_scores_gemma":[0.9990993,0.000104594845,0.00008557379,0.00059238804,0.000023354041,0.0000947524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002142363,0.00018705241,0.00025301398,0.00004861193,0.00010091769,0.00008034346,0.00025292858,0.00008080621,0.0000060998213],"category_scores_gemma":[0.000010798521,0.0001890614,0.000018836625,0.00023912774,0.000037537942,0.0005136575,0.00012547913,0.00013516069,0.00001156464],"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.000002133931,0.00019955581,0.00049183314,0.0008094679,0.00009328487,5.3609523e-7,0.002123838,0.93722594,0.0009116852,0.044522453,0.0010608863,0.012558369],"study_design_scores_gemma":[0.00020283958,0.0000030364588,0.00003253939,0.00008968621,0.000018860263,0.000003585539,0.0005433572,0.99425304,0.0000965635,0.0003966055,0.0041202153,0.00023966283],"about_ca_topic_score_codex":0.000011269926,"about_ca_topic_score_gemma":0.0000035727667,"teacher_disagreement_score":0.6559464,"about_ca_system_score_codex":0.000047719604,"about_ca_system_score_gemma":0.0000051692045,"threshold_uncertainty_score":0.77097},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02386261,0.00014800491,0.975343,0.00019731629,0.000017098613,0.00022318897,0.000010020776,0.00002207044,0.00017670995],"genre_scores_gemma":[0.8224985,0.00007233217,0.1773479,0.000012902477,0.0000135274895,0.000022261771,0.000017428387,0.000002810064,0.000012359859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934095,0.0000110200845,0.0002676297,0.00016617341,0.00013771703,0.00007653063],"domain_scores_gemma":[0.999372,0.00006546884,0.00017151362,0.00017717856,0.00016472422,0.000049100727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012603283,0.00008111518,0.0001367543,0.000110375615,0.00009540506,0.00003144661,0.000111881775,0.000034762983,0.0000011136151],"category_scores_gemma":[0.0000091796865,0.00007692404,0.00002286263,0.0004828997,0.00011055136,0.00015700706,0.00003805345,0.00004141463,4.4199393e-7],"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.0000014749475,0.000052583226,0.0000542517,0.00007211474,0.000010952194,8.271448e-8,0.00034764054,0.0018135945,0.00068691414,0.82525545,0.0000044367675,0.17170048],"study_design_scores_gemma":[0.0003458754,0.0001358255,0.0049117096,0.00007311725,0.000038083203,0.000026326969,0.00091191597,0.7307185,0.007130118,0.25517955,0.00033477144,0.0001942001],"about_ca_topic_score_codex":0.0000055143887,"about_ca_topic_score_gemma":0.0000012147075,"teacher_disagreement_score":0.79863584,"about_ca_system_score_codex":0.000006003621,"about_ca_system_score_gemma":0.000026907404,"threshold_uncertainty_score":0.31368715},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026235977,0.00012299622,0.97173756,0.00005122642,0.000021675702,0.00039027055,0.000015361948,0.00002476268,0.0014001372],"genre_scores_gemma":[0.7562218,0.00002072332,0.2435042,0.0000061272026,0.000052532872,0.00014784408,0.0000062796294,0.000009623818,0.000030907016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991401,0.00002567264,0.00027825267,0.00018142184,0.00016288795,0.00021166167],"domain_scores_gemma":[0.9990868,0.00019866833,0.00020996609,0.0003533877,0.00007875615,0.000072443036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002585691,0.00011391162,0.00024164282,0.0000402338,0.00006060167,0.00002578979,0.00018806609,0.000050035516,0.000009339041],"category_scores_gemma":[0.0000071781265,0.00009463809,0.0000351349,0.00037133254,0.00011579588,0.00020175271,0.0000997419,0.00009848707,0.0000014025834],"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.000013614371,0.0014602356,0.051744297,0.0002572199,0.0001552965,0.0000014639485,0.0025230262,0.005298229,0.00043207136,0.9133901,0.00008118055,0.02464325],"study_design_scores_gemma":[0.0006605416,0.00006312668,0.024261724,0.00012904246,0.00003767174,0.00005799587,0.00047628416,0.96285087,0.0007138653,0.010010688,0.0004042895,0.00033387783],"about_ca_topic_score_codex":0.000037303722,"about_ca_topic_score_gemma":0.000012412774,"teacher_disagreement_score":0.9575527,"about_ca_system_score_codex":0.000017001064,"about_ca_system_score_gemma":0.00001933586,"threshold_uncertainty_score":0.3859229},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029399546,0.000077178294,0.9920114,0.00031046828,0.000018838353,0.00037499625,0.000009998357,0.00014089893,0.004116217],"genre_scores_gemma":[0.28114608,0.00007365483,0.71830475,0.000069498965,0.000042396292,0.00017214046,0.00001741521,0.000020041365,0.00015404636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991513,0.000015409154,0.00020714563,0.00031586693,0.0001439538,0.00016635556],"domain_scores_gemma":[0.99925464,0.00005440127,0.0001234195,0.0003995697,0.00006051748,0.00010745537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021201691,0.00013108492,0.0001258671,0.00008479145,0.0002213725,0.00016467662,0.0002808386,0.000044228724,0.0000063597677],"category_scores_gemma":[0.00001094964,0.00012175779,0.000028395065,0.00021818995,0.00010272538,0.0004212734,0.00017613365,0.00008473642,0.0000162827],"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":[8.735014e-7,0.00007642281,0.000018224502,0.00005508649,0.000013603492,9.3512506e-7,0.0039441935,0.0000034442996,0.0014766494,0.9758486,0.000021390362,0.018540572],"study_design_scores_gemma":[0.0003756856,0.00004807187,0.0007075876,0.000045235112,0.000047585192,0.000038619473,0.000922996,0.55919135,0.0018612009,0.4354901,0.0009181439,0.0003534193],"about_ca_topic_score_codex":0.000021440352,"about_ca_topic_score_gemma":0.0000014564765,"teacher_disagreement_score":0.55918795,"about_ca_system_score_codex":0.000018593195,"about_ca_system_score_gemma":0.000018661052,"threshold_uncertainty_score":0.49651384},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25251877,0.00044766234,0.7249562,0.0019440369,0.00004580842,0.003634387,0.00048209287,0.00014955427,0.015821476],"genre_scores_gemma":[0.9024959,0.000079404614,0.09622406,0.0000383489,0.00005218758,0.00080524996,0.000025071988,0.000041942494,0.0002377932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998704,0.00004408493,0.00055736705,0.00020783233,0.00032422828,0.00016246256],"domain_scores_gemma":[0.9977614,0.00083152024,0.00040707385,0.00073645636,0.00015740236,0.00010611323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007442113,0.00017197261,0.00033053348,0.0000919033,0.00013884864,0.000020615156,0.0003245401,0.00006787305,0.000023425719],"category_scores_gemma":[0.00012558016,0.00011835329,0.00011893751,0.00039267272,0.00029606483,0.000042655774,0.00008342219,0.00013017376,0.000008902775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046034,0.00047051263,0.000006471703,0.00012344307,0.000058543086,6.854024e-8,0.0006915197,0.000008457019,0.00061135035,0.9968733,0.0002933371,0.0008583566],"study_design_scores_gemma":[0.00026015457,0.000077745666,0.00002690563,0.00006472132,0.000109049535,0.0000034211398,0.0017872078,0.0013004255,0.0019809224,0.99366534,0.00059481844,0.00012929806],"about_ca_topic_score_codex":0.000008547667,"about_ca_topic_score_gemma":0.000002228671,"teacher_disagreement_score":0.6499772,"about_ca_system_score_codex":0.000009736374,"about_ca_system_score_gemma":0.000019667932,"threshold_uncertainty_score":0.4826307},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023095498,0.00015368595,0.99544305,0.0006039217,0.00001354644,0.00040361212,0.000040618565,0.00007937747,0.0009526382],"genre_scores_gemma":[0.31726483,0.00024210152,0.6808536,0.00004774439,0.000056296758,0.00038487348,0.000008198672,0.00003492687,0.0011074524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990148,0.000022334405,0.0002873002,0.0002633715,0.00021635789,0.0001958474],"domain_scores_gemma":[0.9986814,0.00032245775,0.00013067765,0.0006398936,0.0001223131,0.00010321471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021018465,0.00011275323,0.00018468127,0.00012118889,0.00010244763,0.000029427574,0.00045918205,0.00004499639,0.00001158813],"category_scores_gemma":[0.000049925075,0.00007264243,0.00006168394,0.00048376925,0.00017180893,0.00017620418,0.00018206851,0.00005512512,0.000019373507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015083389,0.00005804901,0.000016745566,0.000027983515,0.000019371691,4.909213e-7,0.00023903357,0.00000319716,0.0062061762,0.9435025,0.000021050844,0.04990392],"study_design_scores_gemma":[0.00051145966,0.000060388706,0.00014900774,0.00006069451,0.000012754651,0.000010751481,0.0001207469,0.025670024,0.009614786,0.9608962,0.0026836786,0.00020948908],"about_ca_topic_score_codex":0.0000022571262,"about_ca_topic_score_gemma":5.49972e-7,"teacher_disagreement_score":0.31495526,"about_ca_system_score_codex":0.0000075909074,"about_ca_system_score_gemma":0.000020975598,"threshold_uncertainty_score":0.29622725},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00057588174,0.00003875418,0.99636346,0.00089719373,0.00001277953,0.00027892936,0.000013610581,0.000052941905,0.0017664604],"genre_scores_gemma":[0.19324876,0.0001505481,0.8057599,0.000042677064,0.00003604868,0.0002061429,0.0000039507186,0.000013253237,0.0005387215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992371,0.000017602999,0.0002441465,0.00020055586,0.00017217935,0.0001284011],"domain_scores_gemma":[0.9990973,0.0001617225,0.000096892145,0.0004438271,0.00012515557,0.000075108794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032756515,0.00007476689,0.00012775892,0.00004116322,0.00009260479,0.000051775503,0.00029106846,0.000028546538,0.000014732066],"category_scores_gemma":[0.000036779213,0.000048157493,0.000032533655,0.00020318633,0.00008844911,0.00017446933,0.00014592808,0.000030361934,0.000009720791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.1578793e-7,0.00008392341,0.00012714091,0.00006634635,0.000011625048,1.1795585e-7,0.00044105537,0.00007451194,0.002058882,0.9228118,0.000037110578,0.07428715],"study_design_scores_gemma":[0.0008613114,0.00009379853,0.0012494994,0.00015250758,0.000019575054,0.000012957367,0.00026294205,0.46827373,0.0075832466,0.514999,0.005977941,0.00051349733],"about_ca_topic_score_codex":0.0000069129687,"about_ca_topic_score_gemma":0.0000019437864,"teacher_disagreement_score":0.46819922,"about_ca_system_score_codex":0.000012095944,"about_ca_system_score_gemma":0.000029695138,"threshold_uncertainty_score":0.19638056},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014236303,0.00027431993,0.9867909,0.00085505866,0.000028769984,0.00027156377,0.000016105101,0.00012847684,0.010211202],"genre_scores_gemma":[0.41116443,0.0003293136,0.5861236,0.00023492714,0.0002695318,0.0005701734,0.00001763885,0.000031574848,0.0012588112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932134,0.000008503267,0.00015746293,0.00023618115,0.00012315583,0.00015336886],"domain_scores_gemma":[0.9985964,0.00008081406,0.00014874559,0.00106591,0.000030039299,0.00007813194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021488292,0.00011031271,0.00015095843,0.00003835753,0.0006556521,0.00060187,0.0008351161,0.000035801993,0.000008298946],"category_scores_gemma":[0.000023295897,0.00008689858,0.000052498894,0.000055528606,0.00011125061,0.00026240942,0.00027968056,0.00006209942,0.000027811273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.921441e-7,0.000039493945,0.000026286358,0.000027062115,0.00001619133,0.0000018057613,0.0003818465,0.0000020192554,0.00021714294,0.9143157,0.00012771621,0.08484434],"study_design_scores_gemma":[0.0011604325,0.000029020835,0.0017875562,0.00006387875,0.000039123108,0.000049344595,0.0006632204,0.17003731,0.001417905,0.8103523,0.013887372,0.0005125104],"about_ca_topic_score_codex":0.000014536094,"about_ca_topic_score_gemma":0.0000017475546,"teacher_disagreement_score":0.4097408,"about_ca_system_score_codex":0.0000039407546,"about_ca_system_score_gemma":0.000009135979,"threshold_uncertainty_score":0.5803847},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027954606,0.0002911268,0.99129945,0.0005895575,0.00003565671,0.0013281081,0.00007375944,0.00017349547,0.003413376],"genre_scores_gemma":[0.11087896,0.00016005781,0.88640386,0.000026185604,0.000112793976,0.0019665281,0.000048289032,0.000064881184,0.00033842938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978509,0.000046156405,0.0003672572,0.0008576325,0.000467839,0.00041021875],"domain_scores_gemma":[0.99668694,0.00026513738,0.0004999924,0.0021945897,0.00016081623,0.00019254272],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006469968,0.0003849937,0.00047072832,0.00015409003,0.0008870319,0.0011762705,0.0017019927,0.00013637927,0.0000045009406],"category_scores_gemma":[0.000041129817,0.00030031032,0.00010858596,0.00014602178,0.00026037014,0.00027878326,0.0025187696,0.00067909475,0.000014617644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036829194,0.00014879869,0.000033281656,0.0010026924,0.00013526289,0.000016166252,0.0040087546,0.00063855445,0.00013008903,0.8490044,0.000019989708,0.14485836],"study_design_scores_gemma":[0.0002363476,0.00003759398,0.00010539185,0.00041736875,0.000036640537,0.000053064367,0.00030883416,0.21208751,0.00015574846,0.78575164,0.000324371,0.00048551182],"about_ca_topic_score_codex":0.000023228913,"about_ca_topic_score_gemma":0.000007271339,"teacher_disagreement_score":0.21144895,"about_ca_system_score_codex":0.00004508491,"about_ca_system_score_gemma":0.00010347482,"threshold_uncertainty_score":0.9999449},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020798862,0.000058562866,0.9927392,0.00047675672,0.000023604867,0.00042414662,0.0000070311485,0.00004343418,0.0041473885],"genre_scores_gemma":[0.0809211,0.00008814723,0.9185127,0.000056573004,0.000069245885,0.0001575344,0.0000087780845,0.0000117827185,0.00017411991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989303,0.000021962953,0.0003857494,0.0002548599,0.00019497993,0.00021214681],"domain_scores_gemma":[0.9991699,0.00012078285,0.00010315716,0.00036028438,0.0001503388,0.00009552654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046444547,0.00010874926,0.00020949722,0.000112552,0.00012789338,0.00010761035,0.000369772,0.000053331954,0.000024676907],"category_scores_gemma":[0.000037018915,0.00009400347,0.00003826623,0.0004191327,0.00014753429,0.00018590759,0.00018668572,0.000091622234,0.000016932348],"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.000008177064,0.0003433561,0.0002793676,0.00017241745,0.000038434366,0.0000012755149,0.0022146292,0.004132972,0.0005655733,0.9771665,0.00006708027,0.015010246],"study_design_scores_gemma":[0.0006862421,0.000057487196,0.00013014914,0.00004661749,0.000006292685,0.0000056751824,0.0001273781,0.9836722,0.00045779347,0.0137381395,0.0009452009,0.0001267946],"about_ca_topic_score_codex":0.000008219593,"about_ca_topic_score_gemma":0.0000046166715,"teacher_disagreement_score":0.9795393,"about_ca_system_score_codex":0.00001007437,"about_ca_system_score_gemma":0.00004343834,"threshold_uncertainty_score":0.38333502},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006698206,0.0003199892,0.9947675,0.0014343432,0.000054410546,0.002475518,0.00034063778,0.00023723856,0.000303403],"genre_scores_gemma":[0.0013200999,0.000033255197,0.99252176,0.00021238267,0.00016859137,0.005492432,0.00013668348,0.000054545166,0.000060219994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759066,0.00007702743,0.00053432526,0.0010252062,0.000369673,0.00040313657],"domain_scores_gemma":[0.99737614,0.0005983178,0.0003427014,0.001179038,0.00023676001,0.00026704138],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067805726,0.0003880115,0.0005154148,0.00017031624,0.0004376809,0.0005431741,0.0012975186,0.00018380884,0.0000037415534],"category_scores_gemma":[0.000081690276,0.00036404352,0.0002455902,0.00046853907,0.000107968204,0.00011374751,0.0009909375,0.00047262784,0.000007240645],"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.0000029671394,0.000081243554,0.000001948016,0.000626647,0.000078500474,0.0000012237585,0.00048184668,0.0023515902,0.0018293723,0.9607817,0.00015855567,0.033604432],"study_design_scores_gemma":[0.00014202291,0.000026944743,0.0000015744507,0.00003326741,0.000024238752,0.0000022704824,0.000044417622,0.5684548,0.0008673503,0.428203,0.0019602191,0.0002399109],"about_ca_topic_score_codex":0.000005786742,"about_ca_topic_score_gemma":0.0000018646336,"teacher_disagreement_score":0.5661032,"about_ca_system_score_codex":0.000032289878,"about_ca_system_score_gemma":0.00018122,"threshold_uncertainty_score":0.99988115},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002670851,0.0012908035,0.992562,0.0005253331,0.00014747446,0.0019418212,0.00034532096,0.00008533328,0.00043106594],"genre_scores_gemma":[0.15601188,0.0012899493,0.837437,0.00022844641,0.0003849265,0.002634922,0.0013377125,0.000047700403,0.0006274675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850285,0.000017426517,0.0003923945,0.0006300543,0.00024640773,0.00021088352],"domain_scores_gemma":[0.9984169,0.00048501074,0.00025665492,0.000583288,0.00014019253,0.000117964206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042166372,0.00026297028,0.00039374898,0.00032591872,0.0002570746,0.00044665678,0.000432619,0.0001798762,0.000002948524],"category_scores_gemma":[0.000032574644,0.00024072795,0.0000977664,0.00037560557,0.00005508315,0.0001227882,0.00055529125,0.00020904721,0.000005001261],"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.0000110215215,0.0002228212,0.0001296867,0.0015409968,0.00019929501,7.75472e-7,0.0007116849,0.0053309393,0.000057213896,0.90507644,0.0012863012,0.0854328],"study_design_scores_gemma":[0.0007911392,0.000047362722,0.0003322949,0.000053129148,0.00007035595,0.000017741388,0.00004042498,0.5912514,0.000103901795,0.4002019,0.0067069773,0.0003834169],"about_ca_topic_score_codex":0.000010500548,"about_ca_topic_score_gemma":0.0000026003615,"teacher_disagreement_score":0.5859204,"about_ca_system_score_codex":0.000016693626,"about_ca_system_score_gemma":0.00006882058,"threshold_uncertainty_score":0.9816601},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19780862,0.0036075788,0.79038745,0.000067533845,0.00006294441,0.0020359263,0.0021755872,0.00004657413,0.0038077557],"genre_scores_gemma":[0.8742527,0.0023969715,0.11536528,0.00005477944,0.0002765611,0.0013655555,0.004520497,0.00013969495,0.0016279725],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828625,0.00003631175,0.000622612,0.0006336694,0.00017958424,0.00024159555],"domain_scores_gemma":[0.99817586,0.000029906856,0.00059825013,0.0009256021,0.00015051062,0.00011985329],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036191352,0.00033021646,0.00058548315,0.00017558766,0.0001229307,0.000054142365,0.00029090207,0.00028340865,0.000055431978],"category_scores_gemma":[0.000031217318,0.0003192465,0.00033055578,0.00027298418,0.0001271615,0.0000034643062,0.00060692185,0.00018860372,0.0000038947496],"study_design_candidate":"bench_or_experimental","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.00013000547,0.007281496,0.008586027,0.01666132,0.09429369,0.00019375695,0.020953927,0.012521421,0.5960395,0.033273958,0.011079062,0.19898584],"study_design_scores_gemma":[0.0061770305,0.0016467982,0.0022295928,0.001140071,0.06051506,0.0009018341,0.011868405,0.53342247,0.22698799,0.08087213,0.06078034,0.013458245],"about_ca_topic_score_codex":0.0000745569,"about_ca_topic_score_gemma":0.000010374876,"teacher_disagreement_score":0.67644405,"about_ca_system_score_codex":0.0000131310535,"about_ca_system_score_gemma":0.000039798266,"threshold_uncertainty_score":0.999926},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008582922,0.00011772932,0.9851011,0.00062330643,0.000012637597,0.00020039949,0.0000071431887,0.00007267341,0.0052820593],"genre_scores_gemma":[0.7374892,0.000035618847,0.2623036,0.00005156055,0.000026388137,0.000048932765,0.000005402749,0.0000033793895,0.000035901616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993575,0.000012412985,0.00021605921,0.00017696491,0.00012746523,0.00010960418],"domain_scores_gemma":[0.9993395,0.000057220215,0.0001245587,0.00037194716,0.00005331744,0.00005341856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019399494,0.000082341845,0.00011444531,0.000049180842,0.0001672644,0.000107267355,0.00034663835,0.000032853182,0.000004941259],"category_scores_gemma":[0.0000067454343,0.000070625065,0.000046689056,0.00034270887,0.00009814138,0.00017330021,0.000041239564,0.00005239112,0.000004635567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.7927288e-7,0.000049978156,0.00002399365,0.000012917138,0.000004825302,1.06570226e-7,0.00042660703,0.000006480222,0.0010145012,0.9191464,0.00001317878,0.07930063],"study_design_scores_gemma":[0.00013894544,0.000097858574,0.004246665,0.00002762387,0.000018374581,0.000012461782,0.0002560708,0.15416808,0.0011010334,0.8368132,0.002928957,0.00019071596],"about_ca_topic_score_codex":0.0000018095269,"about_ca_topic_score_gemma":3.2090432e-7,"teacher_disagreement_score":0.72890633,"about_ca_system_score_codex":0.000003873655,"about_ca_system_score_gemma":0.000017794166,"threshold_uncertainty_score":0.28800064},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015809193,0.0006642891,0.9925875,0.0015928753,0.000109484274,0.0032064083,0.0008190708,0.00033578888,0.00052648695],"genre_scores_gemma":[0.008769057,0.00043651072,0.9838546,0.00007989123,0.00018812547,0.0058753965,0.0003848057,0.00010056538,0.00031107533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968832,0.00004582119,0.0006487759,0.0013090719,0.0005122508,0.0006008691],"domain_scores_gemma":[0.9969756,0.00040541205,0.00038340752,0.0015915969,0.00026869256,0.00037530673],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004640619,0.0005254957,0.00064275897,0.00023109416,0.00043946735,0.00058317865,0.0020446926,0.00025855575,0.0000062648305],"category_scores_gemma":[0.00006179031,0.00050187,0.00030449446,0.00052969105,0.0002533065,0.00021169284,0.0020565873,0.0007178838,0.000018875335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004254602,0.0001461393,0.0000034628474,0.00078913587,0.0001651257,0.0000027011279,0.0008603835,0.00050466007,0.00025797772,0.93687826,0.00017005827,0.060217846],"study_design_scores_gemma":[0.00020972143,0.00004259488,0.000012208001,0.00004787492,0.00003408545,0.000006545038,0.0001269721,0.46971455,0.00008557456,0.52690446,0.002477861,0.0003375483],"about_ca_topic_score_codex":0.000006574005,"about_ca_topic_score_gemma":0.0000031528643,"teacher_disagreement_score":0.4692099,"about_ca_system_score_codex":0.000060791095,"about_ca_system_score_gemma":0.00015005085,"threshold_uncertainty_score":0.9997433},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015544993,0.00047233663,0.9805401,0.001277992,0.000046370915,0.0004529031,0.000031541593,0.00018865753,0.001445086],"genre_scores_gemma":[0.62876576,0.000081096325,0.37081507,0.00016718276,0.000017063297,0.000106125815,0.000012570305,0.000017093867,0.000018011073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989583,0.0000131519055,0.00034284586,0.00030906335,0.00020349417,0.00017313033],"domain_scores_gemma":[0.99915457,0.00009560579,0.00018184232,0.00032682606,0.00008000283,0.00016116787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015777677,0.00013559197,0.00023685582,0.00004890522,0.00018738885,0.00010443892,0.00038562185,0.000039053684,0.0000020419209],"category_scores_gemma":[0.00004486625,0.00011688491,0.00005601737,0.00034497544,0.00008398222,0.00010859449,0.00014979069,0.000095353505,0.0000060060947],"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.0000010487763,0.00006308166,0.00032893362,0.00015834562,0.000027110473,8.0028553e-7,0.0019246808,0.000048868842,0.0013437076,0.9868927,0.00011611611,0.009094622],"study_design_scores_gemma":[0.0005645472,0.00009877966,0.0005381054,0.00017485925,0.00006069033,0.0000112690595,0.00075328,0.51690066,0.0024603638,0.4757749,0.0022295034,0.00043302323],"about_ca_topic_score_codex":0.00001479596,"about_ca_topic_score_gemma":0.000001103064,"teacher_disagreement_score":0.6132208,"about_ca_system_score_codex":0.000005167129,"about_ca_system_score_gemma":0.000019567486,"threshold_uncertainty_score":0.47664285},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3613275,0.0040297653,0.60492456,0.013060324,0.00024203573,0.003708082,0.0018648732,0.0013978835,0.00944499],"genre_scores_gemma":[0.9914708,0.00017609051,0.0075286105,0.00014012064,0.00015974526,0.00033487476,0.0000410827,0.000036882895,0.000111754984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917066,0.000014481285,0.00021627932,0.0002463378,0.00013833767,0.0002139273],"domain_scores_gemma":[0.9994626,0.00004586984,0.000053093336,0.00021557993,0.00002947259,0.00019338817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000104490646,0.00020284868,0.00023631139,0.00003802129,0.00015195593,0.00018960239,0.00014242134,0.00006498585,0.000018174975],"category_scores_gemma":[0.000005089623,0.00017097514,0.000042668835,0.00017345794,0.00012803126,0.00012554965,0.00003202158,0.00011879884,0.000009143766],"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.000017161532,0.00019997769,0.0013047125,0.0064789816,0.0010999291,0.00003759116,0.07859719,0.001587561,0.030411823,0.8222637,0.0041440097,0.053857364],"study_design_scores_gemma":[0.0014353035,0.00039655343,0.00038754073,0.0003642581,0.0004319694,0.00012806519,0.043520935,0.6434487,0.0049508065,0.19850975,0.10385714,0.0025689644],"about_ca_topic_score_codex":0.000009435415,"about_ca_topic_score_gemma":0.000008856448,"teacher_disagreement_score":0.64186114,"about_ca_system_score_codex":0.000010033069,"about_ca_system_score_gemma":0.000009344921,"threshold_uncertainty_score":0.6972164},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003476669,0.0003224738,0.9974496,0.0003442902,0.000047166,0.0008989818,0.00040665103,0.000064868465,0.00011831724],"genre_scores_gemma":[0.017482711,0.000028735918,0.98012346,0.00015419541,0.00007044362,0.001980957,0.00010316423,0.000020362795,0.000035990342],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871236,0.000046538717,0.00036947906,0.00034360346,0.00032632,0.00020169945],"domain_scores_gemma":[0.9983282,0.00035698162,0.0002733135,0.0008648288,0.000095630145,0.00008102084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006207136,0.00014539488,0.00020528348,0.00007690226,0.0008900644,0.00014064844,0.0010041877,0.000027035316,0.000009612698],"category_scores_gemma":[0.000012033355,0.00010581299,0.00007534073,0.00041755318,0.000086463275,0.00019211475,0.0003238594,0.00011686687,8.1642764e-7],"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.000002190082,0.00029309664,0.000008526639,0.000047090572,0.000020057007,5.772794e-7,0.0007747479,0.00055290665,0.00031324598,0.27655455,0.0002241163,0.7212089],"study_design_scores_gemma":[0.00032248354,0.00010589183,0.000024115796,0.000011947409,0.000016425482,0.0000082185,0.0005940492,0.946375,0.00052433513,0.03061209,0.02126016,0.00014524418],"about_ca_topic_score_codex":0.000016890082,"about_ca_topic_score_gemma":0.000001527575,"teacher_disagreement_score":0.9458221,"about_ca_system_score_codex":0.000023108343,"about_ca_system_score_gemma":0.00007279421,"threshold_uncertainty_score":0.68457454},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01258414,0.00038131012,0.98441285,0.00032240667,0.000017815932,0.00031309863,0.00003239393,0.00006597718,0.0018700197],"genre_scores_gemma":[0.07489776,0.0002944163,0.9239158,0.000065060645,0.000035471232,0.00030120963,0.000019313278,0.000022923392,0.0004480713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989445,0.000027164126,0.00028946108,0.00027836394,0.00026270375,0.00019781345],"domain_scores_gemma":[0.9987302,0.00017911315,0.00011172992,0.00073597074,0.00014331841,0.00009966885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019338544,0.00011375103,0.00020756933,0.00005648724,0.00013448096,0.00007674337,0.0004076709,0.00003706571,0.000027954184],"category_scores_gemma":[0.000027666452,0.000102326296,0.00006652981,0.0005602622,0.00013837052,0.0002422597,0.0002729587,0.00009163193,0.000026068928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.2127492e-7,0.0000866849,0.000023223176,0.000114241775,0.000021555912,0.000001951044,0.00031548992,0.0000045362713,0.0011756043,0.99156624,0.000015096195,0.006675134],"study_design_scores_gemma":[0.00014885099,0.000010585651,0.00010929989,0.00003056755,0.000010434767,0.00003462597,0.00024145523,0.032075033,0.0039623748,0.96250814,0.0007386177,0.00013000694],"about_ca_topic_score_codex":0.0000020994205,"about_ca_topic_score_gemma":6.192844e-7,"teacher_disagreement_score":0.06231362,"about_ca_system_score_codex":0.0000088031675,"about_ca_system_score_gemma":0.000045027533,"threshold_uncertainty_score":0.41727453},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066770227,0.00012574153,0.9888294,0.0013476298,0.00004293167,0.00040238164,0.000022547516,0.00008724552,0.0024651082],"genre_scores_gemma":[0.65355796,0.00009817679,0.3430039,0.0007269867,0.000120089855,0.0014091182,0.000012817431,0.000031202526,0.001039727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991723,0.000017215463,0.00018875982,0.0002832292,0.00019508677,0.00014346026],"domain_scores_gemma":[0.99930114,0.00014012978,0.00007253066,0.00039224591,0.000025313744,0.00006863393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015281988,0.00009959205,0.000111631016,0.000053572767,0.00046189644,0.00013371756,0.00033359544,0.000020096848,0.000022846274],"category_scores_gemma":[0.000011762594,0.000090369074,0.00002477151,0.00019971965,0.0000704105,0.00008068725,0.00037382735,0.00012330055,0.000023085973],"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":[6.21119e-7,0.00009030051,0.000057034697,0.000016595985,0.000008137851,0.000001512603,0.0016881805,0.00018661444,0.00017806854,0.895481,0.00011747864,0.10217447],"study_design_scores_gemma":[0.00011539682,0.00013678885,0.00035135314,0.000012204847,0.00001532135,0.00005138974,0.0010302654,0.65406144,0.00074693584,0.29728368,0.04585053,0.00034471537],"about_ca_topic_score_codex":0.000010205694,"about_ca_topic_score_gemma":0.0000013610492,"teacher_disagreement_score":0.6538748,"about_ca_system_score_codex":0.000019404744,"about_ca_system_score_gemma":0.000015884776,"threshold_uncertainty_score":0.36851442},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032894986,0.00019933209,0.99550134,0.0025771905,0.000010143554,0.00037304743,0.00002263142,0.000022137996,0.00096523995],"genre_scores_gemma":[0.31267092,0.00061981974,0.68381256,0.0005363143,0.0000667937,0.0009483742,0.0001397092,0.000025691521,0.0011798656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990569,0.000038638762,0.00026943872,0.00023909839,0.00025882438,0.00013710443],"domain_scores_gemma":[0.9989623,0.0002113079,0.000095610325,0.0005296166,0.00015517154,0.000046002817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025785697,0.00009227872,0.00012827099,0.000045012912,0.00010657104,0.00012218748,0.00043566304,0.000036165915,0.00000781674],"category_scores_gemma":[0.00004622276,0.00006838078,0.00002585816,0.0006422995,0.00006342053,0.000108353044,0.00011436949,0.00010792375,0.0000053097706],"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.0000019747777,0.00096131006,0.00003453924,0.00023658275,0.000027247932,0.0000049449436,0.0066432045,0.07761129,0.00033513876,0.8811223,0.0013161837,0.031705316],"study_design_scores_gemma":[0.00020692579,0.000051106697,0.00005423133,0.00005562154,0.000005125304,0.0000110421715,0.0007846736,0.9877337,0.0007530661,0.0086141415,0.0016164366,0.000113887174],"about_ca_topic_score_codex":0.0000090533495,"about_ca_topic_score_gemma":0.0000041423095,"teacher_disagreement_score":0.91012245,"about_ca_system_score_codex":0.000008826589,"about_ca_system_score_gemma":0.000053741842,"threshold_uncertainty_score":0.27884874},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088947885,0.000027211634,0.9092399,0.00039350727,0.000028821212,0.0008333319,0.000095706244,0.000048408245,0.00038524106],"genre_scores_gemma":[0.9589267,0.000068649126,0.04031812,0.000014307343,0.000027368233,0.0004498245,0.000017299866,0.000013768844,0.0001640028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917877,0.000028358572,0.0002403473,0.00018341735,0.00023929996,0.00012980805],"domain_scores_gemma":[0.9990498,0.000117562064,0.00021808075,0.00044731417,0.00013187643,0.00003541033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002292082,0.000081941456,0.00014670283,0.000109133536,0.0001292023,0.00002805073,0.00048487986,0.000030343192,0.0000021940552],"category_scores_gemma":[0.000023851004,0.000055989458,0.00005311225,0.0013013078,0.00037323008,0.00015564404,0.00020919107,0.000067385976,0.000001432744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.543393e-7,0.000038581078,0.00027180798,0.00014159559,0.000027379416,1.7408193e-7,0.0014990126,0.00002169231,0.025935614,0.9570908,0.0000027159508,0.014969652],"study_design_scores_gemma":[0.00022992986,0.000050104903,0.0049545905,0.00011444233,0.000021747734,0.000011531495,0.00097340276,0.13144234,0.058722533,0.80297124,0.00031340055,0.00019471052],"about_ca_topic_score_codex":0.000002337855,"about_ca_topic_score_gemma":7.873605e-7,"teacher_disagreement_score":0.8699788,"about_ca_system_score_codex":0.000004761664,"about_ca_system_score_gemma":0.00003360879,"threshold_uncertainty_score":0.22831838},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022778701,0.0004343488,0.99206537,0.00022324044,0.000056160858,0.0008100977,0.00011401261,0.00048038733,0.0055885767],"genre_scores_gemma":[0.08645752,0.000113063295,0.9124541,0.000023320672,0.00014837758,0.00057290454,0.00004473531,0.000073457624,0.00011248422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931014,0.00000968857,0.0002400116,0.00017899586,0.00009404349,0.00016709701],"domain_scores_gemma":[0.999392,0.00029143013,0.000016761269,0.00018859643,0.000037330734,0.00007392971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028523142,0.00012933234,0.00014669095,0.00003796216,0.00010019012,0.00015279526,0.00008693524,0.00006154288,0.000021993554],"category_scores_gemma":[0.000026837202,0.00010948199,0.000051833278,0.00017685564,0.00012305185,0.00004705038,0.000022365572,0.00008968273,0.000011792136],"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":[3.749764e-7,0.000011840994,6.1887437e-7,0.00036316251,0.000031617164,3.3519444e-7,0.00026407297,0.0024741727,0.0004245486,0.974249,0.00007955426,0.02210069],"study_design_scores_gemma":[0.00008750162,0.000010264957,0.0000011397017,0.000048268015,0.00004410609,0.000009298746,0.00013276124,0.8632871,0.00081337866,0.12820145,0.0072316173,0.00013313713],"about_ca_topic_score_codex":3.4872278e-7,"about_ca_topic_score_gemma":8.856168e-8,"teacher_disagreement_score":0.8608129,"about_ca_system_score_codex":0.000019919536,"about_ca_system_score_gemma":0.000014338866,"threshold_uncertainty_score":0.44645458},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039740073,0.00083753123,0.99171567,0.0011830113,0.00004105536,0.00033275096,0.000046731635,0.00037450355,0.005071367],"genre_scores_gemma":[0.51365715,0.0007394135,0.47800905,0.00047955877,0.0004420862,0.00199794,0.00014679242,0.00006793359,0.0044600875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990813,0.000007602014,0.00022808979,0.00035245824,0.00015651438,0.00017403858],"domain_scores_gemma":[0.9990633,0.00021029478,0.000039377654,0.0005662199,0.000028339391,0.00009247392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013141379,0.0001361798,0.00013326359,0.00007684088,0.00019919965,0.00053254043,0.00039304726,0.000059593058,0.000032484808],"category_scores_gemma":[0.000007078894,0.000115508825,0.00006567663,0.00040220693,0.000057768335,0.00020566494,0.00018295857,0.000116893636,0.00012082215],"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":[7.0369566e-8,0.000037198493,0.0000026448447,0.000081122,0.000018933464,0.0000018089219,0.00046523593,0.000022076114,0.0002389864,0.9513278,0.0006510182,0.047153108],"study_design_scores_gemma":[0.000056618894,0.000009961635,0.000042752057,0.00003356759,0.000020298025,0.00001608408,0.000052835898,0.7534841,0.00041213192,0.15117191,0.094523534,0.00017624332],"about_ca_topic_score_codex":0.000009579562,"about_ca_topic_score_gemma":0.0000027205408,"teacher_disagreement_score":0.8001559,"about_ca_system_score_codex":0.000010981024,"about_ca_system_score_gemma":0.000029231378,"threshold_uncertainty_score":0.51352996},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006762256,0.0005007724,0.9829172,0.0062588914,0.00017160553,0.0036286667,0.00021858355,0.00045797168,0.0051701036],"genre_scores_gemma":[0.7227977,0.0011183692,0.16509943,0.007412682,0.010153782,0.046567105,0.0062283543,0.0005359747,0.040086593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987626,0.0000066174794,0.00038107036,0.00040785098,0.000213611,0.00022822709],"domain_scores_gemma":[0.99916583,0.00018816095,0.000063764506,0.00040339382,0.0001570824,0.000021744592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050549617,0.00021910635,0.00018835312,0.00013484475,0.00046605663,0.0005592877,0.00023026303,0.000054887987,0.0001459379],"category_scores_gemma":[0.000040755618,0.00015446206,0.00009856066,0.0005503683,0.000092932234,0.00028761948,0.00008157573,0.00009730117,0.00046718368],"study_design_candidate":"design_other","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.000009919202,0.00031734348,0.000007169471,0.0012932086,0.00023285927,5.262742e-7,0.00038251185,0.0012157736,0.00016666319,0.15523116,0.02696546,0.8141774],"study_design_scores_gemma":[0.0001609213,0.000011552045,0.00012374585,0.000044011333,0.00011257552,6.317162e-7,0.00034790242,0.71999687,0.000016229536,0.004807006,0.27419922,0.0001793146],"about_ca_topic_score_codex":0.00015752223,"about_ca_topic_score_gemma":0.000036864938,"teacher_disagreement_score":0.81781775,"about_ca_system_score_codex":0.00003031572,"about_ca_system_score_gemma":0.000021827462,"threshold_uncertainty_score":0.629878},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015364835,0.0014096558,0.8882967,0.0004324189,0.000049412098,0.000555673,0.00096730154,0.00005523676,0.09286873],"genre_scores_gemma":[0.9828151,0.0005439597,0.01483131,0.000023523315,0.000029628443,0.00018790041,0.000122042315,0.000013894435,0.0014326699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990537,0.000009672015,0.0005286307,0.00024029132,0.000034902117,0.00013278551],"domain_scores_gemma":[0.99919695,0.00009557795,0.00032640307,0.00029982225,0.00003206922,0.000049158785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043943754,0.00011479454,0.00029916875,0.0001414275,0.00024380148,0.00004850071,0.00016547978,0.00006669922,0.00007469054],"category_scores_gemma":[0.0000563177,0.00011966435,0.000067218585,0.00032891246,0.0000959237,0.00007364376,0.00010544443,0.00016498739,0.0000043697646],"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.0000019916965,0.00018320324,0.036444142,0.00026903604,0.00007110407,6.927496e-8,0.00035461056,0.000060136048,0.0000055313626,0.96011865,0.000042054864,0.002449441],"study_design_scores_gemma":[0.00019621507,0.00001694997,0.019849982,0.000024933506,0.000017942792,8.525863e-7,0.00009803192,0.693692,0.0000074223194,0.26483843,0.02114228,0.00011491689],"about_ca_topic_score_codex":0.00015095726,"about_ca_topic_score_gemma":0.000012472395,"teacher_disagreement_score":0.96745026,"about_ca_system_score_codex":0.000021101545,"about_ca_system_score_gemma":0.000012547794,"threshold_uncertainty_score":0.48797706},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032985964,0.00050972326,0.99508446,0.00073258515,0.00011033951,0.00089303934,0.00006735729,0.00018772364,0.0020849118],"genre_scores_gemma":[0.0051294127,0.00006873118,0.9921595,0.00015609775,0.00002258536,0.0014730815,0.000023725277,0.000017226488,0.0009496641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873435,0.00001075353,0.000363129,0.00044391284,0.00015525834,0.00029259932],"domain_scores_gemma":[0.99858075,0.00020458768,0.00015582953,0.0008066898,0.00014775412,0.00010437819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029002829,0.00018593266,0.0002349801,0.00017162964,0.00046732192,0.0002455421,0.0006655311,0.000073687406,0.0000021243227],"category_scores_gemma":[0.000031104948,0.00016665059,0.000097331314,0.00052172993,0.000093967305,0.00015081312,0.00031789116,0.000099707904,0.0000049068285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.9846026e-7,0.00006709029,0.000008369218,0.000064451415,0.000030936284,1.9638324e-7,0.00012903669,0.000012897262,0.000110885376,0.8926497,0.0005784447,0.1063477],"study_design_scores_gemma":[0.00043219927,0.000027318858,0.000029846606,0.000046151476,0.000034940007,0.0000027587023,0.0001393784,0.3709751,0.0005379954,0.62184817,0.005753817,0.00017231077],"about_ca_topic_score_codex":0.000011954881,"about_ca_topic_score_gemma":0.0000025086786,"teacher_disagreement_score":0.3709622,"about_ca_system_score_codex":0.000014641099,"about_ca_system_score_gemma":0.000045028868,"threshold_uncertainty_score":0.67958134},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14028019,0.00065492856,0.8299098,0.0001506189,0.00003569558,0.0010625038,0.00011351896,0.00023205613,0.027560696],"genre_scores_gemma":[0.95131594,0.000019982057,0.046993867,0.0000139454205,0.000025488964,0.0005056733,0.00009100416,0.00002317662,0.0010109066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993936,0.000012053662,0.0002811345,0.000120429904,0.00009682269,0.00009597137],"domain_scores_gemma":[0.99949604,0.00010189672,0.00006512763,0.00021631236,0.000081756676,0.000038843675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011910612,0.000115384435,0.00015997553,0.00012631011,0.00010055936,0.000029764764,0.00007567538,0.000043014323,0.000026226424],"category_scores_gemma":[0.000010626979,0.000095425865,0.000026407619,0.0005825695,0.00009574247,0.00006566672,0.0000162617,0.00007056129,0.000009466941],"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.0000032315618,0.000031742213,0.0008714896,0.00040800206,0.000106172054,1.4682755e-7,0.0007963456,0.0045144274,0.00075822946,0.9901113,0.00012775837,0.0022711903],"study_design_scores_gemma":[0.0015144182,0.0000957938,0.004586031,0.000835707,0.00037810247,0.000011236229,0.0035796713,0.5175354,0.002520107,0.4572801,0.010960638,0.0007028221],"about_ca_topic_score_codex":0.0000042675906,"about_ca_topic_score_gemma":0.000010369942,"teacher_disagreement_score":0.81103575,"about_ca_system_score_codex":0.000008144669,"about_ca_system_score_gemma":0.000020208967,"threshold_uncertainty_score":0.3891354},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1410677,0.00074122683,0.83909845,0.0016960304,0.000089412926,0.0013798529,0.000052792526,0.00017123949,0.015703287],"genre_scores_gemma":[0.6880594,0.0004087393,0.30393293,0.00041888547,0.00016816496,0.001523686,0.000055525747,0.000059360493,0.0053732917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986317,0.000035131092,0.0005332937,0.00034119925,0.00014638186,0.00031228765],"domain_scores_gemma":[0.9988593,0.0004324323,0.00013236981,0.0004475954,0.00005261514,0.00007570037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036584397,0.00020635132,0.00041435007,0.00029769202,0.00016744102,0.000056350695,0.00024074459,0.00012875586,0.000055469965],"category_scores_gemma":[0.00013697983,0.00018092425,0.000080221624,0.0008257772,0.00014813467,0.00006308732,0.00014843623,0.00018695177,0.000013481078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019079764,0.00027348328,0.00024378824,0.00018022145,0.000028774048,0.0000012330225,0.00029229422,0.0000026300386,0.000041056686,0.99237853,0.0003042847,0.006251764],"study_design_scores_gemma":[0.00070074946,0.000022086466,0.0008182372,0.000050620485,0.000063703206,0.000008095884,0.00075564755,0.010765729,0.00011329628,0.98350966,0.0029792509,0.00021293372],"about_ca_topic_score_codex":0.00005162207,"about_ca_topic_score_gemma":0.000043309257,"teacher_disagreement_score":0.5469917,"about_ca_system_score_codex":0.00004008066,"about_ca_system_score_gemma":0.00004243111,"threshold_uncertainty_score":0.7377877},"labels":[],"label_agreement":null}]}