{"meta":{"query_hash":"0fbf8c78a995","filters":{"venue":"Graph Drawing E-print Archive (Die Universität zu Köln)"},"cohort_total":10,"direct_labels_cover":0,"predictions_cover":10,"exported":10,"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/0fbf8c78a995","api":"https://metacan.xera.ac/api/v1/cohort?venue=Graph+Drawing+E-print+Archive+%28Die+Universit%C3%A4t+zu+K%C3%B6ln%29"},"results":[{"id":"W2462105638","doi":"10.1007/978-3-642","title":"Homotopic -Oriented Routing","year":2013,"lang":"en","type":"article","venue":"Graph Drawing E-print Archive (Die Universität zu Köln)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Computer science; Process (computing); Context (archaeology); Service (business); Process management; Service design; Business process; Business process modeling; Knowledge management; Service delivery framework; Work in process; Business; Marketing","score_opus":0.008032525424219467,"score_gpt":0.19451812844154506,"score_spread":0.18648560301732559,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2462105638","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.20794116,0.00004339782,0.78223747,0.00066661433,0.00046403066,0.00024577114,0.0000026504251,0.00023529492,0.008163617],"genre_scores_gemma":[0.91342705,0.000018395873,0.08528459,0.00028056023,0.000115446004,0.000007257858,0.000026694825,0.000010585488,0.00082943164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984292,0.000105071595,0.00022203152,0.00052603934,0.00031196233,0.0004057285],"domain_scores_gemma":[0.9989526,0.00015284547,0.000110405716,0.0004494537,0.00015533832,0.00017931922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015799573,0.00019826097,0.00017248635,0.00051594205,0.0005065406,0.00018750528,0.000709977,0.000048077232,0.00007228596],"category_scores_gemma":[0.000044583852,0.00021226953,0.00015902294,0.0006610885,0.00007512049,0.001588932,0.0005622181,0.0002200419,0.00024698433],"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.00001166601,0.00014207422,0.0030917805,0.000029655836,0.0001395342,0.00008257322,0.004876654,0.007213039,0.011265087,0.89014316,0.0014222196,0.08158253],"study_design_scores_gemma":[0.0031858939,0.00045673322,0.2033851,0.00025868384,0.00009003865,0.00009210369,0.0014915236,0.44394198,0.009177203,0.26586828,0.07001259,0.0020398705],"about_ca_topic_score_codex":0.00015938225,"about_ca_topic_score_gemma":0.000018551807,"teacher_disagreement_score":0.7054859,"about_ca_system_score_codex":0.00006274481,"about_ca_system_score_gemma":0.00007589488,"threshold_uncertainty_score":0.86561006},"labels":[],"label_agreement":null},{"id":"W2899943641","doi":"","title":"Planar k-NodeTrix Graphs: A New Family of Beyond Planar Graphs","year":2017,"lang":"en","type":"article","venue":"Graph Drawing E-print Archive (Die Universität zu Köln)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ciência sem Fronteiras; Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Austrian Science Fund; Grantová Agentura České Republiky; National Institutes of Health; National Science Foundation","keywords":"Planar; Combinatorics; Planar graph; 1-planar graph; Planar straight-line graph; Chordal graph; Outerplanar graph; Mathematics; Pathwidth; Computer science; Discrete mathematics; Graph; Line graph; Computer graphics (images)","score_opus":0.023472459383375346,"score_gpt":0.25993526909825093,"score_spread":0.2364628097148756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899943641","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.1788595,0.0009801949,0.76610035,0.0011659586,0.001086296,0.0010776479,0.00017834804,0.0006053364,0.04994636],"genre_scores_gemma":[0.9010244,0.00063265406,0.09674455,0.00025796134,0.00008321836,0.000008885529,0.000036999798,0.00007900883,0.0011323475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99538285,0.00036389878,0.00056088704,0.0013515218,0.0010855778,0.0012552754],"domain_scores_gemma":[0.99435747,0.000691134,0.0006028696,0.0033973027,0.000224532,0.00072669296],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.00083376747,0.0005980357,0.0007519141,0.0023244794,0.0016210094,0.00033938032,0.006744196,0.00017658627,0.000022550892],"category_scores_gemma":[0.0002514232,0.000633027,0.0007016786,0.0009461278,0.0012960774,0.0029983579,0.0014882985,0.0008562878,0.00006975537],"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.0003053395,0.00012565796,0.005667214,0.00006260548,0.00034201873,0.0005770233,0.0024584502,0.00013918732,0.014281499,0.9642798,0.0012747146,0.010486525],"study_design_scores_gemma":[0.0020349263,0.00035896833,0.030248083,0.00020212593,0.000061637125,0.000035387056,0.0006374178,0.00065836054,0.002532483,0.95763797,0.0048042512,0.0007883738],"about_ca_topic_score_codex":0.0009083221,"about_ca_topic_score_gemma":0.0002519936,"teacher_disagreement_score":0.72216487,"about_ca_system_score_codex":0.000080981605,"about_ca_system_score_gemma":0.00034531154,"threshold_uncertainty_score":0.99967873},"labels":[],"label_agreement":null},{"id":"W2900800851","doi":"","title":"Which Graph Layout Gives a Good Shape for Large Graphs?","year":2017,"lang":"en","type":"article","venue":"Graph Drawing E-print Archive (Die Universität zu Köln)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ciência sem Fronteiras; Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Austrian Science Fund; Grantová Agentura České Republiky; National Institutes of Health; National Science Foundation","keywords":"Computer science; Graph; Graph drawing; Combinatorics; Mathematics; Theoretical computer science","score_opus":0.015151042034084293,"score_gpt":0.23635854264501058,"score_spread":0.22120750061092628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900800851","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.13565172,0.00019438582,0.8384022,0.0016649712,0.001574785,0.0009912543,0.0002514767,0.00068778923,0.020581434],"genre_scores_gemma":[0.96020263,0.000098832774,0.038765326,0.00023027051,0.00011789313,0.000026442196,0.000037448644,0.000046592366,0.00047456045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963207,0.00021556023,0.00039056753,0.0013360634,0.00046880104,0.0012682556],"domain_scores_gemma":[0.99621135,0.00039524457,0.00044233308,0.0022424287,0.00026882713,0.00043981013],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00082271267,0.00057089626,0.00056202605,0.0010424455,0.003651496,0.00075235637,0.00459376,0.00016245234,0.000037244863],"category_scores_gemma":[0.00016562533,0.000589248,0.0008008219,0.0005500137,0.00040463416,0.003013546,0.0017502242,0.00053243944,0.00005762558],"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.00008780989,0.0002119563,0.0038560901,0.00006536034,0.00031640573,0.000109113185,0.0039760433,0.00006179851,0.001163403,0.983867,0.00026830693,0.006016736],"study_design_scores_gemma":[0.0038720213,0.0004601772,0.041949905,0.0002701287,0.0001658828,0.000042228858,0.0012232333,0.01959564,0.0014501428,0.9150897,0.014428944,0.0014520002],"about_ca_topic_score_codex":0.00006630081,"about_ca_topic_score_gemma":0.0002544631,"teacher_disagreement_score":0.8245509,"about_ca_system_score_codex":0.000037389047,"about_ca_system_score_gemma":0.0001156816,"threshold_uncertainty_score":0.9996559},"labels":[],"label_agreement":null},{"id":"W2931936143","doi":"","title":"Low Ply Drawings of Trees of Bounded Degrees","year":2017,"lang":"en","type":"other","venue":"Graph Drawing E-print Archive (Die Universität zu Köln)","topic":"Hermeneutics and Narrative Identity","field":"Arts and Humanities","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ciência sem Fronteiras; Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Austrian Science Fund; Grantová Agentura České Republiky; National Institutes of Health; National Science Foundation","keywords":"Bounded function; Mathematics; Computer science; Mathematical analysis","score_opus":0.02017949357107897,"score_gpt":0.2185386676907421,"score_spread":0.19835917411966314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2931936143","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018866796,0.0003944788,0.00023121481,0.0000681511,0.0008740258,0.00044037504,0.0007116176,0.0001330634,0.9782803],"genre_scores_gemma":[0.37161392,0.00074975577,0.00048783518,0.000035139237,0.00052660157,0.0000050537446,0.00012711305,0.00030575824,0.6261488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980617,0.00012092363,0.00038964793,0.00053599005,0.00045026903,0.0004414473],"domain_scores_gemma":[0.997753,0.000113190305,0.0009826325,0.0008349057,0.00017314477,0.00014309035],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018587269,0.00049136794,0.00090327405,0.0011789823,0.000560983,0.00014484912,0.0010433771,0.0001715329,0.002736245],"category_scores_gemma":[0.000051152358,0.0004889301,0.0006145175,0.00005729104,0.0020854073,0.00036584408,0.0004266954,0.00037814386,0.00005028843],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029209335,0.00078663666,0.0028828613,0.0018818345,0.0037228754,0.00026099652,0.043260965,0.00002802196,0.0036563552,0.72897303,0.207983,0.0062713437],"study_design_scores_gemma":[0.0010467303,0.00023079137,0.0019673896,0.002052284,0.00035551598,0.0000016809087,0.0016931243,0.000027259619,0.00083171984,0.015149195,0.97589856,0.0007457234],"about_ca_topic_score_codex":0.0064169564,"about_ca_topic_score_gemma":0.07554508,"teacher_disagreement_score":0.7679156,"about_ca_system_score_codex":0.000050250677,"about_ca_system_score_gemma":0.00015918873,"threshold_uncertainty_score":0.9997562},"labels":[],"label_agreement":null},{"id":"W6991443160","doi":"","title":"Graph Drawing for Formalized Diagrammatic Proofs in Geometry","year":2017,"lang":"en","type":"other","venue":"Graph Drawing E-print Archive (Die Universität zu Köln)","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ciência sem Fronteiras; Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Austrian Science Fund; Grantová Agentura České Republiky; National Institutes of Health; National Science Foundation","keywords":"Diagrammatic reasoning; Mathematical proof; Graph; Graph drawing; Algebra over a field; Graph theory","score_opus":0.01798832985682494,"score_gpt":0.25215579000524624,"score_spread":0.2341674601484213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6991443160","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010278402,0.0039165653,0.0977626,0.00032966584,0.003357432,0.015096115,0.0036751812,0.0042238487,0.8613602],"genre_scores_gemma":[0.16770718,0.003983707,0.114879146,0.00059006474,0.0030057905,0.0015982543,0.007707449,0.016247973,0.68428046],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9921713,0.0005050774,0.0010349626,0.0023333079,0.0011742171,0.0027811266],"domain_scores_gemma":[0.99333686,0.0007615796,0.0019881362,0.0030208747,0.00017313928,0.00071943505],"candidate_categories":["metaepi_narrow","bibliometrics","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0013386633,0.0019555632,0.0024472396,0.011321021,0.0011956716,0.00044632063,0.0035609822,0.00089401513,0.0004949839],"category_scores_gemma":[0.00062701316,0.0021804152,0.0019069342,0.0012942574,0.0012785799,0.0015195061,0.0014955442,0.0017147508,0.00080018985],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.0057613514,0.0032320619,0.031440344,0.016171468,0.014619268,0.0054906895,0.022227513,0.0012890525,0.008590204,0.18684328,0.6460835,0.058251325],"study_design_scores_gemma":[0.015463659,0.00045661317,0.0053462884,0.0075616194,0.0016503666,0.00005645266,0.0014837612,0.00089703704,0.00043074173,0.07183603,0.88941956,0.0053978604],"about_ca_topic_score_codex":0.0021087949,"about_ca_topic_score_gemma":0.0063209836,"teacher_disagreement_score":0.24333613,"about_ca_system_score_codex":0.000618338,"about_ca_system_score_gemma":0.00046564647,"threshold_uncertainty_score":0.9999778},"labels":[],"label_agreement":null},{"id":"W7015656285","doi":"","title":"Towards Characterizing Strict Outerconfluent Graphs","year":2017,"lang":"en","type":"other","venue":"Graph Drawing E-print Archive (Die Universität zu Köln)","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ciência sem Fronteiras; Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Austrian Science Fund; Grantová Agentura České Republiky; National Institutes of Health; National Science Foundation","keywords":"Set (abstract data type); Class (philosophy); Sequence (biology); Identification (biology); Interval (graph theory); Intersection (aeronautics); Term (time); Matching (statistics); Feature (linguistics); Representation (politics)","score_opus":0.020193707919910278,"score_gpt":0.24319928816954045,"score_spread":0.2230055802496302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7015656285","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041121733,0.0011358423,0.0037838307,0.0002449172,0.0027879348,0.0019666513,0.0036802785,0.002972728,0.97931564],"genre_scores_gemma":[0.05209159,0.0071416036,0.02147333,0.00096454745,0.002961341,0.00012305299,0.004695878,0.010647245,0.8999014],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99272054,0.00064308953,0.0006868649,0.0024855416,0.0013741722,0.0020898038],"domain_scores_gemma":[0.9932234,0.00018238649,0.001887884,0.0036064947,0.00017468714,0.0009251166],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.0007114101,0.0019872617,0.0019145837,0.006140297,0.0011819887,0.0005369968,0.0039673387,0.0007712569,0.0016847615],"category_scores_gemma":[0.00018499259,0.002218795,0.001716435,0.0005814254,0.0012803755,0.0011920284,0.0022283387,0.0019335559,0.003999639],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.0014239311,0.0011490411,0.005866894,0.0018121365,0.0125272,0.010400372,0.009545739,0.000050153358,0.028248519,0.0795644,0.800082,0.049329568],"study_design_scores_gemma":[0.0022134457,0.00015417201,0.010243247,0.0026365598,0.0008442132,0.00005360724,0.00034222333,0.000037173562,0.0003671013,0.0037284128,0.9768448,0.0025350424],"about_ca_topic_score_codex":0.003947035,"about_ca_topic_score_gemma":0.001207551,"teacher_disagreement_score":0.17676276,"about_ca_system_score_codex":0.0005042605,"about_ca_system_score_gemma":0.0004693039,"threshold_uncertainty_score":0.999287},"labels":[],"label_agreement":null},{"id":"W7028604115","doi":"","title":"Flattening Polygonal Linkages via Uniform Angular Motion","year":2017,"lang":"en","type":"other","venue":"Graph Drawing E-print Archive (Die Universität zu Köln)","topic":"Cooperative Studies and Economics","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ciência sem Fronteiras; Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Austrian Science Fund; Grantová Agentura České Republiky; National Institutes of Health; National Science Foundation","keywords":"Rectangle; Flattening; Regular polygon; Line segment; Motion (physics); Line (geometry)","score_opus":0.011657572698677622,"score_gpt":0.1960335449224507,"score_spread":0.18437597222377308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7028604115","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025889631,0.00071940065,0.02585418,0.000533316,0.001630151,0.0005774081,0.00007971005,0.00050347013,0.9675134],"genre_scores_gemma":[0.15365124,0.0039269584,0.007685428,0.0023840896,0.016892536,0.000039489172,0.0023492386,0.001969536,0.8111015],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99803704,0.000019416795,0.00024561258,0.0008047,0.00023447802,0.00065876],"domain_scores_gemma":[0.9984837,0.000040698236,0.0006311269,0.0006973028,0.00009686382,0.000050317423],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018322008,0.00063248666,0.0006454769,0.0012818343,0.0011977995,0.00037715948,0.0008380117,0.00022187253,0.00084874063],"category_scores_gemma":[0.000041979365,0.0006758174,0.00044224327,0.00017098147,0.00034052378,0.0011565421,0.0012798873,0.0005325781,0.00049272965],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00023243956,0.00033618152,0.020563198,0.0017502974,0.004770158,0.0010294759,0.0015718585,0.001113596,0.0008598194,0.112391666,0.72763354,0.12774777],"study_design_scores_gemma":[0.0008026766,0.000018610055,0.0034753417,0.0006134631,0.00027889447,0.0000036374383,0.00041084236,0.0019695347,0.0000089877485,0.0028890003,0.9886398,0.0008892135],"about_ca_topic_score_codex":0.0030643677,"about_ca_topic_score_gemma":0.003759541,"teacher_disagreement_score":0.26100627,"about_ca_system_score_codex":0.00010062282,"about_ca_system_score_gemma":0.000035925274,"threshold_uncertainty_score":0.9995693},"labels":[],"label_agreement":null},{"id":"W7055032404","doi":"","title":"BCSA: BC Tree-Based Sampling and Visualization of Big Graphs","year":2017,"lang":"en","type":"other","venue":"Graph Drawing E-print Archive (Die Universität zu Köln)","topic":"Magnetic confinement fusion research","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ciência sem Fronteiras; Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Austrian Science Fund; Grantová Agentura České Republiky; National Institutes of Health; National Science Foundation","keywords":"Sampling (signal processing); Scalability; Graph; Visualization; Big data; Cloud computing; Tree (set theory); Graph drawing; Data visualization","score_opus":0.01977339194413986,"score_gpt":0.26096440248846475,"score_spread":0.2411910105443249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7055032404","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002420403,0.00018624045,0.063086845,0.000113748596,0.00023758042,0.00073497504,0.00021850558,0.00009864999,0.93290305],"genre_scores_gemma":[0.2914802,0.00089638727,0.013381837,0.000089340014,0.0009123334,0.00006110772,0.0019837671,0.00091589685,0.6902791],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99821657,0.00012013216,0.00024848868,0.0005984809,0.00040495454,0.0004113818],"domain_scores_gemma":[0.9984013,0.00016599297,0.00046118879,0.0007023041,0.00008560288,0.0001836136],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017155202,0.00039350733,0.0004966421,0.0014102713,0.00029916252,0.00008228021,0.00056106574,0.00010966417,0.01198095],"category_scores_gemma":[0.000017525288,0.00042341798,0.0002744563,0.00019753604,0.00044360233,0.000045166802,0.00042736318,0.00028883675,0.000015973596],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025477188,0.0005796798,0.060966097,0.0011589187,0.0015206797,0.00006707927,0.0011036053,0.000060239592,0.0070204516,0.17760837,0.05207689,0.6975832],"study_design_scores_gemma":[0.0033644757,0.00024343036,0.0115307765,0.001828638,0.00038595175,5.547244e-7,0.00067970686,0.0009666337,0.0007684635,0.0063230284,0.9728104,0.0010979625],"about_ca_topic_score_codex":0.0076691676,"about_ca_topic_score_gemma":0.0012895716,"teacher_disagreement_score":0.9207335,"about_ca_system_score_codex":0.000010309349,"about_ca_system_score_gemma":0.00017452691,"threshold_uncertainty_score":0.9998218},"labels":[],"label_agreement":null},{"id":"W7060939866","doi":"","title":"Optimal Compaction of Orthogonal Grid Drawings for Graphs","year":2017,"lang":"en","type":"other","venue":"Graph Drawing E-print Archive (Die Universität zu Köln)","topic":"Magnetic confinement fusion research","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ciência sem Fronteiras; Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Austrian Science Fund; Grantová Agentura České Republiky; National Institutes of Health; National Science Foundation","keywords":"Grid; Representation (politics); Software; Orthogonal transformation; Set (abstract data type); Very-large-scale integration; Orthogonal array; Planar; Surface (topology)","score_opus":0.013007615566911103,"score_gpt":0.2512445498955611,"score_spread":0.23823693432865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7060939866","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004713267,0.000096006006,0.0389082,0.00027073018,0.0007122656,0.0015270074,0.0014533891,0.00012567967,0.95219344],"genre_scores_gemma":[0.06795936,0.00022577544,0.020349847,0.000044238026,0.0014673261,0.00010014374,0.0024431057,0.0006380132,0.9067722],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977877,0.000086606866,0.00031727902,0.0006936589,0.00049862434,0.00061610143],"domain_scores_gemma":[0.99795294,0.00019083927,0.0006461092,0.00083186815,0.00014221741,0.00023600619],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021351498,0.000491511,0.00066791923,0.0012106006,0.00043010392,0.00008477517,0.00093328994,0.00013382884,0.029984409],"category_scores_gemma":[0.00001666443,0.0005313589,0.00073097885,0.00014952333,0.000503614,0.00009130052,0.0004865581,0.00047360297,0.000035277422],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00050580356,0.0005405014,0.0065974104,0.0007217471,0.0022742301,0.000048666094,0.00092035613,0.00012886494,0.0043152496,0.11496003,0.77092123,0.098065905],"study_design_scores_gemma":[0.002087755,0.00023159465,0.0025229112,0.00063409714,0.0002832854,0.0000013785354,0.0006116507,0.0004012814,0.0004171533,0.0033800297,0.98873997,0.0006888906],"about_ca_topic_score_codex":0.0032767092,"about_ca_topic_score_gemma":0.00038173865,"teacher_disagreement_score":0.21781874,"about_ca_system_score_codex":0.000017568127,"about_ca_system_score_gemma":0.00023146576,"threshold_uncertainty_score":0.9997138},"labels":[],"label_agreement":null},{"id":"W7068055581","doi":"","title":"A Note on PLus-Contacts, Rectangular Duals, and Box-Orthogonal Drawings","year":2017,"lang":"en","type":"other","venue":"Graph Drawing E-print Archive (Die Universität zu Köln)","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ciência sem Fronteiras; Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Austrian Science Fund; Grantová Agentura České Republiky; National Institutes of Health; National Science Foundation","keywords":"Nucleofection; Gestational period; TSG101; Dysgeusia; Liquation; Diafiltration; Emperipolesis; Triacetin; Durvalumab","score_opus":0.01214722301296269,"score_gpt":0.2363064839320956,"score_spread":0.2241592609191329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7068055581","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008009983,0.0020688453,0.0024501374,0.00035013375,0.001662019,0.002144871,0.0021182715,0.001839553,0.97935617],"genre_scores_gemma":[0.09187818,0.0057557905,0.02654685,0.0013928274,0.0036865817,0.00010060437,0.004264123,0.009820989,0.85655403],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99295396,0.00053102925,0.0005811405,0.0027264233,0.0013762825,0.0018311393],"domain_scores_gemma":[0.9942716,0.0004684731,0.0014445706,0.0027288934,0.0001354973,0.0009509721],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.0006945044,0.0019186497,0.0019014317,0.0041510533,0.0014235195,0.00046182456,0.0020979592,0.0008714008,0.0010325979],"category_scores_gemma":[0.00033994904,0.0021343143,0.00098803,0.00040948726,0.0016018319,0.00086221675,0.0016335325,0.0021670957,0.0017872076],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.0035116712,0.00067406194,0.00234412,0.0013235305,0.0059884414,0.010958857,0.010242306,0.00014712325,0.012838581,0.11681485,0.8217194,0.013437074],"study_design_scores_gemma":[0.0043486105,0.00037699234,0.003538388,0.0044772197,0.0009131328,0.00010427351,0.00030628836,0.00013094538,0.00033507872,0.005648785,0.97706693,0.0027533441],"about_ca_topic_score_codex":0.002749305,"about_ca_topic_score_gemma":0.003800111,"teacher_disagreement_score":0.15534756,"about_ca_system_score_codex":0.0006291883,"about_ca_system_score_gemma":0.0005824216,"threshold_uncertainty_score":0.9998806},"labels":[],"label_agreement":null}]}