{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":10,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":10,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"0fbf8c78a995","filters":{"venue":"Graph Drawing E-print Archive (Die Universität zu Köln)"}},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Bose, Prosenjit","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008032525424219467,"gpt":0.1945181284415451,"spread":0.1864856030173256,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002014257,0.0005016472,0.0003593464,0.001129323,0.000632686,0.001251949,0.0007100757,0.0005223613,0.01996514],"category_scores_gemma":[0.0007599599,0.0002641172,0.0003631178,0.0007048714,0.0005326729,0.001156741,0.001574813,0.0009666521,0.003106904],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006202267,"about_ca_system_score_gemma":0.0005066862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001033834,"about_ca_topic_score_gemma":0.001664904,"domain_scores_codex":[0.9997713,0.00002994734,0.00001081919,0.0000541131,0.00008560797,0.00004817892],"domain_scores_gemma":[0.9996992,0.00004928048,0.00003205411,0.00009593184,0.00007397579,0.00004954347],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001235752,0.0000851824,0.0004100098,0.0001073736,0.00002110404,0.0002297071,0.0001639437,0.02688003,0.01189937,0.8073575,0.01639178,0.1363305],"study_design_scores_gemma":[0.00004296018,0.0000748901,0.0007889089,0.00004701122,0.00003433253,0.0004469223,0.0002024246,0.1337412,0.009001544,0.804366,0.0512256,0.00002820306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.100685,0.0004836841,0.6290718,0.0008211815,0.0005601125,0.0002034597,0.000829934,0.00156383,0.265781],"genre_scores_gemma":[0.6757811,0.001140187,0.1685967,0.0005411916,0.0002012947,0.0001733231,0.001391985,0.0008447564,0.1513295],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01996514,"threshold_uncertainty_score":0.06679004,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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)","authors":[{"name":"Emilio Di Giacomo","is_ca":false},{"name":"Giuseppe Liotta","is_ca":false},{"name":"Maurizio Patrignani","is_ca":false},{"name":"Alessandra Tappini","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02347245938337535,"gpt":0.2599352690982509,"spread":0.2364628097148756,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003791792,0.0007960871,0.0007551184,0.001874879,0.001906262,0.002931888,0.002071624,0.001337575,0.01398233],"category_scores_gemma":[0.002491939,0.0007302577,0.0008423457,0.003114887,0.00162402,0.004996533,0.002070848,0.002267571,0.002201561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009412694,"about_ca_system_score_gemma":0.0005809175,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001243545,"about_ca_topic_score_gemma":0.00166052,"domain_scores_codex":[0.9993918,0.0001066425,0.0000252665,0.0002112611,0.0001686812,0.00009634153],"domain_scores_gemma":[0.9981389,0.0005888606,0.0003091313,0.0003893244,0.0003103761,0.000263473],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009080324,0.00004412358,0.001011295,0.0002429942,0.00002385049,0.000435404,0.0004581391,0.006844318,0.003339366,0.9261574,0.01324632,0.04810584],"study_design_scores_gemma":[0.00004400458,0.00007416675,0.001245147,0.00008771042,0.00004930564,0.001809947,0.0005423225,0.02527077,0.002453515,0.8838251,0.08455285,0.00004517788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2170169,0.002942273,0.5772824,0.003021308,0.0003577865,0.0003288802,0.003082664,0.002279596,0.1936881],"genre_scores_gemma":[0.6810468,0.005203927,0.2225168,0.00128284,0.0003969369,0.0004364237,0.005972619,0.00130203,0.08184155],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01398233,"threshold_uncertainty_score":0.04677552,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01977339194413986,"gpt":0.2609644024884648,"spread":0.2411910105443249,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001220694,0.001683375,0.001083671,0.004944592,0.0009929693,0.003559421,0.001883471,0.001045348,0.05684275],"category_scores_gemma":[0.007127318,0.0008315325,0.001232813,0.005050467,0.0004307124,0.002085221,0.002329323,0.00204109,0.01030766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007744894,"about_ca_system_score_gemma":0.001728333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009495081,"about_ca_topic_score_gemma":0.01956803,"domain_scores_codex":[0.9992624,0.0001623191,0.00005627737,0.0001274326,0.0003031691,0.00008843774],"domain_scores_gemma":[0.9968034,0.001543135,0.0001358646,0.0006029659,0.0006387537,0.0002759342],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007536753,0.0003632665,0.004328941,0.001565593,0.0002757788,0.0004091666,0.001408728,0.03383678,0.01403404,0.03697771,0.4817576,0.4242889],"study_design_scores_gemma":[0.0003429223,0.0001118943,0.003458673,0.0002614538,0.0000839851,0.000365997,0.0004500527,0.7848307,0.01548797,0.06974975,0.124739,0.0001175158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0268909,0.0008748474,0.6595042,0.001284227,0.0005657248,0.0004670458,0.05330521,0.2403983,0.01670956],"genre_scores_gemma":[0.1411077,0.001248706,0.7423954,0.0004247634,0.000177329,0.0008576986,0.06751956,0.03538274,0.0108861],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05684275,"threshold_uncertainty_score":0.1901579,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01798832985682494,"gpt":0.2521557900052462,"spread":0.2341674601484213,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009193587,0.001129838,0.0006570122,0.001615904,0.0007788241,0.003559934,0.001946934,0.001019171,0.08127061],"category_scores_gemma":[0.00664936,0.0006861659,0.001209449,0.002277537,0.001303874,0.004218764,0.002302701,0.001843694,0.01600354],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001150119,"about_ca_system_score_gemma":0.0009656975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001622015,"about_ca_topic_score_gemma":0.002176684,"domain_scores_codex":[0.9987496,0.0004543772,0.00009040287,0.0002368315,0.0003823803,0.00008635381],"domain_scores_gemma":[0.9980666,0.001062587,0.00006988876,0.0005004604,0.0002348714,0.00006570614],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008854194,0.00004403036,0.0001628383,0.0005057754,0.00002592915,0.0001408106,0.0003437137,0.009468854,0.002377307,0.7437997,0.0488993,0.194143],"study_design_scores_gemma":[0.00006492537,0.00002192091,0.0001087142,0.0001386274,0.00003162885,0.0001531894,0.0000924532,0.03533479,0.004561753,0.7912469,0.1682218,0.0000233393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003396619,0.0003510765,0.9465938,0.0005424698,0.0001535676,0.0001172296,0.001491299,0.007580105,0.03977386],"genre_scores_gemma":[0.1879946,0.001459386,0.7545131,0.0003283329,0.0002198156,0.0003513345,0.007322266,0.007049411,0.04076168],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.08127061,"threshold_uncertainty_score":0.2718773,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.02019370791991028,"gpt":0.2431992881695405,"spread":0.2230055802496302,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001569857,0.001087321,0.0009984414,0.003084395,0.001617447,0.004115589,0.001657547,0.001036714,0.01204811],"category_scores_gemma":[0.01082174,0.0008472557,0.0006855283,0.003705546,0.002024587,0.006449939,0.004641434,0.002837152,0.002472551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00111025,"about_ca_system_score_gemma":0.000764391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002427386,"about_ca_topic_score_gemma":0.004370695,"domain_scores_codex":[0.9979432,0.0004327419,0.0001221493,0.0005371379,0.0007254933,0.000239246],"domain_scores_gemma":[0.990926,0.003428244,0.0008199422,0.00235182,0.001657925,0.0008160938],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004436698,0.000179347,0.007828229,0.000577006,0.0000486318,0.0003543366,0.001758045,0.01189652,0.008963727,0.8385116,0.01847393,0.1109649],"study_design_scores_gemma":[0.00002075195,0.00005494989,0.001831896,0.00009302313,0.00003456418,0.0002863216,0.0005386448,0.03293813,0.004963538,0.9305331,0.02868143,0.0000236227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2825971,0.0008661274,0.6078798,0.001480415,0.0001776608,0.0002998361,0.004665222,0.002123746,0.09991015],"genre_scores_gemma":[0.7762234,0.0009194358,0.1665454,0.001030156,0.000316961,0.0002011512,0.008981739,0.002080602,0.04370122],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01204811,"threshold_uncertainty_score":0.04030502,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Quan Nguyen","is_ca":false},{"name":"Peter Eades","is_ca":false},{"name":"Seok-Hee Hong","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01515104203408429,"gpt":0.2363585426450106,"spread":0.2212075006109263,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001344308,0.001257533,0.002138444,0.001595291,0.001051676,0.003564761,0.002000036,0.003217642,0.01609918],"category_scores_gemma":[0.02309978,0.001516039,0.001188731,0.002868567,0.001604907,0.009945655,0.001972629,0.001791907,0.0108268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007488246,"about_ca_system_score_gemma":0.0007586082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000863023,"about_ca_topic_score_gemma":0.002507335,"domain_scores_codex":[0.9983391,0.0005323156,0.0001073082,0.0005032901,0.000334192,0.0001837831],"domain_scores_gemma":[0.9887349,0.004031895,0.0008174358,0.003789405,0.001724556,0.0009018734],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001200717,0.0002503847,0.008098957,0.001579609,0.0001728662,0.00047816,0.0007630592,0.0698911,0.04192431,0.08510171,0.07596862,0.7145704],"study_design_scores_gemma":[0.0005113964,0.0005641284,0.003165485,0.0003841661,0.0002434299,0.001471199,0.002347897,0.3031407,0.0404548,0.584405,0.06304732,0.0002643986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1269536,0.005964816,0.815181,0.0116147,0.001406946,0.0001844784,0.002367968,0.01351008,0.02281642],"genre_scores_gemma":[0.4950655,0.003139847,0.4784057,0.00150911,0.0005931288,0.0001645252,0.002210723,0.009651237,0.009260209],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01609918,"threshold_uncertainty_score":0.05385715,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Michael T. Goodrich","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02017949357107897,"gpt":0.2185386676907421,"spread":0.1983591741196631,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003403463,0.000779082,0.0005228125,0.001561817,0.00103583,0.003972098,0.001257179,0.001225607,0.03821503],"category_scores_gemma":[0.006126281,0.0007298736,0.0004398792,0.00201606,0.001300518,0.002747758,0.001596991,0.002680412,0.004809029],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001251143,"about_ca_system_score_gemma":0.0005634436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003639732,"about_ca_topic_score_gemma":0.007923063,"domain_scores_codex":[0.9993061,0.0001890856,0.00002933304,0.0001160019,0.0002583907,0.0001011343],"domain_scores_gemma":[0.9973434,0.001173543,0.0002533221,0.0004562616,0.0004945183,0.0002790148],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001149888,0.00002349115,0.0005531852,0.0001240935,0.00001370659,0.0001601068,0.0006406311,0.01191284,0.002806061,0.9142817,0.01242123,0.05694784],"study_design_scores_gemma":[0.00003823527,0.00001717209,0.000557937,0.00006904886,0.00001693755,0.0001695325,0.0002953428,0.03455139,0.001609907,0.9208347,0.04182456,0.00001528041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1738671,0.001267634,0.6028551,0.002072077,0.0002579294,0.0001820506,0.002779439,0.001325198,0.2153935],"genre_scores_gemma":[0.6930631,0.001316044,0.1680813,0.0004603695,0.0001680638,0.0001754032,0.004037234,0.00137333,0.1313253],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03821503,"threshold_uncertainty_score":0.1278421,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01165757269867762,"gpt":0.1960335449224507,"spread":0.1843759722237731,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004173422,0.001168501,0.0008095584,0.002190786,0.0007247947,0.001462702,0.001360996,0.0008011009,0.03443732],"category_scores_gemma":[0.003187832,0.0006803991,0.0008752079,0.001503289,0.0009769952,0.001666517,0.003348771,0.001536291,0.007661802],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000418832,"about_ca_system_score_gemma":0.0004065126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001744476,"about_ca_topic_score_gemma":0.002606678,"domain_scores_codex":[0.9993712,0.00008796704,0.00002860304,0.0001830623,0.000233509,0.00009565913],"domain_scores_gemma":[0.9991623,0.0002350412,0.00006961785,0.000341106,0.0001250132,0.0000668819],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003619828,0.0001546644,0.0006600899,0.0003967302,0.00005525768,0.0003008668,0.0005949906,0.1715978,0.02158465,0.2421077,0.02237484,0.5398105],"study_design_scores_gemma":[0.0001247276,0.0002897345,0.000446159,0.0001756055,0.00005119041,0.0003616332,0.0004608601,0.6430602,0.01952897,0.2373628,0.09805793,0.00008017037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03031675,0.0001998644,0.9282989,0.0001167421,0.0002949618,0.0001581704,0.0004721122,0.003036038,0.03710651],"genre_scores_gemma":[0.4099242,0.0005515874,0.5332887,0.0001854306,0.0001028703,0.000307989,0.001553665,0.002933424,0.05115202],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03443732,"threshold_uncertainty_score":0.1152043,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01214722301296269,"gpt":0.2363064839320956,"spread":0.2241592609191329,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008505491,0.001208161,0.0008705507,0.001675118,0.001524763,0.003206913,0.002330232,0.00135421,0.1445695],"category_scores_gemma":[0.005558872,0.00105607,0.001268354,0.003857181,0.001588114,0.006819962,0.002046285,0.003958151,0.03776914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001120233,"about_ca_system_score_gemma":0.0008263769,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004225704,"about_ca_topic_score_gemma":0.009719265,"domain_scores_codex":[0.9990212,0.0002322594,0.00005961218,0.0001761828,0.000424408,0.0000862567],"domain_scores_gemma":[0.9983216,0.0006595931,0.00004350144,0.0005306772,0.0003489013,0.00009557024],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006636521,0.00004717528,0.0001128541,0.0001863775,0.000007414642,0.0001305379,0.0001279872,0.0027966,0.0008940815,0.5377331,0.2873778,0.1705197],"study_design_scores_gemma":[0.00001786524,0.00002035649,0.0001596691,0.0001462395,0.00001200756,0.0003135608,0.0001023011,0.004896739,0.001375347,0.3464636,0.6464599,0.00003244583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.003222244,0.004486571,0.4305444,0.005379828,0.007100089,0.000167498,0.001640525,0.004505445,0.5429534],"genre_scores_gemma":[0.07971611,0.01650598,0.5249644,0.002603942,0.003636488,0.0003295848,0.004240748,0.008626077,0.3593766],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.1445695,"threshold_uncertainty_score":0.483633,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.0130076155669111,"gpt":0.2512445498955611,"spread":0.23823693432865,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000497395,0.001008209,0.001071019,0.001457622,0.0004736409,0.001984722,0.001170809,0.0007173154,0.01948118],"category_scores_gemma":[0.005637095,0.0007410184,0.0006627142,0.002687352,0.0005680821,0.00189188,0.002065853,0.0009656202,0.002419601],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009105895,"about_ca_system_score_gemma":0.0008796771,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002543776,"about_ca_topic_score_gemma":0.005624774,"domain_scores_codex":[0.9989203,0.00029199,0.000067669,0.0001620498,0.0003551928,0.0002028575],"domain_scores_gemma":[0.9972755,0.001370057,0.0002033767,0.0007188077,0.000305051,0.0001271876],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001030103,0.0002834034,0.002058495,0.0006913393,0.00007061246,0.0002542717,0.0004681881,0.2171859,0.01893644,0.07390414,0.0493075,0.6358097],"study_design_scores_gemma":[0.0002474526,0.0002593189,0.001321493,0.0001027805,0.00006427838,0.0002574804,0.0004715321,0.8054585,0.01325223,0.1495873,0.02893964,0.00003798335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1942537,0.0009985166,0.7485334,0.0008307444,0.0001899415,0.0003809379,0.003712249,0.00486785,0.04623265],"genre_scores_gemma":[0.452451,0.0007766947,0.5208536,0.0002372951,0.00007177715,0.0003757964,0.00701133,0.001807373,0.01641513],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01948118,"threshold_uncertainty_score":0.06517106,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}