{"meta":{"query_hash":"e3a4e7f163ff","filters":{"venue":"Journal of Graph Algorithms and Applications"},"cohort_total":21,"direct_labels_cover":0,"predictions_cover":21,"exported":21,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/e3a4e7f163ff","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Graph+Algorithms+and+Applications"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.01957954025613224,"score_gpt":0.2770090639574265,"score_spread":0.2574295237012943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1957290555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08996995,0.0006164692,0.8237034,0.0007515602,0.00047249338,0.00014819774,0.00083412445,0.0010377485,0.08246603],"genre_scores_gemma":[0.5505601,0.0012634369,0.42196846,0.00051794143,0.00020345472,0.00022140243,0.0015550377,0.0008580481,0.022852048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990158,0.0002015878,0.00007384693,0.00017169828,0.0003698959,0.00016716679],"domain_scores_gemma":[0.99859625,0.00032295633,0.00018322746,0.00029153726,0.00044126902,0.00016479145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005801229,0.0005800356,0.00038565713,0.001100482,0.0012678837,0.0017176316,0.00083312474,0.0006482571,0.007878805],"category_scores_gemma":[0.0029900116,0.0004500038,0.000770367,0.0013988786,0.0020005684,0.0019384394,0.0019389127,0.002019011,0.0019132849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034333767,0.000014386958,0.00066538044,0.00007464144,0.000006438506,0.0001855926,0.0002504388,0.0044007697,0.0032718799,0.95205843,0.004603129,0.034434635],"study_design_scores_gemma":[0.000022152399,0.00005876391,0.0007178141,0.000062020554,0.000023949508,0.000601836,0.00052179716,0.035517547,0.011560938,0.8615845,0.089278966,0.000049684957],"about_ca_topic_score_codex":0.0020924858,"about_ca_topic_score_gemma":0.004524697,"teacher_disagreement_score":0.007878805,"about_ca_system_score_codex":0.00088179053,"about_ca_system_score_gemma":0.0011494237,"threshold_uncertainty_score":0.026357234},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Cayley graph; Indifference graph; Discrete mathematics; Graph; Computer science","score_opus":0.009693911016826953,"score_gpt":0.2227337202091065,"score_spread":0.21303980919227955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012207201","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5665184,0.0006129529,0.3839163,0.00030534848,0.000069162954,0.00031924725,0.00081218017,0.00090733916,0.04653904],"genre_scores_gemma":[0.82608163,0.000642281,0.14823349,0.00026146823,0.00004553444,0.00038453835,0.0014792404,0.0002551187,0.022616697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932146,0.00014860323,0.000052124007,0.00021368783,0.00014496811,0.00011906378],"domain_scores_gemma":[0.99829024,0.000614836,0.00033180695,0.0003606828,0.00023813228,0.00016427092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032167044,0.0005275325,0.00046976976,0.00078103517,0.0006181838,0.0009808994,0.0007626852,0.0005152939,0.0055945446],"category_scores_gemma":[0.0026648345,0.0005545547,0.0005836052,0.0008359975,0.0011097651,0.0017423865,0.0010669408,0.0006719771,0.00061556953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002912819,0.00011719428,0.0029359574,0.00048058538,0.000102855745,0.0010884042,0.0009573125,0.06930431,0.027119026,0.7798943,0.0049591553,0.11274958],"study_design_scores_gemma":[0.00013449976,0.00017996549,0.001747293,0.0000828005,0.00009717265,0.00069928746,0.0003756244,0.09055133,0.014129682,0.86217564,0.029750692,0.00007597223],"about_ca_topic_score_codex":0.0020550212,"about_ca_topic_score_gemma":0.0034774654,"teacher_disagreement_score":0.0055945446,"about_ca_system_score_codex":0.0007169207,"about_ca_system_score_gemma":0.0005609147,"threshold_uncertainty_score":0.01871562},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Point (geometry); Computer science; Mathematics; Calculus (dental); Geometry; Orthodontics; Medicine","score_opus":0.007711995862403725,"score_gpt":0.24300440033588805,"score_spread":0.23529240447348432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017228186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053926732,0.0045089596,0.8423297,0.010553881,0.0009248009,0.0002837981,0.0008556412,0.0010280142,0.08558851],"genre_scores_gemma":[0.37392983,0.0065739285,0.52952534,0.005100151,0.0019447624,0.00047263855,0.0030211937,0.0013558023,0.07807636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782914,0.0005752523,0.00008188199,0.000687403,0.00052233407,0.00030404635],"domain_scores_gemma":[0.99630487,0.0017896487,0.00024358807,0.0011541063,0.00031475927,0.00019310352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001729277,0.001675909,0.0014282329,0.0013146157,0.0027456551,0.0030151429,0.002981183,0.0032110037,0.027666353],"category_scores_gemma":[0.006876854,0.00089136575,0.0026521601,0.003740696,0.0037485356,0.013856897,0.0035999685,0.0045868694,0.0032805547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017220617,0.0001530223,0.0010452085,0.0003717263,0.000056864905,0.000326114,0.0006145569,0.049023602,0.0020825416,0.8258211,0.030048624,0.090284415],"study_design_scores_gemma":[0.000078203266,0.0001318121,0.0005933585,0.00012552759,0.000041479132,0.0005097388,0.00029809133,0.059668165,0.0015697601,0.86182094,0.075102225,0.000060679235],"about_ca_topic_score_codex":0.0051961965,"about_ca_topic_score_gemma":0.0051000626,"teacher_disagreement_score":0.027666353,"about_ca_system_score_codex":0.0023090304,"about_ca_system_score_gemma":0.0011215995,"threshold_uncertainty_score":0.0925532},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.028244954182113268,"score_gpt":0.3234862292229718,"score_spread":0.29524127504085856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114909581","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7965491,0.00039964035,0.19801967,0.0004989425,0.000034332013,0.000105445506,0.0003939612,0.00071950734,0.003279369],"genre_scores_gemma":[0.834935,0.0002448068,0.16149586,0.00007282847,0.00002289487,0.00009903624,0.00056134287,0.00023933893,0.0023288792],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945766,0.00014410136,0.00002082904,0.00017786391,0.00007082606,0.00012872757],"domain_scores_gemma":[0.9965642,0.002298053,0.0005275379,0.00022228133,0.0001463783,0.00024152352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060410454,0.00088561204,0.00094415655,0.00051995,0.0007466649,0.0010060592,0.0016464862,0.0011201154,0.0032990274],"category_scores_gemma":[0.0050279964,0.0005354612,0.0005410173,0.0006840266,0.0009355235,0.0021994652,0.00090589345,0.0009038489,0.00033433884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013751114,0.0002057032,0.0032378512,0.00047785122,0.00008707015,0.00032659172,0.00027027575,0.8899449,0.031082194,0.015817113,0.0024199812,0.054755367],"study_design_scores_gemma":[0.00013341337,0.00051647215,0.0010154734,0.000026181362,0.00006576667,0.00019896819,0.0002246235,0.9559646,0.012463752,0.02776963,0.001591382,0.000029625697],"about_ca_topic_score_codex":0.0023896906,"about_ca_topic_score_gemma":0.0037923849,"teacher_disagreement_score":0.0032990274,"about_ca_system_score_codex":0.00134194,"about_ca_system_score_gemma":0.0008040372,"threshold_uncertainty_score":0.011036336},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Grid; Computer science; Geometry; Mathematics; Combinatorics","score_opus":0.012468721534286395,"score_gpt":0.26028148832077197,"score_spread":0.24781276678648556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135989110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22182183,0.001914226,0.74049324,0.0010873557,0.00015547081,0.00007332305,0.001115962,0.0012940201,0.032044623],"genre_scores_gemma":[0.71770287,0.0014042719,0.2748382,0.00015153813,0.000100910154,0.00024034287,0.00093870785,0.00034089253,0.004282288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999154,0.00017107328,0.00007748996,0.00019081363,0.00024675226,0.00015976377],"domain_scores_gemma":[0.995076,0.0032007091,0.00048615102,0.000681928,0.00028754096,0.00026775527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008193818,0.0006396771,0.0009538084,0.0012034745,0.000732546,0.002883885,0.0018343095,0.0012248596,0.0065528504],"category_scores_gemma":[0.008435119,0.0005300799,0.00068963226,0.0017519622,0.0017645638,0.0041092834,0.0022471223,0.0012641912,0.000876689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005981358,0.00008129143,0.0051412643,0.00084131106,0.0000764168,0.0004812151,0.0005684528,0.31399935,0.025704814,0.46059993,0.008134363,0.18377338],"study_design_scores_gemma":[0.000056358305,0.00012073155,0.0017194272,0.0001715758,0.000057808644,0.00064561685,0.00025112717,0.5034108,0.01895001,0.46187004,0.01269356,0.00005286306],"about_ca_topic_score_codex":0.00057077035,"about_ca_topic_score_gemma":0.0008764225,"teacher_disagreement_score":0.0065528504,"about_ca_system_score_codex":0.0007326852,"about_ca_system_score_gemma":0.00031063895,"threshold_uncertainty_score":0.021921456},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Upper and lower bounds; Computer science; Combinatorics; Mathematics","score_opus":0.030894195947069204,"score_gpt":0.2672424313698322,"score_spread":0.236348235422763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143613789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026614415,0.1459105,0.683308,0.0044290028,0.0010373775,0.00024873827,0.0015093402,0.0012786525,0.13566402],"genre_scores_gemma":[0.19519995,0.20543693,0.5636091,0.0020322267,0.0019911758,0.00041097798,0.0045426,0.000825737,0.025951259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987375,0.00016901166,0.00011941266,0.00038912072,0.00047559655,0.00010934767],"domain_scores_gemma":[0.997841,0.0012225031,0.000179816,0.00031778464,0.00034261416,0.00009628446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012739822,0.0009883073,0.0009850623,0.0043119355,0.001725607,0.0041733724,0.0016003684,0.0011185069,0.0066794963],"category_scores_gemma":[0.004332006,0.00086217024,0.0012394714,0.008866309,0.0018847235,0.010661983,0.0015743559,0.0026966443,0.0023523567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006343827,0.00010663283,0.0015800615,0.0018968062,0.00004982238,0.0001300805,0.00037104383,0.009327987,0.002387581,0.60536575,0.01998582,0.35873497],"study_design_scores_gemma":[0.0000086379805,0.00005139514,0.0012200469,0.0004567664,0.000044450633,0.001170485,0.0002446128,0.014443496,0.0021581429,0.7932501,0.18688463,0.00006708684],"about_ca_topic_score_codex":0.0020362448,"about_ca_topic_score_gemma":0.0026259106,"teacher_disagreement_score":0.0066794963,"about_ca_system_score_codex":0.0022157098,"about_ca_system_score_gemma":0.0016422239,"threshold_uncertainty_score":0.022345185},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02522473167498975,"score_gpt":0.33448234752013234,"score_spread":0.3092576158451426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152845747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15838341,0.00053900754,0.78770214,0.0013864784,0.00015118837,0.00026440973,0.0012852004,0.0009747292,0.049313355],"genre_scores_gemma":[0.5037015,0.0009799635,0.4780256,0.00047807954,0.00008220641,0.00023852159,0.001759185,0.0003871481,0.014347756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931383,0.00015609807,0.00004479499,0.00022040332,0.0001293911,0.0001355194],"domain_scores_gemma":[0.9981694,0.0006523752,0.00024352687,0.00051178905,0.00023199013,0.00019073053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061232754,0.00072033436,0.00059680897,0.0007836639,0.00097074837,0.0018425506,0.0012223696,0.0009707984,0.0070781414],"category_scores_gemma":[0.003702854,0.0004398226,0.0004890129,0.00106852,0.0010193012,0.0029603576,0.0016822834,0.0014743396,0.001673883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008331294,0.0002998166,0.005134913,0.00049513305,0.0000805558,0.00043123655,0.0008372125,0.11737069,0.02649875,0.55945647,0.024495143,0.264067],"study_design_scores_gemma":[0.00013059819,0.00022830554,0.0015915224,0.00011264915,0.000104762,0.00061942975,0.00073571847,0.18339513,0.020542782,0.7497408,0.04273163,0.00006669692],"about_ca_topic_score_codex":0.0013700965,"about_ca_topic_score_gemma":0.0031073003,"teacher_disagreement_score":0.0070781414,"about_ca_system_score_codex":0.0009264982,"about_ca_system_score_gemma":0.00094787456,"threshold_uncertainty_score":0.02367872},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.030256003817284462,"score_gpt":0.29376898507636107,"score_spread":0.26351298125907663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296012640","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15319254,0.0005467481,0.8248302,0.00044885813,0.00008951883,0.00008697554,0.0013524063,0.0029725244,0.016480284],"genre_scores_gemma":[0.49154344,0.000602394,0.5007973,0.0001049144,0.000031922715,0.00015719175,0.001969884,0.0003597774,0.0044332603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992976,0.00014389936,0.000040956482,0.00014292286,0.00029260106,0.00008203441],"domain_scores_gemma":[0.9986382,0.000561313,0.00017547765,0.00038436742,0.00015055577,0.000089982095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030598216,0.0008022774,0.00076954777,0.0009571858,0.00046075234,0.0012721913,0.0012534377,0.0008203467,0.006119062],"category_scores_gemma":[0.0024810445,0.0005678594,0.0007019041,0.0017999876,0.0007272564,0.0017570868,0.0021909664,0.0014138563,0.0017111828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059290923,0.0001612081,0.0028149774,0.0004883298,0.000109485256,0.00062342413,0.0006323871,0.46823573,0.038508657,0.24475001,0.013734808,0.22934815],"study_design_scores_gemma":[0.000078124394,0.000112982845,0.0013386073,0.000049478967,0.00002936098,0.0004903382,0.00017132275,0.7535985,0.013707651,0.21250196,0.017864805,0.00005683107],"about_ca_topic_score_codex":0.001722673,"about_ca_topic_score_gemma":0.0022049819,"teacher_disagreement_score":0.006119062,"about_ca_system_score_codex":0.000723538,"about_ca_system_score_gemma":0.00027352863,"threshold_uncertainty_score":0.020470321},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Polytechnique Montréal","funders":"","keywords":"Constructive; Computer science; Algorithm; Mathematics; Programming language","score_opus":0.010210136984915599,"score_gpt":0.2204246536533684,"score_spread":0.2102145166684528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296267519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046478407,0.00012774888,0.9909609,0.00020282491,0.000034773122,0.00010137701,0.00006605226,0.00042601733,0.0034324229],"genre_scores_gemma":[0.10125816,0.00028227718,0.89495045,0.00016243798,0.00009795325,0.00041627747,0.00036113686,0.00017900653,0.0022922999],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99701846,0.0014033092,0.00012281416,0.00044570476,0.00068793277,0.00032187335],"domain_scores_gemma":[0.99066436,0.006411899,0.00054978876,0.0012348825,0.00083610974,0.00030298598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032173053,0.0017641388,0.0011963847,0.0017179144,0.0010953638,0.002525624,0.0034031055,0.0018245251,0.0041595986],"category_scores_gemma":[0.012012974,0.00071898324,0.0014580812,0.0027358243,0.002122853,0.00282487,0.0029662468,0.0026700497,0.0010207769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019361309,0.000308644,0.00068638,0.0002806321,0.0000686233,0.00014435878,0.00032531287,0.44516876,0.0019255328,0.34458986,0.008315849,0.19799238],"study_design_scores_gemma":[0.00011742207,0.00006865884,0.00010118274,0.000029464398,0.00003068614,0.00009340274,0.00008803679,0.8442116,0.0017977649,0.1480609,0.0053808214,0.000020050209],"about_ca_topic_score_codex":0.0025455046,"about_ca_topic_score_gemma":0.003446258,"teacher_disagreement_score":0.0041595986,"about_ca_system_score_codex":0.0021888523,"about_ca_system_score_gemma":0.0026952839,"threshold_uncertainty_score":0.01701498},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013927623660651572,"score_gpt":0.27158858750897885,"score_spread":0.25766096384832726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2465996091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078109354,0.00024215282,0.9130961,0.00030410851,0.000023977382,0.00018140629,0.0012067093,0.00034874878,0.006487518],"genre_scores_gemma":[0.48589796,0.00047835425,0.5068497,0.000118546726,0.00004027607,0.00037826414,0.0022746262,0.00020237251,0.0037600098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998467,0.00031972307,0.000100647645,0.00040762432,0.00057740195,0.00012746203],"domain_scores_gemma":[0.9972096,0.0013228358,0.00043976333,0.0004096485,0.00039748178,0.00022070024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056937226,0.000738055,0.0008644283,0.0013504995,0.0009076976,0.0012956318,0.0018700814,0.0012291863,0.0053367796],"category_scores_gemma":[0.008761507,0.00082018255,0.0006562036,0.0018426944,0.0011038922,0.0032722515,0.00290516,0.0012564624,0.0005874951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049751805,0.0001838042,0.0056462707,0.0009540516,0.00011643529,0.0011719099,0.0008827171,0.4259057,0.017587626,0.32358032,0.00925349,0.21422009],"study_design_scores_gemma":[0.000070536444,0.00013703089,0.0018949049,0.000100851255,0.00005502434,0.000917344,0.0004187201,0.70198107,0.012648346,0.2651993,0.016530657,0.000046178753],"about_ca_topic_score_codex":0.0029850944,"about_ca_topic_score_gemma":0.003966944,"teacher_disagreement_score":0.0053367796,"about_ca_system_score_codex":0.00065333536,"about_ca_system_score_gemma":0.0008594569,"threshold_uncertainty_score":0.01785332},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016296599930877145,"score_gpt":0.28550247132498674,"score_spread":0.2692058713941096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2764287401","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2454323,0.00042686024,0.7220297,0.00093179196,0.000053428786,0.00017215061,0.0017161878,0.0017328172,0.027504832],"genre_scores_gemma":[0.7545698,0.0005862961,0.22900902,0.00029265543,0.00006412499,0.0002511493,0.004116879,0.0004180885,0.010691996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990552,0.0001289037,0.00004572219,0.00028736927,0.00025746206,0.00022531406],"domain_scores_gemma":[0.9975739,0.0006976994,0.00034362162,0.0008776904,0.00032570818,0.000181328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032345284,0.0011124404,0.0006184605,0.0006359336,0.0008029386,0.0013129408,0.0014184336,0.0007475477,0.008565103],"category_scores_gemma":[0.0025107278,0.0007852157,0.0009049687,0.0013769305,0.0016572697,0.0046244278,0.003231569,0.001752773,0.0012714415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059376063,0.00025303118,0.0037628277,0.0007003866,0.00012413277,0.00080409925,0.001074733,0.26707077,0.07011119,0.4835453,0.013556728,0.15840304],"study_design_scores_gemma":[0.00010416881,0.00060414383,0.0035443886,0.00009650408,0.0001320449,0.0018675727,0.0012203512,0.40066293,0.062239274,0.46920252,0.060193725,0.00013245858],"about_ca_topic_score_codex":0.0017997468,"about_ca_topic_score_gemma":0.002607407,"teacher_disagreement_score":0.008565103,"about_ca_system_score_codex":0.0008679359,"about_ca_system_score_gemma":0.0005992174,"threshold_uncertainty_score":0.028653085},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; University of Waterloo","funders":"","keywords":"Computer science; Graph; Graph drawing; Combinatorics; Mathematics; Theoretical computer science","score_opus":0.03062397399114286,"score_gpt":0.2644701421016975,"score_spread":0.23384616811055464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788640963","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57357496,0.00062419544,0.39031717,0.006390198,0.0001124396,0.00022714204,0.0024913684,0.0016474276,0.024615262],"genre_scores_gemma":[0.8651272,0.00060795643,0.12583667,0.0004322767,0.00006921524,0.00019262722,0.0020749469,0.00038834472,0.0052708383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977609,0.0005260816,0.00015403872,0.00079367956,0.00045142265,0.00031395737],"domain_scores_gemma":[0.9916796,0.0060666413,0.0006187041,0.0010735468,0.00027070017,0.00029077256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000987022,0.000756709,0.0010524231,0.0004942152,0.0011651997,0.0035761287,0.0027060811,0.0015614012,0.009003323],"category_scores_gemma":[0.009660025,0.0007041828,0.0016664411,0.0017394645,0.0019596051,0.009556555,0.0028918202,0.0026041018,0.00072586816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012176142,0.00025293152,0.005895502,0.0014357213,0.00021278068,0.0006719679,0.0018712393,0.53548014,0.014750992,0.29470327,0.01292599,0.13058193],"study_design_scores_gemma":[0.00015538215,0.00012831914,0.0013895729,0.00007635471,0.00016937157,0.0004883114,0.0005566598,0.53591824,0.008350002,0.4436476,0.009062415,0.000057794023],"about_ca_topic_score_codex":0.0033057607,"about_ca_topic_score_gemma":0.0030662855,"teacher_disagreement_score":0.009003323,"about_ca_system_score_codex":0.0020527286,"about_ca_system_score_gemma":0.0010520307,"threshold_uncertainty_score":0.030119061},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06704610915214952,"score_gpt":0.3427686469278052,"score_spread":0.27572253777565564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952754000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030139575,0.0066808895,0.90122765,0.004225761,0.00038095887,0.00031914716,0.0011564129,0.0023923838,0.053477235],"genre_scores_gemma":[0.6563401,0.007266785,0.30342895,0.0020364765,0.0009685309,0.001617159,0.0024082505,0.0035951675,0.022338483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9916283,0.0021613857,0.00033189307,0.0014583769,0.0019731603,0.0024468023],"domain_scores_gemma":[0.9373668,0.049460344,0.0026504002,0.0054109944,0.002126956,0.0029845424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069780517,0.00438269,0.0033406944,0.0030135307,0.002225152,0.007212249,0.007059452,0.003563166,0.023016695],"category_scores_gemma":[0.0517272,0.0014473206,0.0035269894,0.0038074178,0.0040748413,0.015768975,0.0071909246,0.011144319,0.0046209567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009308908,0.00054452557,0.0033691507,0.0016079581,0.00024828737,0.00026851453,0.0007336831,0.4906038,0.005535916,0.3858626,0.020012874,0.09028184],"study_design_scores_gemma":[0.0000669436,0.00017523851,0.00042336946,0.00022424037,0.00012476121,0.00021182437,0.00013624091,0.7151151,0.00222585,0.27581146,0.005431301,0.00005375121],"about_ca_topic_score_codex":0.002117627,"about_ca_topic_score_gemma":0.0036671164,"teacher_disagreement_score":0.023016695,"about_ca_system_score_codex":0.005323283,"about_ca_system_score_gemma":0.004038329,"threshold_uncertainty_score":0.07699853},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01542996390512583,"score_gpt":0.3150062101701762,"score_spread":0.29957624626505036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953333724","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9866028,0.0003167303,0.008082151,0.000081678656,0.00007288994,0.00033359995,0.0004388622,0.00037006754,0.0037012422],"genre_scores_gemma":[0.983687,0.00017678303,0.01247192,0.00008895721,0.000054284465,0.0005058098,0.00081560644,0.00022673642,0.0019729512],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9955539,0.002271297,0.0005062294,0.0007763065,0.0006355507,0.00025663857],"domain_scores_gemma":[0.8469999,0.13076907,0.0055142557,0.0099952305,0.0049660495,0.0017554988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036327643,0.0010951478,0.00067436986,0.0012354914,0.0005262192,0.0019408263,0.0013546952,0.0017472118,0.0148829045],"category_scores_gemma":[0.082193926,0.0005967583,0.0007303172,0.0007338169,0.00084926107,0.0025554749,0.0014880167,0.0010162344,0.0013174396],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.04766718,0.020001514,0.06546889,0.011846264,0.0009895948,0.002673376,0.040988088,0.023348663,0.44899347,0.0074236477,0.012418916,0.3181804],"study_design_scores_gemma":[0.006874917,0.08622795,0.40369257,0.002376378,0.0026507922,0.00839185,0.022582503,0.16822836,0.22304587,0.02393556,0.050723337,0.0012700114],"about_ca_topic_score_codex":0.00044497446,"about_ca_topic_score_gemma":0.0004287938,"teacher_disagreement_score":0.0148829045,"about_ca_system_score_codex":0.0003411402,"about_ca_system_score_gemma":0.00017480266,"threshold_uncertainty_score":0.049788237},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018019579993603523,"score_gpt":0.2642648077463178,"score_spread":0.24624522775271426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164604964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36730137,0.00028154216,0.61356956,0.0013089861,0.00005742449,0.00035312588,0.00489319,0.0013923127,0.010842422],"genre_scores_gemma":[0.54023606,0.0002934559,0.44166964,0.00038112325,0.00006236006,0.0003471825,0.007976567,0.0005125547,0.00852114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940276,0.00013752286,0.000024147424,0.00022499428,0.00011142625,0.00009912771],"domain_scores_gemma":[0.9983016,0.0010165655,0.00017817772,0.00021752257,0.00014494342,0.00014114658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004461531,0.0007810471,0.00096376357,0.0009537852,0.0011066704,0.0011902404,0.0014159435,0.0015020417,0.007557044],"category_scores_gemma":[0.0030229276,0.0007176224,0.0010808258,0.0017763806,0.0010042695,0.0028753963,0.0015204172,0.0011109757,0.00094518537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010487598,0.0006032658,0.00820796,0.0013116709,0.0003472318,0.0018419495,0.0014547687,0.52331465,0.04689971,0.20557202,0.035952725,0.17344531],"study_design_scores_gemma":[0.00014077444,0.00015459573,0.0022834516,0.0000875186,0.00007250733,0.00046435284,0.0006670169,0.69483757,0.009496066,0.28238407,0.009362414,0.000049655806],"about_ca_topic_score_codex":0.0025496304,"about_ca_topic_score_gemma":0.0037393118,"teacher_disagreement_score":0.007557044,"about_ca_system_score_codex":0.000717804,"about_ca_system_score_gemma":0.0007694022,"threshold_uncertainty_score":0.025280774},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.029834612093644887,"score_gpt":0.27346577042968856,"score_spread":0.24363115833604368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211907390","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17821747,0.0043930816,0.75418806,0.0066201147,0.00027641244,0.0006518378,0.004188649,0.006791635,0.044672742],"genre_scores_gemma":[0.4953602,0.0026863182,0.479401,0.001117873,0.00050378585,0.00075213565,0.006565554,0.0010529308,0.012560211],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99628985,0.0007300486,0.0002339463,0.0010903501,0.00097197655,0.0006837927],"domain_scores_gemma":[0.9860998,0.010290383,0.00094566715,0.0016948984,0.0005886128,0.00038065505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015983239,0.001723521,0.0017484557,0.0017561619,0.0020920837,0.006093255,0.0032309592,0.0024507702,0.011594722],"category_scores_gemma":[0.011234117,0.0011323047,0.002335997,0.003872171,0.0023233052,0.011502417,0.0039305096,0.0032881454,0.002245907],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016566019,0.00064249884,0.007955903,0.0014663767,0.0002869403,0.00046381063,0.0009959686,0.29028767,0.009375253,0.24909411,0.047454197,0.39032072],"study_design_scores_gemma":[0.00020461268,0.00012269487,0.0011548249,0.00009766856,0.00009593342,0.00044346642,0.00032395276,0.51074797,0.0040141414,0.47095042,0.011792503,0.000051884344],"about_ca_topic_score_codex":0.0054669045,"about_ca_topic_score_gemma":0.004829075,"teacher_disagreement_score":0.011594722,"about_ca_system_score_codex":0.0039902045,"about_ca_system_score_gemma":0.0025974854,"threshold_uncertainty_score":0.0387882},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Compression (physics); Graph; Theoretical computer science; Materials science; Composite material","score_opus":0.012441054180522498,"score_gpt":0.27545003469494855,"score_spread":0.26300898051442606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399370999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037741635,0.0013883127,0.95644337,0.00041532883,0.00007062816,0.00010387084,0.00014401012,0.0005254155,0.0031674393],"genre_scores_gemma":[0.36135963,0.0020797946,0.62899977,0.00028982727,0.00019037905,0.00021823017,0.000759747,0.0002992119,0.0058035427],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998767,0.000209507,0.00007132298,0.0002126484,0.0006404619,0.00009905427],"domain_scores_gemma":[0.9974388,0.0012279836,0.00026450533,0.00068287057,0.00032836135,0.000057412395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009943529,0.00089426583,0.0008077672,0.0018883646,0.0004779402,0.0009829473,0.0019210842,0.0011001126,0.0019760863],"category_scores_gemma":[0.0056713843,0.00034676943,0.0006118334,0.0032708086,0.0009961317,0.0033011166,0.0016155652,0.0012571303,0.0007009595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025778174,0.00017198318,0.00090911106,0.00047024156,0.000096597374,0.00031002073,0.0003361144,0.2832721,0.024825078,0.0873012,0.0052008945,0.59684885],"study_design_scores_gemma":[0.000046764464,0.00026247615,0.00050630624,0.000058802074,0.000048732178,0.0008884273,0.00014752054,0.8575749,0.030439511,0.10233612,0.0076629315,0.00002753586],"about_ca_topic_score_codex":0.0007590641,"about_ca_topic_score_gemma":0.0007813482,"teacher_disagreement_score":0.0019760863,"about_ca_system_score_codex":0.0006779391,"about_ca_system_score_gemma":0.00065138616,"threshold_uncertainty_score":0.006610632},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009399194379631248,"score_gpt":0.25290598610333714,"score_spread":0.2435067917237059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399371052","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13197923,0.003724827,0.80141383,0.001440945,0.0002035812,0.00025170544,0.002108877,0.0012878792,0.05758909],"genre_scores_gemma":[0.5793948,0.007939442,0.37530622,0.0008379134,0.00040689285,0.00044939434,0.005216811,0.00094343105,0.029505054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715024,0.0006176536,0.00022345828,0.0008129612,0.0007104511,0.00048522954],"domain_scores_gemma":[0.9881924,0.0059696385,0.0019984348,0.0021053958,0.0011086548,0.00062553544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010101276,0.0017725233,0.0012686574,0.0014835431,0.001235575,0.0038576352,0.0029381965,0.0014104868,0.014856563],"category_scores_gemma":[0.011579977,0.001566026,0.0013066187,0.0032798732,0.0014802889,0.008114294,0.0029072408,0.0028334875,0.0028601629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041243242,0.00017872655,0.002470891,0.0012367299,0.000103440565,0.0006870387,0.00068510044,0.09203642,0.01146506,0.71973765,0.021808205,0.14917836],"study_design_scores_gemma":[0.00006634258,0.00014997344,0.001997889,0.00017879081,0.00008454264,0.0022232977,0.00038158268,0.14455229,0.0077901906,0.79037094,0.05213444,0.00006981686],"about_ca_topic_score_codex":0.0011171619,"about_ca_topic_score_gemma":0.0019224379,"teacher_disagreement_score":0.014856563,"about_ca_system_score_codex":0.001471762,"about_ca_system_score_gemma":0.0006854871,"threshold_uncertainty_score":0.0497002},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Spanning tree; Combinatorics; Minimum spanning tree; Mathematics; Computer science","score_opus":0.018457793447468035,"score_gpt":0.2757615769877305,"score_spread":0.2573037835402625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399371091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20521507,0.0016245953,0.7719636,0.002409119,0.00014468476,0.00036629222,0.0029348347,0.000987104,0.014354727],"genre_scores_gemma":[0.544148,0.0015681208,0.4426407,0.00038866643,0.0001648139,0.00045088158,0.00483182,0.00030041861,0.0055065514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990742,0.0003160369,0.00006299525,0.00023036002,0.00018519412,0.00013116421],"domain_scores_gemma":[0.99835557,0.00097548764,0.00015257954,0.00021962405,0.0001629047,0.00013379003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078072114,0.0007004514,0.0012932867,0.0006925041,0.0008726299,0.0012961315,0.0012587557,0.001084591,0.002943641],"category_scores_gemma":[0.004502841,0.000535839,0.0008171791,0.0019130892,0.0006309556,0.0036447814,0.0012882664,0.001035355,0.00047883828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059216324,0.00028263003,0.0023093254,0.0007048797,0.00018637418,0.0005292962,0.00054031605,0.5337527,0.010828677,0.2458779,0.03580451,0.16859117],"study_design_scores_gemma":[0.0001375696,0.000102916536,0.0007284792,0.000050355742,0.000051948857,0.00034092375,0.0002551821,0.6717678,0.003709871,0.31219846,0.010634349,0.00002225569],"about_ca_topic_score_codex":0.0022964627,"about_ca_topic_score_gemma":0.0024960353,"teacher_disagreement_score":0.002943641,"about_ca_system_score_codex":0.0008210658,"about_ca_system_score_gemma":0.0010057421,"threshold_uncertainty_score":0.009847462},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Hypercube; Computer science; Parallel computing","score_opus":0.008143199895198298,"score_gpt":0.2516604544261473,"score_spread":0.24351725453094902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411391099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28096887,0.0020631975,0.6830604,0.0006417232,0.00015739576,0.00035907407,0.00072197616,0.0007896952,0.031237643],"genre_scores_gemma":[0.8112097,0.0012251147,0.17697717,0.00017648173,0.00008791348,0.0003556668,0.0009242379,0.00016809454,0.008875617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850637,0.0005371788,0.00010567086,0.00014811527,0.00045128068,0.00025136553],"domain_scores_gemma":[0.9964779,0.001431407,0.00040591165,0.0008126032,0.0006966212,0.00017563775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012929301,0.00026030777,0.0006097851,0.00092502875,0.0011881454,0.0018930472,0.0009803473,0.0006069029,0.002875634],"category_scores_gemma":[0.005881359,0.00038200957,0.00043407836,0.0013802365,0.0008238256,0.002904294,0.0014615936,0.0007035741,0.0005726047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007290321,0.00010178379,0.0018294798,0.00031489818,0.000060962077,0.00016141862,0.0009791818,0.12796688,0.022612046,0.69173104,0.0063463906,0.14716686],"study_design_scores_gemma":[0.0001775791,0.00025530273,0.00090315175,0.00009750746,0.000053825628,0.00027363628,0.00044074949,0.486257,0.017820837,0.4681975,0.025470722,0.000052233114],"about_ca_topic_score_codex":0.0012345267,"about_ca_topic_score_gemma":0.0014999543,"teacher_disagreement_score":0.002875634,"about_ca_system_score_codex":0.0012556835,"about_ca_system_score_gemma":0.0008340719,"threshold_uncertainty_score":0.009619951},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.01072175382599901,"score_gpt":0.27643784271796806,"score_spread":0.26571608889196907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415113082","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5239336,0.0038318746,0.43861088,0.0016130817,0.00012482052,0.00012753755,0.0005197541,0.0009108898,0.030327631],"genre_scores_gemma":[0.9424508,0.0029792741,0.050803997,0.00035040808,0.00009608152,0.00012564013,0.00040775436,0.00023375783,0.0025522106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986357,0.00041724055,0.00005783888,0.0002496652,0.00035456184,0.00028501975],"domain_scores_gemma":[0.9818611,0.0138035165,0.001599226,0.0012035307,0.0006520528,0.0008805534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013713262,0.0013922866,0.0011014227,0.0021322516,0.0011161227,0.0014177117,0.0019241021,0.00083627756,0.0040286304],"category_scores_gemma":[0.019984901,0.00065682904,0.0006588811,0.0026199864,0.0022605988,0.0041610305,0.0027338383,0.001695504,0.000499264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006690925,0.00018120764,0.0056501273,0.0006290397,0.00009763709,0.0005645059,0.00038435962,0.62062097,0.012352273,0.28689653,0.0046743364,0.067280024],"study_design_scores_gemma":[0.000046758007,0.00019242622,0.0017209465,0.000121175595,0.00006393311,0.000588882,0.00021800712,0.75898284,0.00759062,0.22684102,0.003582202,0.00005122395],"about_ca_topic_score_codex":0.0022454178,"about_ca_topic_score_gemma":0.002646416,"teacher_disagreement_score":0.0040286304,"about_ca_system_score_codex":0.0016863524,"about_ca_system_score_gemma":0.0007661219,"threshold_uncertainty_score":0.013477087},"labels":[],"label_agreement":null}]}