{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":21,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":21,"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":"e3a4e7f163ff","filters":{"venue":"Journal of Graph Algorithms and Applications"}},"results":[{"id":"W2135989110","doi":"10.7155/jgaa.00079","title":"The Maximum Number of Edges in a Three-Dimensional Grid-Drawing","year":2004,"lang":"en","type":"article","venue":"Journal of Graph Algorithms and Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":28,"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":"Grid; Computer science; Geometry; Mathematics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01246872153428639,"gpt":0.260281488320772,"spread":0.2478127667864856,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003404918,0.00005818174,0.0001002008,0.0001109227,0.0001630843,0.00005023655,0.0002224245,0.00002467709,0.000001332399],"category_scores_gemma":[0.000011824,0.0000408712,0.00005791033,0.0005533536,0.00005526117,0.0001992807,0.00004683974,0.0001057185,0.000001326748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001443464,"about_ca_system_score_gemma":0.00009479914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001504011,"about_ca_topic_score_gemma":0.00001889956,"domain_scores_codex":[0.999271,0.00001460168,0.0003219874,0.0000941569,0.0002082852,0.00008991538],"domain_scores_gemma":[0.999337,0.0001176036,0.0001996428,0.0001130716,0.0001836192,0.00004912137],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001664144,0.0003511537,0.002607691,0.00001689035,0.00006349272,0.000008685356,0.0002983947,0.03381747,0.001398236,0.4080913,0.0002183284,0.5531117],"study_design_scores_gemma":[0.001188866,0.0001104581,0.04674628,0.00006546035,0.00001701443,0.0004419555,0.00006547011,0.01086989,0.001929151,0.930491,0.007909219,0.000165222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08126003,0.0009173566,0.9153892,0.002077716,0.0001536531,0.0001118927,0.000002418947,0.000005655723,0.00008207491],"genre_scores_gemma":[0.8338745,0.0002254172,0.1654234,0.0001167391,0.000313954,0.00002291186,0.000001879938,0.000005189007,0.00001599956],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7526145,"threshold_uncertainty_score":0.1666679,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2152845747","doi":"10.7155/jgaa.00435","title":"Egalitarian Graph Orientations","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Algorithms and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Bell (Canada)","funders":"","keywords":"Lexicographical order; Orientation (vector space); Graph; Directed graph; Vertex (graph theory); Computer science; Undirected graph; Combinatorics; Mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02522473167498975,"gpt":0.3344823475201323,"spread":0.3092576158451426,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004871361,0.00009730882,0.0001596848,0.000282199,0.001099559,0.0003825133,0.001225733,0.00003930173,0.000005707966],"category_scores_gemma":[0.00005052598,0.00008195489,0.0001158132,0.0003125527,0.0002835002,0.001024996,0.000163367,0.000227864,0.000004992747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000117559,"about_ca_system_score_gemma":0.00006017908,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001311732,"about_ca_topic_score_gemma":0.000006046513,"domain_scores_codex":[0.9989839,0.00003490411,0.0003068915,0.0001905607,0.000288262,0.0001954904],"domain_scores_gemma":[0.9982207,0.00009056003,0.0004111085,0.0007204066,0.0003433847,0.0002138069],"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.000004674278,0.00009050565,0.001266769,0.000006256256,0.00004600054,0.000009401562,0.0001830833,0.00002115986,0.0003960288,0.8598692,0.0003077472,0.1377992],"study_design_scores_gemma":[0.0006126417,0.0001325538,0.01937512,0.00001907265,0.00002074473,0.0001781915,0.0001529172,0.000680419,0.0003813041,0.9499973,0.02827923,0.0001705013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002845408,0.0004720643,0.9929913,0.002203152,0.0001306615,0.0001739883,0.000009114713,0.00001958716,0.001154752],"genre_scores_gemma":[0.5644418,0.001410312,0.4329495,0.0001957684,0.0004823866,0.000113332,0.000002770905,0.00002273355,0.0003813989],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5615964,"threshold_uncertainty_score":0.8457034,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2788640963","doi":"10.7155/jgaa.00602","title":"The Complexity of Drawing a Graph in a Polygonal Region","year":2022,"lang":"en","type":"article","venue":"Journal of Graph Algorithms and Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan; University of Waterloo","funders":"","keywords":"Computer science; Graph; Graph drawing; Combinatorics; Mathematics; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03062397399114286,"gpt":0.2644701421016975,"spread":0.2338461681105546,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004984949,0.0000503335,0.0001003105,0.0002386931,0.0004245384,0.00004293089,0.0003265543,0.00001132768,0.000001613955],"category_scores_gemma":[0.000008105781,0.00003981367,0.00007023916,0.000965064,0.0001063923,0.0001382192,0.0001029735,0.0001586777,9.990264e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001707494,"about_ca_system_score_gemma":0.00006989259,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001329021,"about_ca_topic_score_gemma":0.000005989343,"domain_scores_codex":[0.9991673,0.00006569354,0.0003300601,0.00009607867,0.0002543241,0.00008659373],"domain_scores_gemma":[0.9993271,0.0001161171,0.000280704,0.000123641,0.0001105754,0.00004188304],"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.0000218579,0.000244145,0.0009835538,0.000008753223,0.00003554663,0.000006549523,0.0005520881,0.006733113,0.0007188199,0.7609088,0.0004600635,0.2293267],"study_design_scores_gemma":[0.001039561,0.0003642103,0.05093658,0.00001926502,0.0000190167,0.0007452561,0.0006040598,0.0625108,0.0003368673,0.8531887,0.03004325,0.0001924494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03060947,0.001547998,0.9640176,0.003463601,0.000113779,0.0001512112,0.000004438568,0.00000625631,0.00008561111],"genre_scores_gemma":[0.9767386,0.0001802174,0.02284605,0.00009507385,0.00007683926,0.00003726815,0.000001945741,0.000002714037,0.00002125064],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9461291,"threshold_uncertainty_score":0.3265249,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2953333724","doi":"10.7155/jgaa.00474","title":"Experimental Analysis of the Accessibility of Drawings with Few Segments","year":2018,"lang":"en","type":"article","venue":"Journal of Graph Algorithms and Applications","topic":"Data Visualization and Analytics","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":"University of Waterloo","funders":"Deutsche Forschungsgemeinschaft; Netherlands eScience Center","keywords":"Computer science; Line drawings; Graph drawing; Line segment; Graph; Dense graph; Shortest path problem; Theoretical computer science; Combinatorics; Line graph; Artificial intelligence; Mathematics; Pathwidth; Engineering drawing","retraction":null,"screen_n_in":null,"score":{"opus":0.01542996390512583,"gpt":0.3150062101701762,"spread":0.2995762462650504,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001908456,0.00005260463,0.0001643322,0.0001658724,0.00009535546,0.00003974829,0.0004638029,0.00001652012,0.000008836145],"category_scores_gemma":[0.000004905426,0.00003088824,0.00009030785,0.001525734,0.0001955807,0.0002178921,0.00008972471,0.00004162988,1.494141e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007103261,"about_ca_system_score_gemma":0.00003842561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009924774,"about_ca_topic_score_gemma":0.000003321979,"domain_scores_codex":[0.9992776,0.00002058772,0.0003102662,0.0001014933,0.0002327784,0.00005730727],"domain_scores_gemma":[0.9988845,0.00002071789,0.0004848896,0.0002804497,0.0002810066,0.00004842147],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0001049938,0.006107617,0.4849109,0.000167899,0.00735759,0.000003840308,0.01038264,0.0006448926,0.07859538,0.2409512,0.002193353,0.1685797],"study_design_scores_gemma":[0.002297614,0.001115281,0.6143963,0.000160751,0.001908065,0.00004762058,0.001840994,0.1279723,0.2375387,0.007428404,0.004800411,0.0004934886],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1421028,0.00009478046,0.8574259,0.0001300134,0.00002402957,0.00007750482,0.00001637426,0.000003668198,0.0001248718],"genre_scores_gemma":[0.9811734,0.00002079059,0.01869156,0.00006711493,0.00002516936,0.000002383958,0.000001393289,0.000001990437,0.00001619941],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8390706,"threshold_uncertainty_score":0.1259586,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2143613789","doi":"10.7155/jgaa.00123","title":"A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs","year":2006,"lang":"en","type":"article","venue":"Journal of Graph Algorithms and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Upper and lower bounds; Computer science; Combinatorics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0308941959470692,"gpt":0.2672424313698322,"spread":0.236348235422763,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007103269,0.0001107015,0.0002562966,0.0002424163,0.0002052783,0.00005431541,0.0005835504,0.00004607113,0.00000138011],"category_scores_gemma":[0.00003027841,0.00007106948,0.0001034563,0.001007095,0.000560808,0.0002535687,0.0001584029,0.0001771191,2.152889e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008014396,"about_ca_system_score_gemma":0.00008219625,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002192441,"about_ca_topic_score_gemma":0.00004325524,"domain_scores_codex":[0.9987127,0.0001140468,0.0005013942,0.0001662736,0.0003328841,0.0001727162],"domain_scores_gemma":[0.9984825,0.000134434,0.0004398192,0.0003444348,0.0005292341,0.0000695814],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0001299981,0.001645334,0.0887819,0.0004468693,0.0004199502,0.00000554017,0.001292345,0.0003937454,0.0930765,0.5739665,0.0006491138,0.2391922],"study_design_scores_gemma":[0.001374437,0.000417643,0.5477521,0.000242506,0.00006324208,0.0002291176,0.0002509118,0.005361307,0.02768563,0.4144632,0.001771362,0.0003884339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7562633,0.009481633,0.2328681,0.0004903417,0.00008389805,0.000622848,0.00005197734,0.00001406289,0.0001238382],"genre_scores_gemma":[0.9888309,0.0004295306,0.01059783,0.00002226147,0.00004100116,0.00002277704,5.989098e-7,0.000009234853,0.00004584802],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4589703,"threshold_uncertainty_score":0.289813,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2017228186","doi":"10.7155/jgaa.00317","title":"More on Generalized Jewels and the PointPlacement Problem","year":2014,"lang":"en","type":"article","venue":"Journal of Graph Algorithms and Applications","topic":"Computational Geometry and Mesh Generation","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":"University of Windsor","funders":"","keywords":"Point (geometry); Computer science; Mathematics; Calculus (dental); Geometry; Orthodontics; Medicine","retraction":null,"screen_n_in":null,"score":{"opus":0.007711995862403725,"gpt":0.243004400335888,"spread":0.2352924044734843,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005815713,0.00006823975,0.0001141609,0.0001054803,0.0002112433,0.0001139539,0.0001720809,0.00001950394,0.000001663529],"category_scores_gemma":[0.00001034506,0.00004149411,0.00004700693,0.0002343591,0.00006866129,0.0001204631,0.0000415917,0.00008688815,0.000001032144],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005963934,"about_ca_system_score_gemma":0.00001794296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002776146,"about_ca_topic_score_gemma":5.031055e-7,"domain_scores_codex":[0.9993401,0.00005287443,0.0002277614,0.0001158411,0.0001888005,0.00007466565],"domain_scores_gemma":[0.9993597,0.0001400931,0.0001791003,0.0001287546,0.0001242923,0.00006803811],"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.00001508289,0.0000487221,0.000030355,0.000005534932,0.00002635141,3.060381e-7,0.0001968119,0.001346063,0.0001523326,0.7602773,0.0006411132,0.23726],"study_design_scores_gemma":[0.005442839,0.0004972887,0.006416728,0.00004148719,0.00006617485,0.0002838606,0.0001112275,0.321752,0.0006177073,0.5228723,0.141616,0.0002824508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008551965,0.0004251464,0.9818769,0.008556876,0.00005332486,0.000203757,0.00000124329,0.000009238001,0.0003215666],"genre_scores_gemma":[0.6110532,0.001124603,0.3831038,0.00336629,0.0008912652,0.0001460691,0.000005597342,0.00001219426,0.0002970173],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6025012,"threshold_uncertainty_score":0.169208,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2012207201","doi":"10.7155/jgaa.00278","title":"Hamilton Cycles in Restricted and Incomplete Rotator Graphs","year":2012,"lang":"en","type":"article","venue":"Journal of Graph Algorithms and Applications","topic":"graph theory and CDMA systems","field":"Engineering","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 Victoria; Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Cayley graph; Indifference graph; Discrete mathematics; Graph; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.009693911016826953,"gpt":0.2227337202091065,"spread":0.2130398091922796,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002144552,0.00009667915,0.0001748143,0.0002989667,0.00006815074,0.00002458395,0.00007233753,0.00005178316,0.000002590551],"category_scores_gemma":[0.00000359914,0.0000839675,0.00004588272,0.0003923455,0.00005522911,0.0001891832,0.000008787249,0.0001643706,9.727308e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008641125,"about_ca_system_score_gemma":0.000003897231,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007682621,"about_ca_topic_score_gemma":0.000003699183,"domain_scores_codex":[0.9993461,0.00002604477,0.0003160065,0.00006133685,0.00008848917,0.000162022],"domain_scores_gemma":[0.9995989,0.00005485196,0.00008155995,0.00008891641,0.00003203967,0.0001438008],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0001447411,0.0009342634,0.3087265,0.0007652574,0.0007767946,0.00003424168,0.008216865,0.001720433,0.05441634,0.308274,0.002151962,0.3138386],"study_design_scores_gemma":[0.002467073,0.000221742,0.8379152,0.0002416496,0.0001370176,0.0008093358,0.002053397,0.003724523,0.001420228,0.08742472,0.06281607,0.000769049],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9872695,0.006767677,0.005325584,0.00002827061,0.00010478,0.0001704155,0.00001208313,0.00002677918,0.0002949584],"genre_scores_gemma":[0.9970627,0.001420961,0.001341264,0.00001239101,0.0001136345,0.0000313208,0.00000156062,0.00001194029,0.000004259557],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5291888,"threshold_uncertainty_score":0.3424095,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2296267519","doi":"10.7155/jgaa.00389","title":"Constructive algorithms for the partial directed weighted improper coloring problem","year":2016,"lang":"en","type":"article","venue":"Journal of Graph Algorithms and Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure; Polytechnique Montréal","funders":"","keywords":"Constructive; Computer science; Algorithm; Mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.0102101369849156,"gpt":0.2204246536533684,"spread":0.2102145166684528,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003243123,0.0001373187,0.0002110853,0.00009913633,0.0002431335,0.00004372605,0.0001667917,0.00006473838,0.0000106524],"category_scores_gemma":[0.000008153853,0.00007097385,0.0001292831,0.000242424,0.0001588128,0.000154695,0.00001400938,0.0001197356,0.000001951876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001982167,"about_ca_system_score_gemma":0.00002026016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003102212,"about_ca_topic_score_gemma":0.000001531548,"domain_scores_codex":[0.999141,0.00002440723,0.0003943216,0.0001176288,0.0001241835,0.0001984528],"domain_scores_gemma":[0.9991165,0.0002651333,0.0001517724,0.0001415021,0.0002224884,0.0001025665],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000184284,0.0001172778,0.0006156948,0.0001400418,0.001408211,0.00000400832,0.0008163939,0.000193721,0.04210555,0.07048226,0.002667268,0.8812653],"study_design_scores_gemma":[0.0106881,0.001157615,0.004705324,0.0006249718,0.001164074,0.00124443,0.002930593,0.04196304,0.06074493,0.1673033,0.7057846,0.001689104],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03845089,0.003076986,0.9545612,0.0005266541,0.001157359,0.001488832,0.0001559444,0.0001779155,0.0004042449],"genre_scores_gemma":[0.9807922,0.001329836,0.01524202,0.00002742189,0.001420421,0.000922662,0.000002871775,0.00005629208,0.000206306],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9423413,"threshold_uncertainty_score":0.2894229,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2764287401","doi":"10.7155/jgaa.00446","title":"Column planarity and partially-simultaneous geometric embedding","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Algorithms and Applications","topic":"Computational Geometry and Mesh Generation","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 British Columbia","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Planarity testing; Combinatorics; Mathematics; Planar graph; Embedding; Book embedding; Planar; Column (typography); Vertex (graph theory); Graph drawing; Plane (geometry); Graph; Discrete mathematics; Geometry; 1-planar graph; Computer science; Chordal graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01629659993087714,"gpt":0.2855024713249867,"spread":0.2692058713941096,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003260089,0.00007396716,0.0001351965,0.0002292026,0.0007187314,0.0005009294,0.0003373411,0.00003766407,0.000002115442],"category_scores_gemma":[0.00008602486,0.00006731212,0.00004186482,0.0002422592,0.00006730005,0.0004647282,0.0001012742,0.0001149672,0.00000115201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009203467,"about_ca_system_score_gemma":0.00004157607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001172315,"about_ca_topic_score_gemma":0.000006347817,"domain_scores_codex":[0.9992952,0.00001622099,0.0002423199,0.0001511828,0.0001871578,0.0001079167],"domain_scores_gemma":[0.9989119,0.0001612825,0.0003520327,0.000216737,0.0002227146,0.0001353859],"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.000007298583,0.0001201149,0.002017134,0.00001780759,0.00005848369,0.00002329541,0.000135209,0.003113769,0.0003440237,0.03156799,0.000472366,0.9621225],"study_design_scores_gemma":[0.002135664,0.0006007642,0.1029807,0.00006680109,0.0001185987,0.001600845,0.0001066918,0.6773815,0.001158203,0.1014828,0.1117217,0.0006457905],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03151438,0.0008467336,0.9663243,0.0009361251,0.0001200271,0.0001103322,0.000005274002,0.00001143291,0.0001313975],"genre_scores_gemma":[0.9143201,0.0005551637,0.08467938,0.00008553649,0.0002797386,0.000009863524,0.000001551729,0.000003623004,0.00006502982],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9614767,"threshold_uncertainty_score":0.5527973,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2465996091","doi":"10.7155/jgaa.00422","title":"Essential Constraints of Edge-Constrained Proximity Graphs","year":2017,"lang":"en","type":"article","venue":"Journal of Graph Algorithms and Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa; Carleton University","funders":"","keywords":"Enhanced Data Rates for GSM Evolution; Computer science; Mathematical optimization; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01392762366065157,"gpt":0.2715885875089789,"spread":0.2576609638483273,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003458139,0.00007999701,0.0001693096,0.0001834958,0.0003576855,0.0001456368,0.0004824419,0.00004017424,0.000006411549],"category_scores_gemma":[0.00003413761,0.00006997892,0.0001057343,0.0001765715,0.0003289061,0.0005205611,0.00007272723,0.0001065178,7.24102e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004925637,"about_ca_system_score_gemma":0.0001101792,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004101814,"about_ca_topic_score_gemma":0.000001414377,"domain_scores_codex":[0.9991695,0.0000206364,0.0003625567,0.000137118,0.0002124856,0.00009769607],"domain_scores_gemma":[0.9985176,0.00005542518,0.0006577861,0.0002782436,0.0003888227,0.0001021069],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007225144,0.0002133439,0.0008491873,0.00002485161,0.00008291045,0.000004772546,0.0001254762,0.0001100221,0.005561152,0.4139529,0.0001862404,0.5788819],"study_design_scores_gemma":[0.004145953,0.0006453803,0.1228877,0.0001538912,0.00018622,0.001189127,0.0002028042,0.02992963,0.02987981,0.8010637,0.009003391,0.0007123605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02936397,0.0002044301,0.9688674,0.0006864073,0.000169761,0.0001570915,0.00001140753,0.000008650388,0.0005309272],"genre_scores_gemma":[0.9025003,0.0001155062,0.09717043,0.00002871581,0.0001488047,0.000009447966,0.000001869667,0.000002807657,0.00002205406],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8731364,"threshold_uncertainty_score":0.2853657,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3211907390","doi":"10.7155/jgaa.00576","title":"Angle Covers: Algorithms and Complexity","year":2021,"lang":"en","type":"article","venue":"Journal of Graph Algorithms and Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"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":"Combinatorics; Mathematics; Planar graph; Graph; Vertex (graph theory); Vertex cover; Degree (music); Algorithm; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02983461209364489,"gpt":0.2734657704296886,"spread":0.2436311583360437,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002234002,0.00008408563,0.000150828,0.0001285706,0.0002194231,0.0001751849,0.0001544091,0.00003566607,0.000008330526],"category_scores_gemma":[0.0000152437,0.00007787636,0.00005984294,0.0005579159,0.00007267111,0.0003623547,0.00008906289,0.0001173451,0.000001671135],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000116664,"about_ca_system_score_gemma":0.00008788158,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004385966,"about_ca_topic_score_gemma":0.000002876114,"domain_scores_codex":[0.9992002,0.00003462326,0.0002682671,0.0001827631,0.0002068556,0.0001073281],"domain_scores_gemma":[0.9990894,0.00008817556,0.0001704747,0.000149907,0.0003637327,0.0001383242],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005718087,0.0003122598,0.000446623,0.00002492828,0.0001027028,0.00003466323,0.0003245682,0.0005288245,0.002650124,0.2983558,0.001911109,0.6953027],"study_design_scores_gemma":[0.002661713,0.0004698305,0.04560409,0.00007340033,0.0001165828,0.003807458,0.0005045311,0.1228318,0.006737076,0.5451717,0.2713182,0.0007035086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007418556,0.002578581,0.9878277,0.001700467,0.0001198148,0.00007933063,0.00001147189,0.00001470355,0.0002493897],"genre_scores_gemma":[0.1776646,0.002013515,0.818461,0.0008410865,0.0007065364,0.00002347746,0.00002255048,0.00001101583,0.0002561795],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6945992,"threshold_uncertainty_score":0.3175706,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1957290555","doi":"10.7155/jgaa.00396","title":"The (3,1)-ordering for 4-connected planar triangulations","year":2016,"lang":"en","type":"preprint","venue":"Journal of Graph Algorithms and Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"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":"Planar graph; Dual polyhedron; Planar; Rectangle; Combinatorics; Mathematical proof; Graph; Mathematics; First order; Computer science; Discrete mathematics; Geometry; Computer graphics (images)","retraction":null,"screen_n_in":null,"score":{"opus":0.01957954025613224,"gpt":0.2770090639574265,"spread":0.2574295237012943,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005112143,0.0001290615,0.0001869303,0.0002135724,0.0005541172,0.0002786452,0.0005333826,0.00008788109,9.649293e-7],"category_scores_gemma":[0.00005588021,0.00008306942,0.0001713503,0.0002575064,0.00004887762,0.0001519996,0.0001143163,0.0001867129,7.467685e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002269916,"about_ca_system_score_gemma":0.0001704192,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001552681,"about_ca_topic_score_gemma":0.000003090693,"domain_scores_codex":[0.9989281,0.00003540123,0.0004902908,0.0002078812,0.0001972096,0.0001411701],"domain_scores_gemma":[0.9978808,0.0006328199,0.0005763407,0.0002874153,0.0005310574,0.00009163179],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001528263,0.00006007389,0.00002135477,0.00003239397,0.0001780741,9.168406e-7,0.0001286565,0.001773664,0.0004143141,0.4058477,0.002573145,0.5889544],"study_design_scores_gemma":[0.0007360646,0.00009438396,0.001364084,0.00006806171,0.00006371178,0.00006676762,0.00003223873,0.03249265,0.0002512767,0.8097368,0.1548674,0.0002266093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000475399,0.002230723,0.9909776,0.005225892,0.0004548195,0.0004910323,0.00004149398,0.00002247961,0.00008049059],"genre_scores_gemma":[0.1283831,0.004357398,0.8586259,0.0004414695,0.005909659,0.001345637,0.00008831586,0.00005504038,0.0007933913],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5887278,"threshold_uncertainty_score":0.4261877,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4399371052","doi":"10.7155/jgaa.v28i2.2925","title":"Min-$k$-planar Drawings of Graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Algorithms and Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Planar; Combinatorics; Planar graph; Outerplanar graph; Computer science; Mathematics; Pathwidth; Graph; Computer graphics (images); Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.009399194379631248,"gpt":0.2529059861033371,"spread":0.2435067917237059,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002445902,0.00006374806,0.0001149838,0.0003658124,0.00007501679,0.00009353631,0.00020632,0.00002817612,0.000003485424],"category_scores_gemma":[0.000005570671,0.00005270534,0.00009338302,0.0008186364,0.00004129982,0.0002964184,0.00002114443,0.0000945628,0.000001918833],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006120028,"about_ca_system_score_gemma":0.00006362892,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003489091,"about_ca_topic_score_gemma":5.659882e-7,"domain_scores_codex":[0.9992983,0.00001371957,0.0003007244,0.0001194347,0.0001934963,0.00007433395],"domain_scores_gemma":[0.9994346,0.00009472003,0.0001233861,0.000106732,0.0001693734,0.00007114659],"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.000002199109,0.00007856644,0.00006498132,0.00004478105,0.00006652554,0.000007651134,0.0002578172,0.000227454,0.00333838,0.6068977,0.001884507,0.3871294],"study_design_scores_gemma":[0.0004541035,0.0004172765,0.003589377,0.0001403691,0.00009143779,0.0006107151,0.00009154688,0.04302519,0.004717084,0.7584658,0.1881123,0.0002847644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006438619,0.004047497,0.9879117,0.001071076,0.0001749111,0.00007830811,0.000006359784,0.00001822285,0.0002533193],"genre_scores_gemma":[0.7757661,0.001049808,0.2224858,0.0001340385,0.0003577258,0.00001899484,0.00000598478,0.000009051848,0.0001724977],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7693275,"threshold_uncertainty_score":0.2149261,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4399371091","doi":"10.7155/jgaa.v28i1.2929","title":"The Minimum Consistent Spanning Subset Problem on Trees","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Algorithms and Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"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":"Spanning tree; Combinatorics; Minimum spanning tree; Mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01845779344746803,"gpt":0.2757615769877305,"spread":0.2573037835402625,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004577346,0.00007270651,0.00008973263,0.0001362925,0.0003199307,0.0005185492,0.000317846,0.00002499371,0.000002597551],"category_scores_gemma":[0.000007930681,0.0000433052,0.00007845256,0.0004355265,0.0000814331,0.0001856677,0.00004412736,0.0001840775,0.000005996375],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001191843,"about_ca_system_score_gemma":0.00006705708,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001709759,"about_ca_topic_score_gemma":0.000002037867,"domain_scores_codex":[0.9992012,0.00003214039,0.0002736381,0.0001334943,0.0002254205,0.0001341204],"domain_scores_gemma":[0.9992882,0.0002122839,0.00009503124,0.000165128,0.0001360319,0.000103344],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000004571902,0.00008579106,0.00005450116,0.00002125364,0.00008532403,0.00001246162,0.0004916115,0.001107657,0.0002336825,0.5495132,0.007662926,0.440727],"study_design_scores_gemma":[0.0005018372,0.0005044496,0.00114116,0.0002059499,0.0000364785,0.000327669,0.0003625015,0.2160837,0.0002122391,0.0958059,0.6845638,0.0002542897],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004627982,0.003853628,0.9787018,0.01468783,0.0001733214,0.0002931781,0.000005785204,0.00005284314,0.001768807],"genre_scores_gemma":[0.5182654,0.01754501,0.4567111,0.001698184,0.001286442,0.0004146311,0.00001014997,0.00006597732,0.00400307],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6769009,"threshold_uncertainty_score":0.5000382,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4399370999","doi":"10.7155/jgaa.v28i1.2933","title":"Distance-Preserving Graph Compression Techniques","year":2024,"lang":"en","type":"article","venue":"Journal of Graph 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":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Compression (physics); Graph; Theoretical computer science; Materials science; Composite material","retraction":null,"screen_n_in":null,"score":{"opus":0.0124410541805225,"gpt":0.2754500346949486,"spread":0.2630089805144261,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003294052,0.0001431427,0.000201669,0.0003229775,0.0002522568,0.0004266799,0.0007515001,0.00006520752,0.000008870595],"category_scores_gemma":[0.000006625787,0.0001035427,0.0001258156,0.000700173,0.00007515244,0.0009956749,0.0002745465,0.0002951398,0.000002851051],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001607633,"about_ca_system_score_gemma":0.00004572243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001139432,"about_ca_topic_score_gemma":0.00000102936,"domain_scores_codex":[0.9987844,0.00003260363,0.0004135951,0.0002715961,0.0003196982,0.0001780663],"domain_scores_gemma":[0.9990243,0.00009524761,0.0001692194,0.0003930391,0.0001561891,0.0001620568],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000003660846,0.0000809899,0.00006683199,0.00005893923,0.00003724749,0.00002708703,0.0001422628,0.00001035816,0.0017859,0.07742018,0.008637824,0.9117287],"study_design_scores_gemma":[0.000256494,0.0001802594,0.001169336,0.0006501028,0.0000456393,0.0004390586,0.00009951044,0.04291753,0.002696195,0.214971,0.7362071,0.0003677314],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002153122,0.008483145,0.9891365,0.001004467,0.0002103638,0.0001608957,0.00001584769,0.000131409,0.0006420269],"genre_scores_gemma":[0.1158462,0.00761428,0.8745346,0.0002620434,0.001297054,0.0001347422,0.00001616629,0.00004194157,0.0002529436],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.911361,"threshold_uncertainty_score":0.4222351,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4415113082","doi":"10.7155/jgaa.v29i3.3003","title":"On k-planar Graphs without Short Cycles","year":2025,"lang":"en","type":"article","venue":"Journal of Graph 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 Ottawa; Carleton University","funders":"Hellenic Foundation for Research and Innovation; Austrian Science Fund; Deutsche Forschungsgemeinschaft","keywords":"Upper and lower bounds; Constant (computer programming); Girth (graph theory); Graph; Crossing number (knot theory); Plane (geometry)","retraction":null,"screen_n_in":null,"score":{"opus":0.01072175382599901,"gpt":0.2764378427179681,"spread":0.2657160888919691,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002124079,0.00007797143,0.0001229229,0.0004060239,0.0001873909,0.00009310677,0.0002533344,0.00003264262,0.000001707384],"category_scores_gemma":[0.000009526062,0.00006483437,0.00006987958,0.000682842,0.00003487911,0.0001751984,0.0000234117,0.0001159312,0.000001593851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001008981,"about_ca_system_score_gemma":0.0000539993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001878851,"about_ca_topic_score_gemma":0.000001333588,"domain_scores_codex":[0.9993216,0.00002048297,0.0002546829,0.000141602,0.000174075,0.00008754371],"domain_scores_gemma":[0.9994239,0.00009492293,0.00009286715,0.0001526934,0.00016623,0.00006937261],"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.000005419622,0.0001010594,0.0005523398,0.000006660233,0.00004367121,0.000001787666,0.00003155973,0.000616975,0.0004278,0.699899,0.001570291,0.2967435],"study_design_scores_gemma":[0.000604118,0.0002447029,0.03108805,0.00007075087,0.0000527985,0.0001159632,0.0000493383,0.01792371,0.001694693,0.9061792,0.04174485,0.0002317638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01328573,0.0005682578,0.9836309,0.00114776,0.0001375606,0.0001159239,0.000003059832,0.00001842028,0.001092368],"genre_scores_gemma":[0.8732596,0.0004894397,0.1249354,0.0008777279,0.0001639036,0.00003742961,0.000005395507,0.00000549671,0.0002255645],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8599739,"threshold_uncertainty_score":0.2643869,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2296012640","doi":"10.7155/jgaa.00355","title":"Point-Set Embedding in Three Dimensions","year":2015,"lang":"en","type":"article","venue":"Journal of Graph 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 Lethbridge","funders":"","keywords":"Combinatorics; Bounded function; Mathematics; Embedding; Grid; Minimum bounding box; Integer (computer science); Point (geometry); Graph; Discrete mathematics; Bounding overwatch; Geometry; Computer science; Mathematical analysis; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03025600381728446,"gpt":0.2937689850763611,"spread":0.2635129812590766,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004435249,0.0000628769,0.0001113344,0.0002954263,0.00007711392,0.00007074009,0.0001960663,0.00002793735,0.000001410439],"category_scores_gemma":[0.00002254648,0.00005421731,0.00004095955,0.0006537362,0.00002333471,0.0003827362,0.00005731428,0.0001136017,0.000002985076],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001915386,"about_ca_system_score_gemma":0.00007940496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007275025,"about_ca_topic_score_gemma":0.000009245802,"domain_scores_codex":[0.9992944,0.00002094964,0.0002799543,0.0001154648,0.0001925836,0.00009664261],"domain_scores_gemma":[0.9993122,0.00006702005,0.0001475933,0.0001228725,0.0002099989,0.0001403194],"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.00001759006,0.0004327728,0.003868781,0.00001538444,0.00006515967,0.00003536035,0.001353455,0.03882863,0.001227753,0.5937725,0.003388124,0.3569945],"study_design_scores_gemma":[0.001509743,0.0002720257,0.01285526,0.00004502016,0.00002182999,0.0005519129,0.0003079839,0.299625,0.0003491989,0.6604108,0.02377026,0.0002810177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03388457,0.000790633,0.9639457,0.001010406,0.0001118363,0.00009818311,0.000001993441,0.00001071467,0.0001459276],"genre_scores_gemma":[0.7110074,0.0001406775,0.2882988,0.0002152511,0.0002687012,0.00002326073,0.000003452693,0.000005649348,0.0000368227],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6771228,"threshold_uncertainty_score":0.2210918,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114909581","doi":"10.7155/jgaa.00256","title":"Minimizing the Number of Label Transitions Around a Nonseparating Vertex of a Planar Graph","year":2012,"lang":"en","type":"article","venue":"Journal of Graph 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":"Simon Fraser University","funders":"","keywords":"Planar straight-line graph; Planar graph; Combinatorics; Vertex (graph theory); Planar; Graph; Outerplanar graph; Computer science; Mathematics; 1-planar graph; Pathwidth; Line graph; Computer graphics (images)","retraction":null,"screen_n_in":null,"score":{"opus":0.02824495418211327,"gpt":0.3234862292229718,"spread":0.2952412750408586,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007182645,0.00009772216,0.0002226056,0.0001899062,0.0002373706,0.00003001208,0.0004887167,0.00003983051,0.00000385806],"category_scores_gemma":[0.00001954754,0.00006924185,0.0001310923,0.0009311523,0.0002667111,0.0004480588,0.0000392753,0.000222839,0.000001154407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007823473,"about_ca_system_score_gemma":0.00004798123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007480608,"about_ca_topic_score_gemma":0.000001613866,"domain_scores_codex":[0.9988262,0.0000705243,0.0004687526,0.0001081961,0.0003072518,0.0002190584],"domain_scores_gemma":[0.9985543,0.000377965,0.0003902236,0.0002952454,0.0002542479,0.0001280035],"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.00003975823,0.0008219864,0.004757102,0.00007194843,0.0002766655,0.000002892483,0.003971402,0.00008629855,0.01525648,0.9089746,0.0002804664,0.06546035],"study_design_scores_gemma":[0.003626715,0.0005875665,0.0221235,0.0003799707,0.000328007,0.00208389,0.007052348,0.01245841,0.008656466,0.9349847,0.006966367,0.0007520357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05727512,0.001274085,0.9400798,0.0007119135,0.00005447134,0.0002165386,0.000024565,0.000009092199,0.00035443],"genre_scores_gemma":[0.7717257,0.0003067516,0.2277542,0.00005823413,0.00008817756,0.00004035694,0.000001242581,0.000009459171,0.00001588212],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7144505,"threshold_uncertainty_score":0.28236,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4411391099","doi":"10.7155/jgaa.v29i1.3011","title":"Broadcast Schemes of Hypercubes","year":2025,"lang":"en","type":"article","venue":"Journal of Graph Algorithms and Applications","topic":"Interconnection Networks and Systems","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":"","keywords":"Hypercube; Computer science; Parallel computing","retraction":null,"screen_n_in":null,"score":{"opus":0.008143199895198298,"gpt":0.2516604544261473,"spread":0.243517254530949,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000208381,0.00005315226,0.0001518013,0.0001853561,0.00008482754,0.00004805377,0.0002569172,0.00003217337,0.000002438617],"category_scores_gemma":[0.000005595731,0.00004135592,0.00008176169,0.0004239293,0.00004271199,0.0001501958,0.00004070658,0.00008593594,5.985193e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006245716,"about_ca_system_score_gemma":0.00003428754,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007678017,"about_ca_topic_score_gemma":8.908151e-7,"domain_scores_codex":[0.9993982,0.00001698872,0.0003334423,0.00008517884,0.00009644227,0.0000697998],"domain_scores_gemma":[0.9993371,0.00005492508,0.0001812211,0.0001518882,0.0002357503,0.00003911496],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000003590517,0.0001237923,0.001025283,0.00003842445,0.0001030959,0.000001514995,0.0001602228,0.00008943706,0.001947534,0.5727456,0.002749664,0.4210118],"study_design_scores_gemma":[0.001547764,0.0004167117,0.007735358,0.0004642699,0.00009897386,0.0005199153,0.0009373401,0.05073174,0.008214965,0.1077075,0.8212315,0.0003939341],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006451527,0.002342936,0.9892216,0.0005781029,0.0001921294,0.00007899428,0.00000162187,0.00000885068,0.001124272],"genre_scores_gemma":[0.9557125,0.0006525176,0.04294762,0.0001511427,0.000200843,0.00001685483,3.609063e-7,0.000003565279,0.0003146143],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.949261,"threshold_uncertainty_score":0.1686446,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3164604964","doi":"10.7155/jgaa.00608","title":"Finding a Maximum Clique in a Grounded 1-Bend String Graph","year":2022,"lang":"en","type":"article","venue":"Journal of Graph 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 Saskatchewan","funders":"","keywords":"Combinatorics; String (physics); Block graph; Mathematics; Clique; Monotone polygon; Graph; Discrete mathematics; Chordal graph; Geometry; 1-planar graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01801957999360352,"gpt":0.2642648077463178,"spread":0.2462452277527143,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005543549,0.00007751075,0.0001307104,0.0006003959,0.0003298261,0.00009685524,0.0003122565,0.00002090847,0.000008294549],"category_scores_gemma":[0.00000737679,0.00007871765,0.00007320015,0.001330099,0.00001991429,0.0003086383,0.0001281287,0.0002553633,4.691308e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004351065,"about_ca_system_score_gemma":0.00007597359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001415907,"about_ca_topic_score_gemma":0.00000632735,"domain_scores_codex":[0.9990237,0.000057623,0.0003567437,0.0001656006,0.0002640356,0.0001322657],"domain_scores_gemma":[0.9993959,0.00009026119,0.0002344017,0.0001241896,0.00007970196,0.00007550915],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002014063,0.0004640247,0.001298681,0.00002287375,0.00006217461,0.00004090295,0.0009712297,0.03081132,0.001660714,0.4697432,0.0004067728,0.494498],"study_design_scores_gemma":[0.002142676,0.0005375129,0.02901733,0.00003618353,0.00003101282,0.001217903,0.0008491015,0.06104669,0.0005097297,0.8666672,0.0374663,0.0004784203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05685337,0.0006634959,0.9412537,0.0007858829,0.0001305447,0.000164268,0.000005503613,0.00001361817,0.0001296514],"genre_scores_gemma":[0.9310824,0.0001760261,0.06827399,0.0001811743,0.0001440034,0.0000931897,0.000005281867,0.000006066003,0.00003787632],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.874229,"threshold_uncertainty_score":0.3210013,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2952754000","doi":"10.7155/jgaa.00421","title":"Lower Bounds for Graph Exploration Using Local Policies","year":2017,"lang":"en","type":"preprint","venue":"Journal of Graph 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":"University of Waterloo","funders":"","keywords":"Bounded function; Graph; Computer science; Abstraction; Exponential function; Theoretical computer science; Enhanced Data Rates for GSM Evolution; Robot; Combinatorics; Mathematics; Discrete mathematics; Mathematical optimization; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.06704610915214952,"gpt":0.3427686469278052,"spread":0.2757225377756556,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005378976,0.0001872332,0.0003175168,0.0004293683,0.0006382595,0.000890915,0.0008720455,0.0001634681,0.00000199538],"category_scores_gemma":[0.00002494504,0.0001653141,0.0002155832,0.0002384537,0.0002064667,0.0006935433,0.0003213472,0.0003615254,6.688314e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003801782,"about_ca_system_score_gemma":0.0002980183,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003341509,"about_ca_topic_score_gemma":0.000005963935,"domain_scores_codex":[0.998629,0.00003466097,0.0005253351,0.0002842656,0.0003086804,0.0002180966],"domain_scores_gemma":[0.9973639,0.00006118194,0.0008732713,0.0005351451,0.0009822974,0.0001841673],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000456612,0.0007898962,0.0001601349,0.0004222645,0.0005206533,0.00001020444,0.002176038,0.116385,0.0004697654,0.2717833,0.005124452,0.6021126],"study_design_scores_gemma":[0.0008746068,0.0002608943,0.000173651,0.0002125857,0.00009925823,0.00008926757,0.000192426,0.4618252,0.0002077034,0.4976819,0.0379005,0.0004820018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002079336,0.0007802626,0.9959007,0.002019629,0.0003725722,0.0005460707,0.0000319201,0.00002572561,0.0001151944],"genre_scores_gemma":[0.0611298,0.004596781,0.9321246,0.0003266253,0.001189043,0.0003420059,0.00003758294,0.00004485884,0.0002086741],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6016306,"threshold_uncertainty_score":0.8591114,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}