{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":42,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":42,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"0497af5d4c81","filters":{"venue":"Discrete Mathematics Algorithms and Applications"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Francisco Claude","is_ca":true},{"name":"Gautam K. Das","is_ca":true},{"name":"Reza Dorrigiv","is_ca":true},{"name":"Stéphane Durocher","is_ca":true},{"name":"Robert Fraser","is_ca":true},{"name":"Alejandro López-Ortíz","is_ca":true},{"name":"Bradford G. Nickerson","is_ca":true},{"name":"Alejandro Salinger","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01506356402780207,"gpt":0.2952694722992302,"spread":0.2802059082714282,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004513739,0.00103491,0.001399594,0.001685597,0.0008636358,0.00126581,0.002731557,0.001200163,0.01494664],"category_scores_gemma":[0.002680973,0.0004719442,0.0007458144,0.002814009,0.0006490484,0.002433162,0.002665434,0.001225884,0.004417669],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001216504,"about_ca_system_score_gemma":0.001326139,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003600979,"about_ca_topic_score_gemma":0.004216791,"domain_scores_codex":[0.9989923,0.0001299667,0.00006660481,0.0001971189,0.0004543699,0.0001597108],"domain_scores_gemma":[0.9987943,0.0003522896,0.00009365154,0.0004411562,0.0002368617,0.00008173452],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001070027,0.0004570227,0.0008386936,0.0002915101,0.00005205363,0.0002956433,0.0003068036,0.1202422,0.01812748,0.02334068,0.02128603,0.8136919],"study_design_scores_gemma":[0.0001974881,0.000134929,0.000204722,0.00001535983,0.00001773076,0.000203731,0.00007026067,0.9654571,0.008330769,0.01430105,0.01104203,0.00002480807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03485919,0.0004256975,0.9498417,0.0003631284,0.00006882181,0.0002257334,0.0003491718,0.00572768,0.008138795],"genre_scores_gemma":[0.1621719,0.0001682211,0.8290039,0.0001564209,0.00005190989,0.0003300413,0.001308437,0.0004417876,0.006367477],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01494664,"threshold_uncertainty_score":0.0500015,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Commodity; Mathematics; China; Econometrics; Economics; Mathematical economics; Geography","authors":[{"name":"Bingzi Jin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01301653025397524,"gpt":0.2397788439829875,"spread":0.2267623137290123,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001541487,0.0006615694,0.0004032727,0.001169328,0.0002335109,0.0008697149,0.0005697365,0.0005354536,0.001407027],"category_scores_gemma":[0.004684868,0.0002204941,0.0005518639,0.0007305138,0.0002778632,0.0008632042,0.0004165,0.0008612416,0.0003446879],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001084156,"about_ca_system_score_gemma":0.00129684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.03183252,"about_ca_topic_score_gemma":0.01898874,"domain_scores_codex":[0.9997063,0.00007862349,0.00001925187,0.00008510246,0.00005608988,0.00005453907],"domain_scores_gemma":[0.9988709,0.0005983504,0.0001317622,0.00009250245,0.0002482461,0.00005814721],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001374855,0.0001197323,0.06022234,0.00004015642,0.00008178741,0.000123837,0.00005861684,0.8853414,0.000839307,0.003928493,0.004036879,0.04507004],"study_design_scores_gemma":[0.000003529843,0.000005767707,0.002969971,0.000002788929,0.000003316873,0.00000234306,0.000005396101,0.9961027,0.0001533138,0.0006238354,0.0001239327,0.000003182392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9730272,0.0003650461,0.02087917,0.0007542545,0.00009360116,0.00002433064,0.0009130171,0.0003291921,0.003614167],"genre_scores_gemma":[0.9938805,0.000141882,0.003804866,0.00004467491,0.00002986265,0.00001214556,0.00118085,0.00001702169,0.0008881621],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03183252,"threshold_uncertainty_score":0.06329447,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Chinh T. Vu","is_ca":false},{"name":"Zhipeng Cai","is_ca":true},{"name":"Yingshu Li","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01181489703442622,"gpt":0.241267969559039,"spread":0.2294530725246128,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00145397,0.001108782,0.001249166,0.0009425868,0.000751932,0.001074451,0.002689401,0.001347904,0.001939361],"category_scores_gemma":[0.005868601,0.0004550686,0.0006825039,0.00167567,0.0009851692,0.002212093,0.002104712,0.00160346,0.0003195141],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001103808,"about_ca_system_score_gemma":0.001083729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00214972,"about_ca_topic_score_gemma":0.001663034,"domain_scores_codex":[0.9988245,0.0003524693,0.00006765515,0.0002903106,0.0003150609,0.0001499925],"domain_scores_gemma":[0.9977942,0.001498746,0.0002110709,0.0001922469,0.0002112636,0.00009252601],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001910707,0.0001120513,0.0006005861,0.0001829298,0.0000355098,0.00007224193,0.0002306124,0.8713052,0.002940393,0.03188657,0.002703352,0.08973935],"study_design_scores_gemma":[0.00003921487,0.00004443046,0.00006839266,0.000007352174,0.000007104516,0.00003186277,0.00002164055,0.9884829,0.0004601111,0.01004361,0.0007872154,0.000006147297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01153506,0.0005627382,0.9853799,0.0002376327,0.00004513428,0.00008300752,0.00003546058,0.0002502714,0.001870753],"genre_scores_gemma":[0.5261775,0.001290623,0.4676426,0.0002125293,0.0001912322,0.0006541447,0.0002591431,0.0001263624,0.003445812],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002689401,"threshold_uncertainty_score":0.008008718,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Balasingham Balamohan","is_ca":true},{"name":"Paola Flocchini","is_ca":true},{"name":"Ali Miri","is_ca":true},{"name":"Nicola Santoro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04500272391394888,"gpt":0.2952494002916094,"spread":0.2502466763776605,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002893911,0.001344119,0.001443108,0.001189686,0.001175325,0.001954021,0.002600196,0.001869669,0.005224044],"category_scores_gemma":[0.01135343,0.0006986018,0.001031551,0.001328244,0.00151858,0.004238567,0.002619341,0.001371583,0.00120078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001812453,"about_ca_system_score_gemma":0.002678943,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002562818,"about_ca_topic_score_gemma":0.002916481,"domain_scores_codex":[0.9975804,0.000759244,0.0001560736,0.000492674,0.0004526946,0.0005588388],"domain_scores_gemma":[0.9938307,0.004290299,0.0006943106,0.0006263293,0.0003080378,0.000250389],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008437643,0.0003238825,0.001376987,0.0003827571,0.000110121,0.0001124022,0.0004847606,0.7502657,0.00459397,0.1091497,0.007274622,0.1250813],"study_design_scores_gemma":[0.0001828265,0.0001183267,0.0001740901,0.00002244144,0.00002583055,0.00006228135,0.00007830487,0.9319283,0.001573059,0.06417315,0.001641492,0.00001994833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04349561,0.0007566924,0.9462867,0.0004601462,0.00007247753,0.0002236489,0.0001182981,0.001357125,0.007229374],"genre_scores_gemma":[0.3945627,0.0005749652,0.5986359,0.0002053412,0.0001002276,0.0005453316,0.0003198617,0.0003490112,0.004706678],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005224044,"threshold_uncertainty_score":0.0174762,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"James Nastos","is_ca":true},{"name":"Yong Gao","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03785958332532282,"gpt":0.3017967662122005,"spread":0.2639371828868777,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002055174,0.001067547,0.001356034,0.001509535,0.0009281894,0.001841041,0.003372658,0.001508918,0.006340775],"category_scores_gemma":[0.01453181,0.0007458701,0.001737473,0.002482054,0.001530489,0.005318226,0.003136809,0.003119326,0.00158138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001501388,"about_ca_system_score_gemma":0.002152054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002689166,"about_ca_topic_score_gemma":0.00398401,"domain_scores_codex":[0.997872,0.000612725,0.0001401676,0.000490746,0.0005771272,0.0003072325],"domain_scores_gemma":[0.9923465,0.005195593,0.0003622092,0.001569298,0.000352242,0.0001740111],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000620703,0.0004296467,0.002426459,0.0005191666,0.00009663535,0.000238758,0.0006147542,0.2667276,0.01514455,0.2203427,0.01117689,0.4816621],"study_design_scores_gemma":[0.0001298952,0.00008570014,0.0002250947,0.0000390902,0.00003813649,0.0001322986,0.00006964502,0.7963997,0.005120126,0.1939779,0.003757076,0.00002540746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02159849,0.000233816,0.9733909,0.0002194712,0.00002432611,0.000163704,0.000152616,0.00140599,0.002810681],"genre_scores_gemma":[0.1657634,0.0002693141,0.8291059,0.0002338806,0.00004457734,0.0004448449,0.001054457,0.0007221661,0.002361364],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006340775,"threshold_uncertainty_score":0.02121198,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Stefan Dobrev","is_ca":false},{"name":"Evangelos Kranakis","is_ca":true},{"name":"Danny Kriz̧anc","is_ca":false},{"name":"Jaroslav Opatrny","is_ca":true},{"name":"Oscar Morales Ponce","is_ca":true},{"name":"Ladislav Stacho","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01269048725663137,"gpt":0.2593403503057864,"spread":0.246649863049155,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002276947,0.0008581133,0.0008065181,0.0009157477,0.0008243588,0.001742883,0.001603001,0.001092601,0.002214026],"category_scores_gemma":[0.01771159,0.0007817944,0.0008663793,0.00131052,0.002674754,0.00505922,0.002660859,0.001810642,0.000405153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001122702,"about_ca_system_score_gemma":0.0008771168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007216244,"about_ca_topic_score_gemma":0.001045771,"domain_scores_codex":[0.9977506,0.0009180919,0.0001377307,0.000443705,0.0004904795,0.0002593848],"domain_scores_gemma":[0.9860244,0.01058574,0.001363651,0.0009404753,0.0006317115,0.0004539978],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004590319,0.00009810446,0.002831638,0.0005488363,0.00007986888,0.0004769473,0.0004581365,0.7121241,0.009244759,0.2376709,0.002400933,0.03360674],"study_design_scores_gemma":[0.00005998764,0.0002567727,0.0005471498,0.000057898,0.00004093084,0.0003002098,0.0001826275,0.8719175,0.002332739,0.1210685,0.003211777,0.00002402222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07553751,0.000598656,0.9165393,0.0008432083,0.00005402009,0.0001718924,0.0001305882,0.0003412309,0.005783699],"genre_scores_gemma":[0.7990132,0.001329608,0.1953773,0.0002814569,0.0001096272,0.0005041843,0.0002969002,0.00009756486,0.002990068],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002276947,"threshold_uncertainty_score":0.01204175,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Reihaneh Safavi–Naini","is_ca":true},{"name":"Peter Nickolas","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02708206846653067,"gpt":0.2692125488899711,"spread":0.2421304804234405,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002413674,0.0006073212,0.00120585,0.0008036438,0.001029306,0.001297724,0.001576381,0.001800758,0.001508064],"category_scores_gemma":[0.009105137,0.0004676077,0.0009407677,0.0009129381,0.001760852,0.003862435,0.003373015,0.001909423,0.0006916522],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008302986,"about_ca_system_score_gemma":0.001030978,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004407514,"about_ca_topic_score_gemma":0.0002216737,"domain_scores_codex":[0.9958626,0.0009779045,0.0003870877,0.000631669,0.00161508,0.0005255677],"domain_scores_gemma":[0.9925733,0.001896848,0.0009403827,0.003689582,0.0007324141,0.0001674179],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001608826,0.0002112307,0.00425295,0.0004240439,0.0002666954,0.001507074,0.00169458,0.1135401,0.1983247,0.402968,0.002581497,0.2726203],"study_design_scores_gemma":[0.0002450733,0.00107302,0.001777785,0.00008392823,0.0002312209,0.002798439,0.0003120502,0.6551516,0.1613287,0.1549183,0.021848,0.0002318102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1565311,0.0003255817,0.8393486,0.0004260251,0.0001438344,0.0001097404,0.00006304224,0.0006189761,0.002433032],"genre_scores_gemma":[0.7882645,0.0002160507,0.2076956,0.0001564968,0.00008608042,0.0001024438,0.0001113137,0.00005681977,0.003310708],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002413674,"threshold_uncertainty_score":0.01276487,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Gianluca De Marco","is_ca":false},{"name":"Evangelos Kranakis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03332369886006615,"gpt":0.2834356569589292,"spread":0.2501119580988631,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006763393,0.001466877,0.003862846,0.001344438,0.001538891,0.004053579,0.004409977,0.002805131,0.002611253],"category_scores_gemma":[0.03880521,0.0009056958,0.001778199,0.001866132,0.001824946,0.008809676,0.004738739,0.001798991,0.001321752],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000958863,"about_ca_system_score_gemma":0.001815422,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001272099,"about_ca_topic_score_gemma":0.001101436,"domain_scores_codex":[0.990918,0.002961915,0.001131698,0.001885878,0.001920989,0.001181543],"domain_scores_gemma":[0.9619114,0.02721594,0.002637789,0.00525918,0.00228044,0.0006952702],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.006139163,0.0009278709,0.02483485,0.001081685,0.0007068901,0.001310018,0.002307646,0.3847174,0.0410908,0.06266193,0.008818546,0.4654032],"study_design_scores_gemma":[0.0001913529,0.0004316606,0.0008098331,0.00003995771,0.0001312931,0.0004753966,0.0005689801,0.8767795,0.02235466,0.09625103,0.001891702,0.00007468258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2117399,0.0007504116,0.7804807,0.001203651,0.00009234063,0.0002340619,0.0003676054,0.00315992,0.00197135],"genre_scores_gemma":[0.716962,0.0001915223,0.2795125,0.0004449927,0.0001189473,0.0001923724,0.0007181276,0.0003765845,0.001482916],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006763393,"threshold_uncertainty_score":0.03576869,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Evangelos Kranakis","is_ca":true},{"name":"Danny Kriz̧anc","is_ca":false},{"name":"Oscar Morales Ponce","is_ca":true},{"name":"Ladislav Stacho","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02056900812021606,"gpt":0.2729444623559385,"spread":0.2523754542357224,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003023556,0.0008817834,0.0004945516,0.0006025069,0.0005633926,0.0007616658,0.001363106,0.0006472816,0.002438362],"category_scores_gemma":[0.003727071,0.0005148218,0.0006245748,0.0009086719,0.0008904791,0.002209737,0.001861724,0.00112538,0.0005985886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005421232,"about_ca_system_score_gemma":0.0004096914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006094687,"about_ca_topic_score_gemma":0.0008146166,"domain_scores_codex":[0.9991873,0.0002077977,0.00005302838,0.0001610781,0.0002929828,0.00009780219],"domain_scores_gemma":[0.9973754,0.001038497,0.0006383715,0.0005032358,0.0002704126,0.0001741589],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000840119,0.0002490758,0.003839107,0.0006192407,0.00007321204,0.001186296,0.0004131109,0.6102995,0.1020822,0.1362714,0.004248912,0.1398779],"study_design_scores_gemma":[0.0001259137,0.0008579824,0.003395884,0.00009677618,0.0001121525,0.001714978,0.0003114258,0.7181242,0.04969814,0.1925045,0.03298301,0.00007518242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4069259,0.0004721304,0.5637405,0.0007511372,0.00006917308,0.000377043,0.0008464977,0.001486211,0.02533147],"genre_scores_gemma":[0.6943868,0.0005732258,0.2981934,0.0001642068,0.00006142925,0.0003490066,0.001213671,0.0001376233,0.004920798],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002438362,"threshold_uncertainty_score":0.008157134,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Andreas Wiese","is_ca":false},{"name":"Evangelos Kranakis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01329141970587319,"gpt":0.2560789226968948,"spread":0.2427875029910216,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003518511,0.0005534273,0.0007004638,0.0006069663,0.0005808405,0.0007321788,0.001206791,0.0005574732,0.003659414],"category_scores_gemma":[0.002287226,0.0003528457,0.0004684133,0.0009226763,0.0006599938,0.001571182,0.00168673,0.000679495,0.0007579896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005639395,"about_ca_system_score_gemma":0.0004179384,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008957838,"about_ca_topic_score_gemma":0.001479894,"domain_scores_codex":[0.9995058,0.0001274038,0.0000269728,0.0001365831,0.0001007241,0.0001026153],"domain_scores_gemma":[0.9987407,0.0003388331,0.0001734327,0.0004643138,0.0001459499,0.0001367243],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007396867,0.0003550604,0.006816812,0.0005378785,0.00009591853,0.0006156586,0.0008315077,0.5287324,0.07550014,0.1001631,0.004400526,0.2812114],"study_design_scores_gemma":[0.00005280264,0.0002915456,0.001354647,0.00004148346,0.00003170992,0.000372633,0.0003829222,0.8817785,0.04174358,0.06863135,0.005287911,0.00003086867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2875836,0.0002234634,0.7059284,0.0001000382,0.00002942435,0.0001231622,0.0001676123,0.001124476,0.004719872],"genre_scores_gemma":[0.6433049,0.0001830655,0.3516133,0.00004807702,0.00002283259,0.0001805339,0.0006807167,0.0001890367,0.003777519],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003659414,"threshold_uncertainty_score":0.01224202,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Eddie Cheng","is_ca":false},{"name":"Ke Qiu","is_ca":true},{"name":"Zhizhang Shen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01100409671084664,"gpt":0.2565698859081638,"spread":0.2455657891973171,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006181216,0.0006055759,0.0006789817,0.001898838,0.0007828041,0.00122851,0.0009359734,0.0006540013,0.003383053],"category_scores_gemma":[0.004404922,0.0002434593,0.0003909291,0.001854041,0.001095637,0.003711542,0.0007795384,0.0005295015,0.0005375497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005678512,"about_ca_system_score_gemma":0.0005391866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005675617,"about_ca_topic_score_gemma":0.001004277,"domain_scores_codex":[0.9992369,0.000154058,0.0001020049,0.000241537,0.0001646633,0.0001008452],"domain_scores_gemma":[0.9964194,0.001772755,0.0007134748,0.0003130775,0.0004453592,0.0003359373],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001157343,0.0002035249,0.02153069,0.00131356,0.0002756588,0.0005901671,0.0008269018,0.1653578,0.05508104,0.5389595,0.01161537,0.2030886],"study_design_scores_gemma":[0.00005553447,0.0003675219,0.007374339,0.0000910013,0.0001112943,0.001554397,0.0005075494,0.2884995,0.01969409,0.6637416,0.0178895,0.0001136757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6112514,0.0009657565,0.3712757,0.0007139429,0.0001948018,0.00008033972,0.002328247,0.0003062354,0.01288357],"genre_scores_gemma":[0.7569612,0.0009267341,0.2328957,0.00008532911,0.0001249089,0.000139152,0.001941417,0.0001306415,0.006794978],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003383053,"threshold_uncertainty_score":0.01131737,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Reihaneh Safavi–Naini","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02397353003186539,"gpt":0.2403646152375851,"spread":0.2163910852057197,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000981595,0.0003045924,0.0005157205,0.0007224955,0.000476612,0.0008162537,0.0005041632,0.0007230889,0.001563522],"category_scores_gemma":[0.003977629,0.0001754464,0.0005012235,0.0007747887,0.002821115,0.002581819,0.001469824,0.0008789829,0.0003199583],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008517644,"about_ca_system_score_gemma":0.0005324549,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000991957,"about_ca_topic_score_gemma":0.0004131559,"domain_scores_codex":[0.9988054,0.0003440747,0.00007120203,0.0002101412,0.0004364312,0.0001328452],"domain_scores_gemma":[0.9983376,0.0006323454,0.0002270792,0.0005043226,0.0002455354,0.00005305226],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001328,0.0000179715,0.0005758994,0.00009294075,0.00003220068,0.0001167701,0.0002190985,0.06289229,0.006016898,0.8844264,0.0005640569,0.04491281],"study_design_scores_gemma":[0.00002254296,0.0001388562,0.0005602335,0.00002512965,0.00002057189,0.0002858523,0.00008795099,0.4065541,0.00561953,0.5820096,0.004629274,0.00004629982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06746212,0.001026375,0.9253352,0.0003469427,0.00008001053,0.00003484651,0.00005267967,0.0001427172,0.005519077],"genre_scores_gemma":[0.9324601,0.0006748408,0.06284318,0.00011631,0.000138309,0.00004646841,0.00005918744,0.00001832194,0.003643325],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001563522,"threshold_uncertainty_score":0.006180048,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Geology","authors":[{"name":"Dragomir Ž. Ðoković","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01773718719294016,"gpt":0.2653631227996698,"spread":0.2476259356067296,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000977085,0.0005122332,0.0005983659,0.003893491,0.001595389,0.002337523,0.000833513,0.0009670643,0.006182035],"category_scores_gemma":[0.004965368,0.0002269137,0.000422245,0.001781361,0.002197985,0.004361177,0.002230159,0.001732741,0.001333982],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009516018,"about_ca_system_score_gemma":0.0005367758,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004073113,"about_ca_topic_score_gemma":0.0002659068,"domain_scores_codex":[0.9987242,0.0001911903,0.0001197064,0.000270635,0.000465114,0.0002291655],"domain_scores_gemma":[0.9970102,0.0006228197,0.0004378422,0.000317961,0.0009741178,0.0006370451],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002184069,0.0001047459,0.005851789,0.00009035539,0.000008672301,0.0001984331,0.0006322612,0.002175106,0.007964359,0.9257367,0.002511516,0.05450775],"study_design_scores_gemma":[0.00002570089,0.0001453643,0.003066448,0.00008062415,0.00001148528,0.0009865611,0.0004533859,0.02108196,0.005487249,0.9434986,0.02511548,0.00004725374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7606328,0.001152846,0.1720756,0.000891335,0.0005249146,0.0001522657,0.0009099662,0.0003741634,0.06328607],"genre_scores_gemma":[0.9220723,0.001017448,0.05071235,0.0003353794,0.0004693676,0.0001684837,0.002553835,0.0001412796,0.02252954],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006182035,"threshold_uncertainty_score":0.02068102,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Combinatorics; Quadrilateral; Mathematics; Graph; Discrete mathematics","authors":[{"name":"Asish Mukhopadhyay","is_ca":true},{"name":"S. Venugopal Rao","is_ca":false},{"name":"Sidharth Pardeshi","is_ca":false},{"name":"Srinivas Gundlapalli","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01998284194362755,"gpt":0.2993882921270793,"spread":0.2794054501834518,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002665439,0.0005796438,0.0004795275,0.001649584,0.0008584432,0.00130648,0.001324943,0.0005946729,0.00707345],"category_scores_gemma":[0.002948911,0.0008053458,0.0007433553,0.001447352,0.001415732,0.001894504,0.001619021,0.0009946717,0.001621074],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001047403,"about_ca_system_score_gemma":0.0004881165,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002341952,"about_ca_topic_score_gemma":0.002906866,"domain_scores_codex":[0.9993231,0.0001110519,0.00004789699,0.0001915799,0.0001963997,0.0001298649],"domain_scores_gemma":[0.9984187,0.0003597703,0.0004065527,0.0003212256,0.0002826823,0.0002110743],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004683418,0.0001375467,0.00525745,0.0004957712,0.00005969422,0.0008591932,0.001432652,0.1712084,0.04244348,0.5992364,0.005673421,0.1727276],"study_design_scores_gemma":[0.00007398393,0.0002090594,0.002038283,0.00007408475,0.00004470002,0.0004607172,0.0006161931,0.2405585,0.02339258,0.7169006,0.01554065,0.00009075592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3530261,0.0003449953,0.6280559,0.000206615,0.00007950947,0.0001804931,0.0009331357,0.001456093,0.01571719],"genre_scores_gemma":[0.7155209,0.0003503181,0.2690646,0.0001218907,0.00004633833,0.0002387725,0.002155955,0.0005153764,0.01198578],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00707345,"threshold_uncertainty_score":0.0236631,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Wei Ding","is_ca":false},{"name":"Guohui Lin","is_ca":true},{"name":"Guoliang Xue","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03432157415003299,"gpt":0.2854218560093663,"spread":0.2511002818593333,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004085815,0.0006516814,0.0008545695,0.0006774548,0.000608784,0.0009969705,0.001333068,0.0008883189,0.003920335],"category_scores_gemma":[0.003152581,0.0005845281,0.0006324403,0.00156488,0.0003551666,0.002197125,0.001342923,0.000608654,0.000644753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006620465,"about_ca_system_score_gemma":0.0006062066,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009288329,"about_ca_topic_score_gemma":0.001530722,"domain_scores_codex":[0.9995489,0.0001037748,0.00003401357,0.0001262847,0.0001201148,0.0000670478],"domain_scores_gemma":[0.9991834,0.00032295,0.0001518878,0.0001654971,0.0000978981,0.00007845806],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006053853,0.0001106623,0.00196017,0.000652555,0.0001140393,0.000529323,0.0003209034,0.6480113,0.02624366,0.1550345,0.01536623,0.1510513],"study_design_scores_gemma":[0.00007053762,0.000167906,0.001033146,0.00007029345,0.00004539404,0.0006000488,0.0001545257,0.7753725,0.005434002,0.2038975,0.01312428,0.00002980587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.116342,0.0008062556,0.8686553,0.0004441048,0.00007544574,0.0001812274,0.001696476,0.0004966495,0.01130258],"genre_scores_gemma":[0.5101765,0.001144424,0.4790427,0.0001455343,0.00007250812,0.0002315161,0.002722628,0.0002164253,0.006247743],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003920335,"threshold_uncertainty_score":0.01311487,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Danjun Huang","is_ca":false},{"name":"Xiaoxiu Zhang","is_ca":false},{"name":"Weifan Wang","is_ca":false},{"name":"Stephen Finbow","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0272746977448408,"gpt":0.2564915264794571,"spread":0.2292168287346163,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002604058,0.0004642816,0.0004199042,0.000917036,0.0009529077,0.001183772,0.0008066707,0.0004631454,0.004829662],"category_scores_gemma":[0.002098039,0.0003284753,0.0005431623,0.001389464,0.001037732,0.001694214,0.001125516,0.001129383,0.0005432923],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001244406,"about_ca_system_score_gemma":0.0008338733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001958558,"about_ca_topic_score_gemma":0.002600627,"domain_scores_codex":[0.9995116,0.00006268152,0.00002771285,0.000140939,0.0001222893,0.0001347311],"domain_scores_gemma":[0.9985959,0.0005204965,0.0002841646,0.0002669864,0.000208937,0.0001235373],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003873996,0.0001940589,0.005976673,0.0004681531,0.00004922097,0.0004412911,0.0006026008,0.04859324,0.04983922,0.7787901,0.006884795,0.1077733],"study_design_scores_gemma":[0.00007698448,0.0002284073,0.006270496,0.00006229336,0.0001016187,0.000968657,0.0005040388,0.1495937,0.03509403,0.7732511,0.03375186,0.00009692138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.710759,0.0005925861,0.2194996,0.0005431104,0.00009919975,0.0001767644,0.001017341,0.0007347758,0.06657764],"genre_scores_gemma":[0.911184,0.00045817,0.08111315,0.0002041738,0.00004386767,0.0001119618,0.001097303,0.0001394495,0.005647992],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004829662,"threshold_uncertainty_score":0.01615685,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Huda Chuangpishit","is_ca":true},{"name":"Jurek Czyzowicz","is_ca":true},{"name":"Ryan Killick","is_ca":true},{"name":"Evangelos Kranakis","is_ca":true},{"name":"Danny Kriz̧anc","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02490822150995882,"gpt":0.2950486309745702,"spread":0.2701404094646114,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001021423,0.001345154,0.001663927,0.0008091431,0.001856616,0.001256909,0.002610478,0.001896597,0.002414732],"category_scores_gemma":[0.004422347,0.0005747799,0.0009494826,0.001008223,0.002051094,0.002025356,0.002179256,0.001122564,0.0005497804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001867355,"about_ca_system_score_gemma":0.001527973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01269465,"about_ca_topic_score_gemma":0.00911046,"domain_scores_codex":[0.9988683,0.0001988571,0.00005320437,0.000349167,0.0002101799,0.0003202731],"domain_scores_gemma":[0.9970396,0.001745239,0.0003467289,0.0003956884,0.0002312483,0.0002414538],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008595042,0.0001337961,0.001234366,0.0001570149,0.00009665587,0.0003507576,0.000421901,0.9084147,0.01266691,0.0219745,0.002198095,0.05149196],"study_design_scores_gemma":[0.00007773795,0.0001416735,0.0002646911,0.00001174263,0.00002145885,0.000173407,0.0001406598,0.9788297,0.006350521,0.0123541,0.001606877,0.00002748343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2208568,0.0006629017,0.767189,0.0004306034,0.00006954863,0.0002137636,0.0001634695,0.001963853,0.008450042],"genre_scores_gemma":[0.7894036,0.0002169939,0.2050511,0.0000862507,0.00002243517,0.0001314464,0.0002994793,0.0001807183,0.004607963],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01269465,"threshold_uncertainty_score":0.02524155,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Md. Zamilur Rahman","is_ca":true},{"name":"Asish Mukhopadhyay","is_ca":true},{"name":"Y.P. Aneja","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04423433465103242,"gpt":0.367542594786597,"spread":0.3233082601355645,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008524931,0.0009093271,0.0008808941,0.001702512,0.001073535,0.001540205,0.002628379,0.0009110282,0.01151941],"category_scores_gemma":[0.00448041,0.0007735094,0.001241203,0.002578392,0.001100874,0.003827633,0.003220651,0.001513693,0.005306154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000898182,"about_ca_system_score_gemma":0.001424028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009456046,"about_ca_topic_score_gemma":0.001600571,"domain_scores_codex":[0.998429,0.0002215787,0.0001475329,0.0003854207,0.0006738408,0.0001426301],"domain_scores_gemma":[0.9964204,0.0008955381,0.0002631908,0.001665382,0.0005853601,0.0001700774],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009406166,0.000326131,0.001889134,0.0008776027,0.0001049569,0.0003933542,0.0007068312,0.02552395,0.09623633,0.1374495,0.02120524,0.7143463],"study_design_scores_gemma":[0.0004381847,0.0007533735,0.0009136743,0.0001070028,0.0001293919,0.001046263,0.000461965,0.4346751,0.209051,0.2459593,0.1062382,0.0002266115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01152111,0.0000915701,0.9785366,0.000129973,0.00005959916,0.0002197545,0.0005181559,0.005328805,0.003594361],"genre_scores_gemma":[0.08406052,0.00009508304,0.9078931,0.0001035646,0.00003053725,0.0002963997,0.001756803,0.001057504,0.00470649],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01151941,"threshold_uncertainty_score":0.03853625,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Mohammad M. Karbasioun","is_ca":true},{"name":"Gennady Shaikhet","is_ca":true},{"name":"Ioannis Lambadaris","is_ca":true},{"name":"Evangelos Kranakis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01526204110658818,"gpt":0.2729520866695129,"spread":0.2576900455629247,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001536413,0.0006936167,0.001310543,0.0003916854,0.00031965,0.0007262702,0.0007774897,0.0008196661,0.001736539],"category_scores_gemma":[0.006727188,0.0005869587,0.0004160239,0.000770131,0.0008378121,0.001279471,0.0005898831,0.0008789817,0.0001686285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001480828,"about_ca_system_score_gemma":0.0009683011,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004512555,"about_ca_topic_score_gemma":0.002832355,"domain_scores_codex":[0.9993098,0.0002787859,0.00003312972,0.0001088224,0.0001039172,0.0001656609],"domain_scores_gemma":[0.9959689,0.003042344,0.0004741246,0.0001371225,0.0001973318,0.0001802246],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001371811,0.00003625353,0.0004022922,0.00005420162,0.00001565567,0.00004404724,0.00002197749,0.9855852,0.000765687,0.009086794,0.0004469072,0.003403834],"study_design_scores_gemma":[0.00001350387,0.00002192495,0.00009967351,0.000002092847,0.000003108413,0.000006901684,0.000009114055,0.9938877,0.0001514782,0.005711432,0.00009052591,0.00000247682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3185017,0.0009336455,0.6731114,0.001221801,0.0001056203,0.00008157054,0.0002768753,0.0003930425,0.005374355],"genre_scores_gemma":[0.9717197,0.0003196271,0.02591307,0.0000980193,0.00004659694,0.00005594887,0.0001218189,0.0000670405,0.001658214],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004512555,"threshold_uncertainty_score":0.01074421,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Finite field; Mathematics; Liquid-crystal display; Discrete mathematics; Combinatorics; Computer science; Operating system","authors":[{"name":"Nouara Zoubir","is_ca":false},{"name":"Kenza Guenda","is_ca":false},{"name":"Padmapani Seneviratne","is_ca":false},{"name":"T. Aaron Gulliver","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01298768042965274,"gpt":0.2692800756832095,"spread":0.2562923952535567,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003842891,0.0003262952,0.0003453324,0.001106211,0.0008270981,0.0009339739,0.0004746228,0.0005515211,0.003323808],"category_scores_gemma":[0.002572986,0.0002024373,0.0003561012,0.001039477,0.001425816,0.001267554,0.001576665,0.001039755,0.0006666092],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001170362,"about_ca_system_score_gemma":0.000819906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006704221,"about_ca_topic_score_gemma":0.000596573,"domain_scores_codex":[0.9993227,0.0001118833,0.00004308534,0.0001448692,0.0002503918,0.0001270309],"domain_scores_gemma":[0.9983091,0.0005776444,0.0002230282,0.000458633,0.0002944163,0.0001370939],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009024884,0.00002908143,0.0009805406,0.0001469893,0.0000111714,0.0002600871,0.0003151091,0.008569929,0.01336979,0.9305596,0.001348901,0.04431843],"study_design_scores_gemma":[0.00004931804,0.00008646346,0.0006955692,0.00009697505,0.00001996588,0.001285658,0.0001521319,0.0793724,0.02529221,0.8599499,0.03294478,0.00005473789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3781623,0.002264739,0.5486658,0.00129322,0.0003126651,0.0001578117,0.0005559334,0.0009142099,0.06767333],"genre_scores_gemma":[0.9166349,0.0008837947,0.07273462,0.0003041454,0.0001695878,0.0001333014,0.0002911887,0.0000899854,0.008758392],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003323808,"threshold_uncertainty_score":0.01111931,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Gupta Rk","is_ca":true},{"name":"Bala Shetty","is_ca":false},{"name":"V. Lokesha","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05179355761883672,"gpt":0.3071338804084807,"spread":0.2553403227896439,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001098707,0.0003969746,0.0003558254,0.001109985,0.0008681576,0.0006906896,0.0005494928,0.0003915878,0.004426249],"category_scores_gemma":[0.0005284341,0.0001403932,0.000290395,0.0005274747,0.0008348115,0.001255246,0.0006533067,0.0005979633,0.000638633],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000345485,"about_ca_system_score_gemma":0.0002275563,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006489278,"about_ca_topic_score_gemma":0.0006820952,"domain_scores_codex":[0.999793,0.00004947889,0.000005785355,0.00006649914,0.00005171062,0.00003352766],"domain_scores_gemma":[0.9996098,0.000102441,0.00008800265,0.0000380042,0.00007789668,0.00008381342],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007967099,0.00003454523,0.0007872783,0.0001285611,0.00001655268,0.0005026765,0.0004014304,0.004063624,0.01175758,0.9684092,0.002264823,0.01155418],"study_design_scores_gemma":[0.00002514212,0.0001029211,0.001131346,0.00002792232,0.00001879256,0.0007565732,0.0002786403,0.03178082,0.004877179,0.9515986,0.009365741,0.00003642251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8083439,0.001106336,0.1403448,0.0008991659,0.0003142388,0.00005777254,0.0003893695,0.0004530527,0.04809121],"genre_scores_gemma":[0.9594806,0.0007380467,0.02624469,0.0003247196,0.0002065967,0.00005424182,0.0004530542,0.0001217786,0.01237626],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004426249,"threshold_uncertainty_score":0.01480722,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Yi Shi","is_ca":true},{"name":"Maryam Hasan","is_ca":true},{"name":"Zhipeng Cai","is_ca":false},{"name":"Guohui Lin","is_ca":true},{"name":"Dale Schuurmans","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02738209962784016,"gpt":0.3062128468123452,"spread":0.2788307471845051,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00391541,0.001025324,0.001701324,0.002679303,0.001209413,0.001671007,0.003588346,0.001651419,0.002348108],"category_scores_gemma":[0.009926919,0.001032305,0.001422818,0.004415028,0.001659216,0.002196451,0.003590614,0.001736625,0.001691266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001004689,"about_ca_system_score_gemma":0.001836381,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002982789,"about_ca_topic_score_gemma":0.004113631,"domain_scores_codex":[0.9960151,0.001568862,0.000193816,0.0007103184,0.001316648,0.0001952488],"domain_scores_gemma":[0.9957425,0.001945208,0.0003338885,0.0008208555,0.001018609,0.0001388897],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006366528,0.0002244035,0.003715965,0.0004543981,0.0004663118,0.0001360027,0.0007243669,0.3579844,0.0423861,0.08811452,0.006360472,0.4987964],"study_design_scores_gemma":[0.00004013068,0.00005839358,0.0004869541,0.00001092876,0.00002418073,0.00005357526,0.00003800881,0.9712151,0.007539106,0.01852699,0.001963854,0.0000427453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002378162,0.00006895948,0.9970202,0.00004164347,0.000007654977,0.00002321068,0.00002553453,0.0002461192,0.0001885013],"genre_scores_gemma":[0.04290905,0.00009125221,0.9554218,0.0001222707,0.00002254037,0.0002595501,0.0003077613,0.0001374637,0.0007283085],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00391541,"threshold_uncertainty_score":0.02070695,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Mathilde Bouvel","is_ca":false},{"name":"Cédric Chauve","is_ca":true},{"name":"Marni Mishna","is_ca":true},{"name":"Dominique Rossin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01799824759812478,"gpt":0.2727716805417889,"spread":0.2547734329436641,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007749107,0.001269571,0.002375567,0.00236683,0.001510638,0.004688032,0.004306285,0.002413527,0.01143963],"category_scores_gemma":[0.05023734,0.0009289985,0.001682518,0.00306447,0.003087861,0.0101347,0.002393885,0.002903361,0.001270176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002843544,"about_ca_system_score_gemma":0.001930087,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00251474,"about_ca_topic_score_gemma":0.00158916,"domain_scores_codex":[0.9948747,0.001256642,0.0002943364,0.001066963,0.001310356,0.001196927],"domain_scores_gemma":[0.9600905,0.02762781,0.003509037,0.004167452,0.002627488,0.00197776],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005845347,0.0001982558,0.005315757,0.0002490304,0.0001319657,0.0006166186,0.0002232418,0.3908381,0.003869474,0.5727582,0.00550521,0.01970961],"study_design_scores_gemma":[0.00003498686,0.00007549454,0.0005902916,0.00001969211,0.00003503176,0.0002655695,0.00006872834,0.7204428,0.0011911,0.2759461,0.001294291,0.00003589167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3111788,0.00254222,0.6473604,0.0021532,0.0001851091,0.0001630955,0.001472927,0.001096838,0.03384741],"genre_scores_gemma":[0.9494786,0.00117088,0.0398783,0.0004042549,0.0003263896,0.0001575733,0.0008353111,0.0003216596,0.007427091],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01143963,"threshold_uncertainty_score":0.04098171,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","authors":[{"name":"Jurek Czyzowicz","is_ca":true},{"name":"Stefan Dobrev","is_ca":false},{"name":"Evangelos Kranakis","is_ca":true},{"name":"Eduardo Pacheco","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02190954584372441,"gpt":0.2733032141721305,"spread":0.2513936683284062,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002770242,0.0005159776,0.0005731346,0.0005118491,0.0008879314,0.0006605104,0.0008012787,0.0004711939,0.001643113],"category_scores_gemma":[0.001764311,0.0003088267,0.0004313872,0.0003214102,0.00148213,0.0009991184,0.001807264,0.0005623464,0.0001858563],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004644418,"about_ca_system_score_gemma":0.0002942819,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002294497,"about_ca_topic_score_gemma":0.0009732789,"domain_scores_codex":[0.9996934,0.00003443775,0.0000175965,0.00007182277,0.00009393827,0.0000888442],"domain_scores_gemma":[0.9991074,0.0002312177,0.0002292115,0.00013941,0.0001256584,0.0001671332],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001105731,0.0001539632,0.03341104,0.0006469032,0.0001857108,0.003890065,0.001827267,0.6614707,0.09246599,0.1239876,0.002983262,0.07787179],"study_design_scores_gemma":[0.00005002124,0.0006800896,0.01000222,0.00008163691,0.00007434756,0.001255926,0.0009551971,0.8677709,0.0251405,0.0851175,0.008803247,0.000068416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.919101,0.0006773448,0.07170769,0.0002187882,0.00004332062,0.00003595689,0.00009975689,0.0002008866,0.007915181],"genre_scores_gemma":[0.9929923,0.0002249961,0.00450807,0.00003392138,0.00000935874,0.00003983024,0.0001679547,0.00001770949,0.002005981],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002294497,"threshold_uncertainty_score":0.0054968,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Sylvain Lazard","is_ca":false},{"name":"Christophe Weibel","is_ca":true},{"name":"Sue Whitesides","is_ca":true},{"name":"Linqiao Zhang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00903917616466114,"gpt":0.2646601547034648,"spread":0.2556209785388037,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007197655,0.0006061768,0.001140551,0.001028453,0.0006550952,0.001729841,0.001802418,0.00108495,0.006362284],"category_scores_gemma":[0.006132291,0.000695258,0.001167756,0.001697793,0.001032945,0.003522858,0.003722331,0.001238911,0.001872416],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004515088,"about_ca_system_score_gemma":0.001207917,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001232157,"about_ca_topic_score_gemma":0.001605352,"domain_scores_codex":[0.9987507,0.0001402695,0.0001213061,0.0002516295,0.0006296353,0.0001065025],"domain_scores_gemma":[0.9962223,0.0006816713,0.0002036722,0.002324712,0.0004473173,0.0001203299],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001019091,0.0003760194,0.005481349,0.0008704917,0.0001144692,0.0005414457,0.0005599618,0.1466887,0.1049535,0.139748,0.03701567,0.5626314],"study_design_scores_gemma":[0.000211581,0.0004031143,0.001885568,0.0001181572,0.00006518343,0.001018585,0.0001912806,0.7553195,0.06842386,0.1247134,0.04754964,0.0001001133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04951922,0.0002493816,0.9285852,0.0003785147,0.000074392,0.0001978334,0.005039471,0.0106688,0.005287128],"genre_scores_gemma":[0.4098468,0.0002740933,0.5726739,0.0001473723,0.00004384256,0.0003051798,0.01286352,0.0009804668,0.002864814],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006362284,"threshold_uncertainty_score":0.02128398,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Babak Miraftab","is_ca":true},{"name":"Konstantinos S. Stavropoulos","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02290419757695057,"gpt":0.3173159408806792,"spread":0.2944117433037287,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001938899,0.0002139067,0.0002443961,0.0005611412,0.0005508833,0.0009903173,0.0003649756,0.0002967137,0.003313448],"category_scores_gemma":[0.0007494646,0.0001842067,0.0002659989,0.0005057346,0.001452912,0.001215859,0.0008892472,0.0004806293,0.0003155431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006259182,"about_ca_system_score_gemma":0.000327114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001565607,"about_ca_topic_score_gemma":0.001605164,"domain_scores_codex":[0.9997728,0.00005183123,0.00001329941,0.00006090832,0.00005542361,0.00004560535],"domain_scores_gemma":[0.9996525,0.0001157621,0.00006233915,0.0000528009,0.00005218127,0.00006442322],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002382937,0.000008546711,0.000375075,0.00002872771,0.000004939268,0.000120403,0.0002682746,0.00144376,0.001973397,0.9904584,0.0005522826,0.004742441],"study_design_scores_gemma":[0.00002248517,0.0000237282,0.0003120631,0.00000650595,0.000004646752,0.00008281285,0.0001289074,0.006526875,0.0008205595,0.9884548,0.00360935,0.000007299164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8461927,0.0009603245,0.09479447,0.001021465,0.0001354199,0.00005933127,0.0002111403,0.0001805555,0.05644472],"genre_scores_gemma":[0.9820573,0.0003524978,0.009237397,0.0001128953,0.00006171245,0.00004235521,0.0001131213,0.00001795024,0.008004745],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003313448,"threshold_uncertainty_score":0.01108462,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Reihaneh Safavi–Naini","is_ca":true},{"name":"Peter Wild","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01766604716944332,"gpt":0.239202052924283,"spread":0.2215360057548397,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01278035,0.001505445,0.001624472,0.001670043,0.002368491,0.005044519,0.002877938,0.004030014,0.004264017],"category_scores_gemma":[0.04947172,0.0008256229,0.0019038,0.001852611,0.01714345,0.02446168,0.006836043,0.007080507,0.0006534421],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003964119,"about_ca_system_score_gemma":0.003007644,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002185437,"about_ca_topic_score_gemma":0.001059229,"domain_scores_codex":[0.9818413,0.01028765,0.000662934,0.001394812,0.003449954,0.002363204],"domain_scores_gemma":[0.9122926,0.07547849,0.003245551,0.005028298,0.0026121,0.001342979],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001656787,0.00004041731,0.0003722904,0.00005136429,0.00001646808,0.0001028737,0.00030484,0.02091948,0.0006384905,0.9715066,0.000663513,0.005217971],"study_design_scores_gemma":[0.0000512469,0.00009986916,0.0001084756,0.00003440232,0.00002436296,0.00009088076,0.00008033472,0.1933782,0.0009035714,0.8039253,0.001269171,0.00003427069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1199331,0.001332682,0.8372766,0.007193133,0.0002763551,0.0002205513,0.0001650429,0.0003146256,0.03328789],"genre_scores_gemma":[0.9515911,0.0009313225,0.04090109,0.0008764582,0.0004044603,0.0001794965,0.0000728745,0.0001098199,0.004933374],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01278035,"threshold_uncertainty_score":0.06758976,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Saieed Akbari","is_ca":false},{"name":"M. Chavooshi","is_ca":false},{"name":"M. Ghanbari","is_ca":false},{"name":"S. Taghian","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01719858553165622,"gpt":0.3070740244792048,"spread":0.2898754389475486,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003153903,0.0002693009,0.0002443162,0.001156962,0.001073881,0.001250046,0.0003928858,0.0003953938,0.006789543],"category_scores_gemma":[0.001281203,0.0002167779,0.0003291022,0.001216248,0.001233048,0.001330902,0.0004827057,0.0007014655,0.0004221522],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001534537,"about_ca_system_score_gemma":0.0009590795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002456996,"about_ca_topic_score_gemma":0.002580093,"domain_scores_codex":[0.9996506,0.00005865287,0.00001393619,0.00009521154,0.000104118,0.00007748872],"domain_scores_gemma":[0.999,0.0004149088,0.0001128234,0.00009809358,0.0002244367,0.0001497918],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002656732,0.00006959218,0.003785379,0.000185139,0.00002892845,0.0002581947,0.000475274,0.01181234,0.01547766,0.9434088,0.008294058,0.01593897],"study_design_scores_gemma":[0.0000674112,0.0001040537,0.004375096,0.00003521565,0.0000489533,0.0004714148,0.0003371328,0.09958919,0.01306436,0.8518748,0.0299801,0.00005228744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8035833,0.0006178664,0.07910588,0.001769798,0.0002520828,0.00009635495,0.001013273,0.0004308116,0.1131307],"genre_scores_gemma":[0.9683717,0.0004606819,0.01829512,0.000226179,0.0001055438,0.00006238755,0.0005489364,0.0001015989,0.01182789],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006789543,"threshold_uncertainty_score":0.02271324,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Nancy E. Clarke","is_ca":true},{"name":"Stephen Finbow","is_ca":true},{"name":"Margaret-Ellen Messinger","is_ca":true},{"name":"A. Duane Porter","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02309444933057681,"gpt":0.2868035390969812,"spread":0.2637090897664044,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002645154,0.001016301,0.001610493,0.00111719,0.00222141,0.00310046,0.003185115,0.002176732,0.006829218],"category_scores_gemma":[0.01642198,0.0007468204,0.001205073,0.001057697,0.008330258,0.01428869,0.00520009,0.005204104,0.0007430954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001849346,"about_ca_system_score_gemma":0.00061032,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002043174,"about_ca_topic_score_gemma":0.001445294,"domain_scores_codex":[0.9966365,0.001411304,0.00009367873,0.0008006992,0.000714982,0.0003428833],"domain_scores_gemma":[0.9867764,0.009864657,0.0006932321,0.001091894,0.0005689129,0.001004929],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005450388,0.00001641766,0.0003235819,0.00006656959,0.0000170689,0.0001393076,0.0002295818,0.008199925,0.0006982483,0.9832975,0.003121157,0.003836232],"study_design_scores_gemma":[0.00003466089,0.00008947421,0.0004303413,0.00006806683,0.00002336783,0.0002536236,0.0002211982,0.06142046,0.001139355,0.9185586,0.01770159,0.00005935088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1485063,0.005994473,0.6486768,0.01706329,0.001628367,0.0001267823,0.0002080883,0.0004468687,0.1773491],"genre_scores_gemma":[0.8842451,0.002691362,0.09502269,0.002564324,0.001304789,0.0001931278,0.0001214699,0.0004660726,0.01339111],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006829218,"threshold_uncertainty_score":0.02284604,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01425455687108847,"gpt":0.2576466227332637,"spread":0.2433920658621752,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00100317,0.0007872502,0.0007855619,0.00223993,0.001541447,0.003033555,0.002562637,0.001824826,0.006765184],"category_scores_gemma":[0.00499782,0.0004866166,0.001128007,0.002506173,0.005001724,0.004728253,0.002198947,0.003704816,0.00105511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001661667,"about_ca_system_score_gemma":0.001196525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001125067,"about_ca_topic_score_gemma":0.001160751,"domain_scores_codex":[0.9986743,0.0004658836,0.00006317557,0.0002304853,0.0004388175,0.0001273104],"domain_scores_gemma":[0.9970945,0.001669035,0.0001848053,0.0005441324,0.0003671368,0.0001403153],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006398648,0.00001458791,0.00005884407,0.00003185459,0.000004632485,0.00002610152,0.0000302571,0.01732503,0.0005733679,0.977071,0.0005379589,0.004320027],"study_design_scores_gemma":[0.000007381333,0.00001634891,0.00004618026,0.000013341,0.000004480674,0.00004609441,0.00002275012,0.08418762,0.000496561,0.9114676,0.003680411,0.00001134097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01157057,0.0005961982,0.963025,0.001586112,0.0002506824,0.00005041404,0.0001154662,0.000136033,0.02266959],"genre_scores_gemma":[0.360164,0.00197687,0.6196125,0.001033657,0.001245233,0.0003311862,0.000267012,0.0002432524,0.01512628],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006765184,"threshold_uncertainty_score":0.02263182,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Martin F. van Bommel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01625894790405058,"gpt":0.2693119762721733,"spread":0.2530530283681227,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005233435,0.0009382273,0.0007557854,0.0010932,0.001453742,0.001663372,0.001718381,0.0008712765,0.01249871],"category_scores_gemma":[0.001911949,0.0005021631,0.001181035,0.001602374,0.0008070201,0.002088234,0.002710713,0.00153946,0.00330492],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001648376,"about_ca_system_score_gemma":0.00240465,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002543861,"about_ca_topic_score_gemma":0.004648222,"domain_scores_codex":[0.9992445,0.00012539,0.00005196117,0.0002226622,0.0001660563,0.0001895863],"domain_scores_gemma":[0.9984862,0.0004145352,0.0001050444,0.0005437408,0.0002912406,0.000159113],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001879731,0.000856401,0.003884417,0.0007887534,0.000164532,0.0003684874,0.0007899971,0.06253841,0.05045418,0.2195996,0.05767589,0.6009997],"study_design_scores_gemma":[0.0004249135,0.0003299728,0.002065327,0.0000702041,0.0001184398,0.0003982282,0.0003413537,0.4900911,0.03513355,0.4326001,0.03832832,0.00009857828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1930121,0.0005352061,0.7569739,0.001884175,0.0003144747,0.0005477129,0.002412822,0.007811316,0.0365083],"genre_scores_gemma":[0.3769093,0.0002348718,0.5978503,0.0005723273,0.00008815924,0.0003296659,0.004049201,0.0008931854,0.01907294],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01249871,"threshold_uncertainty_score":0.04181236,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Farej Omer","is_ca":true},{"name":"Nabil Shalaby","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01563913419805387,"gpt":0.2125826377238773,"spread":0.1969435035258234,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001662725,0.001240818,0.001076241,0.001646237,0.001429968,0.002729319,0.001403276,0.003106712,0.01131517],"category_scores_gemma":[0.006057284,0.0005379323,0.0007392516,0.001309219,0.00588685,0.02025545,0.003180146,0.00594634,0.004465337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009572475,"about_ca_system_score_gemma":0.0007339015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006820201,"about_ca_topic_score_gemma":0.0007694081,"domain_scores_codex":[0.9993843,0.0002131916,0.00004398064,0.0001415292,0.0001378602,0.00007917843],"domain_scores_gemma":[0.9977067,0.001162744,0.0001875562,0.0002790127,0.0004184244,0.0002456244],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005918662,0.0000297079,0.0002400307,0.0002182519,0.00000719137,0.0002029325,0.0005107266,0.0004585705,0.001014711,0.9454849,0.0134758,0.03829795],"study_design_scores_gemma":[0.000008734557,0.00005854201,0.0001795732,0.0001859713,0.000005393103,0.000372564,0.0003193994,0.001380945,0.00134331,0.9141679,0.08193849,0.00003903325],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03828012,0.06815314,0.6427799,0.07410369,0.01801237,0.0001801727,0.0004429018,0.002398781,0.1556489],"genre_scores_gemma":[0.4184148,0.06512634,0.3565613,0.02986293,0.01619672,0.0004610513,0.000827506,0.001723508,0.1108258],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01131517,"threshold_uncertainty_score":0.037853,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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)","authors":[{"name":"Curtis Bright","is_ca":true},{"name":"Amadou Keita","is_ca":true},{"name":"Brett Stevens","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007072878004715721,"gpt":0.2239737302842744,"spread":0.2169008522795587,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001124144,0.0006512055,0.0006010583,0.0005860315,0.001337342,0.002174659,0.001255562,0.00121077,0.01649463],"category_scores_gemma":[0.008325127,0.0006760861,0.001592398,0.0013192,0.002300076,0.004825349,0.001639617,0.00245341,0.001868707],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001381482,"about_ca_system_score_gemma":0.00195034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003753564,"about_ca_topic_score_gemma":0.007433226,"domain_scores_codex":[0.9983634,0.0005662276,0.00007058502,0.0003608665,0.0004265785,0.000212305],"domain_scores_gemma":[0.9921869,0.006256113,0.0003990071,0.0006257008,0.0004073101,0.0001249364],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003479315,0.0003521849,0.004538324,0.0006353206,0.00008414499,0.001242942,0.0005697536,0.04272832,0.004086519,0.8733041,0.02071754,0.05139296],"study_design_scores_gemma":[0.0003289246,0.0002742032,0.002201908,0.0002749788,0.0001270872,0.001119341,0.0009433721,0.2598653,0.01227836,0.6412702,0.08122333,0.00009304299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4564802,0.00197815,0.2752333,0.00820575,0.0005998081,0.0004852504,0.002888877,0.001242495,0.2528862],"genre_scores_gemma":[0.7067046,0.0009462799,0.2509002,0.001716688,0.0002451692,0.000308206,0.002810698,0.0003566321,0.03601153],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01649463,"threshold_uncertainty_score":0.05518001,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Md. Zamilur Rahman","is_ca":true},{"name":"Asish Mukhopadhyay","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03345199863854946,"gpt":0.332869464926785,"spread":0.2994174662882356,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001645845,0.0007440016,0.0009275445,0.001113648,0.001107434,0.002680979,0.003018582,0.001203728,0.005214261],"category_scores_gemma":[0.0147486,0.000496252,0.0009661964,0.001805402,0.001441573,0.007222445,0.004625898,0.002269365,0.00141346],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001789073,"about_ca_system_score_gemma":0.001994294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001491329,"about_ca_topic_score_gemma":0.002127461,"domain_scores_codex":[0.996865,0.0006424714,0.0002672623,0.0007993874,0.001093026,0.0003328906],"domain_scores_gemma":[0.9882352,0.005863367,0.0007419938,0.003504675,0.001251915,0.0004028605],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000576371,0.0003185575,0.001606512,0.000657442,0.00009404404,0.000194967,0.0004891683,0.1334008,0.01582907,0.5144165,0.01608884,0.3163278],"study_design_scores_gemma":[0.00009399191,0.0001124913,0.0002971481,0.00003524058,0.00002835584,0.000332116,0.0001534596,0.3528881,0.006026116,0.6252143,0.01478341,0.00003534687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02284162,0.0006317975,0.9663578,0.0007112181,0.00009878449,0.00023525,0.0003877137,0.001522189,0.007213614],"genre_scores_gemma":[0.4021989,0.0009543078,0.5862247,0.0006156438,0.0001930202,0.0004358751,0.001734954,0.0004628732,0.007179759],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005214261,"threshold_uncertainty_score":0.01744348,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Evangelos Kranakis","is_ca":true},{"name":"Danny Kriz̧anc","is_ca":false},{"name":"I. LAMBADARIS","is_ca":true},{"name":"Lata Narayanan","is_ca":true},{"name":"Jaroslav Opatrný","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01945101131439236,"gpt":0.2631627647524371,"spread":0.2437117534380447,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003535997,0.00165492,0.001673036,0.001273748,0.001794827,0.002994551,0.00353793,0.001624342,0.002707181],"category_scores_gemma":[0.006917235,0.001043119,0.0004638267,0.003168224,0.001518164,0.003502029,0.001691263,0.001493962,0.001200826],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004856509,"about_ca_system_score_gemma":0.004502133,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01312414,"about_ca_topic_score_gemma":0.01063207,"domain_scores_codex":[0.9973075,0.0006524164,0.0001530261,0.0004683256,0.0006147582,0.0008039789],"domain_scores_gemma":[0.9969675,0.001601538,0.000334333,0.000315637,0.0004698464,0.0003111783],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007314949,0.0002797206,0.001167816,0.0001164364,0.00004776263,0.0001053335,0.0001859359,0.9107011,0.01746672,0.008961378,0.002496435,0.05774],"study_design_scores_gemma":[0.00006860202,0.00006190883,0.0002051335,0.000005015794,0.00001915799,0.00003040982,0.00006838294,0.9849268,0.007266388,0.00653756,0.0007971305,0.00001345644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1482238,0.000919073,0.8398947,0.0006914133,0.00009345213,0.0003105084,0.0002877001,0.003471923,0.006107519],"genre_scores_gemma":[0.734352,0.0005039179,0.2590936,0.0001755531,0.00007546908,0.0002752872,0.0003014382,0.0003694753,0.004853237],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01312414,"threshold_uncertainty_score":0.0352366,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Ahmad Biniaz","is_ca":true},{"name":"Evangelos Kranakis","is_ca":true},{"name":"Anil Maheshwari","is_ca":true},{"name":"Michiel Smid","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02200798055860665,"gpt":0.2754168138140871,"spread":0.2534088332554805,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001722237,0.000615015,0.001030717,0.003096585,0.0009329346,0.002707511,0.001858568,0.001547164,0.005385],"category_scores_gemma":[0.02426153,0.0005933588,0.0007984271,0.001699545,0.002830102,0.004250308,0.002590113,0.002206287,0.0006274158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002363665,"about_ca_system_score_gemma":0.0005605879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00108394,"about_ca_topic_score_gemma":0.0006184157,"domain_scores_codex":[0.9980811,0.0004717531,0.00008733539,0.0004913009,0.0005366718,0.0003317707],"domain_scores_gemma":[0.9775344,0.01462913,0.003317868,0.001651851,0.001247757,0.001619053],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005368593,0.000138864,0.004195656,0.0002426443,0.00006651606,0.0002680832,0.0003987049,0.1089194,0.007751345,0.8522168,0.005319327,0.01994579],"study_design_scores_gemma":[0.00008764568,0.0001447018,0.003183112,0.00006079672,0.00005358629,0.0004882346,0.0001992216,0.3273464,0.005275114,0.6591259,0.003971315,0.00006387382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.668217,0.002572923,0.282864,0.00382158,0.0001356075,0.0001960136,0.001132429,0.0008897544,0.04017074],"genre_scores_gemma":[0.9711053,0.0006725292,0.0233026,0.0003423102,0.0001202455,0.0001845366,0.0006029134,0.000178695,0.003490778],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005385,"threshold_uncertainty_score":0.01801467,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Haizhong Shi","is_ca":false},{"name":"Yue Shi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0121068608089565,"gpt":0.2792503952538275,"spread":0.267143534444871,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002182147,0.0006757598,0.0008517535,0.002473063,0.001300048,0.00342441,0.001429472,0.00139418,0.009477428],"category_scores_gemma":[0.008574088,0.000414714,0.001483366,0.001791277,0.003604969,0.007540418,0.001990875,0.001944958,0.002270301],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001551105,"about_ca_system_score_gemma":0.0009553258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000695371,"about_ca_topic_score_gemma":0.0004692417,"domain_scores_codex":[0.9958401,0.001436419,0.0003202786,0.001270933,0.0007966241,0.0003357099],"domain_scores_gemma":[0.993101,0.003987671,0.000719242,0.0009114944,0.0009567231,0.0003239301],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001216494,0.000008375135,0.0001495461,0.00005799442,0.000008985722,0.00009065484,0.0002786285,0.0008952181,0.0004609728,0.9918845,0.001650928,0.004501948],"study_design_scores_gemma":[0.00001141956,0.00001612069,0.0001023425,0.00003263402,0.000009213218,0.0003364701,0.0001436814,0.007152849,0.000380236,0.9756278,0.01616724,0.00001984483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07899994,0.005307015,0.7968917,0.00855216,0.0009695718,0.000312341,0.002321191,0.001972482,0.1046736],"genre_scores_gemma":[0.770687,0.003925391,0.1744148,0.003861275,0.001362055,0.0008176483,0.002462788,0.0006685458,0.04180046],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009477428,"threshold_uncertainty_score":0.0317052,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"","keywords":"Mathematics; Time complexity; Facility location problem; Algorithm; Combinatorics; Discrete mathematics; Mathematical optimization","authors":[{"name":"Wei Ding","is_ca":false},{"name":"Guangting Chen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01927807784296741,"gpt":0.2526821950377509,"spread":0.2334041171947835,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008913136,0.002505612,0.002510399,0.001442953,0.002072293,0.002962165,0.004710438,0.002791072,0.02197563],"category_scores_gemma":[0.004983671,0.0009818658,0.00196443,0.004576412,0.001099388,0.007518846,0.003287693,0.002908996,0.005731015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002963012,"about_ca_system_score_gemma":0.004711511,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01159879,"about_ca_topic_score_gemma":0.01327494,"domain_scores_codex":[0.9981832,0.0002694673,0.000111414,0.0005995641,0.0003053907,0.0005310501],"domain_scores_gemma":[0.9975029,0.001374127,0.0002040648,0.0004759636,0.0002314581,0.0002115507],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001164337,0.0009535528,0.00144331,0.001891309,0.0002203285,0.0005742774,0.0005591595,0.4412156,0.00688536,0.06923811,0.07414426,0.4017104],"study_design_scores_gemma":[0.0004783125,0.0002097771,0.0003897188,0.00007535702,0.00008417738,0.0003557657,0.0003031104,0.8714808,0.001709888,0.1139515,0.01091253,0.00004900359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05382568,0.001990114,0.8947581,0.002239777,0.0003736063,0.00102823,0.002642401,0.01145788,0.03168428],"genre_scores_gemma":[0.2677905,0.0009807493,0.7109426,0.0005915654,0.0002278366,0.0008092212,0.006409362,0.001136775,0.01111137],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02197563,"threshold_uncertainty_score":0.07351583,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","authors":[{"name":"Asish Mukhopadhyay","is_ca":true},{"name":"Daniel John","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0182773249693935,"gpt":0.2813524692736935,"spread":0.2630751443043,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00364964,0.002068637,0.001445184,0.003814182,0.001628942,0.002906458,0.001722104,0.001682584,0.01538873],"category_scores_gemma":[0.01321219,0.0009688658,0.002549216,0.002651925,0.00405821,0.004941077,0.005084401,0.008277006,0.002739137],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002321505,"about_ca_system_score_gemma":0.001960777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001532219,"about_ca_topic_score_gemma":0.002008755,"domain_scores_codex":[0.997869,0.0005728566,0.0001706352,0.0004217557,0.0007764117,0.0001893469],"domain_scores_gemma":[0.991667,0.005155487,0.0003795749,0.0006097779,0.001707651,0.0004806027],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002944608,0.00005725069,0.0001778495,0.0003398929,0.00002807121,0.0003173148,0.0004220344,0.003145838,0.004904347,0.9640058,0.006144428,0.02042773],"study_design_scores_gemma":[0.00004087502,0.0000589498,0.0004918656,0.0001567697,0.00004035958,0.0006133029,0.0001786157,0.01123587,0.00461612,0.9227316,0.05975736,0.00007834249],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01282914,0.002776178,0.886035,0.004762159,0.001842111,0.0003627551,0.001107775,0.0006445828,0.08964034],"genre_scores_gemma":[0.3058708,0.005774373,0.6473987,0.003835925,0.002202203,0.001054816,0.001440784,0.0004754882,0.03194688],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01538873,"threshold_uncertainty_score":0.05148041,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"William F. Klostermeyer","is_ca":false},{"name":"Margaret-Ellen Messinger","is_ca":true},{"name":"Alejandro Angeli Ayello","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02575959521276084,"gpt":0.3259960554148043,"spread":0.3002364602020434,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002341543,0.00115166,0.001380418,0.001125017,0.001417584,0.002566107,0.001823757,0.00127785,0.004673981],"category_scores_gemma":[0.01172727,0.0008101194,0.001261589,0.002281382,0.002005685,0.00649554,0.003101053,0.001765375,0.0008925199],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002033091,"about_ca_system_score_gemma":0.001041499,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008560548,"about_ca_topic_score_gemma":0.000728261,"domain_scores_codex":[0.9966768,0.0008315573,0.000209791,0.001071084,0.00084892,0.000361759],"domain_scores_gemma":[0.992724,0.003768508,0.001033417,0.001425977,0.000420164,0.0006281057],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000379787,0.0001309291,0.001670711,0.0004050994,0.0001352936,0.0004512337,0.0004962764,0.09011653,0.004378328,0.8589277,0.004757084,0.03815099],"study_design_scores_gemma":[0.00008516102,0.000119763,0.0005428852,0.00005126244,0.00007904627,0.0006671581,0.0001174092,0.1319883,0.003435034,0.8468564,0.01602492,0.00003268941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2575625,0.002281898,0.6844543,0.00229503,0.0002385576,0.0003212123,0.001724355,0.0004547614,0.05066732],"genre_scores_gemma":[0.8361393,0.001037298,0.145345,0.0006038211,0.0002672916,0.000267698,0.0009889801,0.0001349801,0.01521554],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004673981,"threshold_uncertainty_score":0.01563603,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Luı́s Fernando Schultz Xavier da Silveira","is_ca":true},{"name":"Michiel Smid","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03360502915633542,"gpt":0.2895113734225701,"spread":0.2559063442662347,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00439026,0.001342354,0.002285245,0.001426677,0.001149489,0.00340182,0.003785351,0.003309573,0.007713072],"category_scores_gemma":[0.02345249,0.0008212469,0.001850837,0.001941692,0.001601291,0.005305436,0.002889308,0.004056316,0.002259618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002052921,"about_ca_system_score_gemma":0.005221423,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002107717,"about_ca_topic_score_gemma":0.003077105,"domain_scores_codex":[0.9949335,0.001503311,0.000480815,0.001169725,0.001337299,0.0005753542],"domain_scores_gemma":[0.9870334,0.008563675,0.0006511401,0.002227801,0.001158809,0.0003652405],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002774389,0.0007085876,0.005436379,0.0007275619,0.0004478538,0.0003283046,0.0003010868,0.09165172,0.01765744,0.09835144,0.0314384,0.7501768],"study_design_scores_gemma":[0.0006014288,0.0003097737,0.001030183,0.0001294629,0.0002211617,0.0004735476,0.0001061083,0.8136661,0.01799598,0.1556285,0.009742942,0.00009466708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03075013,0.0006749946,0.95329,0.001707911,0.0002999701,0.0005177002,0.0007535288,0.005945574,0.006060176],"genre_scores_gemma":[0.2322482,0.000330008,0.7601659,0.001079129,0.0002830621,0.0005437773,0.001654482,0.0004819234,0.003213509],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007713072,"threshold_uncertainty_score":0.02580285,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Constant (computer programming); Value (mathematics); Mathematics; Computer science; Statistics","authors":[{"name":"Lennert D. den Boer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01232486349155806,"gpt":0.288302431773061,"spread":0.275977568281503,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004097407,0.001562697,0.001526639,0.003472619,0.00231845,0.005325281,0.004996188,0.003562094,0.02696988],"category_scores_gemma":[0.05513583,0.0007853979,0.001258993,0.003817777,0.004037489,0.008785821,0.003181921,0.005870206,0.006688709],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005820669,"about_ca_system_score_gemma":0.002815065,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002313821,"about_ca_topic_score_gemma":0.001307257,"domain_scores_codex":[0.9956796,0.0009724132,0.000105725,0.001114302,0.001639694,0.000488301],"domain_scores_gemma":[0.9752886,0.01709594,0.0008314067,0.002911733,0.003235205,0.0006372422],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005050079,0.00005477341,0.0006113857,0.0001737012,0.00001834044,0.0001025977,0.0001177639,0.02966526,0.0008554409,0.928673,0.01229383,0.02738346],"study_design_scores_gemma":[0.00002466194,0.00005712431,0.0004649211,0.0001943467,0.00003796676,0.0005743933,0.0001052489,0.2316905,0.001393224,0.7380314,0.02736859,0.00005762514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01953814,0.006113616,0.7895617,0.01056029,0.001507663,0.0001733282,0.0009496256,0.001812739,0.1697829],"genre_scores_gemma":[0.7290257,0.01019787,0.2188733,0.004899031,0.00390276,0.00128975,0.001582131,0.001272849,0.02895663],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02696988,"threshold_uncertainty_score":0.09022325,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}