{"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047539902,0.002230723,0.99097764,0.0052258917,0.0004548195,0.00049103226,0.000041493982,0.000022479615,0.000080490594],"genre_scores_gemma":[0.12838314,0.004357398,0.85862595,0.00044146946,0.0059096594,0.0013456375,0.00008831586,0.00005504038,0.0007933913],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892807,0.000035401226,0.0004902908,0.00020788121,0.00019720956,0.00014117007],"domain_scores_gemma":[0.99788076,0.0006328199,0.0005763407,0.00028741534,0.00053105736,0.000091631795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051121425,0.00012906155,0.00018693034,0.00021357236,0.0005541172,0.00027864517,0.00053338264,0.00008788109,9.649293e-7],"category_scores_gemma":[0.000055880213,0.00008306942,0.00017135032,0.00025750638,0.000048877624,0.00015199957,0.000114316324,0.0001867129,7.4676854e-7],"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.000015282632,0.000060073893,0.000021354766,0.000032393975,0.00017807413,9.1684063e-7,0.00012865651,0.0017736641,0.00041431407,0.40584767,0.0025731446,0.58895445],"study_design_scores_gemma":[0.0007360646,0.000094383955,0.0013640843,0.00006806171,0.000063711785,0.00006676762,0.000032238728,0.032492653,0.00025127674,0.8097368,0.15486735,0.00022660934],"about_ca_topic_score_codex":0.0000015526806,"about_ca_topic_score_gemma":0.0000030906929,"teacher_disagreement_score":0.58872783,"about_ca_system_score_codex":0.000022699156,"about_ca_system_score_gemma":0.00017041915,"threshold_uncertainty_score":0.42618772},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98726946,0.006767677,0.005325584,0.000028270611,0.00010477998,0.00017041553,0.000012083133,0.000026779177,0.00029495836],"genre_scores_gemma":[0.9970627,0.0014209608,0.001341264,0.000012391011,0.00011363445,0.000031320797,0.0000015606198,0.000011940292,0.0000042595575],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9993461,0.000026044765,0.00031600654,0.00006133685,0.00008848917,0.000162022],"domain_scores_gemma":[0.99959886,0.000054851964,0.00008155995,0.00008891641,0.000032039672,0.0001438008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021445523,0.00009667915,0.00017481425,0.00029896665,0.00006815074,0.000024583946,0.000072337534,0.000051783165,0.0000025905513],"category_scores_gemma":[0.00000359914,0.000083967505,0.00004588272,0.0003923455,0.000055229106,0.0001891832,0.0000087872495,0.00016437065,9.727308e-7],"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.00014474112,0.0009342634,0.30872646,0.0007652574,0.00077679456,0.00003424168,0.008216865,0.0017204334,0.054416344,0.30827403,0.0021519624,0.31383863],"study_design_scores_gemma":[0.0024670733,0.00022174203,0.8379152,0.00024164958,0.0001370176,0.0008093358,0.0020533975,0.0037245231,0.0014202282,0.08742472,0.06281607,0.000769049],"about_ca_topic_score_codex":0.000007682621,"about_ca_topic_score_gemma":0.0000036991835,"teacher_disagreement_score":0.52918875,"about_ca_system_score_codex":0.000008641125,"about_ca_system_score_gemma":0.000003897231,"threshold_uncertainty_score":0.34240952},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008551965,0.00042514643,0.9818769,0.008556876,0.00005332486,0.00020375701,0.0000012432902,0.0000092380005,0.00032156656],"genre_scores_gemma":[0.61105317,0.0011246033,0.3831038,0.0033662901,0.00089126517,0.00014606907,0.0000055973424,0.000012194259,0.00029701728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934006,0.000052874435,0.00022776135,0.00011584113,0.00018880049,0.00007466565],"domain_scores_gemma":[0.9993597,0.00014009312,0.00017910026,0.00012875463,0.0001242923,0.000068038105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058157125,0.00006823975,0.000114160866,0.00010548027,0.00021124327,0.00011395389,0.00017208085,0.000019503941,0.0000016635292],"category_scores_gemma":[0.00001034506,0.000041494106,0.000047006928,0.00023435909,0.00006866129,0.0001204631,0.0000415917,0.000086888154,0.0000010321437],"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.000015082892,0.000048722097,0.000030354997,0.000005534932,0.000026351408,3.0603815e-7,0.00019681192,0.0013460628,0.0001523326,0.76027733,0.0006411132,0.23726001],"study_design_scores_gemma":[0.005442839,0.00049728865,0.0064167283,0.00004148719,0.00006617485,0.0002838606,0.000111227506,0.32175198,0.00061770726,0.5228723,0.14161596,0.00028245084],"about_ca_topic_score_codex":0.0000027761457,"about_ca_topic_score_gemma":5.0310547e-7,"teacher_disagreement_score":0.6025012,"about_ca_system_score_codex":0.000005963934,"about_ca_system_score_gemma":0.000017942955,"threshold_uncertainty_score":0.16920805},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05727512,0.0012740846,0.9400798,0.00071191345,0.000054471344,0.00021653862,0.000024564995,0.0000090921985,0.00035443],"genre_scores_gemma":[0.77172565,0.00030675164,0.22775422,0.000058234127,0.000088177556,0.00004035694,0.0000012425805,0.0000094591705,0.000015882117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988262,0.0000705243,0.00046875264,0.00010819609,0.00030725176,0.00021905838],"domain_scores_gemma":[0.9985543,0.00037796504,0.00039022358,0.00029524538,0.0002542479,0.00012800348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071826455,0.000097722164,0.00022260555,0.00018990623,0.00023737064,0.000030012083,0.0004887167,0.000039830506,0.00000385806],"category_scores_gemma":[0.000019547537,0.00006924185,0.00013109225,0.00093115226,0.00026671108,0.00044805882,0.000039275295,0.00022283901,0.0000011544074],"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.000039758233,0.00082198635,0.004757102,0.00007194843,0.00027666552,0.0000028924826,0.0039714016,0.00008629855,0.015256482,0.90897465,0.00028046637,0.06546035],"study_design_scores_gemma":[0.0036267147,0.0005875665,0.022123497,0.00037997073,0.00032800698,0.00208389,0.0070523475,0.012458407,0.008656466,0.93498474,0.006966367,0.0007520357],"about_ca_topic_score_codex":0.0000074806085,"about_ca_topic_score_gemma":0.0000016138663,"teacher_disagreement_score":0.71445054,"about_ca_system_score_codex":0.0000078234725,"about_ca_system_score_gemma":0.000047981233,"threshold_uncertainty_score":0.28236005},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08126003,0.0009173566,0.9153892,0.0020777162,0.0001536531,0.0001118927,0.0000024189467,0.0000056557233,0.00008207491],"genre_scores_gemma":[0.8338745,0.00022541721,0.16542336,0.00011673911,0.00031395405,0.00002291186,0.0000018799378,0.0000051890074,0.000015999563],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927104,0.000014601677,0.00032198743,0.0000941569,0.0002082852,0.00008991538],"domain_scores_gemma":[0.99933696,0.00011760358,0.00019964276,0.00011307158,0.00018361915,0.000049121372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034049177,0.000058181737,0.000100200785,0.00011092265,0.00016308427,0.000050236555,0.00022242445,0.000024677087,0.0000013323989],"category_scores_gemma":[0.000011824001,0.000040871197,0.000057910333,0.0005533536,0.00005526117,0.00019928066,0.000046839745,0.000105718485,0.0000013267477],"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.000016641443,0.00035115372,0.002607691,0.000016890346,0.00006349272,0.000008685356,0.0002983947,0.03381747,0.0013982363,0.40809128,0.00021832837,0.55311173],"study_design_scores_gemma":[0.0011888655,0.00011045808,0.046746276,0.00006546035,0.000017014429,0.00044195546,0.00006547011,0.010869891,0.0019291512,0.93049103,0.007909219,0.00016522204],"about_ca_topic_score_codex":0.0000150401065,"about_ca_topic_score_gemma":0.00001889956,"teacher_disagreement_score":0.7526145,"about_ca_system_score_codex":0.000014434636,"about_ca_system_score_gemma":0.00009479914,"threshold_uncertainty_score":0.16666791},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7562633,0.009481633,0.23286806,0.0004903417,0.00008389805,0.00062284805,0.000051977342,0.000014062886,0.00012383818],"genre_scores_gemma":[0.9888309,0.00042953057,0.010597827,0.000022261465,0.000041001156,0.000022777043,5.989098e-7,0.000009234853,0.000045848017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99871266,0.00011404681,0.00050139416,0.0001662736,0.00033288405,0.00017271617],"domain_scores_gemma":[0.9984825,0.00013443403,0.00043981924,0.0003444348,0.0005292341,0.0000695814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007103269,0.00011070146,0.00025629657,0.00024241627,0.00020527834,0.000054315406,0.00058355037,0.000046071134,0.0000013801098],"category_scores_gemma":[0.000030278414,0.00007106948,0.000103456296,0.0010070946,0.000560808,0.0002535687,0.0001584029,0.00017711907,2.1528895e-7],"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.0001299981,0.0016453342,0.0887819,0.00044686932,0.0004199502,0.00000554017,0.0012923446,0.00039374543,0.0930765,0.5739665,0.00064911385,0.2391922],"study_design_scores_gemma":[0.0013744365,0.00041764296,0.54775214,0.00024250595,0.00006324208,0.00022911765,0.00025091183,0.0053613074,0.027685635,0.41446322,0.0017713624,0.0003884339],"about_ca_topic_score_codex":0.00021924409,"about_ca_topic_score_gemma":0.000043255237,"teacher_disagreement_score":0.45897028,"about_ca_system_score_codex":0.000008014396,"about_ca_system_score_gemma":0.000082196246,"threshold_uncertainty_score":0.28981295},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002845408,0.00047206428,0.99299127,0.0022031516,0.0001306615,0.00017398827,0.000009114713,0.00001958716,0.001154752],"genre_scores_gemma":[0.5644418,0.0014103125,0.4329495,0.00019576839,0.0004823866,0.00011333198,0.0000027709048,0.00002273355,0.00038139895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989839,0.000034904115,0.00030689148,0.0001905607,0.00028826203,0.00019549036],"domain_scores_gemma":[0.99822074,0.00009056003,0.00041110854,0.0007204066,0.00034338472,0.0002138069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048713607,0.00009730882,0.00015968483,0.000282199,0.0010995595,0.00038251333,0.0012257333,0.000039301725,0.0000057079656],"category_scores_gemma":[0.000050525978,0.00008195489,0.00011581317,0.0003125527,0.0002835002,0.001024996,0.00016336699,0.00022786402,0.000004992747],"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.0000046742784,0.00009050565,0.0012667689,0.000006256256,0.000046000543,0.000009401562,0.00018308328,0.000021159856,0.0003960288,0.8598692,0.00030774722,0.1377992],"study_design_scores_gemma":[0.0006126417,0.00013255383,0.01937512,0.000019072653,0.00002074473,0.00017819149,0.00015291719,0.000680419,0.00038130407,0.9499973,0.02827923,0.0001705013],"about_ca_topic_score_codex":0.000013117323,"about_ca_topic_score_gemma":0.0000060465127,"teacher_disagreement_score":0.5615964,"about_ca_system_score_codex":0.000011755903,"about_ca_system_score_gemma":0.00006017908,"threshold_uncertainty_score":0.84570336},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033884566,0.00079063297,0.96394575,0.0010104064,0.00011183627,0.00009818311,0.0000019934412,0.000010714666,0.00014592758],"genre_scores_gemma":[0.71100736,0.00014067751,0.28829885,0.00021525109,0.00026870117,0.000023260729,0.0000034526931,0.000005649348,0.000036822705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992944,0.000020949645,0.00027995434,0.00011546478,0.00019258357,0.00009664261],"domain_scores_gemma":[0.9993122,0.000067020046,0.00014759328,0.00012287255,0.00020999894,0.00014031942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044352494,0.000062876905,0.00011133441,0.00029542626,0.000077113924,0.00007074009,0.00019606634,0.000027937345,0.0000014104394],"category_scores_gemma":[0.000022546477,0.000054217315,0.000040959552,0.0006537362,0.000023334715,0.0003827362,0.00005731428,0.00011360174,0.0000029850764],"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.000017590057,0.00043277277,0.0038687808,0.00001538444,0.00006515967,0.000035360354,0.0013534547,0.038828626,0.0012277531,0.59377253,0.0033881243,0.35699448],"study_design_scores_gemma":[0.0015097427,0.00027202573,0.012855262,0.000045020155,0.00002182999,0.0005519129,0.00030798392,0.299625,0.00034919893,0.66041076,0.023770258,0.00028101765],"about_ca_topic_score_codex":0.0000072750254,"about_ca_topic_score_gemma":0.000009245802,"teacher_disagreement_score":0.6771228,"about_ca_system_score_codex":0.000019153864,"about_ca_system_score_gemma":0.000079404956,"threshold_uncertainty_score":0.22109179},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038450893,0.0030769857,0.9545612,0.00052665407,0.0011573595,0.0014888316,0.0001559444,0.0001779155,0.00040424487],"genre_scores_gemma":[0.98079216,0.0013298359,0.015242024,0.000027421893,0.0014204208,0.00092266203,0.0000028717752,0.000056292076,0.00020630601],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999141,0.00002440723,0.00039432163,0.00011762884,0.00012418353,0.00019845282],"domain_scores_gemma":[0.99911654,0.00026513328,0.00015177242,0.00014150208,0.00022248841,0.00010256654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032431228,0.00013731865,0.0002110853,0.00009913633,0.00024313355,0.000043726053,0.00016679165,0.00006473838,0.000010652402],"category_scores_gemma":[0.000008153853,0.000070973845,0.00012928306,0.00024242396,0.00015881284,0.00015469496,0.000014009379,0.00011973557,0.0000019518757],"study_design_candidate":"design_other","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.00018428404,0.00011727777,0.0006156948,0.00014004175,0.0014082106,0.00000400832,0.00081639393,0.00019372105,0.04210555,0.07048226,0.0026672678,0.8812653],"study_design_scores_gemma":[0.010688101,0.0011576153,0.0047053243,0.0006249718,0.001164074,0.0012444303,0.0029305927,0.041963045,0.06074493,0.16730326,0.70578456,0.0016891035],"about_ca_topic_score_codex":0.000003102212,"about_ca_topic_score_gemma":0.0000015315476,"teacher_disagreement_score":0.94234127,"about_ca_system_score_codex":0.000019821675,"about_ca_system_score_gemma":0.000020260164,"threshold_uncertainty_score":0.28942293},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029363973,0.00020443012,0.96886736,0.00068640726,0.00016976097,0.00015709152,0.0000114075265,0.000008650388,0.00053092715],"genre_scores_gemma":[0.90250033,0.0001155062,0.097170435,0.000028715805,0.00014880468,0.000009447966,0.0000018696671,0.0000028076572,0.000022054057],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991695,0.000020636402,0.00036255675,0.00013711801,0.00021248564,0.00009769607],"domain_scores_gemma":[0.99851763,0.00005542518,0.00065778615,0.0002782436,0.00038882272,0.00010210691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034581393,0.00007999701,0.00016930957,0.00018349578,0.0003576855,0.00014563683,0.00048244192,0.00004017424,0.0000064115493],"category_scores_gemma":[0.000034137607,0.000069978916,0.00010573432,0.0001765715,0.00032890608,0.0005205611,0.00007272723,0.000106517844,7.24102e-7],"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.000007225144,0.00021334388,0.0008491873,0.000024851613,0.00008291045,0.0000047725457,0.00012547619,0.00011002211,0.0055611515,0.4139529,0.00018624039,0.5788819],"study_design_scores_gemma":[0.0041459533,0.0006453803,0.12288769,0.00015389123,0.00018622002,0.0011891265,0.00020280416,0.02992963,0.029879812,0.8010637,0.009003391,0.0007123605],"about_ca_topic_score_codex":0.0000041018143,"about_ca_topic_score_gemma":0.0000014143767,"teacher_disagreement_score":0.8731364,"about_ca_system_score_codex":0.000004925637,"about_ca_system_score_gemma":0.00011017921,"threshold_uncertainty_score":0.28536573},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031514376,0.0008467336,0.9663243,0.00093612506,0.00012002713,0.00011033221,0.000005274002,0.0000114329105,0.00013139754],"genre_scores_gemma":[0.9143201,0.00055516366,0.08467938,0.000085536485,0.00027973863,0.000009863524,0.0000015517292,0.0000036230042,0.00006502982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992952,0.000016220987,0.00024231993,0.0001511828,0.0001871578,0.00010791673],"domain_scores_gemma":[0.99891186,0.00016128247,0.0003520327,0.000216737,0.00022271465,0.00013538587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032600889,0.00007396716,0.0001351965,0.00022920256,0.0007187314,0.00050092937,0.0003373411,0.000037664075,0.0000021154417],"category_scores_gemma":[0.00008602486,0.000067312125,0.000041864816,0.00024225916,0.000067300054,0.00046472825,0.00010127417,0.00011496724,0.0000011520095],"study_design_candidate":"design_other","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.0000072985827,0.000120114884,0.0020171336,0.00001780759,0.000058483693,0.000023295406,0.00013520896,0.0031137692,0.0003440237,0.03156799,0.00047236597,0.9621225],"study_design_scores_gemma":[0.0021356645,0.00060076424,0.102980666,0.00006680109,0.00011859871,0.0016008453,0.00010669181,0.67738146,0.0011582028,0.101482846,0.111721694,0.00064579054],"about_ca_topic_score_codex":0.000011723153,"about_ca_topic_score_gemma":0.0000063478174,"teacher_disagreement_score":0.96147674,"about_ca_system_score_codex":0.000009203467,"about_ca_system_score_gemma":0.000041576066,"threshold_uncertainty_score":0.5527973},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030609472,0.0015479982,0.9640176,0.003463601,0.00011377898,0.00015121122,0.0000044385683,0.0000062563104,0.000085611115],"genre_scores_gemma":[0.97673863,0.00018021741,0.022846054,0.000095073854,0.000076839264,0.00003726815,0.0000019457407,0.0000027140372,0.00002125064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916726,0.00006569354,0.0003300601,0.00009607867,0.0002543241,0.00008659373],"domain_scores_gemma":[0.99932706,0.00011611713,0.00028070397,0.00012364105,0.00011057538,0.000041883042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049849495,0.000050333503,0.00010031049,0.00023869306,0.00042453842,0.000042930893,0.00032655432,0.000011327677,0.0000016139547],"category_scores_gemma":[0.000008105781,0.00003981367,0.000070239155,0.000965064,0.00010639234,0.00013821918,0.00010297353,0.00015867768,9.9902635e-8],"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.000021857904,0.000244145,0.0009835538,0.000008753223,0.00003554663,0.000006549523,0.00055208814,0.0067331125,0.0007188199,0.7609088,0.00046006346,0.22932671],"study_design_scores_gemma":[0.0010395607,0.0003642103,0.05093658,0.000019265022,0.0000190167,0.0007452561,0.0006040598,0.062510796,0.0003368673,0.8531887,0.030043254,0.00019244938],"about_ca_topic_score_codex":0.000013290212,"about_ca_topic_score_gemma":0.0000059893428,"teacher_disagreement_score":0.94612914,"about_ca_system_score_codex":0.00001707494,"about_ca_system_score_gemma":0.000069892594,"threshold_uncertainty_score":0.3265249},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020793357,0.0007802626,0.9959007,0.0020196289,0.00037257216,0.0005460707,0.000031920103,0.000025725614,0.000115194416],"genre_scores_gemma":[0.061129797,0.0045967815,0.9321246,0.00032662533,0.0011890429,0.00034200586,0.000037582937,0.000044858836,0.0002086741],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998629,0.00003466097,0.00052533514,0.00028426564,0.0003086804,0.00021809658],"domain_scores_gemma":[0.9973639,0.00006118194,0.0008732713,0.00053514505,0.0009822974,0.00018416726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053789763,0.00018723316,0.00031751677,0.00042936826,0.0006382595,0.000890915,0.0008720455,0.00016346807,0.0000019953795],"category_scores_gemma":[0.000024945039,0.00016531406,0.00021558323,0.00023845374,0.00020646672,0.00069354335,0.00032134715,0.0003615254,6.688314e-7],"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.000045661203,0.0007898962,0.00016013489,0.00042226448,0.0005206533,0.000010204437,0.0021760378,0.116385035,0.00046976536,0.2717833,0.0051244516,0.6021126],"study_design_scores_gemma":[0.00087460683,0.00026089433,0.00017365105,0.00021258566,0.00009925823,0.000089267574,0.00019242604,0.4618252,0.00020770342,0.49768192,0.037900496,0.00048200178],"about_ca_topic_score_codex":0.000033415086,"about_ca_topic_score_gemma":0.000005963935,"teacher_disagreement_score":0.6016306,"about_ca_system_score_codex":0.000038017824,"about_ca_system_score_gemma":0.00029801828,"threshold_uncertainty_score":0.85911137},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14210284,0.00009478046,0.8574259,0.00013001342,0.00002402957,0.00007750482,0.000016374259,0.0000036681977,0.00012487176],"genre_scores_gemma":[0.9811734,0.000020790587,0.01869156,0.00006711493,0.000025169358,0.0000023839584,0.0000013932889,0.000001990437,0.000016199412],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9992776,0.000020587719,0.00031026624,0.00010149334,0.00023277837,0.00005730727],"domain_scores_gemma":[0.9988845,0.000020717895,0.00048488964,0.00028044972,0.0002810066,0.00004842147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019084559,0.00005260463,0.0001643322,0.00016587244,0.000095355455,0.00003974829,0.00046380292,0.000016520118,0.000008836145],"category_scores_gemma":[0.0000049054256,0.000030888245,0.000090307854,0.001525734,0.00019558067,0.00021789208,0.00008972471,0.000041629883,1.494141e-7],"study_design_candidate":"observational","study_design_consensus":"observational","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.000104993815,0.006107617,0.48491094,0.00016789895,0.0073575904,0.0000038403077,0.010382639,0.0006448926,0.07859538,0.24095121,0.0021933527,0.16857967],"study_design_scores_gemma":[0.002297614,0.0011152807,0.61439633,0.00016075098,0.0019080649,0.000047620575,0.0018409943,0.12797233,0.23753871,0.007428404,0.0048004114,0.0004934886],"about_ca_topic_score_codex":0.000009924774,"about_ca_topic_score_gemma":0.0000033219787,"teacher_disagreement_score":0.83907056,"about_ca_system_score_codex":0.000007103261,"about_ca_system_score_gemma":0.000038425613,"threshold_uncertainty_score":0.1259586},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056853373,0.00066349586,0.94125366,0.0007858829,0.00013054472,0.00016426803,0.0000055036135,0.000013618173,0.00012965144],"genre_scores_gemma":[0.93108237,0.00017602614,0.06827399,0.0001811743,0.00014400342,0.0000931897,0.0000052818673,0.0000060660027,0.00003787632],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902374,0.000057623,0.00035674372,0.0001656006,0.00026403557,0.00013226572],"domain_scores_gemma":[0.9993959,0.000090261194,0.00023440168,0.00012418961,0.00007970196,0.00007550915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005543549,0.000077510755,0.00013071041,0.0006003959,0.00032982609,0.00009685524,0.0003122565,0.000020908466,0.000008294549],"category_scores_gemma":[0.00000737679,0.00007871765,0.00007320015,0.0013300986,0.000019914287,0.0003086383,0.00012812874,0.00025536332,4.6913075e-7],"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.000020140627,0.00046402466,0.0012986811,0.000022873752,0.000062174615,0.000040902945,0.0009712297,0.030811321,0.0016607136,0.46974316,0.0004067728,0.49449798],"study_design_scores_gemma":[0.0021426762,0.0005375129,0.029017333,0.000036183526,0.000031012816,0.0012179029,0.0008491015,0.061046686,0.00050972967,0.86666715,0.0374663,0.0004784203],"about_ca_topic_score_codex":0.000014159069,"about_ca_topic_score_gemma":0.0000063273496,"teacher_disagreement_score":0.874229,"about_ca_system_score_codex":0.000043510652,"about_ca_system_score_gemma":0.00007597359,"threshold_uncertainty_score":0.32100126},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007418556,0.002578581,0.98782766,0.0017004671,0.00011981476,0.00007933063,0.000011471889,0.000014703553,0.00024938968],"genre_scores_gemma":[0.17766464,0.0020135152,0.818461,0.0008410865,0.0007065364,0.00002347746,0.000022550481,0.000011015834,0.00025617945],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920017,0.000034623263,0.0002682671,0.00018276315,0.00020685558,0.000107328146],"domain_scores_gemma":[0.99908936,0.00008817556,0.0001704747,0.00014990705,0.0003637327,0.0001383242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022340019,0.00008408563,0.00015082801,0.00012857062,0.00021942315,0.00017518495,0.00015440908,0.00003566607,0.000008330526],"category_scores_gemma":[0.000015243701,0.000077876364,0.000059842936,0.0005579159,0.00007267111,0.0003623547,0.000089062894,0.00011734513,0.000001671135],"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.0000057180873,0.00031225983,0.00044662296,0.000024928278,0.0001027028,0.000034663233,0.00032456822,0.00052882446,0.0026501238,0.29835576,0.0019111087,0.6953027],"study_design_scores_gemma":[0.002661713,0.00046983053,0.045604087,0.000073400326,0.00011658277,0.003807458,0.00050453114,0.12283184,0.006737076,0.54517174,0.2713182,0.00070350856],"about_ca_topic_score_codex":0.000004385966,"about_ca_topic_score_gemma":0.0000028761137,"teacher_disagreement_score":0.6945992,"about_ca_system_score_codex":0.000011666395,"about_ca_system_score_gemma":0.000087881584,"threshold_uncertainty_score":0.3175706},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021531223,0.008483145,0.9891365,0.0010044673,0.00021036381,0.00016089572,0.000015847692,0.00013140896,0.00064202695],"genre_scores_gemma":[0.115846194,0.0076142796,0.8745346,0.0002620434,0.0012970542,0.00013474216,0.000016166288,0.00004194157,0.0002529436],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987844,0.00003260363,0.00041359515,0.00027159607,0.0003196982,0.00017806633],"domain_scores_gemma":[0.9990243,0.00009524761,0.00016921945,0.00039303908,0.00015618913,0.00016205676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032940521,0.00014314266,0.00020166904,0.0003229775,0.00025225684,0.00042667988,0.0007515001,0.00006520752,0.000008870595],"category_scores_gemma":[0.000006625787,0.00010354275,0.00012581561,0.00070017297,0.00007515244,0.0009956749,0.0002745465,0.00029513976,0.0000028510508],"study_design_candidate":"design_other","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.0000036608465,0.0000809899,0.00006683199,0.000058939226,0.00003724749,0.000027087026,0.00014226277,0.000010358162,0.0017858997,0.077420175,0.008637824,0.91172874],"study_design_scores_gemma":[0.00025649398,0.00018025938,0.0011693359,0.0006501028,0.000045639295,0.00043905855,0.00009951044,0.04291753,0.0026961952,0.21497099,0.7362071,0.00036773144],"about_ca_topic_score_codex":0.000011394317,"about_ca_topic_score_gemma":0.00000102936,"teacher_disagreement_score":0.911361,"about_ca_system_score_codex":0.000016076332,"about_ca_system_score_gemma":0.000045722434,"threshold_uncertainty_score":0.42223507},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064386195,0.0040474967,0.9879117,0.0010710765,0.00017491111,0.00007830811,0.000006359784,0.000018222854,0.00025331927],"genre_scores_gemma":[0.77576613,0.0010498082,0.22248577,0.0001340385,0.00035772577,0.000018994837,0.00000598478,0.000009051848,0.00017249775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992983,0.0000137195675,0.00030072435,0.00011943466,0.00019349634,0.00007433395],"domain_scores_gemma":[0.99943465,0.00009472003,0.0001233861,0.00010673201,0.0001693734,0.00007114659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024459022,0.000063748055,0.000114983755,0.00036581242,0.00007501679,0.00009353631,0.00020631996,0.000028176119,0.0000034854245],"category_scores_gemma":[0.0000055706705,0.000052705338,0.000093383016,0.0008186364,0.000041299823,0.00029641835,0.000021144431,0.0000945628,0.0000019188328],"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.0000021991093,0.00007856644,0.00006498132,0.000044781053,0.000066525536,0.000007651134,0.00025781716,0.00022745403,0.0033383796,0.6068977,0.0018845069,0.38712943],"study_design_scores_gemma":[0.00045410355,0.00041727646,0.003589377,0.0001403691,0.00009143779,0.00061071507,0.000091546885,0.04302519,0.004717084,0.7584658,0.1881123,0.00028476436],"about_ca_topic_score_codex":0.0000034890913,"about_ca_topic_score_gemma":5.659882e-7,"teacher_disagreement_score":0.7693275,"about_ca_system_score_codex":0.000006120028,"about_ca_system_score_gemma":0.00006362892,"threshold_uncertainty_score":0.21492612},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046279823,0.003853628,0.97870183,0.014687827,0.00017332139,0.00029317813,0.0000057852044,0.00005284314,0.001768807],"genre_scores_gemma":[0.51826537,0.01754501,0.45671114,0.0016981841,0.001286442,0.00041463107,0.000010149971,0.00006597732,0.00400307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992012,0.000032140386,0.00027363808,0.00013349426,0.00022542046,0.00013412036],"domain_scores_gemma":[0.9992882,0.00021228392,0.00009503124,0.000165128,0.00013603191,0.00010334405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045773457,0.00007270651,0.00008973263,0.00013629245,0.00031993067,0.00051854923,0.00031784596,0.00002499371,0.000002597551],"category_scores_gemma":[0.000007930681,0.0000433052,0.00007845256,0.00043552654,0.0000814331,0.00018566767,0.000044127355,0.00018407754,0.000005996375],"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.000004571902,0.000085791056,0.000054501157,0.000021253636,0.00008532403,0.000012461615,0.0004916115,0.0011076571,0.00023368251,0.5495132,0.0076629263,0.440727],"study_design_scores_gemma":[0.00050183723,0.0005044496,0.0011411596,0.00020594991,0.000036478505,0.00032766897,0.0003625015,0.21608374,0.0002122391,0.0958059,0.6845638,0.00025428968],"about_ca_topic_score_codex":0.0000017097591,"about_ca_topic_score_gemma":0.000002037867,"teacher_disagreement_score":0.67690086,"about_ca_system_score_codex":0.00001191843,"about_ca_system_score_gemma":0.00006705708,"threshold_uncertainty_score":0.5000382},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064515267,0.0023429357,0.9892216,0.00057810295,0.00019212937,0.00007899428,0.0000016218702,0.00000885068,0.0011242721],"genre_scores_gemma":[0.9557125,0.0006525176,0.04294762,0.00015114273,0.00020084297,0.000016854827,3.6090626e-7,0.000003565279,0.00031461427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993982,0.000016988719,0.0003334423,0.00008517884,0.00009644227,0.000069799804],"domain_scores_gemma":[0.9993371,0.000054925084,0.00018122105,0.0001518882,0.00023575034,0.000039114955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020838101,0.000053152256,0.0001518013,0.00018535614,0.00008482754,0.000048053767,0.00025691724,0.000032173368,0.0000024386172],"category_scores_gemma":[0.000005595731,0.000041355925,0.00008176169,0.0004239293,0.00004271199,0.00015019583,0.000040706578,0.00008593594,5.9851925e-7],"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.0000035905166,0.00012379227,0.0010252832,0.00003842445,0.00010309586,0.0000015149951,0.00016022281,0.00008943706,0.0019475342,0.5727456,0.0027496638,0.42101184],"study_design_scores_gemma":[0.001547764,0.00041671167,0.0077353576,0.00046426995,0.00009897386,0.0005199153,0.0009373401,0.05073174,0.008214965,0.10770752,0.8212315,0.00039393405],"about_ca_topic_score_codex":0.000007678017,"about_ca_topic_score_gemma":8.908151e-7,"teacher_disagreement_score":0.94926095,"about_ca_system_score_codex":0.000006245716,"about_ca_system_score_gemma":0.00003428754,"threshold_uncertainty_score":0.16864456},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013285732,0.00056825776,0.9836309,0.0011477597,0.00013756062,0.00011592385,0.0000030598317,0.000018420282,0.0010923682],"genre_scores_gemma":[0.8732596,0.0004894397,0.124935426,0.0008777279,0.00016390359,0.000037429607,0.0000053955073,0.00000549671,0.00022556454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932164,0.000020482974,0.00025468288,0.00014160197,0.000174075,0.00008754371],"domain_scores_gemma":[0.9994239,0.00009492293,0.00009286715,0.0001526934,0.00016622996,0.00006937261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021240795,0.00007797143,0.0001229229,0.0004060239,0.00018739088,0.00009310677,0.00025333444,0.000032642616,0.0000017073841],"category_scores_gemma":[0.000009526062,0.00006483437,0.000069879585,0.000682842,0.000034879107,0.00017519841,0.0000234117,0.00011593124,0.0000015938506],"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.000005419622,0.00010105942,0.00055233977,0.0000066602333,0.000043671207,0.0000017876664,0.000031559728,0.00061697495,0.00042780003,0.69989896,0.0015702905,0.29674348],"study_design_scores_gemma":[0.000604118,0.00024470285,0.031088052,0.000070750866,0.000052798503,0.000115963216,0.0000493383,0.017923705,0.0016946931,0.90617925,0.041744847,0.00023176384],"about_ca_topic_score_codex":0.000001878851,"about_ca_topic_score_gemma":0.0000013335875,"teacher_disagreement_score":0.8599739,"about_ca_system_score_codex":0.000010089813,"about_ca_system_score_gemma":0.0000539993,"threshold_uncertainty_score":0.2643869},"labels":[],"label_agreement":null}]}