{"meta":{"query_hash":"4252c0884037","filters":{"venue":"Cologne Twente Workshop on Graphs and Combinatorial Optimization"},"cohort_total":11,"direct_labels_cover":0,"predictions_cover":11,"exported":11,"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/4252c0884037","api":"https://metacan.xera.ac/api/v1/cohort?venue=Cologne+Twente+Workshop+on+Graphs+and+Combinatorial+Optimization"},"results":[{"id":"W100499361","doi":"","title":"Static symmetry breaking in circle packing","year":2010,"lang":"en","type":"article","venue":"Cologne Twente Workshop on Graphs and Combinatorial Optimization","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Circle packing; Square (algebra); RADIUS; Packing problems; Symmetry breaking; Combinatorics; Unit square; Symmetry (geometry); Unit (ring theory); Mathematics; Unit circle; Work (physics); Physics; Geometry; Computer science; Quantum mechanics","score_opus":0.006615354732950662,"score_gpt":0.21828412523455074,"score_spread":0.21166877050160007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W100499361","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91403437,0.00028038654,0.045415588,0.0006152549,0.021395545,0.0013194847,0.000014890308,0.0013410939,0.015583394],"genre_scores_gemma":[0.99680823,0.00033460854,0.002547823,0.00010760867,0.000058101006,0.000031523497,0.00003822728,0.000046072637,0.000027815779],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989294,0.00004427141,0.0003136962,0.0002581671,0.00016020822,0.0002942982],"domain_scores_gemma":[0.99942696,0.00015520053,0.000068732705,0.00019133821,0.000060122806,0.00009765827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025623146,0.00019650349,0.00023174142,0.00034550802,0.0001186745,0.0001317024,0.00011692586,0.0002189291,0.000071956674],"category_scores_gemma":[0.00008942131,0.00022597633,0.000042876498,0.00073304656,0.000055476936,0.00018545636,0.000030129546,0.00046603073,0.000004392824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003774457,0.00011898073,0.003507146,0.00005160482,0.00002498094,0.000005316166,0.00027583874,0.94334656,0.0001715966,0.041172948,0.00037641518,0.010910875],"study_design_scores_gemma":[0.003473814,0.00018241495,0.0038074183,0.00025739553,0.000035519508,0.000008689735,0.00016248832,0.9792481,0.00022179673,0.010602336,0.0013217325,0.0006782628],"about_ca_topic_score_codex":0.000006568988,"about_ca_topic_score_gemma":0.000022802316,"teacher_disagreement_score":0.08277386,"about_ca_system_score_codex":0.000034365083,"about_ca_system_score_gemma":0.000015477824,"threshold_uncertainty_score":0.92150474},"labels":[],"label_agreement":null},{"id":"W154300135","doi":"","title":"Some Bounds on Alliances in Trees.","year":2010,"lang":"en","type":"article","venue":"Cologne Twente Workshop on Graphs and Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Dominating set; Mathematics; Cardinality (data modeling); Graph; Simple graph; Alliance; Offensive; Upper and lower bounds; Simple (philosophy); Discrete mathematics; Computer science; Data mining","score_opus":0.013036732546370977,"score_gpt":0.2734150912754956,"score_spread":0.2603783587291246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W154300135","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87640554,0.0012003939,0.06977966,0.0072613196,0.03372876,0.0027705687,0.000012398242,0.0010294118,0.007811923],"genre_scores_gemma":[0.9935045,0.0006983875,0.0049486468,0.00036662666,0.00013159386,0.000091280075,0.000011048371,0.000021433932,0.00022643084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981943,0.0001398826,0.00027538184,0.00060241617,0.00036732937,0.00042072096],"domain_scores_gemma":[0.99875885,0.00037341725,0.000114493676,0.0005078143,0.00009493212,0.00015047641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051544735,0.00022509701,0.00025533515,0.0004532561,0.00024276732,0.0002315632,0.00065194553,0.00020417343,0.000018232673],"category_scores_gemma":[0.00019437402,0.00021090965,0.00006457492,0.0011008139,0.00020947917,0.00059181324,0.00015950874,0.0006281949,0.000007802343],"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.00019919903,0.00031235453,0.0006975511,0.0000041694207,0.000009380961,0.000013499871,0.00009051659,0.02101923,0.00012659018,0.9698018,0.00023050999,0.007495192],"study_design_scores_gemma":[0.004612739,0.0012711432,0.0034367281,0.00010998465,0.000008523632,0.0000050886747,0.000055100343,0.1602346,0.0005198869,0.8264314,0.002681448,0.0006333479],"about_ca_topic_score_codex":0.0000042726933,"about_ca_topic_score_gemma":0.000023929675,"teacher_disagreement_score":0.14337039,"about_ca_system_score_codex":0.000036824178,"about_ca_system_score_gemma":0.00004899857,"threshold_uncertainty_score":0.8600646},"labels":[],"label_agreement":null},{"id":"W2288980828","doi":"","title":"Bound constraints for Point Packing in a Square","year":2011,"lang":"en","type":"article","venue":"Cologne Twente Workshop on Graphs and Combinatorial Optimization","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Square (algebra); Computer science; Point (geometry); Packing problems; Upper and lower bounds; Mathematical optimization; Mathematics; Algorithm; Geometry; Mathematical analysis","score_opus":0.022184027722259934,"score_gpt":0.2285077954032597,"score_spread":0.20632376768099975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288980828","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.19604169,0.0017046654,0.68967634,0.00053963077,0.027865063,0.0073770573,0.000106965934,0.0025376994,0.07415088],"genre_scores_gemma":[0.99391663,0.00038902595,0.00532571,0.000086669876,0.000034686058,0.00011371906,0.00005683147,0.000042176518,0.000034550005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905324,0.000036440924,0.00030269302,0.00023917433,0.000095989024,0.00027244375],"domain_scores_gemma":[0.9995354,0.00010136003,0.00006422039,0.00013511292,0.0000806512,0.0000832555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021763648,0.00019614266,0.00022934932,0.00024384577,0.0001070462,0.00006849696,0.00008861136,0.00018544024,0.00010792388],"category_scores_gemma":[0.00006257224,0.00020895182,0.00005821108,0.00037437363,0.00008826255,0.0001466618,0.000018783368,0.00015767959,0.0000018034449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006218198,0.00041233678,0.0030920296,0.00017753987,0.000096112875,0.00001044949,0.002634078,0.77203655,0.000039732695,0.20618677,0.0015649251,0.013127661],"study_design_scores_gemma":[0.013035457,0.0010145754,0.0027432006,0.0007939327,0.00010107079,0.000011995168,0.0010522322,0.92041993,0.00045007703,0.057388354,0.001584097,0.001405086],"about_ca_topic_score_codex":0.0000033854142,"about_ca_topic_score_gemma":0.000008482183,"teacher_disagreement_score":0.7978749,"about_ca_system_score_codex":0.000047502865,"about_ca_system_score_gemma":0.000016642412,"threshold_uncertainty_score":0.8520808},"labels":[],"label_agreement":null},{"id":"W2396107515","doi":"","title":"Graph Models and their Efficient Implementation for Sparse Jacobian Matrix Determination.","year":2010,"lang":"en","type":"article","venue":"Cologne Twente Workshop on Graphs and Combinatorial Optimization","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Sparse matrix; Computer science; Jacobian matrix and determinant; Theoretical computer science; Algorithm; Graph; Matrix (chemical analysis); Adjacency matrix; Mathematics; Applied mathematics","score_opus":0.012163610641859116,"score_gpt":0.26497738696290196,"score_spread":0.25281377632104285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396107515","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.17861451,0.00009328746,0.8163972,0.00038341264,0.0033688622,0.0008921557,0.000016744421,0.00014305054,0.00009080519],"genre_scores_gemma":[0.9737185,0.0001130717,0.025746513,0.00012391155,0.000061503044,0.00015146218,0.00004210164,0.000018102233,0.000024821926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864507,0.00008275382,0.00030643854,0.00051282434,0.000153072,0.00029983826],"domain_scores_gemma":[0.998932,0.00026740917,0.00018364737,0.00029269574,0.00018444758,0.00013979248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053377484,0.00024149833,0.000223926,0.00031588407,0.00049713126,0.00028624665,0.00029003134,0.00015752856,0.0000079944975],"category_scores_gemma":[0.00003633233,0.00021453811,0.00008929953,0.0005023472,0.00011788009,0.00037783233,0.000109869135,0.00018933597,4.7449217e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008345642,0.00018188158,0.00006315533,0.000014161241,0.00002111374,0.0000012020136,0.00059524825,0.033430204,0.00028251926,0.9306818,0.0000924971,0.03455272],"study_design_scores_gemma":[0.0020198156,0.00030531455,0.00011550122,0.000016909973,0.000019821917,0.000006144967,0.00018626498,0.73895526,0.00043305982,0.25756645,0.0001252804,0.00025016986],"about_ca_topic_score_codex":0.0000029117596,"about_ca_topic_score_gemma":0.000006271502,"teacher_disagreement_score":0.795104,"about_ca_system_score_codex":0.000013309642,"about_ca_system_score_gemma":0.000028224633,"threshold_uncertainty_score":0.874861},"labels":[],"label_agreement":null},{"id":"W2396219131","doi":"","title":"The price of equity in the Hazmat.","year":2011,"lang":"en","type":"article","venue":"Cologne Twente Workshop on Graphs and Combinatorial Optimization","topic":"Islamic Finance and Banking Studies","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Equity (law); Business; Computer science; Natural resource economics; Economics; Political science","score_opus":0.025568240781868406,"score_gpt":0.24649102566684497,"score_spread":0.22092278488497658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396219131","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9122177,0.00088062265,0.0008689267,0.0020433804,0.0058902367,0.0011344072,0.0000014129093,0.00009348643,0.076869875],"genre_scores_gemma":[0.9988999,0.000466393,0.000060718463,0.00038426818,0.00009641108,0.000034787958,0.000004182312,0.000007363445,0.00004599498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992557,0.000023272258,0.00022077684,0.00014873817,0.00016711609,0.00018436418],"domain_scores_gemma":[0.9994034,0.00012757986,0.00020242715,0.000163162,0.000101616606,0.0000017908727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005911156,0.00011156516,0.00014452961,0.00009223835,0.00033591,0.00008641058,0.00025650268,0.00006117466,0.000009837463],"category_scores_gemma":[0.00012643806,0.00006584728,0.00004295408,0.0005847046,0.00014608733,0.00019935386,0.00013961366,0.00012433024,0.0000022284325],"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.00017174857,0.00017371809,0.0033121875,0.000023475961,0.000014323342,0.0000018847692,0.00031847737,0.00037507125,0.000002225597,0.98835593,0.0017542798,0.0054967026],"study_design_scores_gemma":[0.0051714,0.00037222655,0.15881068,0.00048541895,0.0002066423,0.0000020929292,0.0024682248,0.016780224,0.00004132006,0.8010898,0.013844249,0.0007276792],"about_ca_topic_score_codex":0.00004770888,"about_ca_topic_score_gemma":0.000029112805,"teacher_disagreement_score":0.18726605,"about_ca_system_score_codex":0.0000100972875,"about_ca_system_score_gemma":0.000008491026,"threshold_uncertainty_score":0.2685174},"labels":[],"label_agreement":null},{"id":"W2396856145","doi":"","title":"Approximation results for the linear ordering problem on interval graphs.","year":2013,"lang":"en","type":"article","venue":"Cologne Twente Workshop on Graphs and Combinatorial Optimization","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Interval (graph theory); Mathematics; Combinatorics; Interval graph; Discrete mathematics; Chordal graph; Computer science; 1-planar graph; Graph","score_opus":0.014870486590647857,"score_gpt":0.2397716318963463,"score_spread":0.22490114530569844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396856145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037409621,0.000052479525,0.9835149,0.005480528,0.0033101176,0.0022137577,0.0000065862714,0.00031159932,0.0013690422],"genre_scores_gemma":[0.9047109,0.0005745836,0.09210498,0.0010763439,0.00015377742,0.00089305855,0.00011528795,0.000041108357,0.00032998636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984472,0.000097386495,0.00043034359,0.0004974673,0.00025336372,0.00027424184],"domain_scores_gemma":[0.9984235,0.00054424966,0.00026211486,0.00037080926,0.00030637268,0.000092942566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040455858,0.00023356942,0.00020436874,0.00022882792,0.00052264996,0.00038154816,0.00033923404,0.00015399355,0.000017421115],"category_scores_gemma":[0.00020784288,0.0001802742,0.00010190106,0.0006598009,0.0000906532,0.0004972736,0.00009303512,0.0002146471,0.0000070408937],"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.00031142618,0.00021871278,0.00007959137,0.000021937902,0.000057340738,5.7074965e-7,0.00042180548,0.4038171,0.000022789705,0.517488,0.0036260395,0.073934704],"study_design_scores_gemma":[0.0025853706,0.0005177658,0.000461687,0.00007617277,0.000021133083,0.000002565872,0.00009452016,0.9746991,0.00007081915,0.020154662,0.001068891,0.00024734155],"about_ca_topic_score_codex":0.000011130819,"about_ca_topic_score_gemma":0.000004430785,"teacher_disagreement_score":0.9009699,"about_ca_system_score_codex":0.000045244284,"about_ca_system_score_gemma":0.00003413094,"threshold_uncertainty_score":0.73513687},"labels":[],"label_agreement":null},{"id":"W2399456157","doi":"","title":"Computing Derivatives via Compression: An Exact Scheme.","year":2011,"lang":"en","type":"article","venue":"Cologne Twente Workshop on Graphs and Combinatorial Optimization","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Scheme (mathematics); Computer science; Compression (physics); Data compression; Computational science; Parallel computing; Algorithm; Mathematics; Materials science","score_opus":0.027987566854524422,"score_gpt":0.25563200876883885,"score_spread":0.22764444191431443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399456157","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0961258,0.00017280751,0.8964904,0.00016751056,0.0044675167,0.00058250653,0.0000014744453,0.0005886187,0.001403367],"genre_scores_gemma":[0.8414016,0.00006374065,0.15812986,0.00021306347,0.00011122467,0.000020859643,0.000018496768,0.000023824652,0.00001733024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997371,0.00037194946,0.00048744865,0.00092906633,0.00037747415,0.00046305987],"domain_scores_gemma":[0.99813783,0.00028394372,0.0002978244,0.00072400464,0.00028473136,0.00027166837],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050956913,0.00037614728,0.00042656428,0.00025705353,0.0005374802,0.00024359893,0.00089321594,0.00022956703,0.000054700093],"category_scores_gemma":[0.00009553524,0.00035442592,0.00010018572,0.0009471363,0.00021432787,0.0007595091,0.0005935073,0.0003501607,0.000004614467],"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.00065896334,0.005223076,0.012877568,0.00007767079,0.00020354093,0.00007833845,0.0070767156,0.060598306,0.00039462972,0.74903923,0.0007044901,0.16306745],"study_design_scores_gemma":[0.001828072,0.0010316615,0.007785321,0.00007982138,0.00001764348,0.000013342622,0.00011838647,0.94200116,0.00033700975,0.046077207,0.00014950479,0.0005608577],"about_ca_topic_score_codex":0.00001774212,"about_ca_topic_score_gemma":0.0000021709825,"teacher_disagreement_score":0.88140285,"about_ca_system_score_codex":0.00005790539,"about_ca_system_score_gemma":0.000049453472,"threshold_uncertainty_score":0.99989074},"labels":[],"label_agreement":null},{"id":"W2399784609","doi":"","title":"Bruno Simeone's Work in Clustering.","year":2011,"lang":"en","type":"article","venue":"Cologne Twente Workshop on Graphs and Combinatorial Optimization","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Cluster analysis; Computer science; Artificial intelligence","score_opus":0.025207815627535973,"score_gpt":0.25765075609501553,"score_spread":0.23244294046747957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399784609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028783072,0.00035916327,0.960874,0.00041521783,0.0047263396,0.000842096,0.0000014705059,0.00042948697,0.003569133],"genre_scores_gemma":[0.8808942,0.00057197385,0.11773742,0.00022168113,0.000065560685,0.00012227001,0.000008523482,0.000040708346,0.000337669],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982179,0.00013547385,0.0003178074,0.0005783974,0.00029920627,0.0004512518],"domain_scores_gemma":[0.9990123,0.00015864061,0.00011111612,0.00045804633,0.00010798415,0.00015193656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000347777,0.00022306648,0.00025932826,0.00037949003,0.00016141076,0.0001267253,0.000595538,0.00017375316,0.000026258205],"category_scores_gemma":[0.000109061904,0.00022606782,0.000051478684,0.0014285388,0.00010279444,0.00042262312,0.00044896407,0.0003405324,0.0000079052525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002869248,0.002560079,0.0062951637,0.000090819936,0.00012766925,0.00035186962,0.0054878104,0.43401524,0.00005389789,0.32120287,0.0011982203,0.22574711],"study_design_scores_gemma":[0.005962053,0.0012217881,0.008876815,0.00033292142,0.000015222603,0.000015346184,0.00017153566,0.9442329,0.00019697494,0.03716251,0.00081435865,0.0009975738],"about_ca_topic_score_codex":0.000017484217,"about_ca_topic_score_gemma":0.0000073740093,"teacher_disagreement_score":0.8521111,"about_ca_system_score_codex":0.00008181659,"about_ca_system_score_gemma":0.000038470855,"threshold_uncertainty_score":0.9218778},"labels":[],"label_agreement":null},{"id":"W2405459696","doi":"","title":"Searching Circulant Graphs.","year":2011,"lang":"en","type":"article","venue":"Cologne Twente Workshop on Graphs and Combinatorial Optimization","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Circulant matrix; Computer science; Combinatorics; Mathematics; Algorithm","score_opus":0.025711468339408898,"score_gpt":0.23512952671154555,"score_spread":0.20941805837213665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405459696","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.033405665,0.00043119173,0.920271,0.00076497236,0.014375337,0.0012819545,0.0000086495065,0.0010213306,0.028439945],"genre_scores_gemma":[0.9617444,0.0008628866,0.03643734,0.00048764003,0.000070518596,0.00006111381,0.000064065374,0.00002886929,0.0002431361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985263,0.000103398306,0.00023894834,0.0005137721,0.00028308216,0.0003345366],"domain_scores_gemma":[0.999147,0.000070442395,0.00011943497,0.00044974172,0.000078092155,0.0001352692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037480728,0.00020053644,0.00020046183,0.00031928954,0.00030075616,0.00026541136,0.00063987443,0.00009365995,0.000030437912],"category_scores_gemma":[0.00004309657,0.00018719606,0.00007310578,0.000779294,0.00008258963,0.00066423696,0.00034427768,0.00019667504,0.000009117332],"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.000034570665,0.00022566279,0.00045013436,0.000009139567,0.000038470418,0.00002304458,0.0002886759,0.001043014,0.000005838023,0.9757508,0.00067634694,0.02145428],"study_design_scores_gemma":[0.005410295,0.0012594756,0.0059941006,0.0002066147,0.0000996941,0.000014348868,0.0002541125,0.52273613,0.00019851579,0.45838243,0.0041154283,0.0013288516],"about_ca_topic_score_codex":0.000015898493,"about_ca_topic_score_gemma":0.00000123649,"teacher_disagreement_score":0.92833877,"about_ca_system_score_codex":0.000020894438,"about_ca_system_score_gemma":0.000019483517,"threshold_uncertainty_score":0.76336336},"labels":[],"label_agreement":null},{"id":"W2592359012","doi":"","title":"Recognition of certain square geometric graphs.","year":2015,"lang":"en","type":"article","venue":"Cologne Twente Workshop on Graphs and Combinatorial Optimization","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Square (algebra); Computer science; Combinatorics; Mathematics; Discrete mathematics; Geometry","score_opus":0.028525369718188715,"score_gpt":0.24278333765265558,"score_spread":0.21425796793446686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592359012","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6875706,0.0038251975,0.2790812,0.0023622438,0.019221375,0.0020796258,0.000028172573,0.0011687686,0.004662885],"genre_scores_gemma":[0.9869564,0.00043849705,0.012238497,0.00018977637,0.0000121833955,0.000035999576,0.000053211974,0.000017233133,0.00005818503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982312,0.00016977558,0.00042912224,0.00047040955,0.00042254978,0.00027697545],"domain_scores_gemma":[0.9983474,0.00019222121,0.00028937013,0.00037403704,0.00057311915,0.00022383375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064400927,0.00021455468,0.00031154367,0.0008573948,0.00015123856,0.00011017049,0.00031950636,0.00019811573,0.000009127953],"category_scores_gemma":[0.00030521798,0.00020165204,0.00009752528,0.0027822114,0.000109186534,0.00032098702,0.00013102796,0.00018201402,0.0000052757937],"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.00043835695,0.0012975221,0.0023627318,0.00006299986,0.00010380173,0.000014328945,0.00063013565,0.07386598,0.00008034035,0.8587288,0.0063269082,0.05608806],"study_design_scores_gemma":[0.00787937,0.002646253,0.0005447959,0.0002925135,0.00008943984,0.000014089153,0.00027300086,0.13175105,0.0008542972,0.85422945,0.0006276077,0.0007981181],"about_ca_topic_score_codex":0.000020673322,"about_ca_topic_score_gemma":0.0000014117585,"teacher_disagreement_score":0.29938588,"about_ca_system_score_codex":0.000029443463,"about_ca_system_score_gemma":0.000063069085,"threshold_uncertainty_score":0.8223132},"labels":[],"label_agreement":null},{"id":"W2594785953","doi":"","title":"Star Bi-Coloring of Bipartite Graphs using Column Generation.","year":2015,"lang":"en","type":"article","venue":"Cologne Twente Workshop on Graphs and Combinatorial Optimization","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Bipartite graph; Combinatorics; Column (typography); Star (game theory); Computer science; Mathematics; Computer network; Graph","score_opus":0.041415223447748686,"score_gpt":0.2686880458231554,"score_spread":0.22727282237540675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594785953","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99309605,0.000541666,0.004115488,0.00004503164,0.0016536611,0.00026760856,0.0000060978623,0.000025065687,0.0002493223],"genre_scores_gemma":[0.99602145,0.0002678199,0.0032452885,0.000116478564,0.00016827165,0.000012043929,0.000112445276,0.000015278616,0.000040897157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883467,0.00012200077,0.00030853567,0.00035580093,0.00015667088,0.00022234725],"domain_scores_gemma":[0.9992289,0.00002679399,0.00018898759,0.00018016576,0.0002471555,0.00012799604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003273829,0.00017389632,0.00022498664,0.00009875834,0.00014469838,0.00004437307,0.00012262542,0.0002247044,0.0000059515396],"category_scores_gemma":[0.00017058646,0.0001590064,0.00007781047,0.00033716374,0.000121283716,0.00001086471,0.00011791491,0.00009753304,4.784549e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025084398,0.0014400042,0.030859977,0.00006891532,0.00039166404,0.000014672523,0.00026646318,0.60879725,0.29238343,0.05387708,0.004282332,0.0051097716],"study_design_scores_gemma":[0.022017976,0.015492852,0.003714411,0.00042776804,0.00053561747,0.000041537493,0.0011136419,0.79710805,0.12351351,0.016790487,0.01597677,0.0032673592],"about_ca_topic_score_codex":0.000010389042,"about_ca_topic_score_gemma":0.0000042299384,"teacher_disagreement_score":0.18831082,"about_ca_system_score_codex":0.000018592651,"about_ca_system_score_gemma":0.00005458063,"threshold_uncertainty_score":0.64840925},"labels":[],"label_agreement":null}]}