{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10068502,0.00048368413,0.6290718,0.0008211815,0.00056011253,0.00020345973,0.000829934,0.0015638297,0.265781],"genre_scores_gemma":[0.6757811,0.0011401868,0.16859668,0.0005411916,0.00020129466,0.00017332307,0.0013919849,0.00084475643,0.15132953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997713,0.000029947343,0.000010819194,0.0000541131,0.00008560797,0.000048178925],"domain_scores_gemma":[0.99969923,0.000049280476,0.000032054115,0.00009593184,0.00007397579,0.00004954347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020142568,0.0005016472,0.00035934642,0.001129323,0.00063268596,0.0012519485,0.00071007566,0.00052236125,0.019965144],"category_scores_gemma":[0.00075995986,0.0002641172,0.00036311775,0.0007048714,0.00053267286,0.0011567407,0.0015748132,0.00096665206,0.0031069044],"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.00012357521,0.0000851824,0.00041000984,0.00010737362,0.00002110404,0.0002297071,0.00016394365,0.026880031,0.011899366,0.8073575,0.016391778,0.13633053],"study_design_scores_gemma":[0.000042960182,0.0000748901,0.00078890886,0.000047011225,0.000034332534,0.0004469223,0.00020242458,0.13374123,0.009001544,0.804366,0.0512256,0.000028203063],"about_ca_topic_score_codex":0.0010338342,"about_ca_topic_score_gemma":0.0016649036,"teacher_disagreement_score":0.019965144,"about_ca_system_score_codex":0.00062022667,"about_ca_system_score_gemma":0.00050668616,"threshold_uncertainty_score":0.066790044},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2170169,0.0029422734,0.5772824,0.003021308,0.00035778648,0.00032888024,0.0030826642,0.0022795962,0.1936881],"genre_scores_gemma":[0.68104684,0.005203927,0.2225168,0.0012828399,0.0003969369,0.0004364237,0.005972619,0.0013020298,0.08184155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993918,0.00010664248,0.000025266503,0.00021126111,0.00016868119,0.00009634153],"domain_scores_gemma":[0.9981389,0.0005888606,0.00030913125,0.00038932444,0.00031037605,0.00026347305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037917917,0.00079608714,0.00075511844,0.0018748795,0.0019062615,0.0029318877,0.0020716242,0.0013375749,0.01398233],"category_scores_gemma":[0.0024919393,0.00073025766,0.0008423457,0.003114887,0.0016240204,0.0049965326,0.0020708484,0.0022675714,0.0022015614],"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.00009080324,0.00004412358,0.0010112947,0.00024299418,0.000023850489,0.00043540396,0.00045813905,0.0068443185,0.0033393656,0.9261574,0.013246325,0.048105836],"study_design_scores_gemma":[0.000044004584,0.00007416675,0.0012451472,0.00008771042,0.00004930564,0.0018099466,0.0005423225,0.025270768,0.0024535153,0.88382506,0.08455285,0.00004517788],"about_ca_topic_score_codex":0.001243545,"about_ca_topic_score_gemma":0.0016605201,"teacher_disagreement_score":0.01398233,"about_ca_system_score_codex":0.0009412694,"about_ca_system_score_gemma":0.00058091746,"threshold_uncertainty_score":0.04677552},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12695362,0.0059648156,0.815181,0.0116147045,0.0014069456,0.00018447843,0.0023679684,0.013510084,0.02281642],"genre_scores_gemma":[0.4950655,0.0031398472,0.4784057,0.00150911,0.00059312885,0.00016452523,0.0022107232,0.009651237,0.009260209],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833906,0.00053231564,0.00010730815,0.0005032901,0.000334192,0.00018378308],"domain_scores_gemma":[0.9887349,0.004031895,0.0008174358,0.003789405,0.0017245559,0.0009018734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013443085,0.0012575333,0.0021384442,0.0015952907,0.0010516755,0.003564761,0.0020000364,0.0032176417,0.016099181],"category_scores_gemma":[0.023099784,0.0015160395,0.0011887313,0.0028685671,0.0016049065,0.009945655,0.0019726295,0.0017919069,0.010826795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012007171,0.00025038474,0.008098957,0.0015796085,0.00017286625,0.00047816004,0.0007630592,0.069891095,0.041924305,0.08510171,0.075968616,0.7145704],"study_design_scores_gemma":[0.0005113964,0.0005641284,0.0031654846,0.00038416614,0.00024342994,0.0014711994,0.002347897,0.3031407,0.040454805,0.584405,0.06304732,0.00026439864],"about_ca_topic_score_codex":0.000863023,"about_ca_topic_score_gemma":0.0025073348,"teacher_disagreement_score":0.016099181,"about_ca_system_score_codex":0.0007488246,"about_ca_system_score_gemma":0.0007586082,"threshold_uncertainty_score":0.053857148},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1738671,0.0012676342,0.60285515,0.0020720772,0.0002579294,0.00018205061,0.0027794386,0.0013251981,0.21539353],"genre_scores_gemma":[0.6930631,0.0013160442,0.16808128,0.00046036948,0.00016806381,0.00017540321,0.0040372335,0.0013733297,0.13132527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993061,0.00018908558,0.000029333036,0.0001160019,0.00025839068,0.00010113429],"domain_scores_gemma":[0.99734336,0.001173543,0.00025332207,0.00045626156,0.00049451826,0.0002790148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034034628,0.000779082,0.00052281254,0.0015618168,0.0010358301,0.003972098,0.0012571788,0.0012256065,0.038215034],"category_scores_gemma":[0.0061262813,0.0007298736,0.00043987916,0.0020160596,0.0013005183,0.002747758,0.0015969914,0.002680412,0.004809029],"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.00011498882,0.000023491153,0.00055318524,0.0001240935,0.000013706594,0.00016010676,0.00064063113,0.01191284,0.0028060612,0.9142817,0.012421227,0.056947842],"study_design_scores_gemma":[0.000038235274,0.00001717209,0.000557937,0.00006904886,0.000016937553,0.00016953253,0.00029534282,0.034551386,0.0016099071,0.9208347,0.041824564,0.000015280411],"about_ca_topic_score_codex":0.0036397318,"about_ca_topic_score_gemma":0.007923063,"teacher_disagreement_score":0.038215034,"about_ca_system_score_codex":0.0012511434,"about_ca_system_score_gemma":0.0005634436,"threshold_uncertainty_score":0.12784207},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033966193,0.00035107654,0.94659376,0.0005424698,0.0001535676,0.00011722964,0.0014912985,0.0075801047,0.039773855],"genre_scores_gemma":[0.18799458,0.0014593859,0.75451314,0.00032833286,0.0002198156,0.0003513345,0.0073222658,0.0070494106,0.04076168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987496,0.0004543772,0.00009040287,0.00023683147,0.0003823803,0.00008635381],"domain_scores_gemma":[0.9980666,0.0010625867,0.00006988876,0.0005004604,0.00023487142,0.00006570614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009193587,0.0011298384,0.00065701216,0.0016159044,0.00077882415,0.0035599335,0.0019469339,0.0010191712,0.08127061],"category_scores_gemma":[0.0066493596,0.0006861659,0.0012094486,0.0022775366,0.0013038738,0.004218764,0.0023027007,0.0018436945,0.016003544],"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.000088541936,0.000044030356,0.00016283832,0.00050577545,0.000025929152,0.00014081062,0.0003437137,0.009468854,0.0023773073,0.74379975,0.048899304,0.19414303],"study_design_scores_gemma":[0.00006492537,0.000021920914,0.00010871418,0.00013862742,0.000031628853,0.0001531894,0.0000924532,0.03533479,0.0045617535,0.7912469,0.16822179,0.000023339297],"about_ca_topic_score_codex":0.0016220154,"about_ca_topic_score_gemma":0.0021766836,"teacher_disagreement_score":0.08127061,"about_ca_system_score_codex":0.0011501188,"about_ca_system_score_gemma":0.00096569746,"threshold_uncertainty_score":0.2718773},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28259706,0.0008661274,0.6078798,0.0014804153,0.00017766078,0.00029983613,0.0046652225,0.002123746,0.099910155],"genre_scores_gemma":[0.77622336,0.0009194358,0.16654539,0.0010301558,0.00031696103,0.00020115118,0.008981739,0.002080602,0.04370122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979432,0.00043274194,0.00012214933,0.00053713785,0.0007254933,0.00023924596],"domain_scores_gemma":[0.990926,0.003428244,0.00081994216,0.00235182,0.0016579248,0.0008160938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015698569,0.0010873212,0.0009984414,0.0030843946,0.0016174475,0.004115589,0.0016575466,0.0010367137,0.012048113],"category_scores_gemma":[0.0108217355,0.0008472557,0.00068552827,0.0037055465,0.0020245875,0.0064499388,0.004641434,0.0028371518,0.0024725513],"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.00044366982,0.00017934704,0.007828229,0.000577006,0.0000486318,0.00035433657,0.0017580454,0.011896524,0.008963727,0.8385116,0.018473925,0.11096494],"study_design_scores_gemma":[0.00002075195,0.000054949895,0.0018318965,0.000093023125,0.00003456418,0.0002863216,0.00053864485,0.03293813,0.0049635377,0.9305331,0.028681431,0.000023622704],"about_ca_topic_score_codex":0.0024273861,"about_ca_topic_score_gemma":0.004370695,"teacher_disagreement_score":0.012048113,"about_ca_system_score_codex":0.00111025,"about_ca_system_score_gemma":0.00076439104,"threshold_uncertainty_score":0.04030502},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030316751,0.00019986436,0.9282989,0.00011674206,0.00029496182,0.00015817043,0.0004721122,0.0030360383,0.037106507],"genre_scores_gemma":[0.40992424,0.0005515874,0.53328866,0.00018543065,0.00010287035,0.00030798904,0.0015536649,0.0029334244,0.051152024],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937123,0.00008796704,0.000028603039,0.00018306232,0.00023350897,0.00009565913],"domain_scores_gemma":[0.9991623,0.00023504115,0.00006961785,0.000341106,0.00012501325,0.000066881905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041734223,0.0011685009,0.0008095584,0.0021907862,0.0007247947,0.0014627018,0.0013609962,0.00080110086,0.034437325],"category_scores_gemma":[0.0031878324,0.00068039907,0.0008752079,0.0015032887,0.0009769952,0.0016665173,0.003348771,0.001536291,0.007661802],"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.00036198285,0.00015466439,0.0006600899,0.0003967302,0.000055257682,0.00030086676,0.0005949906,0.17159782,0.021584654,0.2421077,0.022374839,0.5398105],"study_design_scores_gemma":[0.00012472764,0.0002897345,0.00044615896,0.00017560554,0.00005119041,0.0003616332,0.00046086006,0.6430602,0.019528972,0.23736279,0.098057926,0.00008017037],"about_ca_topic_score_codex":0.0017444761,"about_ca_topic_score_gemma":0.0026066776,"teacher_disagreement_score":0.034437325,"about_ca_system_score_codex":0.00041883203,"about_ca_system_score_gemma":0.0004065126,"threshold_uncertainty_score":0.115204334},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026890898,0.0008748474,0.6595042,0.0012842271,0.0005657248,0.0004670458,0.053305212,0.2403983,0.016709562],"genre_scores_gemma":[0.14110766,0.0012487056,0.7423954,0.0004247634,0.00017732904,0.0008576986,0.06751956,0.03538274,0.010886096],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992624,0.00016231912,0.00005627737,0.0001274326,0.00030316907,0.000088437744],"domain_scores_gemma":[0.9968034,0.0015431349,0.0001358646,0.0006029659,0.0006387537,0.00027593423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012206942,0.0016833745,0.0010836713,0.0049445922,0.0009929693,0.0035594213,0.0018834708,0.0010453485,0.05684275],"category_scores_gemma":[0.0071273176,0.0008315325,0.0012328129,0.0050504673,0.00043071245,0.002085221,0.0023293232,0.0020410896,0.010307663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007536753,0.00036326647,0.0043289405,0.0015655927,0.00027577882,0.00040916656,0.0014087278,0.033836782,0.01403404,0.03697771,0.4817576,0.42428887],"study_design_scores_gemma":[0.00034292234,0.00011189426,0.0034586734,0.0002614538,0.0000839851,0.00036599702,0.0004500527,0.78483075,0.015487972,0.06974975,0.12473901,0.00011751583],"about_ca_topic_score_codex":0.009495081,"about_ca_topic_score_gemma":0.01956803,"teacher_disagreement_score":0.05684275,"about_ca_system_score_codex":0.00077448937,"about_ca_system_score_gemma":0.001728333,"threshold_uncertainty_score":0.19015795},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1942537,0.0009985166,0.7485334,0.0008307444,0.00018994152,0.00038093788,0.0037122488,0.0048678503,0.04623265],"genre_scores_gemma":[0.45245096,0.0007766947,0.5208536,0.00023729508,0.00007177715,0.0003757964,0.00701133,0.0018073734,0.01641513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989203,0.00029199003,0.000067669,0.00016204984,0.00035519275,0.00020285751],"domain_scores_gemma":[0.99727553,0.001370057,0.00020337665,0.0007188077,0.000305051,0.00012718758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000497395,0.0010082086,0.001071019,0.0014576217,0.00047364095,0.0019847222,0.0011708088,0.0007173154,0.019481178],"category_scores_gemma":[0.0056370953,0.00074101845,0.0006627142,0.0026873515,0.00056808215,0.0018918802,0.0020658534,0.00096562016,0.0024196012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010301028,0.0002834034,0.002058495,0.00069133926,0.00007061246,0.00025427167,0.00046818814,0.21718587,0.018936438,0.07390414,0.049307503,0.63580966],"study_design_scores_gemma":[0.00024745264,0.00025931894,0.001321493,0.00010278054,0.00006427838,0.00025748037,0.00047153214,0.80545855,0.0132522285,0.14958732,0.02893964,0.00003798335],"about_ca_topic_score_codex":0.0025437763,"about_ca_topic_score_gemma":0.005624774,"teacher_disagreement_score":0.019481178,"about_ca_system_score_codex":0.0009105895,"about_ca_system_score_gemma":0.00087967707,"threshold_uncertainty_score":0.06517106},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032222436,0.004486571,0.4305444,0.0053798277,0.007100089,0.00016749804,0.0016405247,0.0045054452,0.5429534],"genre_scores_gemma":[0.07971611,0.016505985,0.5249644,0.0026039418,0.003636488,0.00032958481,0.004240748,0.008626077,0.3593766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990212,0.0002322594,0.00005961218,0.00017618279,0.000424408,0.000086256696],"domain_scores_gemma":[0.9983216,0.00065959315,0.00004350144,0.0005306772,0.0003489013,0.00009557024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085054914,0.0012081612,0.00087055075,0.0016751185,0.0015247632,0.0032069131,0.0023302322,0.0013542101,0.14456947],"category_scores_gemma":[0.005558872,0.00105607,0.0012683541,0.0038571807,0.001588114,0.0068199616,0.0020462847,0.0039581507,0.037769143],"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.00006636521,0.00004717528,0.0001128541,0.00018637753,0.0000074146424,0.00013053791,0.0001279872,0.0027966,0.00089408155,0.53773314,0.28737777,0.17051968],"study_design_scores_gemma":[0.00001786524,0.000020356489,0.0001596691,0.00014623946,0.0000120075565,0.00031356077,0.000102301135,0.0048967386,0.0013753473,0.3464636,0.64645994,0.00003244583],"about_ca_topic_score_codex":0.0042257044,"about_ca_topic_score_gemma":0.009719265,"teacher_disagreement_score":0.14456947,"about_ca_system_score_codex":0.0011202332,"about_ca_system_score_gemma":0.0008263769,"threshold_uncertainty_score":0.48363304},"labels":[],"label_agreement":null}]}