{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Jurek Czyzowicz","is_ca":false},{"name":"Pat Morin","is_ca":true},{"name":"David R. Wood","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008193818,0.0006396771,0.0009538084,0.001203474,0.000732546,0.002883885,0.00183431,0.00122486,0.00655285],"category_scores_gemma":[0.008435119,0.0005300799,0.0006896323,0.001751962,0.001764564,0.004109283,0.002247122,0.001264191,0.000876689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007326852,"about_ca_system_score_gemma":0.0003106389,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005707704,"about_ca_topic_score_gemma":0.0008764225,"domain_scores_codex":[0.999154,0.0001710733,0.00007748996,0.0001908136,0.0002467523,0.0001597638],"domain_scores_gemma":[0.995076,0.003200709,0.000486151,0.000681928,0.000287541,0.0002677553],"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.0005981358,0.00008129143,0.005141264,0.0008413111,0.0000764168,0.0004812151,0.0005684528,0.3139994,0.02570481,0.4605999,0.008134363,0.1837734],"study_design_scores_gemma":[0.00005635831,0.0001207316,0.001719427,0.0001715758,0.00005780864,0.0006456168,0.0002511272,0.5034108,0.01895001,0.46187,0.01269356,0.00005286306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2218218,0.001914226,0.7404932,0.001087356,0.0001554708,0.00007332305,0.001115962,0.00129402,0.03204462],"genre_scores_gemma":[0.7177029,0.001404272,0.2748382,0.0001515381,0.0001009102,0.0002403429,0.0009387078,0.0003408925,0.004282288],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00655285,"threshold_uncertainty_score":0.02192146,"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","authors":[{"name":"Glencora Borradaile","is_ca":true},{"name":"Jennifer Iglesias","is_ca":true},{"name":"Theresa Migler","is_ca":true},{"name":"Antonio Ochoa","is_ca":true},{"name":"Gordon Wilfong","is_ca":true},{"name":"Lisa Zhang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006123275,0.0007203344,0.000596809,0.0007836639,0.0009707484,0.001842551,0.00122237,0.0009707984,0.007078141],"category_scores_gemma":[0.003702854,0.0004398226,0.0004890129,0.00106852,0.001019301,0.002960358,0.001682283,0.00147434,0.001673883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009264982,"about_ca_system_score_gemma":0.0009478746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001370096,"about_ca_topic_score_gemma":0.0031073,"domain_scores_codex":[0.9993138,0.0001560981,0.00004479499,0.0002204033,0.0001293911,0.0001355194],"domain_scores_gemma":[0.9981694,0.0006523752,0.0002435269,0.0005117891,0.0002319901,0.0001907305],"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.0008331294,0.0002998166,0.005134913,0.000495133,0.0000805558,0.0004312365,0.0008372125,0.1173707,0.02649875,0.5594565,0.02449514,0.264067],"study_design_scores_gemma":[0.0001305982,0.0002283055,0.001591522,0.0001126491,0.000104762,0.0006194297,0.0007357185,0.1833951,0.02054278,0.7497408,0.04273163,0.00006669692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1583834,0.0005390075,0.7877021,0.001386478,0.0001511884,0.0002644097,0.0012852,0.0009747292,0.04931336],"genre_scores_gemma":[0.5037015,0.0009799635,0.4780256,0.0004780795,0.00008220641,0.0002385216,0.001759185,0.0003871481,0.01434776],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007078141,"threshold_uncertainty_score":0.02367872,"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","authors":[{"name":"Anna Lubiw","is_ca":true},{"name":"Tillmann Miltzow","is_ca":false},{"name":"Debajyoti Mondal","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000987022,0.000756709,0.001052423,0.0004942152,0.0011652,0.003576129,0.002706081,0.001561401,0.009003323],"category_scores_gemma":[0.009660025,0.0007041828,0.001666441,0.001739464,0.001959605,0.009556555,0.00289182,0.002604102,0.0007258682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002052729,"about_ca_system_score_gemma":0.001052031,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003305761,"about_ca_topic_score_gemma":0.003066286,"domain_scores_codex":[0.9977609,0.0005260816,0.0001540387,0.0007936796,0.0004514226,0.0003139574],"domain_scores_gemma":[0.9916796,0.006066641,0.0006187041,0.001073547,0.0002707002,0.0002907726],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001217614,0.0002529315,0.005895502,0.001435721,0.0002127807,0.0006719679,0.001871239,0.5354801,0.01475099,0.2947033,0.01292599,0.1305819],"study_design_scores_gemma":[0.0001553821,0.0001283191,0.001389573,0.00007635471,0.0001693716,0.0004883114,0.0005566598,0.5359182,0.008350002,0.4436476,0.009062415,0.00005779402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.573575,0.0006241954,0.3903172,0.006390198,0.0001124396,0.000227142,0.002491368,0.001647428,0.02461526],"genre_scores_gemma":[0.8651272,0.0006079564,0.1258367,0.0004322767,0.00006921524,0.0001926272,0.002074947,0.0003883447,0.005270838],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009003323,"threshold_uncertainty_score":0.03011906,"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","authors":[{"name":"Philipp Kindermann","is_ca":true},{"name":"Wouter Meulemans","is_ca":false},{"name":"André Schulz","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003632764,0.001095148,0.0006743699,0.001235491,0.0005262192,0.001940826,0.001354695,0.001747212,0.0148829],"category_scores_gemma":[0.08219393,0.0005967583,0.0007303172,0.0007338169,0.0008492611,0.002555475,0.001488017,0.001016234,0.00131744],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003411402,"about_ca_system_score_gemma":0.0001748027,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004449745,"about_ca_topic_score_gemma":0.0004287938,"domain_scores_codex":[0.9955539,0.002271297,0.0005062294,0.0007763065,0.0006355507,0.0002566386],"domain_scores_gemma":[0.8469999,0.1307691,0.005514256,0.00999523,0.004966049,0.001755499],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.04766718,0.02000151,0.06546889,0.01184626,0.0009895948,0.002673376,0.04098809,0.02334866,0.4489935,0.007423648,0.01241892,0.3181804],"study_design_scores_gemma":[0.006874917,0.08622795,0.4036926,0.002376378,0.002650792,0.00839185,0.0225825,0.1682284,0.2230459,0.02393556,0.05072334,0.001270011],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9866028,0.0003167303,0.008082151,0.00008167866,0.00007288994,0.0003335999,0.0004388622,0.0003700675,0.003701242],"genre_scores_gemma":[0.983687,0.000176783,0.01247192,0.00008895721,0.00005428446,0.0005058098,0.0008156064,0.0002267364,0.001972951],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0148829,"threshold_uncertainty_score":0.04978824,"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","authors":[{"name":"Grant A. Cheston","is_ca":true},{"name":"Tjoen Seng Jap","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001273982,0.0009883073,0.0009850623,0.004311936,0.001725607,0.004173372,0.001600368,0.001118507,0.006679496],"category_scores_gemma":[0.004332006,0.0008621702,0.001239471,0.008866309,0.001884724,0.01066198,0.001574356,0.002696644,0.002352357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00221571,"about_ca_system_score_gemma":0.001642224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002036245,"about_ca_topic_score_gemma":0.002625911,"domain_scores_codex":[0.9987375,0.0001690117,0.0001194127,0.0003891207,0.0004755965,0.0001093477],"domain_scores_gemma":[0.997841,0.001222503,0.000179816,0.0003177846,0.0003426142,0.00009628446],"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.00006343827,0.0001066328,0.001580062,0.001896806,0.00004982238,0.0001300805,0.0003710438,0.009327987,0.002387581,0.6053658,0.01998582,0.358735],"study_design_scores_gemma":[0.00000863798,0.00005139514,0.001220047,0.0004567664,0.00004445063,0.001170485,0.0002446128,0.0144435,0.002158143,0.7932501,0.1868846,0.00006708684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02661441,0.1459105,0.683308,0.004429003,0.001037378,0.0002487383,0.00150934,0.001278652,0.135664],"genre_scores_gemma":[0.1952,0.2054369,0.5636091,0.002032227,0.001991176,0.000410978,0.0045426,0.000825737,0.02595126],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006679496,"threshold_uncertainty_score":0.02234519,"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","authors":[{"name":"Mohammad Shafiul Alam","is_ca":true},{"name":"Atri Mukhopadhyay","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001729277,0.001675909,0.001428233,0.001314616,0.002745655,0.003015143,0.002981183,0.003211004,0.02766635],"category_scores_gemma":[0.006876854,0.0008913658,0.00265216,0.003740696,0.003748536,0.0138569,0.003599969,0.004586869,0.003280555],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00230903,"about_ca_system_score_gemma":0.001121599,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005196196,"about_ca_topic_score_gemma":0.005100063,"domain_scores_codex":[0.9978291,0.0005752523,0.00008188199,0.000687403,0.0005223341,0.0003040463],"domain_scores_gemma":[0.9963049,0.001789649,0.0002435881,0.001154106,0.0003147593,0.0001931035],"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.0001722062,0.0001530223,0.001045209,0.0003717263,0.0000568649,0.000326114,0.0006145569,0.0490236,0.002082542,0.8258211,0.03004862,0.09028441],"study_design_scores_gemma":[0.00007820327,0.0001318121,0.0005933585,0.0001255276,0.00004147913,0.0005097388,0.0002980913,0.05966816,0.00156976,0.8618209,0.07510222,0.00006067923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05392673,0.00450896,0.8423297,0.01055388,0.0009248009,0.0002837981,0.0008556412,0.001028014,0.08558851],"genre_scores_gemma":[0.3739298,0.006573929,0.5295253,0.005100151,0.001944762,0.0004726386,0.003021194,0.001355802,0.07807636],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02766635,"threshold_uncertainty_score":0.0925532,"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","authors":[{"name":"Brett Stevens","is_ca":true},{"name":"Aaron Williams","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003216704,0.0005275325,0.0004697698,0.0007810352,0.0006181838,0.0009808994,0.0007626852,0.0005152939,0.005594545],"category_scores_gemma":[0.002664834,0.0005545547,0.0005836052,0.0008359975,0.001109765,0.001742386,0.001066941,0.0006719771,0.0006155695],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007169207,"about_ca_system_score_gemma":0.0005609147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002055021,"about_ca_topic_score_gemma":0.003477465,"domain_scores_codex":[0.9993215,0.0001486032,0.00005212401,0.0002136878,0.0001449681,0.0001190638],"domain_scores_gemma":[0.9982902,0.000614836,0.000331807,0.0003606828,0.0002381323,0.0001642709],"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.0002912819,0.0001171943,0.002935957,0.0004805854,0.0001028557,0.001088404,0.0009573125,0.06930431,0.02711903,0.7798943,0.004959155,0.1127496],"study_design_scores_gemma":[0.0001344998,0.0001799655,0.001747293,0.0000828005,0.00009717265,0.0006992875,0.0003756244,0.09055133,0.01412968,0.8621756,0.02975069,0.00007597223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5665184,0.0006129529,0.3839163,0.0003053485,0.00006916295,0.0003192473,0.0008121802,0.0009073392,0.04653904],"genre_scores_gemma":[0.8260816,0.000642281,0.1482335,0.0002614682,0.00004553444,0.0003845383,0.00147924,0.0002551187,0.0226167],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005594545,"threshold_uncertainty_score":0.01871562,"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","authors":[{"name":"Alain Hertz","is_ca":true},{"name":"Romain Montagné","is_ca":true},{"name":"François Gagnon","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003217305,0.001764139,0.001196385,0.001717914,0.001095364,0.002525624,0.003403106,0.001824525,0.004159599],"category_scores_gemma":[0.01201297,0.0007189832,0.001458081,0.002735824,0.002122853,0.00282487,0.002966247,0.00267005,0.001020777],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002188852,"about_ca_system_score_gemma":0.002695284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002545505,"about_ca_topic_score_gemma":0.003446258,"domain_scores_codex":[0.9970185,0.001403309,0.0001228142,0.0004457048,0.0006879328,0.0003218733],"domain_scores_gemma":[0.9906644,0.006411899,0.0005497888,0.001234883,0.0008361097,0.000302986],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001936131,0.000308644,0.00068638,0.0002806321,0.0000686233,0.0001443588,0.0003253129,0.4451688,0.001925533,0.3445899,0.008315849,0.1979924],"study_design_scores_gemma":[0.0001174221,0.00006865884,0.0001011827,0.0000294644,0.00003068614,0.00009340274,0.00008803679,0.8442116,0.001797765,0.1480609,0.005380821,0.00002005021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004647841,0.0001277489,0.9909609,0.0002028249,0.00003477312,0.000101377,0.00006605226,0.0004260173,0.003432423],"genre_scores_gemma":[0.1012582,0.0002822772,0.8949504,0.000162438,0.00009795325,0.0004162775,0.0003611369,0.0001790065,0.0022923],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004159599,"threshold_uncertainty_score":0.01701498,"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","authors":[{"name":"Luis Barba","is_ca":false},{"name":"William Evans","is_ca":true},{"name":"Michael M. Hoffmann","is_ca":false},{"name":"Vincent Kusters","is_ca":false},{"name":"Maria Saumell","is_ca":false},{"name":"Bettina Speckmann","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003234528,0.00111244,0.0006184605,0.0006359336,0.0008029386,0.001312941,0.001418434,0.0007475477,0.008565103],"category_scores_gemma":[0.002510728,0.0007852157,0.0009049687,0.001376931,0.00165727,0.004624428,0.003231569,0.001752773,0.001271441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008679359,"about_ca_system_score_gemma":0.0005992174,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001799747,"about_ca_topic_score_gemma":0.002607407,"domain_scores_codex":[0.9990552,0.0001289037,0.00004572219,0.0002873693,0.0002574621,0.0002253141],"domain_scores_gemma":[0.9975739,0.0006976994,0.0003436216,0.0008776904,0.0003257082,0.000181328],"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.0005937606,0.0002530312,0.003762828,0.0007003866,0.0001241328,0.0008040993,0.001074733,0.2670708,0.07011119,0.4835453,0.01355673,0.158403],"study_design_scores_gemma":[0.0001041688,0.0006041438,0.003544389,0.00009650408,0.0001320449,0.001867573,0.001220351,0.4006629,0.06223927,0.4692025,0.06019372,0.0001324586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2454323,0.0004268602,0.7220297,0.000931792,0.00005342879,0.0001721506,0.001716188,0.001732817,0.02750483],"genre_scores_gemma":[0.7545698,0.0005862961,0.229009,0.0002926554,0.00006412499,0.0002511493,0.004116879,0.0004180885,0.010692],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008565103,"threshold_uncertainty_score":0.02865309,"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","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Jean-Lou De Carufel","is_ca":true},{"name":"Alina Shaikhet","is_ca":true},{"name":"Michiel Smid","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005693723,0.000738055,0.0008644283,0.001350499,0.0009076976,0.001295632,0.001870081,0.001229186,0.00533678],"category_scores_gemma":[0.008761507,0.0008201826,0.0006562036,0.001842694,0.001103892,0.003272251,0.00290516,0.001256462,0.0005874951],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006533354,"about_ca_system_score_gemma":0.0008594569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002985094,"about_ca_topic_score_gemma":0.003966944,"domain_scores_codex":[0.998467,0.0003197231,0.0001006476,0.0004076243,0.000577402,0.000127462],"domain_scores_gemma":[0.9972096,0.001322836,0.0004397633,0.0004096485,0.0003974818,0.0002207002],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000497518,0.0001838042,0.005646271,0.0009540516,0.0001164353,0.00117191,0.0008827171,0.4259057,0.01758763,0.3235803,0.00925349,0.2142201],"study_design_scores_gemma":[0.00007053644,0.0001370309,0.001894905,0.0001008513,0.00005502434,0.000917344,0.0004187201,0.7019811,0.01264835,0.2651993,0.01653066,0.00004617875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07810935,0.0002421528,0.9130961,0.0003041085,0.00002397738,0.0001814063,0.001206709,0.0003487488,0.006487518],"genre_scores_gemma":[0.485898,0.0004783543,0.5068497,0.0001185467,0.00004027607,0.0003782641,0.002274626,0.0002023725,0.00376001],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00533678,"threshold_uncertainty_score":0.01785332,"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","authors":[{"name":"William Evans","is_ca":true},{"name":"Ellen Gethner","is_ca":false},{"name":"Jack Spalding-Jamieson","is_ca":true},{"name":"Alexander Wolff","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001598324,0.001723521,0.001748456,0.001756162,0.002092084,0.006093255,0.003230959,0.00245077,0.01159472],"category_scores_gemma":[0.01123412,0.001132305,0.002335997,0.003872171,0.002323305,0.01150242,0.00393051,0.003288145,0.002245907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003990205,"about_ca_system_score_gemma":0.002597485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005466904,"about_ca_topic_score_gemma":0.004829075,"domain_scores_codex":[0.9962898,0.0007300486,0.0002339463,0.00109035,0.0009719766,0.0006837927],"domain_scores_gemma":[0.9860998,0.01029038,0.0009456672,0.001694898,0.0005886128,0.0003806551],"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.001656602,0.0006424988,0.007955903,0.001466377,0.0002869403,0.0004638106,0.0009959686,0.2902877,0.009375253,0.2490941,0.0474542,0.3903207],"study_design_scores_gemma":[0.0002046127,0.0001226949,0.001154825,0.00009766856,0.00009593342,0.0004434664,0.0003239528,0.510748,0.004014141,0.4709504,0.0117925,0.00005188434],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1782175,0.004393082,0.7541881,0.006620115,0.0002764124,0.0006518378,0.004188649,0.006791635,0.04467274],"genre_scores_gemma":[0.4953602,0.002686318,0.479401,0.001117873,0.0005037859,0.0007521356,0.006565554,0.001052931,0.01256021],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01159472,"threshold_uncertainty_score":0.0387882,"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)","authors":[{"name":"Thérèse Biedl","is_ca":true},{"name":"Martin Derka","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005801229,0.0005800356,0.0003856571,0.001100482,0.001267884,0.001717632,0.0008331247,0.0006482571,0.007878805],"category_scores_gemma":[0.002990012,0.0004500038,0.000770367,0.001398879,0.002000568,0.001938439,0.001938913,0.002019011,0.001913285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008817905,"about_ca_system_score_gemma":0.001149424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002092486,"about_ca_topic_score_gemma":0.004524697,"domain_scores_codex":[0.9990158,0.0002015878,0.00007384693,0.0001716983,0.0003698959,0.0001671668],"domain_scores_gemma":[0.9985963,0.0003229563,0.0001832275,0.0002915373,0.000441269,0.0001647914],"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.00003433377,0.00001438696,0.0006653804,0.00007464144,0.000006438506,0.0001855926,0.0002504388,0.00440077,0.00327188,0.9520584,0.004603129,0.03443464],"study_design_scores_gemma":[0.0000221524,0.00005876391,0.0007178141,0.00006202055,0.00002394951,0.000601836,0.0005217972,0.03551755,0.01156094,0.8615845,0.08927897,0.00004968496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08996995,0.0006164692,0.8237034,0.0007515602,0.0004724934,0.0001481977,0.0008341245,0.001037749,0.08246603],"genre_scores_gemma":[0.5505601,0.001263437,0.4219685,0.0005179414,0.0002034547,0.0002214024,0.001555038,0.0008580481,0.02285205],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007878805,"threshold_uncertainty_score":0.02635723,"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","authors":[{"name":"Carla Binucci","is_ca":false},{"name":"Aaron Büngener","is_ca":false},{"name":"Giuseppe Di Battista","is_ca":false},{"name":"Walter Didimo","is_ca":false},{"name":"Vida Dujmović","is_ca":true},{"name":"Seok-Hee Hong","is_ca":false},{"name":"Michael Kaufmann","is_ca":false},{"name":"Giuseppe Liotta","is_ca":false},{"name":"Pat Morin","is_ca":true},{"name":"Alessandra Tappini","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001010128,0.001772523,0.001268657,0.001483543,0.001235575,0.003857635,0.002938197,0.001410487,0.01485656],"category_scores_gemma":[0.01157998,0.001566026,0.001306619,0.003279873,0.001480289,0.008114294,0.002907241,0.002833487,0.002860163],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001471762,"about_ca_system_score_gemma":0.0006854871,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001117162,"about_ca_topic_score_gemma":0.001922438,"domain_scores_codex":[0.9971502,0.0006176536,0.0002234583,0.0008129612,0.0007104511,0.0004852295],"domain_scores_gemma":[0.9881924,0.005969638,0.001998435,0.002105396,0.001108655,0.0006255354],"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.0004124324,0.0001787266,0.002470891,0.00123673,0.0001034406,0.0006870387,0.0006851004,0.09203642,0.01146506,0.7197376,0.02180821,0.1491784],"study_design_scores_gemma":[0.00006634258,0.0001499734,0.001997889,0.0001787908,0.00008454264,0.002223298,0.0003815827,0.1445523,0.007790191,0.7903709,0.05213444,0.00006981686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1319792,0.003724827,0.8014138,0.001440945,0.0002035812,0.0002517054,0.002108877,0.001287879,0.05758909],"genre_scores_gemma":[0.5793948,0.007939442,0.3753062,0.0008379134,0.0004068929,0.0004493943,0.005216811,0.000943431,0.02950505],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01485656,"threshold_uncertainty_score":0.0497002,"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","authors":[{"name":"Ahmad Biniaz","is_ca":true},{"name":"Parham Khamsepour","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007807211,0.0007004514,0.001293287,0.0006925041,0.0008726299,0.001296132,0.001258756,0.001084591,0.002943641],"category_scores_gemma":[0.004502841,0.000535839,0.0008171791,0.001913089,0.0006309556,0.003644781,0.001288266,0.001035355,0.0004788383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008210658,"about_ca_system_score_gemma":0.001005742,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002296463,"about_ca_topic_score_gemma":0.002496035,"domain_scores_codex":[0.9990742,0.0003160369,0.00006299525,0.00023036,0.0001851941,0.0001311642],"domain_scores_gemma":[0.9983556,0.0009754876,0.0001525795,0.0002196241,0.0001629047,0.00013379],"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.0005921632,0.00028263,0.002309325,0.0007048797,0.0001863742,0.0005292962,0.000540316,0.5337527,0.01082868,0.2458779,0.03580451,0.1685912],"study_design_scores_gemma":[0.0001375696,0.0001029165,0.0007284792,0.00005035574,0.00005194886,0.0003409238,0.0002551821,0.6717678,0.003709871,0.3121985,0.01063435,0.00002225569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2052151,0.001624595,0.7719636,0.002409119,0.0001446848,0.0003662922,0.002934835,0.000987104,0.01435473],"genre_scores_gemma":[0.544148,0.001568121,0.4426407,0.0003886664,0.0001648139,0.0004508816,0.00483182,0.0003004186,0.005506551],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002943641,"threshold_uncertainty_score":0.009847462,"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","authors":[{"name":"Amirali Madani","is_ca":true},{"name":"Anil Maheshwari","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009943529,0.0008942658,0.0008077672,0.001888365,0.0004779402,0.0009829473,0.001921084,0.001100113,0.001976086],"category_scores_gemma":[0.005671384,0.0003467694,0.0006118334,0.003270809,0.0009961317,0.003301117,0.001615565,0.00125713,0.0007009595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006779391,"about_ca_system_score_gemma":0.0006513862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007590641,"about_ca_topic_score_gemma":0.0007813482,"domain_scores_codex":[0.998767,0.000209507,0.00007132298,0.0002126484,0.0006404619,0.00009905427],"domain_scores_gemma":[0.9974388,0.001227984,0.0002645053,0.0006828706,0.0003283613,0.0000574124],"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.0002577817,0.0001719832,0.0009091111,0.0004702416,0.00009659737,0.0003100207,0.0003361144,0.2832721,0.02482508,0.0873012,0.005200895,0.5968488],"study_design_scores_gemma":[0.00004676446,0.0002624762,0.0005063062,0.00005880207,0.00004873218,0.0008884273,0.0001475205,0.8575749,0.03043951,0.1023361,0.007662931,0.00002753586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03774163,0.001388313,0.9564434,0.0004153288,0.00007062816,0.0001038708,0.0001440101,0.0005254155,0.003167439],"genre_scores_gemma":[0.3613596,0.002079795,0.6289998,0.0002898273,0.0001903791,0.0002182302,0.000759747,0.0002992119,0.005803543],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001976086,"threshold_uncertainty_score":0.006610632,"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)","authors":[{"name":"Michael A. Bekos","is_ca":false},{"name":"Prosenjit Bose","is_ca":true},{"name":"Aaron Büngener","is_ca":false},{"name":"Vida Dujmović","is_ca":true},{"name":"Michael M. Hoffmann","is_ca":false},{"name":"Michael Kaufmann","is_ca":false},{"name":"Pat Morin","is_ca":true},{"name":"Saeed Odak","is_ca":true},{"name":"Alexandra Weinberger","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001371326,0.001392287,0.001101423,0.002132252,0.001116123,0.001417712,0.001924102,0.0008362776,0.00402863],"category_scores_gemma":[0.0199849,0.000656829,0.0006588811,0.002619986,0.002260599,0.004161031,0.002733838,0.001695504,0.000499264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001686352,"about_ca_system_score_gemma":0.0007661219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002245418,"about_ca_topic_score_gemma":0.002646416,"domain_scores_codex":[0.9986357,0.0004172405,0.00005783888,0.0002496652,0.0003545618,0.0002850197],"domain_scores_gemma":[0.9818611,0.01380352,0.001599226,0.001203531,0.0006520528,0.0008805534],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006690925,0.0001812076,0.005650127,0.0006290397,0.00009763709,0.0005645059,0.0003843596,0.620621,0.01235227,0.2868965,0.004674336,0.06728002],"study_design_scores_gemma":[0.00004675801,0.0001924262,0.001720947,0.0001211756,0.00006393311,0.000588882,0.0002180071,0.7589828,0.00759062,0.226841,0.003582202,0.00005122395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5239336,0.003831875,0.4386109,0.001613082,0.0001248205,0.0001275376,0.0005197541,0.0009108898,0.03032763],"genre_scores_gemma":[0.9424508,0.002979274,0.050804,0.0003504081,0.00009608152,0.0001256401,0.0004077544,0.0002337578,0.002552211],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00402863,"threshold_uncertainty_score":0.01347709,"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","authors":[{"name":"Henk Meijer","is_ca":false},{"name":"Stephen Wismath","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003059822,0.0008022774,0.0007695478,0.0009571858,0.0004607523,0.001272191,0.001253438,0.0008203467,0.006119062],"category_scores_gemma":[0.002481045,0.0005678594,0.0007019041,0.001799988,0.0007272564,0.001757087,0.002190966,0.001413856,0.001711183],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000723538,"about_ca_system_score_gemma":0.0002735286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001722673,"about_ca_topic_score_gemma":0.002204982,"domain_scores_codex":[0.9992976,0.0001438994,0.00004095648,0.0001429229,0.0002926011,0.00008203441],"domain_scores_gemma":[0.9986382,0.000561313,0.0001754776,0.0003843674,0.0001505558,0.0000899821],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005929092,0.0001612081,0.002814977,0.0004883298,0.0001094853,0.0006234241,0.0006323871,0.4682357,0.03850866,0.24475,0.01373481,0.2293482],"study_design_scores_gemma":[0.00007812439,0.0001129828,0.001338607,0.00004947897,0.00002936098,0.0004903382,0.0001713228,0.7535985,0.01370765,0.212502,0.0178648,0.00005683107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1531925,0.0005467481,0.8248302,0.0004488581,0.00008951883,0.00008697554,0.001352406,0.002972524,0.01648028],"genre_scores_gemma":[0.4915434,0.000602394,0.5007973,0.0001049144,0.00003192271,0.0001571918,0.001969884,0.0003597774,0.00443326],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006119062,"threshold_uncertainty_score":0.02047032,"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)","authors":[{"name":"Bojan Mohar","is_ca":true},{"name":"Petr Škoda","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006041045,0.000885612,0.0009441565,0.00051995,0.0007466649,0.001006059,0.001646486,0.001120115,0.003299027],"category_scores_gemma":[0.005027996,0.0005354612,0.0005410173,0.0006840266,0.0009355235,0.002199465,0.0009058935,0.0009038489,0.0003343388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00134194,"about_ca_system_score_gemma":0.0008040372,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002389691,"about_ca_topic_score_gemma":0.003792385,"domain_scores_codex":[0.9994577,0.0001441014,0.00002082904,0.0001778639,0.00007082606,0.0001287276],"domain_scores_gemma":[0.9965642,0.002298053,0.0005275379,0.0002222813,0.0001463783,0.0002415235],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001375111,0.0002057032,0.003237851,0.0004778512,0.00008707015,0.0003265917,0.0002702757,0.8899449,0.03108219,0.01581711,0.002419981,0.05475537],"study_design_scores_gemma":[0.0001334134,0.0005164722,0.001015473,0.00002618136,0.00006576667,0.0001989682,0.0002246235,0.9559646,0.01246375,0.02776963,0.001591382,0.0000296257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7965491,0.0003996404,0.1980197,0.0004989425,0.00003433201,0.0001054455,0.0003939612,0.0007195073,0.003279369],"genre_scores_gemma":[0.834935,0.0002448068,0.1614959,0.00007282847,0.00002289487,0.00009903624,0.0005613429,0.0002393389,0.002328879],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003299027,"threshold_uncertainty_score":0.01103634,"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","authors":[{"name":"M.H. Fakharan","is_ca":true},{"name":"Hovhannes A. Harutyunyan","is_ca":false},{"name":"Pouria Alikhanifard","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00129293,0.0002603078,0.0006097851,0.0009250288,0.001188145,0.001893047,0.0009803473,0.0006069029,0.002875634],"category_scores_gemma":[0.005881359,0.0003820096,0.0004340784,0.001380236,0.0008238256,0.002904294,0.001461594,0.0007035741,0.0005726047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001255683,"about_ca_system_score_gemma":0.0008340719,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001234527,"about_ca_topic_score_gemma":0.001499954,"domain_scores_codex":[0.9985064,0.0005371788,0.0001056709,0.0001481153,0.0004512807,0.0002513655],"domain_scores_gemma":[0.9964779,0.001431407,0.0004059116,0.0008126032,0.0006966212,0.0001756377],"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.0007290321,0.0001017838,0.00182948,0.0003148982,0.00006096208,0.0001614186,0.0009791818,0.1279669,0.02261205,0.691731,0.006346391,0.1471669],"study_design_scores_gemma":[0.0001775791,0.0002553027,0.0009031518,0.00009750746,0.00005382563,0.0002736363,0.0004407495,0.486257,0.01782084,0.4681975,0.02547072,0.00005223311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2809689,0.002063198,0.6830604,0.0006417232,0.0001573958,0.0003590741,0.0007219762,0.0007896952,0.03123764],"genre_scores_gemma":[0.8112097,0.001225115,0.1769772,0.0001764817,0.00008791348,0.0003556668,0.0009242379,0.0001680945,0.008875617],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002875634,"threshold_uncertainty_score":0.009619951,"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","authors":[{"name":"Julian Keil","is_ca":true},{"name":"Debajyoti Mondal","is_ca":true},{"name":"Ehsan Moradi","is_ca":true},{"name":"Yakov Nekrich","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004461531,0.0007810471,0.0009637636,0.0009537852,0.00110667,0.00119024,0.001415943,0.001502042,0.007557044],"category_scores_gemma":[0.003022928,0.0007176224,0.001080826,0.001776381,0.001004269,0.002875396,0.001520417,0.001110976,0.0009451854],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000717804,"about_ca_system_score_gemma":0.0007694022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00254963,"about_ca_topic_score_gemma":0.003739312,"domain_scores_codex":[0.9994028,0.0001375229,0.00002414742,0.0002249943,0.0001114262,0.00009912771],"domain_scores_gemma":[0.9983016,0.001016565,0.0001781777,0.0002175226,0.0001449434,0.0001411466],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00104876,0.0006032658,0.00820796,0.001311671,0.0003472318,0.00184195,0.001454769,0.5233147,0.04689971,0.205572,0.03595272,0.1734453],"study_design_scores_gemma":[0.0001407744,0.0001545957,0.002283452,0.0000875186,0.00007250733,0.0004643528,0.0006670169,0.6948376,0.009496066,0.2823841,0.009362414,0.00004965581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3673014,0.0002815422,0.6135696,0.001308986,0.00005742449,0.0003531259,0.00489319,0.001392313,0.01084242],"genre_scores_gemma":[0.5402361,0.0002934559,0.4416696,0.0003811232,0.00006236006,0.0003471825,0.007976567,0.0005125547,0.00852114],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007557044,"threshold_uncertainty_score":0.02528077,"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","authors":[{"name":"Aditya Kumar Akash","is_ca":false},{"name":"Sándor P. Fekete","is_ca":false},{"name":"Seoung Kyou Lee","is_ca":false},{"name":"Alejandro López-Ortíz","is_ca":true},{"name":"Daniela Maftuleac","is_ca":true},{"name":"James McLurkin","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006978052,0.00438269,0.003340694,0.003013531,0.002225152,0.007212249,0.007059452,0.003563166,0.02301669],"category_scores_gemma":[0.0517272,0.001447321,0.003526989,0.003807418,0.004074841,0.01576898,0.007190925,0.01114432,0.004620957],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005323283,"about_ca_system_score_gemma":0.004038329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002117627,"about_ca_topic_score_gemma":0.003667116,"domain_scores_codex":[0.9916283,0.002161386,0.0003318931,0.001458377,0.00197316,0.002446802],"domain_scores_gemma":[0.9373668,0.04946034,0.0026504,0.005410994,0.002126956,0.002984542],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009308908,0.0005445256,0.003369151,0.001607958,0.0002482874,0.0002685145,0.0007336831,0.4906038,0.005535916,0.3858626,0.02001287,0.09028184],"study_design_scores_gemma":[0.0000669436,0.0001752385,0.0004233695,0.0002242404,0.0001247612,0.0002118244,0.0001362409,0.7151151,0.00222585,0.2758115,0.005431301,0.00005375121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03013957,0.00668089,0.9012277,0.004225761,0.0003809589,0.0003191472,0.001156413,0.002392384,0.05347724],"genre_scores_gemma":[0.6563401,0.007266785,0.3034289,0.002036477,0.0009685309,0.001617159,0.00240825,0.003595168,0.02233848],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02301669,"threshold_uncertainty_score":0.07699853,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}