{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":11,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":11,"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":"4252c0884037","filters":{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Alberto Costa","is_ca":false},{"name":"Pierre Hansen","is_ca":true},{"name":"Leo Liberti","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006615354732950662,"gpt":0.2182841252345507,"spread":0.2116687705016001,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001610866,0.001187035,0.001162779,0.0009203675,0.0008568522,0.002234546,0.002663003,0.001310102,0.01042598],"category_scores_gemma":[0.007828545,0.0005637723,0.000857229,0.001762537,0.002120449,0.003972176,0.001911895,0.002301038,0.001166291],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002001138,"about_ca_system_score_gemma":0.0009376251,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002123623,"about_ca_topic_score_gemma":0.001250193,"domain_scores_codex":[0.9970408,0.0009004578,0.0001259243,0.0003957556,0.001107339,0.0004297452],"domain_scores_gemma":[0.9948225,0.002523329,0.0008440065,0.0007936954,0.0007085871,0.0003079],"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.0002722233,0.00008935657,0.0008653029,0.0003327443,0.00003665085,0.000171825,0.0001598142,0.2447183,0.00516699,0.6680594,0.00842876,0.07169855],"study_design_scores_gemma":[0.00002772643,0.0001047251,0.0003548384,0.00005426786,0.00001210156,0.0001153698,0.00006587605,0.6183398,0.003419734,0.3696611,0.007811524,0.00003292111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07895827,0.00259543,0.841749,0.001469704,0.0003245328,0.0001178136,0.0005102342,0.0003166283,0.07395844],"genre_scores_gemma":[0.8489428,0.001742274,0.135224,0.0004082926,0.0004235857,0.0002173179,0.0006166863,0.0001778545,0.01224726],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01042598,"threshold_uncertainty_score":0.03487837,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ararat Harutyunyan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01303673254637098,"gpt":0.2734150912754956,"spread":0.2603783587291246,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005744938,0.002177378,0.002431536,0.004069531,0.003466296,0.00638512,0.003691952,0.003066906,0.01845473],"category_scores_gemma":[0.03809096,0.001215727,0.002461664,0.006178228,0.003665953,0.01826881,0.005370378,0.007557742,0.002872628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0035359,"about_ca_system_score_gemma":0.0009175398,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009396529,"about_ca_topic_score_gemma":0.001515795,"domain_scores_codex":[0.9949522,0.001485417,0.0003015742,0.0009113607,0.001227121,0.001122271],"domain_scores_gemma":[0.9569749,0.03264196,0.002861125,0.002480361,0.001918948,0.003122743],"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.0004184156,0.0001831933,0.002972568,0.0009149406,0.0001640938,0.0002262441,0.001044929,0.03243377,0.00331371,0.8892186,0.01990875,0.0492009],"study_design_scores_gemma":[0.00005529851,0.0001470748,0.002030311,0.0002863261,0.0001633151,0.0006768357,0.0003615907,0.04727397,0.001436122,0.9251447,0.02237195,0.00005246489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1606058,0.03670339,0.5171904,0.01302519,0.001319949,0.0003734441,0.005784849,0.001005376,0.2639917],"genre_scores_gemma":[0.8079404,0.02536166,0.132241,0.002332814,0.002850103,0.001107687,0.004318444,0.000909186,0.02293864],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01845473,"threshold_uncertainty_score":0.06173724,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Alberto Costa","is_ca":false},{"name":"Pierre Hansen","is_ca":true},{"name":"Leo Liberti","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02218402772225993,"gpt":0.2285077954032597,"spread":0.2063237676809997,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001661208,0.002306421,0.00284246,0.001954417,0.001055433,0.003967191,0.003610897,0.002797758,0.01466961],"category_scores_gemma":[0.0156256,0.001731714,0.001401711,0.004813189,0.001675519,0.005882469,0.004211827,0.00439427,0.002131284],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001689047,"about_ca_system_score_gemma":0.0008922316,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00598689,"about_ca_topic_score_gemma":0.004072539,"domain_scores_codex":[0.9976032,0.0006854931,0.0001274858,0.0003705467,0.0008163078,0.0003969656],"domain_scores_gemma":[0.9912995,0.006684124,0.0003608439,0.0005737061,0.00069891,0.0003829048],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000454649,0.0001448542,0.0006145302,0.0007070451,0.0000781342,0.0003285073,0.0002967474,0.7369109,0.00429693,0.1822858,0.01743627,0.05644557],"study_design_scores_gemma":[0.00004086681,0.00007322415,0.0003483565,0.00007565611,0.00002039253,0.00009455562,0.00007585088,0.8141774,0.001038326,0.1787327,0.005293531,0.00002920427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07021386,0.003603685,0.8700484,0.002147014,0.0004635226,0.0002071112,0.001465831,0.0004935801,0.05135705],"genre_scores_gemma":[0.6253962,0.005376387,0.3167943,0.001036157,0.0007736923,0.0008361257,0.003464853,0.001507696,0.04481461],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01466961,"threshold_uncertainty_score":0.04907471,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Shahadat Hossain","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02798756685452442,"gpt":0.2556320087688388,"spread":0.2276444419143144,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009686914,0.001071496,0.001575822,0.001638258,0.001264309,0.002958855,0.002793445,0.001329908,0.01524428],"category_scores_gemma":[0.007676953,0.0006293524,0.001099716,0.003670254,0.00157866,0.00775013,0.004456739,0.002233642,0.003902105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00136352,"about_ca_system_score_gemma":0.001887268,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002568453,"about_ca_topic_score_gemma":0.005357695,"domain_scores_codex":[0.9983198,0.0002900477,0.0001315223,0.0003405388,0.0007074425,0.0002107013],"domain_scores_gemma":[0.9964187,0.001045228,0.0001206754,0.001944353,0.0003532523,0.0001177257],"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.00101533,0.0002382268,0.001447401,0.0004029876,0.0001260296,0.0002276591,0.0003301661,0.04406271,0.009659033,0.2882509,0.0322777,0.6219619],"study_design_scores_gemma":[0.0001397184,0.0001193601,0.0005367016,0.00006579085,0.00007894556,0.0002315171,0.0001239361,0.2532892,0.01094394,0.7149163,0.01950636,0.00004810471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04768618,0.001733169,0.9115059,0.001325849,0.0004228462,0.0002698835,0.001502144,0.008257779,0.02729631],"genre_scores_gemma":[0.3836449,0.0006845644,0.5954526,0.000512311,0.0003136821,0.0002652614,0.00276364,0.00136975,0.01499328],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01524428,"threshold_uncertainty_score":0.0509972,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Circulant matrix; Computer science; Combinatorics; Mathematics; Algorithm","authors":[{"name":"Öznur Yaşar Diner","is_ca":false},{"name":"Danny Dyer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0257114683394089,"gpt":0.2351295267115456,"spread":0.2094180583721366,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006411914,0.0008657051,0.001097393,0.001847367,0.00110557,0.001467212,0.001368028,0.001659258,0.01560934],"category_scores_gemma":[0.007329714,0.0007086814,0.0007141638,0.001846213,0.0006378806,0.001708668,0.001659425,0.001336835,0.00332821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001004135,"about_ca_system_score_gemma":0.001163779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002749286,"about_ca_topic_score_gemma":0.008943222,"domain_scores_codex":[0.9994172,0.0001882456,0.00002526233,0.0001288019,0.000133762,0.0001067163],"domain_scores_gemma":[0.9975814,0.001469779,0.0001902658,0.0003419886,0.0002138845,0.0002025966],"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.0006597905,0.0004704488,0.002637104,0.001019398,0.0002211863,0.0005304777,0.0002647249,0.1194728,0.009009364,0.2505723,0.1486468,0.4664956],"study_design_scores_gemma":[0.00021862,0.0001586704,0.001029054,0.0001402552,0.0001007265,0.0004083051,0.0001577765,0.4625903,0.004662513,0.4940081,0.03648436,0.00004132152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1028632,0.006890045,0.7831047,0.003984636,0.001026761,0.0003266519,0.003335922,0.003497321,0.09497074],"genre_scores_gemma":[0.4419199,0.002642809,0.4956454,0.001591876,0.0004641362,0.0003386723,0.006211368,0.001258354,0.04992753],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01560934,"threshold_uncertainty_score":0.0522185,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"","keywords":"Bipartite graph; Combinatorics; Column (typography); Star (game theory); Computer science; Mathematics; Computer network; Graph","authors":[{"name":"Daya Ram Gaur","is_ca":true},{"name":"Shahadat Hossain","is_ca":true},{"name":"Rishi Ranjan Singh","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04141522344774869,"gpt":0.2686880458231554,"spread":0.2272728223754067,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00120888,0.0009712471,0.0008654176,0.001536039,0.0008339452,0.001469929,0.001515332,0.0007435941,0.006689219],"category_scores_gemma":[0.003952331,0.0007102499,0.001185738,0.001841649,0.0007792966,0.001658489,0.001672986,0.001537362,0.00180356],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00107844,"about_ca_system_score_gemma":0.001558134,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003111368,"about_ca_topic_score_gemma":0.006209043,"domain_scores_codex":[0.9986516,0.000671551,0.00004677916,0.0001844898,0.0002387427,0.0002069948],"domain_scores_gemma":[0.995634,0.002248096,0.0002101723,0.0009874152,0.0006415752,0.0002785914],"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.001008498,0.0008034203,0.002672004,0.0009529523,0.0002147029,0.0002738818,0.0004752379,0.2675567,0.03232938,0.1739822,0.06039881,0.4593322],"study_design_scores_gemma":[0.00007393995,0.0001129823,0.0004434439,0.00003862963,0.00004361031,0.0001121833,0.00008632841,0.8422334,0.009231062,0.1424453,0.005145985,0.00003303842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04441473,0.0004565631,0.9375365,0.0005700011,0.0001988973,0.0003298919,0.001105486,0.002416774,0.01297114],"genre_scores_gemma":[0.3427599,0.0003456263,0.6398458,0.0005178047,0.0001052396,0.0004695441,0.002691521,0.0007096425,0.01255491],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006689219,"threshold_uncertainty_score":0.02237767,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Alain Quilliot","is_ca":false},{"name":"Djamal Rebaïne","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01487048659064786,"gpt":0.2397716318963463,"spread":0.2249011453056984,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004540382,0.002957668,0.002492699,0.003114086,0.001331469,0.004763388,0.006490096,0.002579935,0.02090918],"category_scores_gemma":[0.03395928,0.00118438,0.002284645,0.00713258,0.001675094,0.01051292,0.002628826,0.006532942,0.00323079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004729278,"about_ca_system_score_gemma":0.003562179,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01094788,"about_ca_topic_score_gemma":0.01262723,"domain_scores_codex":[0.9960446,0.00125633,0.0001494724,0.0006189091,0.0009800071,0.0009505904],"domain_scores_gemma":[0.9723355,0.02066432,0.001312526,0.003078978,0.001326212,0.001282284],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002327415,0.001582069,0.004876828,0.001275677,0.0004955555,0.0003640854,0.0006508117,0.4682347,0.002764598,0.2354446,0.08961281,0.1923708],"study_design_scores_gemma":[0.0001721815,0.000173523,0.0009032566,0.0001674099,0.0001898181,0.000253579,0.0002447186,0.7674652,0.001086681,0.2216523,0.007656104,0.00003515306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07684311,0.01227259,0.836767,0.007771255,0.001115282,0.0003652399,0.003714079,0.002605895,0.05854555],"genre_scores_gemma":[0.5721142,0.008341974,0.3851728,0.001991486,0.001369918,0.000567876,0.009055022,0.001372042,0.02001478],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02090918,"threshold_uncertainty_score":0.0699482,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Shahadat Hossain","is_ca":true},{"name":"Trond Steihaug","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01216361064185912,"gpt":0.264977386962902,"spread":0.2528137763210428,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008385993,0.0008759742,0.00058679,0.001015166,0.0006332434,0.001449565,0.001801288,0.001183586,0.008437816],"category_scores_gemma":[0.00658115,0.0004702669,0.0009050347,0.001495042,0.0009886506,0.002979772,0.001535509,0.00202724,0.002514883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008750111,"about_ca_system_score_gemma":0.001171833,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003681124,"about_ca_topic_score_gemma":0.006498415,"domain_scores_codex":[0.9993581,0.000249166,0.0000278199,0.0001010388,0.0002134816,0.00005033265],"domain_scores_gemma":[0.9980489,0.001037225,0.0001571673,0.0004518472,0.0002381165,0.00006674153],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007203983,0.0001022511,0.0006840152,0.0002117204,0.00004003659,0.0001771794,0.000178194,0.3862429,0.002886127,0.4908298,0.01264091,0.1059349],"study_design_scores_gemma":[0.00001877246,0.00002625655,0.0001011547,0.00001548348,0.000007989519,0.00006623118,0.00004128211,0.7255789,0.0007542315,0.2671816,0.006197256,0.00001081579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005566469,0.0001890792,0.9881108,0.0003641563,0.00005736673,0.00006911253,0.0002131872,0.0007081485,0.004721703],"genre_scores_gemma":[0.1686119,0.0007135748,0.8221218,0.0002692586,0.00009045564,0.0004811543,0.001041413,0.0004434373,0.006227001],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008437816,"threshold_uncertainty_score":0.02822727,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Cluster analysis; Computer science; Artificial intelligence","authors":[{"name":"Pierre Hansen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02520781562753597,"gpt":0.2576507560950155,"spread":0.2324429404674796,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002435379,0.001273291,0.001297735,0.00254703,0.0021026,0.003245829,0.001996011,0.002726452,0.01784031],"category_scores_gemma":[0.00760157,0.0007887201,0.00097277,0.004534915,0.002227568,0.005301556,0.002571546,0.003975452,0.01184173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003113977,"about_ca_system_score_gemma":0.001324933,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006864415,"about_ca_topic_score_gemma":0.006789543,"domain_scores_codex":[0.9971601,0.0007973236,0.00006873703,0.001042903,0.0007235433,0.0002074715],"domain_scores_gemma":[0.9955754,0.002176858,0.0001162428,0.000782249,0.0008038295,0.0005454933],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001755624,0.00007321691,0.0007961607,0.0005516338,0.00007939523,0.0001620967,0.0006449673,0.003933679,0.001410856,0.239479,0.5795699,0.1731236],"study_design_scores_gemma":[0.00002010965,0.00001510911,0.0005093004,0.0001652577,0.00002559018,0.0002973172,0.0001762305,0.003804513,0.001957321,0.1399595,0.8530216,0.00004824202],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.00657455,0.1379061,0.3900093,0.1690194,0.04952756,0.0001696619,0.001838723,0.003282989,0.2416717],"genre_scores_gemma":[0.1596424,0.06747879,0.2288778,0.04751739,0.01951762,0.0003684805,0.00277827,0.002722022,0.4710972],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.01784031,"threshold_uncertainty_score":0.05968183,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Equity (law); Business; Computer science; Natural resource economics; Economics; Political science","authors":[{"name":"Fabio Roda","is_ca":false},{"name":"Pierre Hansen","is_ca":true},{"name":"Leo Liberti","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02556824078186841,"gpt":0.246491025666845,"spread":0.2209227848849766,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003098211,0.0001885814,0.0003351424,0.0005272494,0.0008851367,0.002739953,0.000587094,0.001496418,0.02438225],"category_scores_gemma":[0.002866897,0.0002372273,0.0001993,0.0006256955,0.001461172,0.004158883,0.0007567908,0.00177486,0.001031829],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001926578,"about_ca_system_score_gemma":0.0006164311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005340502,"about_ca_topic_score_gemma":0.008144488,"domain_scores_codex":[0.999801,0.00005774446,0.000005692888,0.00004399507,0.00005083587,0.00004071802],"domain_scores_gemma":[0.9996536,0.0001586165,0.00004600473,0.00003318334,0.00004678887,0.00006183662],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004751645,0.00001051162,0.0002278909,0.00001730292,0.000004784331,0.00004831073,0.00004725227,0.00170672,0.0002062798,0.980992,0.008522696,0.008168682],"study_design_scores_gemma":[0.00002006414,0.00001493387,0.001342358,0.00003536841,0.000007764674,0.00009889741,0.0001479425,0.01296476,0.0003245512,0.9571537,0.02787483,0.00001474853],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2909781,0.01688193,0.04249208,0.0316718,0.002463812,0.00004140818,0.001208098,0.0001666594,0.6140961],"genre_scores_gemma":[0.9190509,0.001552255,0.003120477,0.0004568656,0.000402893,0.00001430669,0.000121676,0.00005114693,0.07522945],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02438225,"threshold_uncertainty_score":0.08156681,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Square (algebra); Computer science; Combinatorics; Mathematics; Discrete mathematics; Geometry","authors":[{"name":"Huda Chuangpishit","is_ca":true},{"name":"Jeannette Janssen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02852536971818872,"gpt":0.2427833376526556,"spread":0.2142579679344669,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001229242,0.0002979051,0.0003646806,0.0004473562,0.0003556525,0.0009866176,0.0004553046,0.0005903333,0.006227044],"category_scores_gemma":[0.001623367,0.000225383,0.000335159,0.0005845281,0.0006009913,0.0011569,0.0007180198,0.0006398549,0.001328207],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003299073,"about_ca_system_score_gemma":0.0002765684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001469635,"about_ca_topic_score_gemma":0.00232041,"domain_scores_codex":[0.9997382,0.00004044927,0.00001265919,0.0001124578,0.0000492357,0.0000470359],"domain_scores_gemma":[0.9992964,0.0002718929,0.0001126927,0.0001410947,0.00009467699,0.00008312203],"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.001332238,0.0002211013,0.01155594,0.0008637993,0.0000768582,0.001135576,0.001210618,0.06669602,0.1330699,0.4441095,0.04778977,0.2919386],"study_design_scores_gemma":[0.0001127527,0.0002138546,0.01189824,0.00006420523,0.00004615541,0.001648903,0.001182678,0.3599747,0.05350588,0.5199365,0.05136394,0.00005227619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6289968,0.0009366085,0.3189507,0.00187775,0.0001819427,0.0001364317,0.002156183,0.001524172,0.04523941],"genre_scores_gemma":[0.9078643,0.0002873001,0.07742875,0.0002693961,0.0000570808,0.00005077937,0.003137773,0.0001431277,0.01076157],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006227044,"threshold_uncertainty_score":0.02083153,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}