{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003301898,0.0002062067,0.000205215,0.0001020876,0.0004614731,0.0004225171,0.000507775,0.00009437851,0.00001614779],"category_scores_gemma":[0.00002243699,0.0001828842,0.00007703006,0.0003718128,0.00007193264,0.0004934029,0.0001086941,0.0001605375,0.00001771139],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008545833,"about_ca_system_score_gemma":0.0000634078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009802113,"about_ca_topic_score_gemma":0.00000768193,"domain_scores_codex":[0.9987057,0.0000143011,0.0003422108,0.0004792269,0.0001906565,0.0002679316],"domain_scores_gemma":[0.9985923,0.0001783689,0.0001571475,0.0006575101,0.0002091632,0.0002055083],"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.000002541791,0.0003222957,0.00001024589,0.00007010016,0.00004935135,5.291732e-7,0.0005325963,0.0008330084,0.01229672,0.5067719,0.000171825,0.4789389],"study_design_scores_gemma":[0.000320804,0.00008004874,0.00005395835,0.000005462224,0.00002341552,0.00001118878,0.0000487172,0.9049895,0.002042509,0.07287791,0.01930029,0.0002462246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001359155,0.00005340358,0.9964186,0.0003407418,0.0001340342,0.0009410709,0.0001689146,0.0001359021,0.0004481931],"genre_scores_gemma":[0.02741173,0.00002739635,0.9699655,0.000128522,0.0004305621,0.0009258134,0.0002779652,0.00002639359,0.0008061308],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9041564,"threshold_uncertainty_score":0.7457801,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004394375,0.0001147945,0.0002991688,0.0001414275,0.0002438015,0.00004850071,0.0001654798,0.00006669922,0.00007469054],"category_scores_gemma":[0.0000563177,0.0001196643,0.00006721859,0.0003289125,0.0000959237,0.00007364376,0.0001054444,0.0001649874,0.000004369765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002110154,"about_ca_system_score_gemma":0.00001254779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001509573,"about_ca_topic_score_gemma":0.00001247239,"domain_scores_codex":[0.9990537,0.000009672015,0.0005286307,0.0002402913,0.00003490212,0.0001327855],"domain_scores_gemma":[0.9991969,0.00009557795,0.0003264031,0.0002998222,0.00003206922,0.00004915879],"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.000001991697,0.0001832032,0.03644414,0.000269036,0.00007110407,6.927496e-8,0.0003546106,0.00006013605,0.000005531363,0.9601187,0.00004205486,0.002449441],"study_design_scores_gemma":[0.0001962151,0.00001694997,0.01984998,0.00002493351,0.00001794279,8.525863e-7,0.00009803192,0.693692,0.000007422319,0.2648384,0.02114228,0.0001149169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01536484,0.001409656,0.8882967,0.0004324189,0.0000494121,0.000555673,0.0009673015,0.00005523676,0.09286873],"genre_scores_gemma":[0.9828151,0.0005439597,0.01483131,0.00002352331,0.00002962844,0.0001879004,0.0001220423,0.00001389444,0.00143267],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9674503,"threshold_uncertainty_score":0.4879771,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003971322,0.0003672114,0.0004773238,0.0001589093,0.0003796169,0.0003476423,0.0004937836,0.0001726963,0.000001300573],"category_scores_gemma":[0.00001308277,0.000344658,0.0001117731,0.0008879656,0.00008345941,0.0001474686,0.0001428901,0.0001984557,0.000001502669],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008373379,"about_ca_system_score_gemma":0.00003705383,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002629185,"about_ca_topic_score_gemma":0.000009547187,"domain_scores_codex":[0.9975682,0.00004559663,0.0006323496,0.0007464322,0.0003115532,0.0006958083],"domain_scores_gemma":[0.9982966,0.0003442197,0.0002763085,0.0007185804,0.0001720939,0.0001922457],"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.000005711005,0.0003508151,0.000004923202,0.00005734956,0.00002456206,0.000007320119,0.0003837854,0.5910949,0.0002507184,0.2355352,0.0001205669,0.1721642],"study_design_scores_gemma":[0.0006671245,0.00005501165,0.00004323767,0.0001023537,0.00002306855,0.00002360881,0.0001328985,0.9884307,0.0003911336,0.007622684,0.002084057,0.000424172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001505926,0.0004225396,0.9956547,0.0006794861,0.00006146322,0.0009625032,0.00007021366,0.0002218556,0.000421283],"genre_scores_gemma":[0.2804529,0.0003331607,0.7178085,0.0002600886,0.0002718846,0.0003511085,0.0002552198,0.00005645385,0.0002106872],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3973358,"threshold_uncertainty_score":0.9999005,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004499466,0.0001496096,0.000195612,0.0001432459,0.000156711,0.000149263,0.0005297836,0.00006603293,0.00003350728],"category_scores_gemma":[0.00001397181,0.0001371511,0.00005297912,0.0003928651,0.0001448038,0.0002715772,0.0002202133,0.0001169743,0.00007517805],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002020073,"about_ca_system_score_gemma":0.00004046962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000145617,"about_ca_topic_score_gemma":0.000001364077,"domain_scores_codex":[0.998749,0.00001848957,0.0003210513,0.0003846517,0.0001940635,0.0003327223],"domain_scores_gemma":[0.9991366,0.00009355567,0.00007190149,0.0004344645,0.0001186659,0.0001448687],"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.0000068918,0.0008691594,0.00004519851,0.0003365384,0.00006091823,0.000004072031,0.02269171,0.006130714,0.0003983178,0.89528,0.0004490627,0.07372741],"study_design_scores_gemma":[0.0003592072,0.00005547499,0.00006244279,0.00002112627,0.000005276807,0.000002765865,0.000309943,0.9836867,0.0003642524,0.01342527,0.001522413,0.0001850768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001029982,0.00003781704,0.9934662,0.0003095839,0.00001153998,0.001110172,0.00002933804,0.0000925435,0.00391284],"genre_scores_gemma":[0.006481672,0.00006542185,0.9912953,0.00007072533,0.0000434418,0.0006996539,0.00002627414,0.00002474986,0.001292723],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.977556,"threshold_uncertainty_score":0.5592862,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006911787,0.000310329,0.0004706272,0.0003076465,0.0006917797,0.0003107311,0.0007000445,0.0001114002,0.00001134597],"category_scores_gemma":[0.00005331062,0.0002816862,0.0002427585,0.0008635105,0.0003273821,0.0002955667,0.0002463399,0.0002019795,0.000002548954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002346748,"about_ca_system_score_gemma":0.00003595034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000176382,"about_ca_topic_score_gemma":0.000001729478,"domain_scores_codex":[0.9977067,0.00005320377,0.0006682532,0.0004772442,0.0005099708,0.0005846084],"domain_scores_gemma":[0.9979565,0.0007031219,0.0003160282,0.0005957137,0.0001973706,0.0002312903],"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.00000619125,0.0004420167,0.00006002603,0.000264804,0.000113685,2.559173e-7,0.002451633,0.00007770349,0.0009350918,0.8530604,0.0002095543,0.1423786],"study_design_scores_gemma":[0.002124767,0.0002051268,0.0007747399,0.0001457561,0.0001633273,0.00004997826,0.003758149,0.5083715,0.009663441,0.46571,0.007882068,0.001151078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0239535,0.0007724985,0.9730456,0.0001845745,0.0001561937,0.001088055,0.0002809069,0.0001126128,0.000406033],"genre_scores_gemma":[0.1443734,0.000148469,0.8540455,0.00004904328,0.0006564842,0.0005451599,0.0001187162,0.00003683556,0.00002650144],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5082938,"threshold_uncertainty_score":0.9999635,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002585691,0.0001139116,0.0002416428,0.0000402338,0.00006060167,0.00002578979,0.0001880661,0.00005003552,0.000009339041],"category_scores_gemma":[0.000007178126,0.00009463809,0.0000351349,0.0003713325,0.0001157959,0.0002017527,0.0000997419,0.00009848707,0.000001402583],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001700106,"about_ca_system_score_gemma":0.00001933586,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003730372,"about_ca_topic_score_gemma":0.00001241277,"domain_scores_codex":[0.9991401,0.00002567264,0.0002782527,0.0001814218,0.000162888,0.0002116617],"domain_scores_gemma":[0.9990868,0.0001986683,0.0002099661,0.0003533877,0.00007875615,0.00007244304],"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.00001361437,0.001460236,0.0517443,0.0002572199,0.0001552965,0.000001463948,0.002523026,0.005298229,0.0004320714,0.9133901,0.00008118055,0.02464325],"study_design_scores_gemma":[0.0006605416,0.00006312668,0.02426172,0.0001290425,0.00003767174,0.00005799587,0.0004762842,0.9628509,0.0007138653,0.01001069,0.0004042895,0.0003338778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02623598,0.0001229962,0.9717376,0.00005122642,0.0000216757,0.0003902706,0.00001536195,0.00002476268,0.001400137],"genre_scores_gemma":[0.7562218,0.00002072332,0.2435042,0.000006127203,0.00005253287,0.0001478441,0.000006279629,0.000009623818,0.00003090702],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9575527,"threshold_uncertainty_score":0.3859229,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002465195,0.0001321616,0.0001303477,0.00008342526,0.000276415,0.0001347713,0.0003063999,0.00005131121,0.000001991018],"category_scores_gemma":[0.000004667187,0.0001163678,0.00002902758,0.0001891686,0.00009349574,0.0004927469,0.0001884035,0.00008340023,0.000001114365],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004602744,"about_ca_system_score_gemma":0.000005664605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008547854,"about_ca_topic_score_gemma":9.567781e-7,"domain_scores_codex":[0.9991466,0.00001465529,0.0002196938,0.000342847,0.0001070501,0.0001692026],"domain_scores_gemma":[0.9991708,0.00002534135,0.0001223018,0.0005498466,0.00004187686,0.00008980829],"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":[8.74176e-7,0.00008081376,0.0001548313,0.00007387194,0.00001374082,9.665812e-7,0.004079262,2.726409e-7,0.0008226148,0.9381212,0.000002583077,0.05664894],"study_design_scores_gemma":[0.0001652246,0.0000570436,0.001517923,0.00007464359,0.00002412604,0.00005402708,0.0003056663,0.3030341,0.005141517,0.68841,0.0008274293,0.000388236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005486544,0.0001048358,0.9915994,0.00005775643,0.000009441279,0.0003334497,0.000004937633,0.0003789735,0.00202465],"genre_scores_gemma":[0.2010623,0.0000657795,0.7985608,0.00002698839,0.00001976272,0.0002276578,0.000006209111,0.0000118221,0.00001864862],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3030338,"threshold_uncertainty_score":0.474534,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003309729,0.00009769316,0.0001402248,0.00003687151,0.0002154359,0.0002583276,0.0002304106,0.00003090266,0.00000101566],"category_scores_gemma":[0.00001240573,0.00007108777,0.00002921564,0.000152216,0.00004478745,0.000187847,0.0000758306,0.00005967252,0.000005029799],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001585984,"about_ca_system_score_gemma":0.00003596693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003247985,"about_ca_topic_score_gemma":0.00001743347,"domain_scores_codex":[0.9992905,0.00001234319,0.0001732676,0.000218582,0.0001425691,0.0001626982],"domain_scores_gemma":[0.9992511,0.00009168933,0.00007804179,0.0003158842,0.0001455109,0.0001177759],"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.000001511262,0.00003006346,0.00001853737,0.00004594346,0.00001557303,2.820738e-7,0.001417065,0.0001227259,0.00001213365,0.9887143,0.0002603959,0.009361515],"study_design_scores_gemma":[0.0004150372,0.0001253024,0.00002215687,0.00003892995,0.00001273164,0.00004682521,0.001616667,0.7986956,0.0001272153,0.1425239,0.05614993,0.0002257311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007035031,0.00007265113,0.9953265,0.0005282462,0.0000430507,0.0005617032,0.00001106794,0.0000851096,0.002668126],"genre_scores_gemma":[0.1727934,0.00001234045,0.8244715,0.00009474246,0.0003100794,0.001314475,0.00001861631,0.00002276045,0.000962077],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8461903,"threshold_uncertainty_score":0.2898875,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000285541,0.000110303,0.000144172,0.0002531613,0.000170748,0.00007370971,0.0002143957,0.00004112059,0.000007830284],"category_scores_gemma":[0.00001759534,0.0001021778,0.00004814807,0.0009198013,0.00004502512,0.0003733847,0.00006122772,0.00005476931,0.00001346371],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001511415,"about_ca_system_score_gemma":0.00002129668,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005921385,"about_ca_topic_score_gemma":6.070534e-7,"domain_scores_codex":[0.9990987,0.0000167935,0.0003019297,0.0001756529,0.0002340422,0.0001728381],"domain_scores_gemma":[0.9992192,0.0001394135,0.0001738876,0.0002741721,0.00008958533,0.0001037324],"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":[6.445968e-7,0.0001741169,0.0001158266,0.00006202664,0.00002708297,8.211344e-8,0.0008619697,0.00005320726,0.0006197257,0.9471713,0.0001193379,0.05079467],"study_design_scores_gemma":[0.001797125,0.0002297589,0.01570712,0.0000762846,0.0001879695,0.00009397489,0.001448313,0.295147,0.02094496,0.6403438,0.02283697,0.001186773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01405163,0.0004727884,0.9837294,0.0001341623,0.00006740726,0.0003366994,0.00002049672,0.0000479091,0.001139562],"genre_scores_gemma":[0.5920753,0.0001154787,0.4072557,0.00005167787,0.0001038424,0.0001772963,0.00007530779,0.000009910264,0.0001354784],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5780236,"threshold_uncertainty_score":0.4166692,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001260328,0.00008111518,0.0001367543,0.0001103756,0.00009540506,0.00003144661,0.0001118818,0.00003476298,0.000001113615],"category_scores_gemma":[0.000009179686,0.00007692404,0.00002286263,0.0004828997,0.0001105514,0.0001570071,0.00003805345,0.00004141463,4.419939e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006003621,"about_ca_system_score_gemma":0.0000269074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005514389,"about_ca_topic_score_gemma":0.000001214707,"domain_scores_codex":[0.999341,0.00001102008,0.0002676297,0.0001661734,0.000137717,0.00007653063],"domain_scores_gemma":[0.999372,0.00006546884,0.0001715136,0.0001771786,0.0001647242,0.00004910073],"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.000001474947,0.00005258323,0.0000542517,0.00007211474,0.00001095219,8.271448e-8,0.0003476405,0.001813594,0.0006869141,0.8252555,0.000004436768,0.1717005],"study_design_scores_gemma":[0.0003458754,0.0001358255,0.00491171,0.00007311725,0.0000380832,0.00002632697,0.000911916,0.7307185,0.007130118,0.2551796,0.0003347714,0.0001942001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02386261,0.0001480049,0.975343,0.0001973163,0.00001709861,0.000223189,0.00001002078,0.00002207044,0.0001767099],"genre_scores_gemma":[0.8224985,0.00007233217,0.1773479,0.00001290248,0.00001352749,0.00002226177,0.00001742839,0.000002810064,0.00001235986],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7986358,"threshold_uncertainty_score":0.3136871,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007685748,0.00008105327,0.0001165692,0.00002142662,0.0002292785,0.0001493319,0.0005361068,0.00003001422,0.000001868505],"category_scores_gemma":[0.0000159447,0.00004282365,0.00004636637,0.0002788855,0.00007478851,0.00006504251,0.00006608274,0.00008463094,0.000006849515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004243571,"about_ca_system_score_gemma":0.000007280841,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002346418,"about_ca_topic_score_gemma":0.0000209643,"domain_scores_codex":[0.9992154,0.0000497921,0.0002989453,0.0001467179,0.0001581082,0.0001310804],"domain_scores_gemma":[0.9988596,0.0004159416,0.0001150695,0.0005298372,0.00005387588,0.00002569495],"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":[1.650339e-7,0.00002999676,0.0001030571,0.00001121051,0.000005413478,9.777878e-8,0.0009683105,0.00002145409,0.000008746378,0.9873749,0.0001374756,0.01133918],"study_design_scores_gemma":[0.0001561589,0.00002607744,0.001002981,0.00004099534,0.00001021075,0.00003714786,0.001615692,0.6487256,0.00003082016,0.3164522,0.03174742,0.0001546713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003266725,0.00007875902,0.988912,0.0008179972,0.00004935153,0.0003522647,0.000004064578,0.00001981006,0.006498978],"genre_scores_gemma":[0.9782614,0.00007895576,0.02092376,0.0001091439,0.0001078099,0.000387149,0.000003027956,0.000007976857,0.0001208061],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9749947,"threshold_uncertainty_score":0.1763448,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002120169,0.0001310849,0.0001258671,0.00008479145,0.0002213725,0.0001646766,0.0002808386,0.00004422872,0.000006359768],"category_scores_gemma":[0.00001094964,0.0001217578,0.00002839506,0.0002181899,0.0001027254,0.0004212734,0.0001761336,0.00008473642,0.0000162827],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001859319,"about_ca_system_score_gemma":0.00001866105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002144035,"about_ca_topic_score_gemma":0.000001456477,"domain_scores_codex":[0.9991513,0.00001540915,0.0002071456,0.0003158669,0.0001439538,0.0001663556],"domain_scores_gemma":[0.9992546,0.00005440127,0.0001234195,0.0003995697,0.00006051748,0.0001074554],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[8.735014e-7,0.00007642281,0.0000182245,0.00005508649,0.00001360349,9.351251e-7,0.003944193,0.0000034443,0.001476649,0.9758486,0.00002139036,0.01854057],"study_design_scores_gemma":[0.0003756856,0.00004807187,0.0007075876,0.00004523511,0.00004758519,0.00003861947,0.000922996,0.5591913,0.001861201,0.4354901,0.0009181439,0.0003534193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002939955,0.00007717829,0.9920114,0.0003104683,0.00001883835,0.0003749962,0.000009998357,0.0001408989,0.004116217],"genre_scores_gemma":[0.2811461,0.00007365483,0.7183048,0.00006949896,0.00004239629,0.0001721405,0.00001741521,0.00002004137,0.0001540464],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5591879,"threshold_uncertainty_score":0.4965138,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001939949,0.00008234184,0.0001144453,0.00004918084,0.0001672644,0.0001072674,0.0003466383,0.00003285318,0.000004941259],"category_scores_gemma":[0.000006745434,0.00007062506,0.00004668906,0.0003427089,0.00009814138,0.0001733002,0.00004123956,0.00005239112,0.000004635567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003873655,"about_ca_system_score_gemma":0.00001779417,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001809527,"about_ca_topic_score_gemma":3.209043e-7,"domain_scores_codex":[0.9993575,0.00001241298,0.0002160592,0.0001769649,0.0001274652,0.0001096042],"domain_scores_gemma":[0.9993395,0.00005722022,0.0001245587,0.0003719472,0.00005331744,0.00005341856],"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":[3.792729e-7,0.00004997816,0.00002399365,0.00001291714,0.000004825302,1.065702e-7,0.000426607,0.000006480222,0.001014501,0.9191464,0.00001317878,0.07930063],"study_design_scores_gemma":[0.0001389454,0.00009785857,0.004246665,0.00002762387,0.00001837458,0.00001246178,0.0002560708,0.1541681,0.001101033,0.8368132,0.002928957,0.000190716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008582922,0.0001177293,0.9851011,0.0006233064,0.0000126376,0.0002003995,0.000007143189,0.00007267341,0.005282059],"genre_scores_gemma":[0.7374892,0.00003561885,0.2623036,0.00005156055,0.00002638814,0.00004893276,0.000005402749,0.000003379389,0.00003590162],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7289063,"threshold_uncertainty_score":0.2880006,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002101846,0.0001127532,0.0001846813,0.0001211889,0.0001024476,0.00002942757,0.000459182,0.00004499639,0.00001158813],"category_scores_gemma":[0.00004992507,0.00007264243,0.00006168394,0.0004837693,0.0001718089,0.0001762042,0.0001820685,0.00005512512,0.00001937351],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007590907,"about_ca_system_score_gemma":0.0000209756,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002257126,"about_ca_topic_score_gemma":5.49972e-7,"domain_scores_codex":[0.9990148,0.00002233441,0.0002873002,0.0002633715,0.0002163579,0.0001958474],"domain_scores_gemma":[0.9986814,0.0003224578,0.0001306777,0.0006398936,0.0001223131,0.0001032147],"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.000001508339,0.00005804901,0.00001674557,0.00002798351,0.00001937169,4.909213e-7,0.0002390336,0.00000319716,0.006206176,0.9435025,0.00002105084,0.04990392],"study_design_scores_gemma":[0.0005114597,0.00006038871,0.0001490077,0.00006069451,0.00001275465,0.00001075148,0.0001207469,0.02567002,0.009614786,0.9608962,0.002683679,0.0002094891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00230955,0.0001536859,0.995443,0.0006039217,0.00001354644,0.0004036121,0.00004061856,0.00007937747,0.0009526382],"genre_scores_gemma":[0.3172648,0.0002421015,0.6808536,0.00004774439,0.00005629676,0.0003848735,0.000008198672,0.00003492687,0.001107452],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3149553,"threshold_uncertainty_score":0.2962272,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002100941,0.0001368932,0.0001560622,0.0001002603,0.0001741169,0.00009144992,0.0005739661,0.00003970402,0.0000283133],"category_scores_gemma":[0.00001772555,0.0001114489,0.00005230215,0.0003456922,0.0001871762,0.0002393759,0.0002188696,0.00009835496,0.00003589717],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007868444,"about_ca_system_score_gemma":0.0000179682,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005463134,"about_ca_topic_score_gemma":0.000002656087,"domain_scores_codex":[0.9990246,0.00001934031,0.0002225756,0.0003161625,0.0001744394,0.0002429184],"domain_scores_gemma":[0.9989462,0.0001125683,0.00007898645,0.0006610471,0.00006478653,0.0001363585],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[5.900346e-7,0.00007832289,0.00002301512,0.00001692877,0.00001593386,0.000001444415,0.0009532555,0.000001438209,0.0003752594,0.9338393,0.00001302432,0.06468148],"study_design_scores_gemma":[0.0002915821,0.00007395642,0.000398706,0.00002002687,0.0000148525,0.0000292258,0.0004856212,0.05877356,0.002075222,0.9352109,0.002310838,0.0003155064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000840525,0.00009694803,0.9869114,0.0001171342,0.00001439523,0.0003981974,0.00001788996,0.000128413,0.01147515],"genre_scores_gemma":[0.1101376,0.0000475186,0.8886672,0.00005034462,0.0000415679,0.0004889341,0.000006101825,0.00001935943,0.000541367],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.109297,"threshold_uncertainty_score":0.4544756,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001577768,0.000135592,0.0002368558,0.00004890522,0.0001873889,0.0001044389,0.0003856219,0.00003905368,0.000002041921],"category_scores_gemma":[0.00004486625,0.0001168849,0.00005601737,0.0003449754,0.00008398222,0.0001085945,0.0001497907,0.00009535351,0.000006006095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005167129,"about_ca_system_score_gemma":0.00001956749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001479596,"about_ca_topic_score_gemma":0.000001103064,"domain_scores_codex":[0.9989583,0.00001315191,0.0003428459,0.0003090634,0.0002034942,0.0001731303],"domain_scores_gemma":[0.9991546,0.00009560579,0.0001818423,0.0003268261,0.00008000283,0.0001611679],"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.000001048776,0.00006308166,0.0003289336,0.0001583456,0.00002711047,8.002855e-7,0.001924681,0.00004886884,0.001343708,0.9868927,0.0001161161,0.009094622],"study_design_scores_gemma":[0.0005645472,0.00009877966,0.0005381054,0.0001748592,0.00006069033,0.00001126906,0.00075328,0.5169007,0.002460364,0.4757749,0.002229503,0.0004330232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01554499,0.0004723366,0.9805401,0.001277992,0.00004637091,0.0004529031,0.00003154159,0.0001886575,0.001445086],"genre_scores_gemma":[0.6287658,0.00008109632,0.3708151,0.0001671828,0.0000170633,0.0001061258,0.00001257031,0.00001709387,0.00001801107],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6132208,"threshold_uncertainty_score":0.4766428,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000257857,0.00009227872,0.000128271,0.00004501291,0.000106571,0.0001221875,0.000435663,0.00003616591,0.00000781674],"category_scores_gemma":[0.00004622276,0.00006838078,0.00002585816,0.0006422995,0.00006342053,0.000108353,0.0001143695,0.0001079237,0.000005309771],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008826589,"about_ca_system_score_gemma":0.00005374184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009053349,"about_ca_topic_score_gemma":0.00000414231,"domain_scores_codex":[0.9990569,0.00003863876,0.0002694387,0.0002390984,0.0002588244,0.0001371044],"domain_scores_gemma":[0.9989623,0.0002113079,0.00009561032,0.0005296166,0.0001551715,0.00004600282],"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.000001974778,0.0009613101,0.00003453924,0.0002365828,0.00002724793,0.000004944944,0.006643204,0.07761129,0.0003351388,0.8811223,0.001316184,0.03170532],"study_design_scores_gemma":[0.0002069258,0.0000511067,0.00005423133,0.00005562154,0.000005125304,0.00001104217,0.0007846736,0.9877337,0.0007530661,0.008614141,0.001616437,0.0001138872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003289499,0.0001993321,0.9955013,0.002577191,0.00001014355,0.0003730474,0.00002263142,0.000022138,0.0009652399],"genre_scores_gemma":[0.3126709,0.0006198197,0.6838126,0.0005363143,0.0000667937,0.0009483742,0.0001397092,0.00002569152,0.001179866],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9101225,"threshold_uncertainty_score":0.2788487,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006780573,0.0003880115,0.0005154148,0.0001703162,0.0004376809,0.0005431741,0.001297519,0.0001838088,0.000003741553],"category_scores_gemma":[0.00008169028,0.0003640435,0.0002455902,0.0004685391,0.0001079682,0.0001137475,0.0009909375,0.0004726278,0.000007240645],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003228988,"about_ca_system_score_gemma":0.00018122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005786742,"about_ca_topic_score_gemma":0.000001864634,"domain_scores_codex":[0.9975907,0.00007702743,0.0005343253,0.001025206,0.000369673,0.0004031366],"domain_scores_gemma":[0.9973761,0.0005983178,0.0003427014,0.001179038,0.00023676,0.0002670414],"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.000002967139,0.00008124355,0.000001948016,0.000626647,0.00007850047,0.000001223759,0.0004818467,0.00235159,0.001829372,0.9607817,0.0001585557,0.03360443],"study_design_scores_gemma":[0.0001420229,0.00002694474,0.000001574451,0.00003326741,0.00002423875,0.000002270482,0.00004441762,0.5684548,0.0008673503,0.428203,0.001960219,0.0002399109],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00006698206,0.0003199892,0.9947675,0.001434343,0.00005441055,0.002475518,0.0003406378,0.0002372386,0.000303403],"genre_scores_gemma":[0.0013201,0.0000332552,0.9925218,0.0002123827,0.0001685914,0.005492432,0.0001366835,0.00005454517,0.00006021999],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5661032,"threshold_uncertainty_score":0.9998811,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004644455,0.0001087493,0.0002094972,0.000112552,0.0001278934,0.0001076104,0.000369772,0.00005333195,0.00002467691],"category_scores_gemma":[0.00003701892,0.00009400347,0.00003826623,0.0004191327,0.0001475343,0.0001859076,0.0001866857,0.00009162223,0.00001693235],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001007437,"about_ca_system_score_gemma":0.00004343834,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008219593,"about_ca_topic_score_gemma":0.000004616672,"domain_scores_codex":[0.9989303,0.00002196295,0.0003857494,0.0002548599,0.0001949799,0.0002121468],"domain_scores_gemma":[0.9991699,0.0001207829,0.0001031572,0.0003602844,0.0001503388,0.00009552654],"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.000008177064,0.0003433561,0.0002793676,0.0001724175,0.00003843437,0.000001275515,0.002214629,0.004132972,0.0005655733,0.9771665,0.00006708027,0.01501025],"study_design_scores_gemma":[0.0006862421,0.0000574872,0.0001301491,0.00004661749,0.000006292685,0.000005675182,0.0001273781,0.9836722,0.0004577935,0.01373814,0.0009452009,0.0001267946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002079886,0.00005856287,0.9927392,0.0004767567,0.00002360487,0.0004241466,0.000007031148,0.00004343418,0.004147389],"genre_scores_gemma":[0.0809211,0.00008814723,0.9185127,0.000056573,0.00006924589,0.0001575344,0.000008778085,0.00001178272,0.0001741199],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9795393,"threshold_uncertainty_score":0.383335,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001314138,0.0001361798,0.0001332636,0.00007684088,0.0001991997,0.0005325404,0.0003930473,0.00005959306,0.00003248481],"category_scores_gemma":[0.000007078894,0.0001155088,0.00006567663,0.0004022069,0.00005776833,0.0002056649,0.0001829586,0.0001168936,0.0001208222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001098102,"about_ca_system_score_gemma":0.00002923138,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009579562,"about_ca_topic_score_gemma":0.000002720541,"domain_scores_codex":[0.9990813,0.000007602014,0.0002280898,0.0003524582,0.0001565144,0.0001740386],"domain_scores_gemma":[0.9990633,0.0002102948,0.00003937765,0.0005662199,0.00002833939,0.00009247392],"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":[7.036957e-8,0.00003719849,0.000002644845,0.000081122,0.00001893346,0.000001808922,0.0004652359,0.00002207611,0.0002389864,0.9513278,0.0006510182,0.04715311],"study_design_scores_gemma":[0.00005661889,0.000009961635,0.00004275206,0.00003356759,0.00002029802,0.00001608408,0.0000528359,0.7534841,0.0004121319,0.1511719,0.09452353,0.0001762433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003974007,0.0008375312,0.9917157,0.001183011,0.00004105536,0.000332751,0.00004673163,0.0003745036,0.005071367],"genre_scores_gemma":[0.5136572,0.0007394135,0.478009,0.0004795588,0.0004420862,0.00199794,0.0001467924,0.00006793359,0.004460088],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8001559,"threshold_uncertainty_score":0.51353,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007442113,0.0001719726,0.0003305335,0.0000919033,0.0001388486,0.00002061516,0.0003245401,0.00006787305,0.00002342572],"category_scores_gemma":[0.0001255802,0.0001183533,0.0001189375,0.0003926727,0.0002960648,0.00004265577,0.00008342219,0.0001301738,0.000008902775],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009736374,"about_ca_system_score_gemma":0.00001966793,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008547667,"about_ca_topic_score_gemma":0.000002228671,"domain_scores_codex":[0.998704,0.00004408493,0.000557367,0.0002078323,0.0003242283,0.0001624626],"domain_scores_gemma":[0.9977614,0.0008315202,0.0004070739,0.0007364564,0.0001574024,0.0001061132],"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.0000046034,0.0004705126,0.000006471703,0.0001234431,0.00005854309,6.854024e-8,0.0006915197,0.000008457019,0.0006113503,0.9968733,0.0002933371,0.0008583566],"study_design_scores_gemma":[0.0002601546,0.00007774567,0.00002690563,0.00006472132,0.0001090495,0.00000342114,0.001787208,0.001300426,0.001980922,0.9936653,0.0005948184,0.0001292981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2525188,0.0004476623,0.7249562,0.001944037,0.00004580842,0.003634387,0.0004820929,0.0001495543,0.01582148],"genre_scores_gemma":[0.9024959,0.00007940461,0.09622406,0.0000383489,0.00005218758,0.00080525,0.00002507199,0.00004194249,0.0002377932],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6499772,"threshold_uncertainty_score":0.4826307,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001747517,0.0001321029,0.0001149728,0.00003832336,0.0002043633,0.0000489987,0.00009151753,0.00006903912,0.00001091208],"category_scores_gemma":[0.00001892043,0.0001182588,0.00003170493,0.00007172116,0.00005744637,0.00001004012,0.0001928333,0.00007234143,0.000003937791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008422126,"about_ca_system_score_gemma":0.00001085998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001445054,"about_ca_topic_score_gemma":0.0000054399,"domain_scores_codex":[0.9992527,0.00001471583,0.0001920263,0.0002267654,0.0001021728,0.000211564],"domain_scores_gemma":[0.9994286,0.00002833568,0.00008326943,0.0002755199,0.00003245792,0.0001518381],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001975113,0.0002675852,0.001941256,0.0005617772,0.0001287915,2.469632e-7,0.002540756,0.0003658645,0.8635253,0.002104024,0.0005050114,0.1280397],"study_design_scores_gemma":[0.002663578,0.0003740366,0.009191143,0.0003054336,0.0002697121,0.0001960334,0.008119606,0.4794803,0.1549528,0.007266107,0.3347869,0.002394346],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05447504,0.0006187393,0.9439175,0.0001298458,0.00003687489,0.0003911343,0.00005634756,0.00002136957,0.0003532183],"genre_scores_gemma":[0.9157794,0.0004711913,0.08232397,0.0001015481,0.000456928,0.0004054951,0.0001986576,0.00003958388,0.0002232756],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8615935,"threshold_uncertainty_score":0.4822452,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003619135,0.0003302165,0.0005854832,0.0001755877,0.0001229307,0.00005414237,0.0002909021,0.0002834086,0.00005543198],"category_scores_gemma":[0.00003121732,0.0003192465,0.0003305558,0.0002729842,0.0001271615,0.000003464306,0.0006069219,0.0001886037,0.00000389475],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001313105,"about_ca_system_score_gemma":0.00003979827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000745569,"about_ca_topic_score_gemma":0.00001037488,"domain_scores_codex":[0.9982862,0.00003631175,0.000622612,0.0006336694,0.0001795842,0.0002415956],"domain_scores_gemma":[0.9981759,0.00002990686,0.0005982501,0.0009256021,0.0001505106,0.0001198533],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001300055,0.007281496,0.008586027,0.01666132,0.09429369,0.0001937569,0.02095393,0.01252142,0.5960395,0.03327396,0.01107906,0.1989858],"study_design_scores_gemma":[0.006177031,0.001646798,0.002229593,0.001140071,0.06051506,0.0009018341,0.01186841,0.5334225,0.226988,0.08087213,0.06078034,0.01345825],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1978086,0.003607579,0.7903875,0.00006753385,0.00006294441,0.002035926,0.002175587,0.00004657413,0.003807756],"genre_scores_gemma":[0.8742527,0.002396971,0.1153653,0.00005477944,0.0002765611,0.001365555,0.004520497,0.000139695,0.001627972],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6764441,"threshold_uncertainty_score":0.999926,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003275652,0.00007476689,0.0001277589,0.00004116322,0.00009260479,0.0000517755,0.0002910685,0.00002854654,0.00001473207],"category_scores_gemma":[0.00003677921,0.00004815749,0.00003253366,0.0002031863,0.00008844911,0.0001744693,0.0001459281,0.00003036193,0.000009720791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001209594,"about_ca_system_score_gemma":0.00002969514,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006912969,"about_ca_topic_score_gemma":0.000001943786,"domain_scores_codex":[0.9992371,0.000017603,0.0002441465,0.0002005559,0.0001721794,0.0001284011],"domain_scores_gemma":[0.9990973,0.0001617225,0.00009689214,0.0004438271,0.0001251556,0.00007510879],"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":[3.157879e-7,0.00008392341,0.0001271409,0.00006634635,0.00001162505,1.179558e-7,0.0004410554,0.00007451194,0.002058882,0.9228118,0.00003711058,0.07428715],"study_design_scores_gemma":[0.0008613114,0.00009379853,0.001249499,0.0001525076,0.00001957505,0.00001295737,0.000262942,0.4682737,0.007583247,0.514999,0.005977941,0.0005134973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005758817,0.00003875418,0.9963635,0.0008971937,0.00001277953,0.0002789294,0.00001361058,0.0000529419,0.00176646],"genre_scores_gemma":[0.1932488,0.0001505481,0.8057599,0.00004267706,0.00003604868,0.0002061429,0.000003950719,0.00001325324,0.0005387215],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4681992,"threshold_uncertainty_score":0.1963806,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002841443,0.0001152194,0.000120538,0.00006903502,0.0002458951,0.0001999883,0.0003035093,0.00005222938,0.00002124665],"category_scores_gemma":[0.00002732807,0.0001012684,0.0000406601,0.0003382391,0.0000476299,0.0002091689,0.0001367026,0.0001380076,0.00003263471],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007358518,"about_ca_system_score_gemma":0.00003650037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007178097,"about_ca_topic_score_gemma":0.000009239053,"domain_scores_codex":[0.9991112,0.0000108817,0.0002307217,0.0003209178,0.0001803178,0.0001459459],"domain_scores_gemma":[0.9990916,0.0001157546,0.00008532337,0.0005014074,0.0001000109,0.0001059178],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[3.891553e-7,0.0001238081,0.00004176372,0.00003450719,0.0000107279,4.669874e-7,0.0003005601,0.0000670241,0.002886262,0.8173957,0.00008983201,0.1790489],"study_design_scores_gemma":[0.0002393601,0.00003291949,0.001811599,0.000006998482,0.00001464242,0.00003653404,0.00004099939,0.7629975,0.001403268,0.199728,0.03340842,0.000279777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01351867,0.00004068669,0.9830445,0.0005758885,0.00007572449,0.0003504037,0.00001125082,0.0001047889,0.002278081],"genre_scores_gemma":[0.2536597,0.00001576317,0.745465,0.0001111538,0.0002119674,0.0002171522,0.00003087345,0.000009643333,0.0002787824],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7629305,"threshold_uncertainty_score":0.4129606,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000365844,0.0002063513,0.0004143501,0.000297692,0.000167441,0.00005635069,0.0002407446,0.0001287559,0.00005546997],"category_scores_gemma":[0.0001369798,0.0001809243,0.00008022162,0.0008257772,0.0001481347,0.00006308732,0.0001484362,0.0001869518,0.00001348108],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004008066,"about_ca_system_score_gemma":0.00004243111,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005162207,"about_ca_topic_score_gemma":0.00004330926,"domain_scores_codex":[0.9986317,0.00003513109,0.0005332937,0.0003411993,0.0001463819,0.0003122877],"domain_scores_gemma":[0.9988593,0.0004324323,0.0001323698,0.0004475954,0.00005261514,0.00007570037],"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.000001907976,0.0002734833,0.0002437882,0.0001802215,0.00002877405,0.000001233023,0.0002922942,0.000002630039,0.00004105669,0.9923785,0.0003042847,0.006251764],"study_design_scores_gemma":[0.0007007495,0.00002208647,0.0008182372,0.00005062049,0.00006370321,0.000008095884,0.0007556475,0.01076573,0.0001132963,0.9835097,0.002979251,0.0002129337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1410677,0.0007412268,0.8390985,0.00169603,0.00008941293,0.001379853,0.00005279253,0.0001712395,0.01570329],"genre_scores_gemma":[0.6880594,0.0004087393,0.3039329,0.0004188855,0.000168165,0.001523686,0.00005552575,0.00005936049,0.005373292],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5469917,"threshold_uncertainty_score":0.7377877,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000280638,0.00009617078,0.0001090809,0.00008654004,0.0001053869,0.00004086925,0.0003978752,0.00004365951,0.00004445707],"category_scores_gemma":[0.00002345198,0.00007230155,0.0000394226,0.0003972902,0.0001131176,0.0001748898,0.00007065054,0.00008853265,0.000009345516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008386114,"about_ca_system_score_gemma":0.00002041963,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001336526,"about_ca_topic_score_gemma":0.000006274508,"domain_scores_codex":[0.9992152,0.00002387351,0.0002707719,0.0002174883,0.0001684224,0.0001041714],"domain_scores_gemma":[0.9990017,0.0001384957,0.0001534896,0.0006053434,0.0000626216,0.00003839544],"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.000001106906,0.0001523324,0.00002839278,0.00001735487,0.00000746432,1.599198e-7,0.003487807,9.363334e-7,0.0001498258,0.995276,0.00004895056,0.0008296208],"study_design_scores_gemma":[0.0001468749,0.00004010419,0.006756337,0.00003554365,0.00001028215,0.000002994004,0.0007798859,0.00946167,0.001080994,0.9808335,0.0007133932,0.0001383943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0175364,0.00006453048,0.9772968,0.000436676,0.00002048915,0.0004972252,0.00009953573,0.0000360817,0.004012304],"genre_scores_gemma":[0.9194911,0.00003153997,0.08001153,0.00006934507,0.000008715733,0.0003268351,0.00004495258,0.000006856674,0.000009150104],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9019547,"threshold_uncertainty_score":0.2948372,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001933854,0.000113751,0.0002075693,0.00005648724,0.000134481,0.00007674337,0.0004076709,0.00003706571,0.00002795418],"category_scores_gemma":[0.00002766645,0.0001023263,0.00006652981,0.0005602622,0.0001383705,0.0002422597,0.0002729587,0.00009163193,0.00002606893],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008803167,"about_ca_system_score_gemma":0.00004502753,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000209942,"about_ca_topic_score_gemma":6.192844e-7,"domain_scores_codex":[0.9989445,0.00002716413,0.0002894611,0.0002783639,0.0002627037,0.0001978135],"domain_scores_gemma":[0.9987302,0.0001791132,0.0001117299,0.0007359707,0.0001433184,0.00009966885],"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":[2.212749e-7,0.0000866849,0.00002322318,0.0001142418,0.00002155591,0.000001951044,0.0003154899,0.000004536271,0.001175604,0.9915662,0.0000150962,0.006675134],"study_design_scores_gemma":[0.000148851,0.00001058565,0.0001092999,0.00003056755,0.00001043477,0.00003462597,0.0002414552,0.03207503,0.003962375,0.9625081,0.0007386177,0.0001300069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01258414,0.0003813101,0.9844128,0.0003224067,0.00001781593,0.0003130986,0.00003239393,0.00006597718,0.00187002],"genre_scores_gemma":[0.07489776,0.0002944163,0.9239158,0.00006506065,0.00003547123,0.0003012096,0.00001931328,0.00002292339,0.0004480713],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.06231362,"threshold_uncertainty_score":0.4172745,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001528199,0.00009959205,0.000111631,0.00005357277,0.0004618964,0.0001337176,0.0003335954,0.00002009685,0.00002284627],"category_scores_gemma":[0.00001176259,0.00009036907,0.00002477151,0.0001997197,0.0000704105,0.00008068725,0.0003738274,0.0001233005,0.00002308597],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001940474,"about_ca_system_score_gemma":0.00001588478,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001020569,"about_ca_topic_score_gemma":0.000001361049,"domain_scores_codex":[0.9991723,0.00001721546,0.0001887598,0.0002832292,0.0001950868,0.0001434603],"domain_scores_gemma":[0.9993011,0.0001401298,0.00007253066,0.0003922459,0.00002531374,0.00006863393],"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":[6.21119e-7,0.00009030051,0.0000570347,0.00001659598,0.000008137851,0.000001512603,0.00168818,0.0001866144,0.0001780685,0.895481,0.0001174786,0.1021745],"study_design_scores_gemma":[0.0001153968,0.0001367888,0.0003513531,0.00001220485,0.00001532135,0.00005138974,0.001030265,0.6540614,0.0007469358,0.2972837,0.04585053,0.0003447154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006677023,0.0001257415,0.9888294,0.00134763,0.00004293167,0.0004023816,0.00002254752,0.00008724552,0.002465108],"genre_scores_gemma":[0.653558,0.00009817679,0.3430039,0.0007269867,0.0001200899,0.001409118,0.00001281743,0.00003120253,0.001039727],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6538748,"threshold_uncertainty_score":0.3685144,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005000345,0.0002365591,0.0003107353,0.0001128102,0.0004902628,0.0003562445,0.0007069177,0.00006900313,0.000001176322],"category_scores_gemma":[0.00005263829,0.0002008025,0.00007156573,0.0005021119,0.00006348473,0.00009743735,0.0003905207,0.0001983055,0.00002315866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001550537,"about_ca_system_score_gemma":0.0000243562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001865664,"about_ca_topic_score_gemma":9.013595e-7,"domain_scores_codex":[0.9984174,0.00004567032,0.0003455649,0.0005553932,0.0002817543,0.0003541735],"domain_scores_gemma":[0.9986134,0.0002509594,0.0001413723,0.0006693195,0.0000873147,0.0002377006],"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":[7.817023e-7,0.0001617854,0.000009667859,0.00007158877,0.0000162943,2.662711e-7,0.001561136,0.000929149,0.00007814797,0.8893386,0.0001176899,0.1077149],"study_design_scores_gemma":[0.000199562,0.00005861071,0.00005150462,0.00002692781,0.00001075401,0.00003567971,0.0002045461,0.8789756,0.0001029982,0.1142889,0.005782882,0.0002620702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005435371,0.00003873204,0.989799,0.0004821965,0.0001960248,0.0005388721,0.00001004403,0.0002723842,0.003227417],"genre_scores_gemma":[0.3745514,0.00000412409,0.6244136,0.0002064332,0.000418294,0.0002990603,0.00001277736,0.00003041018,0.00006384843],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8780464,"threshold_uncertainty_score":0.8188487,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002900283,0.0001859327,0.0002349801,0.0001716296,0.0004673219,0.0002455421,0.0006655311,0.00007368741,0.000002124323],"category_scores_gemma":[0.00003110495,0.0001666506,0.00009733131,0.0005217299,0.0000939673,0.0001508131,0.0003178912,0.0000997079,0.000004906829],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000146411,"about_ca_system_score_gemma":0.00004502887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001195488,"about_ca_topic_score_gemma":0.000002508679,"domain_scores_codex":[0.9987344,0.00001075353,0.000363129,0.0004439128,0.0001552583,0.0002925993],"domain_scores_gemma":[0.9985808,0.0002045877,0.0001558295,0.0008066898,0.0001477541,0.0001043782],"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":[2.984603e-7,0.00006709029,0.000008369218,0.00006445141,0.00003093628,1.963832e-7,0.0001290367,0.00001289726,0.0001108854,0.8926497,0.0005784447,0.1063477],"study_design_scores_gemma":[0.0004321993,0.00002731886,0.00002984661,0.00004615148,0.00003494001,0.000002758702,0.0001393784,0.3709751,0.0005379954,0.6218482,0.005753817,0.0001723108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003298596,0.0005097233,0.9950845,0.0007325851,0.0001103395,0.0008930393,0.00006735729,0.0001877236,0.002084912],"genre_scores_gemma":[0.005129413,0.00006873118,0.9921595,0.0001560978,0.00002258536,0.001473082,0.00002372528,0.00001722649,0.0009496641],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3709622,"threshold_uncertainty_score":0.6795813,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001044906,0.0002028487,0.0002363114,0.00003802129,0.0001519559,0.0001896024,0.0001424213,0.00006498585,0.00001817497],"category_scores_gemma":[0.000005089623,0.0001709751,0.00004266883,0.0001734579,0.0001280313,0.0001255496,0.00003202158,0.0001187988,0.000009143766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001003307,"about_ca_system_score_gemma":0.000009344921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009435415,"about_ca_topic_score_gemma":0.000008856448,"domain_scores_codex":[0.9991707,0.00001448128,0.0002162793,0.0002463378,0.0001383377,0.0002139273],"domain_scores_gemma":[0.9994626,0.00004586984,0.00005309334,0.0002155799,0.00002947259,0.0001933882],"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.00001716153,0.0001999777,0.001304712,0.006478982,0.001099929,0.00003759116,0.07859719,0.001587561,0.03041182,0.8222637,0.00414401,0.05385736],"study_design_scores_gemma":[0.001435303,0.0003965534,0.0003875407,0.0003642581,0.0004319694,0.0001280652,0.04352093,0.6434487,0.004950806,0.1985098,0.1038571,0.002568964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3613275,0.004029765,0.6049246,0.01306032,0.0002420357,0.003708082,0.001864873,0.001397884,0.00944499],"genre_scores_gemma":[0.9914708,0.0001760905,0.007528611,0.0001401206,0.0001597453,0.0003348748,0.0000410827,0.0000368829,0.000111755],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6418611,"threshold_uncertainty_score":0.6972164,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001191061,0.0001153844,0.0001599755,0.0001263101,0.0001005594,0.00002976476,0.00007567538,0.00004301432,0.00002622642],"category_scores_gemma":[0.00001062698,0.00009542586,0.00002640762,0.0005825695,0.00009574247,0.00006566672,0.0000162617,0.00007056129,0.000009466941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008144669,"about_ca_system_score_gemma":0.00002020897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004267591,"about_ca_topic_score_gemma":0.00001036994,"domain_scores_codex":[0.9993936,0.00001205366,0.0002811345,0.0001204299,0.00009682269,0.00009597137],"domain_scores_gemma":[0.999496,0.0001018967,0.00006512763,0.0002163124,0.00008175668,0.00003884367],"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.000003231562,0.00003174221,0.0008714896,0.0004080021,0.0001061721,1.468275e-7,0.0007963456,0.004514427,0.0007582295,0.9901113,0.0001277584,0.00227119],"study_design_scores_gemma":[0.001514418,0.0000957938,0.004586031,0.000835707,0.0003781025,0.00001123623,0.003579671,0.5175354,0.002520107,0.4572801,0.01096064,0.0007028221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1402802,0.0006549286,0.8299098,0.0001506189,0.00003569558,0.001062504,0.000113519,0.0002320561,0.0275607],"genre_scores_gemma":[0.9513159,0.00001998206,0.04699387,0.00001394542,0.00002548896,0.0005056733,0.00009100416,0.00002317662,0.001010907],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8110358,"threshold_uncertainty_score":0.3891354,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004640619,0.0005254957,0.000642759,0.0002310942,0.0004394673,0.0005831787,0.002044693,0.0002585558,0.000006264831],"category_scores_gemma":[0.00006179031,0.00050187,0.0003044945,0.0005296911,0.0002533065,0.0002116928,0.002056587,0.0007178838,0.00001887533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000607911,"about_ca_system_score_gemma":0.0001500509,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006574005,"about_ca_topic_score_gemma":0.000003152864,"domain_scores_codex":[0.9968832,0.00004582119,0.0006487759,0.001309072,0.0005122508,0.0006008691],"domain_scores_gemma":[0.9969756,0.0004054121,0.0003834075,0.001591597,0.0002686926,0.0003753067],"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.000004254602,0.0001461393,0.000003462847,0.0007891359,0.0001651257,0.000002701128,0.0008603835,0.0005046601,0.0002579777,0.9368783,0.0001700583,0.06021785],"study_design_scores_gemma":[0.0002097214,0.00004259488,0.000012208,0.00004787492,0.00003408545,0.000006545038,0.0001269721,0.4697146,0.00008557456,0.5269045,0.002477861,0.0003375483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001580919,0.0006642891,0.9925875,0.001592875,0.0001094843,0.003206408,0.0008190708,0.0003357889,0.000526487],"genre_scores_gemma":[0.008769057,0.0004365107,0.9838546,0.00007989123,0.0001881255,0.005875397,0.0003848057,0.0001005654,0.0003110753],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4692099,"threshold_uncertainty_score":0.9997433,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002142363,0.0001870524,0.000253014,0.00004861193,0.0001009177,0.00008034346,0.0002529286,0.00008080621,0.000006099821],"category_scores_gemma":[0.00001079852,0.0001890614,0.00001883662,0.0002391277,0.00003753794,0.0005136575,0.0001254791,0.0001351607,0.00001156464],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000477196,"about_ca_system_score_gemma":0.000005169205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001126993,"about_ca_topic_score_gemma":0.000003572767,"domain_scores_codex":[0.9988893,0.0000131153,0.0003872079,0.0002348709,0.0001351751,0.0003403213],"domain_scores_gemma":[0.9990993,0.0001045948,0.00008557379,0.000592388,0.00002335404,0.0000947524],"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.000002133931,0.0001995558,0.0004918331,0.0008094679,0.00009328487,5.360952e-7,0.002123838,0.9372259,0.0009116852,0.04452245,0.001060886,0.01255837],"study_design_scores_gemma":[0.0002028396,0.000003036459,0.00003253939,0.00008968621,0.00001886026,0.000003585539,0.0005433572,0.994253,0.0000965635,0.0003966055,0.004120215,0.0002396628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002347843,0.004620809,0.9906779,0.00002813974,0.000088344,0.0006224181,0.0001317448,0.0001905323,0.001292248],"genre_scores_gemma":[0.6582942,0.002862449,0.3363439,0.00003621527,0.0003903352,0.0008056202,0.001038042,0.0001344377,0.00009481201],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6559464,"threshold_uncertainty_score":0.77097,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004216637,0.0002629703,0.000393749,0.0003259187,0.0002570746,0.0004466568,0.000432619,0.0001798762,0.000002948524],"category_scores_gemma":[0.00003257464,0.000240728,0.0000977664,0.0003756056,0.00005508315,0.0001227882,0.0005552912,0.0002090472,0.000005001261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001669363,"about_ca_system_score_gemma":0.00006882058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001050055,"about_ca_topic_score_gemma":0.000002600362,"domain_scores_codex":[0.9985029,0.00001742652,0.0003923945,0.0006300543,0.0002464077,0.0002108835],"domain_scores_gemma":[0.9984169,0.0004850107,0.0002566549,0.000583288,0.0001401925,0.0001179642],"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.00001102152,0.0002228212,0.0001296867,0.001540997,0.000199295,7.75472e-7,0.0007116849,0.005330939,0.0000572139,0.9050764,0.001286301,0.0854328],"study_design_scores_gemma":[0.0007911392,0.00004736272,0.0003322949,0.00005312915,0.00007035595,0.00001774139,0.00004042498,0.5912514,0.0001039018,0.4002019,0.006706977,0.0003834169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002670851,0.001290804,0.992562,0.0005253331,0.0001474745,0.001941821,0.000345321,0.00008533328,0.0004310659],"genre_scores_gemma":[0.1560119,0.001289949,0.837437,0.0002284464,0.0003849265,0.002634922,0.001337713,0.0000477004,0.0006274675],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5859204,"threshold_uncertainty_score":0.9816601,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002148829,0.0001103127,0.0001509584,0.00003835753,0.0006556521,0.00060187,0.0008351161,0.00003580199,0.000008298946],"category_scores_gemma":[0.0000232959,0.00008689858,0.00005249889,0.00005552861,0.0001112506,0.0002624094,0.0002796806,0.00006209942,0.00002781127],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003940755,"about_ca_system_score_gemma":0.000009135979,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001453609,"about_ca_topic_score_gemma":0.000001747555,"domain_scores_codex":[0.9993213,0.000008503267,0.0001574629,0.0002361811,0.0001231558,0.0001533689],"domain_scores_gemma":[0.9985964,0.00008081406,0.0001487456,0.00106591,0.0000300393,0.00007813194],"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":[3.921441e-7,0.00003949395,0.00002628636,0.00002706211,0.00001619133,0.000001805761,0.0003818465,0.000002019255,0.0002171429,0.9143157,0.0001277162,0.08484434],"study_design_scores_gemma":[0.001160432,0.00002902084,0.001787556,0.00006387875,0.00003912311,0.0000493446,0.0006632204,0.1700373,0.001417905,0.8103523,0.01388737,0.0005125104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00142363,0.0002743199,0.9867909,0.0008550587,0.00002876998,0.0002715638,0.0000161051,0.0001284768,0.0102112],"genre_scores_gemma":[0.4111644,0.0003293136,0.5861236,0.0002349271,0.0002695318,0.0005701734,0.00001763885,0.00003157485,0.001258811],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4097408,"threshold_uncertainty_score":0.5803847,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005054962,0.0002191064,0.0001883531,0.0001348448,0.0004660566,0.0005592877,0.000230263,0.00005488799,0.0001459379],"category_scores_gemma":[0.00004075562,0.0001544621,0.00009856066,0.0005503683,0.00009293223,0.0002876195,0.00008157573,0.00009730117,0.0004671837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003031572,"about_ca_system_score_gemma":0.00002182746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001575222,"about_ca_topic_score_gemma":0.00003686494,"domain_scores_codex":[0.9987626,0.000006617479,0.0003810704,0.000407851,0.000213611,0.0002282271],"domain_scores_gemma":[0.9991658,0.0001881609,0.00006376451,0.0004033938,0.0001570824,0.00002174459],"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.000009919202,0.0003173435,0.000007169471,0.001293209,0.0002328593,5.262742e-7,0.0003825118,0.001215774,0.0001666632,0.1552312,0.02696546,0.8141774],"study_design_scores_gemma":[0.0001609213,0.00001155205,0.0001237458,0.00004401133,0.0001125755,6.317162e-7,0.0003479024,0.7199969,0.00001622954,0.004807006,0.2741992,0.0001793146],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006762256,0.0005007724,0.9829172,0.006258891,0.0001716055,0.003628667,0.0002185835,0.0004579717,0.005170104],"genre_scores_gemma":[0.7227977,0.001118369,0.1650994,0.007412682,0.01015378,0.0465671,0.006228354,0.0005359747,0.04008659],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8178177,"threshold_uncertainty_score":0.629878,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002292082,0.00008194146,0.0001467028,0.0001091335,0.0001292023,0.00002805073,0.0004848799,0.00003034319,0.000002194055],"category_scores_gemma":[0.000023851,0.00005598946,0.00005311225,0.001301308,0.0003732301,0.000155644,0.0002091911,0.00006738598,0.000001432744],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004761664,"about_ca_system_score_gemma":0.00003360879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002337855,"about_ca_topic_score_gemma":7.873605e-7,"domain_scores_codex":[0.9991788,0.00002835857,0.0002403473,0.0001834173,0.0002393,0.000129808],"domain_scores_gemma":[0.9990498,0.0001175621,0.0002180807,0.0004473142,0.0001318764,0.00003541033],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[9.543393e-7,0.00003858108,0.000271808,0.0001415956,0.00002737942,1.740819e-7,0.001499013,0.00002169231,0.02593561,0.9570908,0.000002715951,0.01496965],"study_design_scores_gemma":[0.0002299299,0.0000501049,0.00495459,0.0001144423,0.00002174773,0.0000115315,0.0009734028,0.1314423,0.05872253,0.8029712,0.0003134006,0.0001947105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08894788,0.00002721163,0.9092399,0.0003935073,0.00002882121,0.0008333319,0.00009570624,0.00004840824,0.0003852411],"genre_scores_gemma":[0.9589267,0.00006864913,0.04031812,0.00001430734,0.00002736823,0.0004498245,0.00001729987,0.00001376884,0.0001640028],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8699788,"threshold_uncertainty_score":0.2283184,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006469968,0.0003849937,0.0004707283,0.00015409,0.0008870319,0.001176271,0.001701993,0.0001363793,0.000004500941],"category_scores_gemma":[0.00004112982,0.0003003103,0.000108586,0.0001460218,0.0002603701,0.0002787833,0.00251877,0.0006790948,0.00001461764],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004508491,"about_ca_system_score_gemma":0.0001034748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002322891,"about_ca_topic_score_gemma":0.000007271339,"domain_scores_codex":[0.9978509,0.00004615641,0.0003672572,0.0008576325,0.000467839,0.0004102188],"domain_scores_gemma":[0.9966869,0.0002651374,0.0004999924,0.00219459,0.0001608162,0.0001925427],"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.000003682919,0.0001487987,0.00003328166,0.001002692,0.0001352629,0.00001616625,0.004008755,0.0006385545,0.000130089,0.8490044,0.00001998971,0.1448584],"study_design_scores_gemma":[0.0002363476,0.00003759398,0.0001053919,0.0004173687,0.00003664054,0.00005306437,0.0003088342,0.2120875,0.0001557485,0.7857516,0.000324371,0.0004855118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002795461,0.0002911268,0.9912995,0.0005895575,0.00003565671,0.001328108,0.00007375944,0.0001734955,0.003413376],"genre_scores_gemma":[0.110879,0.0001600578,0.8864039,0.0000261856,0.000112794,0.001966528,0.00004828903,0.00006488118,0.0003384294],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.211449,"threshold_uncertainty_score":0.9999449,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006207136,0.0001453949,0.0002052835,0.00007690226,0.0008900644,0.0001406484,0.001004188,0.00002703532,0.000009612698],"category_scores_gemma":[0.00001203336,0.000105813,0.00007534073,0.0004175532,0.00008646327,0.0001921147,0.0003238594,0.0001168669,8.164276e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002310834,"about_ca_system_score_gemma":0.00007279421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001689008,"about_ca_topic_score_gemma":0.000001527575,"domain_scores_codex":[0.9987124,0.00004653872,0.0003694791,0.0003436035,0.00032632,0.0002016995],"domain_scores_gemma":[0.9983282,0.0003569816,0.0002733135,0.0008648288,0.00009563014,0.00008102084],"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.000002190082,0.0002930966,0.000008526639,0.00004709057,0.00002005701,5.772794e-7,0.0007747479,0.0005529067,0.000313246,0.2765546,0.0002241163,0.7212089],"study_design_scores_gemma":[0.0003224835,0.0001058918,0.0000241158,0.00001194741,0.00001642548,0.0000082185,0.0005940492,0.946375,0.0005243351,0.03061209,0.02126016,0.0001452442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003476669,0.0003224738,0.9974496,0.0003442902,0.000047166,0.0008989818,0.000406651,0.00006486847,0.0001183172],"genre_scores_gemma":[0.01748271,0.00002873592,0.9801235,0.0001541954,0.00007044362,0.001980957,0.0001031642,0.0000203628,0.00003599034],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9458221,"threshold_uncertainty_score":0.6845745,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002852314,0.0001293323,0.0001466909,0.00003796216,0.0001001901,0.0001527953,0.00008693524,0.00006154288,0.00002199355],"category_scores_gemma":[0.0000268372,0.000109482,0.00005183328,0.0001768556,0.0001230519,0.00004705038,0.00002236557,0.00008968273,0.00001179214],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001991954,"about_ca_system_score_gemma":0.00001433887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.487228e-7,"about_ca_topic_score_gemma":8.856168e-8,"domain_scores_codex":[0.9993101,0.00000968857,0.0002400116,0.0001789959,0.00009404349,0.000167097],"domain_scores_gemma":[0.999392,0.0002914301,0.00001676127,0.0001885964,0.00003733073,0.00007392971],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[3.749764e-7,0.00001184099,6.188744e-7,0.0003631625,0.00003161716,3.351944e-7,0.000264073,0.002474173,0.0004245486,0.974249,0.00007955426,0.02210069],"study_design_scores_gemma":[0.00008750162,0.00001026496,0.000001139702,0.00004826802,0.00004410609,0.000009298746,0.0001327612,0.8632871,0.0008133787,0.1282015,0.007231617,0.0001331371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000227787,0.0004343488,0.9920654,0.0002232404,0.00005616086,0.0008100977,0.0001140126,0.0004803873,0.005588577],"genre_scores_gemma":[0.08645752,0.0001130633,0.9124541,0.00002332067,0.0001483776,0.0005729045,0.00004473531,0.00007345762,0.0001124842],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8608129,"threshold_uncertainty_score":0.4464546,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}