{"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":"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.078958265,0.0025954298,0.841749,0.0014697037,0.00032453283,0.00011781363,0.0005102342,0.00031662828,0.07395844],"genre_scores_gemma":[0.84894276,0.0017422743,0.135224,0.0004082926,0.00042358568,0.00021731791,0.0006166863,0.00017785447,0.01224726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970408,0.00090045785,0.00012592433,0.00039575563,0.0011073392,0.0004297452],"domain_scores_gemma":[0.9948225,0.0025233293,0.00084400654,0.0007936954,0.0007085871,0.0003079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016108664,0.0011870351,0.0011627787,0.00092036754,0.00085685216,0.0022345462,0.0026630026,0.0013101016,0.010425981],"category_scores_gemma":[0.007828545,0.0005637723,0.000857229,0.0017625374,0.0021204492,0.0039721755,0.0019118949,0.0023010382,0.0011662913],"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.00027222332,0.000089356574,0.00086530286,0.00033274433,0.00003665085,0.00017182504,0.0001598142,0.24471833,0.0051669898,0.6680594,0.00842876,0.071698554],"study_design_scores_gemma":[0.00002772643,0.000104725106,0.00035483838,0.00005426786,0.000012101557,0.000115369796,0.00006587605,0.61833984,0.0034197336,0.36966112,0.0078115244,0.000032921114],"about_ca_topic_score_codex":0.002123623,"about_ca_topic_score_gemma":0.0012501933,"teacher_disagreement_score":0.010425981,"about_ca_system_score_codex":0.002001138,"about_ca_system_score_gemma":0.00093762507,"threshold_uncertainty_score":0.034878373},"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":"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.16060579,0.03670339,0.5171904,0.013025185,0.0013199488,0.00037344408,0.0057848487,0.0010053758,0.26399168],"genre_scores_gemma":[0.8079404,0.025361657,0.132241,0.0023328138,0.0028501034,0.0011076865,0.0043184436,0.00090918597,0.022938637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949522,0.001485417,0.0003015742,0.0009113607,0.0012271211,0.0011222712],"domain_scores_gemma":[0.95697486,0.032641962,0.0028611254,0.0024803614,0.0019189481,0.003122743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057449383,0.0021773777,0.0024315363,0.004069531,0.0034662965,0.0063851196,0.0036919515,0.0030669065,0.018454729],"category_scores_gemma":[0.03809096,0.0012157272,0.0024616637,0.006178228,0.0036659527,0.01826881,0.0053703776,0.007557742,0.0028726277],"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.00041841564,0.00018319329,0.0029725682,0.0009149406,0.00016409378,0.00022624413,0.0010449288,0.032433774,0.0033137097,0.88921857,0.019908747,0.049200896],"study_design_scores_gemma":[0.000055298508,0.00014707477,0.0020303107,0.00028632607,0.00016331505,0.00067683565,0.00036159073,0.04727397,0.0014361225,0.9251447,0.022371953,0.000052464886],"about_ca_topic_score_codex":0.0009396529,"about_ca_topic_score_gemma":0.0015157949,"teacher_disagreement_score":0.018454729,"about_ca_system_score_codex":0.0035358998,"about_ca_system_score_gemma":0.0009175398,"threshold_uncertainty_score":0.06173724},"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":"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.07021386,0.003603685,0.8700484,0.0021470138,0.00046352262,0.00020711122,0.0014658308,0.00049358007,0.051357053],"genre_scores_gemma":[0.6253962,0.005376387,0.31679434,0.0010361572,0.0007736923,0.00083612575,0.0034648534,0.0015076962,0.04481461],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760324,0.0006854931,0.00012748578,0.00037054668,0.00081630785,0.00039696557],"domain_scores_gemma":[0.99129945,0.006684124,0.00036084387,0.00057370606,0.00069891004,0.0003829048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016612081,0.0023064206,0.0028424596,0.0019544165,0.0010554333,0.0039671906,0.003610897,0.0027977577,0.014669608],"category_scores_gemma":[0.015625596,0.0017317135,0.0014017106,0.0048131887,0.0016755188,0.0058824685,0.0042118267,0.00439427,0.002131284],"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.00045464895,0.0001448542,0.0006145302,0.00070704514,0.000078134195,0.00032850733,0.0002967474,0.7369109,0.0042969296,0.18228583,0.01743627,0.056445573],"study_design_scores_gemma":[0.000040866806,0.00007322415,0.00034835647,0.000075656106,0.000020392532,0.00009455562,0.00007585088,0.8141774,0.0010383264,0.1787327,0.005293531,0.000029204266],"about_ca_topic_score_codex":0.00598689,"about_ca_topic_score_gemma":0.004072539,"teacher_disagreement_score":0.014669608,"about_ca_system_score_codex":0.0016890471,"about_ca_system_score_gemma":0.00089223165,"threshold_uncertainty_score":0.04907471},"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":"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.005566469,0.00018907918,0.9881108,0.00036415632,0.000057366728,0.00006911253,0.00021318716,0.0007081485,0.0047217035],"genre_scores_gemma":[0.16861187,0.0007135748,0.8221218,0.0002692586,0.00009045564,0.00048115433,0.0010414126,0.0004434373,0.0062270006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993581,0.00024916595,0.000027819904,0.00010103881,0.00021348159,0.00005033265],"domain_scores_gemma":[0.9980489,0.0010372247,0.0001571673,0.00045184718,0.0002381165,0.00006674153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083859934,0.00087597425,0.00058679,0.001015166,0.0006332434,0.0014495648,0.0018012878,0.0011835857,0.008437816],"category_scores_gemma":[0.0065811495,0.00047026688,0.00090503466,0.0014950417,0.0009886506,0.0029797717,0.0015355087,0.0020272397,0.0025148834],"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.00007203983,0.00010225108,0.0006840152,0.00021172037,0.000040036593,0.00017717943,0.00017819396,0.38624287,0.002886127,0.4908298,0.012640913,0.10593493],"study_design_scores_gemma":[0.00001877246,0.00002625655,0.00010115473,0.000015483478,0.000007989519,0.00006623118,0.00004128211,0.7255789,0.00075423147,0.2671816,0.006197256,0.000010815788],"about_ca_topic_score_codex":0.003681124,"about_ca_topic_score_gemma":0.006498415,"teacher_disagreement_score":0.008437816,"about_ca_system_score_codex":0.0008750111,"about_ca_system_score_gemma":0.0011718326,"threshold_uncertainty_score":0.02822727},"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":"other","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.29097807,0.016881933,0.04249208,0.031671803,0.0024638118,0.000041408177,0.0012080983,0.00016665945,0.6140961],"genre_scores_gemma":[0.91905093,0.0015522551,0.0031204766,0.00045686556,0.000402893,0.000014306685,0.00012167597,0.000051146926,0.07522945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999801,0.00005774446,0.0000056928884,0.000043995075,0.000050835868,0.00004071802],"domain_scores_gemma":[0.9996536,0.00015861655,0.000046004734,0.00003318334,0.000046788868,0.000061836625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030982113,0.00018858138,0.0003351424,0.0005272494,0.00088513666,0.0027399529,0.000587094,0.0014964176,0.024382254],"category_scores_gemma":[0.0028668968,0.00023722734,0.00019929996,0.00062569545,0.0014611719,0.0041588834,0.0007567908,0.0017748601,0.0010318289],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047516445,0.0000105116205,0.00022789087,0.000017302922,0.0000047843314,0.00004831073,0.00004725227,0.0017067196,0.00020627984,0.980992,0.008522696,0.008168682],"study_design_scores_gemma":[0.000020064137,0.000014933867,0.0013423578,0.000035368408,0.000007764674,0.00009889741,0.00014794245,0.012964757,0.0003245512,0.9571537,0.027874826,0.000014748526],"about_ca_topic_score_codex":0.005340502,"about_ca_topic_score_gemma":0.008144488,"teacher_disagreement_score":0.024382254,"about_ca_system_score_codex":0.0019265779,"about_ca_system_score_gemma":0.0006164311,"threshold_uncertainty_score":0.08156681},"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":"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.07684311,0.012272585,0.83676696,0.007771255,0.0011152822,0.00036523992,0.0037140793,0.0026058946,0.058545552],"genre_scores_gemma":[0.5721142,0.008341974,0.38517275,0.0019914857,0.0013699178,0.00056787604,0.009055022,0.0013720425,0.020014778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99604464,0.00125633,0.00014947237,0.00061890914,0.0009800071,0.0009505904],"domain_scores_gemma":[0.9723355,0.020664318,0.0013125257,0.003078978,0.0013262121,0.0012822843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004540382,0.002957668,0.0024926993,0.003114086,0.0013314689,0.0047633876,0.0064900955,0.0025799347,0.020909177],"category_scores_gemma":[0.033959284,0.0011843798,0.0022846446,0.00713258,0.0016750938,0.010512924,0.0026288258,0.0065329424,0.0032307904],"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.0023274147,0.0015820692,0.0048768283,0.0012756769,0.0004955555,0.00036408537,0.0006508117,0.46823475,0.0027645982,0.23544459,0.08961281,0.19237083],"study_design_scores_gemma":[0.00017218154,0.00017352305,0.0009032566,0.00016740993,0.00018981812,0.000253579,0.0002447186,0.7674652,0.0010866813,0.22165234,0.0076561044,0.00003515306],"about_ca_topic_score_codex":0.010947876,"about_ca_topic_score_gemma":0.012627231,"teacher_disagreement_score":0.020909177,"about_ca_system_score_codex":0.004729278,"about_ca_system_score_gemma":0.003562179,"threshold_uncertainty_score":0.0699482},"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":"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.04768618,0.0017331693,0.9115059,0.0013258491,0.0004228462,0.00026988355,0.0015021439,0.008257779,0.027296312],"genre_scores_gemma":[0.3836449,0.00068456435,0.5954526,0.000512311,0.0003136821,0.00026526145,0.00276364,0.0013697497,0.014993284],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983198,0.00029004767,0.00013152232,0.00034053883,0.0007074425,0.00021070128],"domain_scores_gemma":[0.9964187,0.001045228,0.00012067535,0.0019443529,0.00035325228,0.00011772566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096869137,0.001071496,0.0015758219,0.001638258,0.0012643093,0.0029588551,0.0027934455,0.0013299077,0.015244284],"category_scores_gemma":[0.007676953,0.0006293524,0.0010997164,0.0036702538,0.0015786603,0.0077501303,0.004456739,0.0022336417,0.0039021054],"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.0010153296,0.00023822684,0.0014474014,0.00040298764,0.00012602963,0.00022765914,0.00033016613,0.04406271,0.009659033,0.2882509,0.032277696,0.6219619],"study_design_scores_gemma":[0.00013971838,0.00011936009,0.0005367016,0.00006579085,0.00007894556,0.00023151713,0.00012393613,0.25328916,0.010943935,0.71491635,0.019506363,0.000048104714],"about_ca_topic_score_codex":0.002568453,"about_ca_topic_score_gemma":0.005357695,"teacher_disagreement_score":0.015244284,"about_ca_system_score_codex":0.0013635202,"about_ca_system_score_gemma":0.0018872676,"threshold_uncertainty_score":0.050997198},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00657455,0.13790607,0.39000934,0.16901939,0.049527563,0.00016966194,0.0018387234,0.0032829894,0.24167167],"genre_scores_gemma":[0.15964238,0.06747879,0.22887781,0.04751739,0.019517617,0.0003684805,0.00277827,0.0027220221,0.47109723],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971601,0.00079732365,0.00006873703,0.0010429029,0.00072354334,0.00020747149],"domain_scores_gemma":[0.9955754,0.002176858,0.00011624279,0.00078224903,0.0008038295,0.0005454933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024353792,0.0012732914,0.0012977349,0.0025470303,0.0021026004,0.0032458294,0.0019960108,0.0027264524,0.017840315],"category_scores_gemma":[0.00760157,0.0007887201,0.00097277004,0.004534915,0.002227568,0.0053015556,0.0025715455,0.003975452,0.0118417265],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017556238,0.000073216914,0.00079616066,0.00055163377,0.00007939523,0.00016209668,0.00064496725,0.003933679,0.0014108556,0.23947896,0.5795699,0.1731236],"study_design_scores_gemma":[0.00002010965,0.000015109109,0.0005093004,0.00016525768,0.000025590178,0.0002973172,0.00017623055,0.003804513,0.0019573208,0.13995947,0.85302156,0.00004824202],"about_ca_topic_score_codex":0.006864415,"about_ca_topic_score_gemma":0.0067895427,"teacher_disagreement_score":0.017840315,"about_ca_system_score_codex":0.0031139767,"about_ca_system_score_gemma":0.0013249335,"threshold_uncertainty_score":0.059681833},"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":"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.1028632,0.0068900455,0.78310466,0.0039846357,0.001026761,0.0003266519,0.0033359223,0.0034973207,0.09497074],"genre_scores_gemma":[0.4419199,0.002642809,0.4956454,0.0015918763,0.00046413625,0.00033867234,0.0062113684,0.0012583542,0.04992753],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994172,0.00018824561,0.000025262329,0.00012880193,0.00013376203,0.00010671632],"domain_scores_gemma":[0.99758136,0.0014697787,0.00019026583,0.0003419886,0.0002138845,0.0002025966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064119144,0.0008657051,0.0010973926,0.0018473669,0.0011055702,0.001467212,0.0013680278,0.0016592576,0.015609344],"category_scores_gemma":[0.007329714,0.00070868136,0.00071416376,0.0018462129,0.0006378806,0.0017086683,0.0016594249,0.001336835,0.0033282104],"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.0006597905,0.00047044875,0.002637104,0.0010193981,0.00022118633,0.00053047773,0.00026472486,0.1194728,0.009009364,0.25057226,0.14864685,0.4664956],"study_design_scores_gemma":[0.00021862003,0.0001586704,0.0010290538,0.0001402552,0.00010072651,0.00040830515,0.0001577765,0.4625903,0.0046625133,0.4940081,0.036484364,0.00004132152],"about_ca_topic_score_codex":0.0027492857,"about_ca_topic_score_gemma":0.008943222,"teacher_disagreement_score":0.015609344,"about_ca_system_score_codex":0.001004135,"about_ca_system_score_gemma":0.0011637793,"threshold_uncertainty_score":0.052218497},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6289968,0.0009366085,0.31895074,0.0018777504,0.0001819427,0.00013643171,0.002156183,0.0015241723,0.04523941],"genre_scores_gemma":[0.9078643,0.00028730006,0.07742875,0.00026939609,0.0000570808,0.000050779367,0.0031377727,0.00014312773,0.010761574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973816,0.000040449268,0.000012659191,0.00011245781,0.000049235696,0.000047035905],"domain_scores_gemma":[0.9992964,0.00027189293,0.00011269267,0.00014109467,0.00009467699,0.00008312203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012292423,0.00029790506,0.0003646806,0.0004473562,0.0003556525,0.0009866176,0.0004553046,0.0005903333,0.006227044],"category_scores_gemma":[0.0016233673,0.00022538303,0.000335159,0.00058452814,0.0006009913,0.0011568998,0.00071801984,0.0006398549,0.001328207],"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.0013322381,0.00022110128,0.011555936,0.0008637993,0.000076858196,0.0011355759,0.0012106181,0.06669602,0.13306993,0.44410953,0.04778977,0.29193857],"study_design_scores_gemma":[0.0001127527,0.00021385461,0.011898239,0.000064205225,0.00004615541,0.0016489031,0.0011826783,0.35997468,0.053505883,0.5199365,0.05136394,0.000052276195],"about_ca_topic_score_codex":0.0014696347,"about_ca_topic_score_gemma":0.00232041,"teacher_disagreement_score":0.006227044,"about_ca_system_score_codex":0.0003299073,"about_ca_system_score_gemma":0.0002765684,"threshold_uncertainty_score":0.020831525},"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":"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.044414725,0.00045656308,0.93753654,0.00057000114,0.00019889728,0.00032989195,0.0011054862,0.002416774,0.012971142],"genre_scores_gemma":[0.3427599,0.0003456263,0.63984585,0.0005178047,0.0001052396,0.00046954406,0.0026915208,0.0007096425,0.012554907],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865156,0.000671551,0.00004677916,0.00018448976,0.00023874271,0.00020699484],"domain_scores_gemma":[0.995634,0.0022480958,0.00021017231,0.0009874152,0.0006415752,0.00027859138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012088795,0.0009712471,0.00086541765,0.0015360387,0.00083394523,0.0014699285,0.0015153317,0.0007435941,0.0066892193],"category_scores_gemma":[0.0039523314,0.0007102499,0.0011857384,0.0018416492,0.00077929656,0.0016584891,0.001672986,0.0015373622,0.0018035603],"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.0010084984,0.0008034203,0.0026720038,0.00095295225,0.00021470286,0.0002738818,0.00047523787,0.2675567,0.032329384,0.17398223,0.06039881,0.45933223],"study_design_scores_gemma":[0.000073939955,0.00011298229,0.0004434439,0.00003862963,0.00004361031,0.00011218328,0.00008632841,0.8422334,0.009231062,0.14244531,0.005145985,0.000033038425],"about_ca_topic_score_codex":0.003111368,"about_ca_topic_score_gemma":0.0062090433,"teacher_disagreement_score":0.0066892193,"about_ca_system_score_codex":0.0010784396,"about_ca_system_score_gemma":0.0015581339,"threshold_uncertainty_score":0.02237767},"labels":[],"label_agreement":null}]}