{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002562315,0.0001965035,0.0002317414,0.000345508,0.0001186745,0.0001317024,0.0001169259,0.0002189291,0.00007195667],"category_scores_gemma":[0.00008942131,0.0002259763,0.0000428765,0.0007330466,0.00005547694,0.0001854564,0.00003012955,0.0004660307,0.000004392824],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003436508,"about_ca_system_score_gemma":0.00001547782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006568988,"about_ca_topic_score_gemma":0.00002280232,"domain_scores_codex":[0.9989294,0.00004427141,0.0003136962,0.0002581671,0.0001602082,0.0002942982],"domain_scores_gemma":[0.999427,0.0001552005,0.0000687327,0.0001913382,0.00006012281,0.00009765827],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003774457,0.0001189807,0.003507146,0.00005160482,0.00002498094,0.000005316166,0.0002758387,0.9433466,0.0001715966,0.04117295,0.0003764152,0.01091088],"study_design_scores_gemma":[0.003473814,0.000182415,0.003807418,0.0002573955,0.00003551951,0.000008689735,0.0001624883,0.9792481,0.0002217967,0.01060234,0.001321733,0.0006782628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9140344,0.0002803865,0.04541559,0.0006152549,0.02139555,0.001319485,0.00001489031,0.001341094,0.01558339],"genre_scores_gemma":[0.9968082,0.0003346085,0.002547823,0.0001076087,0.00005810101,0.0000315235,0.00003822728,0.00004607264,0.00002781578],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08277386,"threshold_uncertainty_score":0.9215047,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005154473,0.000225097,0.0002553352,0.0004532561,0.0002427673,0.0002315632,0.0006519455,0.0002041734,0.00001823267],"category_scores_gemma":[0.000194374,0.0002109097,0.00006457492,0.001100814,0.0002094792,0.0005918132,0.0001595087,0.0006281949,0.000007802343],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003682418,"about_ca_system_score_gemma":0.00004899857,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004272693,"about_ca_topic_score_gemma":0.00002392968,"domain_scores_codex":[0.9981943,0.0001398826,0.0002753818,0.0006024162,0.0003673294,0.000420721],"domain_scores_gemma":[0.9987589,0.0003734172,0.0001144937,0.0005078143,0.00009493212,0.0001504764],"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.000199199,0.0003123545,0.0006975511,0.000004169421,0.000009380961,0.00001349987,0.00009051659,0.02101923,0.0001265902,0.9698018,0.00023051,0.007495192],"study_design_scores_gemma":[0.004612739,0.001271143,0.003436728,0.0001099846,0.000008523632,0.000005088675,0.00005510034,0.1602346,0.0005198869,0.8264314,0.002681448,0.0006333479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8764055,0.001200394,0.06977966,0.00726132,0.03372876,0.002770569,0.00001239824,0.001029412,0.007811923],"genre_scores_gemma":[0.9935045,0.0006983875,0.004948647,0.0003666267,0.0001315939,0.00009128008,0.00001104837,0.00002143393,0.0002264308],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1433704,"threshold_uncertainty_score":0.8600646,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002176365,0.0001961427,0.0002293493,0.0002438458,0.0001070462,0.00006849696,0.00008861136,0.0001854402,0.0001079239],"category_scores_gemma":[0.00006257224,0.0002089518,0.00005821108,0.0003743736,0.00008826255,0.0001466618,0.00001878337,0.0001576796,0.000001803445],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004750286,"about_ca_system_score_gemma":0.00001664241,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003385414,"about_ca_topic_score_gemma":0.000008482183,"domain_scores_codex":[0.9990532,0.00003644092,0.000302693,0.0002391743,0.00009598902,0.0002724438],"domain_scores_gemma":[0.9995354,0.00010136,0.00006422039,0.0001351129,0.0000806512,0.0000832555],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006218198,0.0004123368,0.00309203,0.0001775399,0.00009611288,0.00001044949,0.002634078,0.7720366,0.00003973269,0.2061868,0.001564925,0.01312766],"study_design_scores_gemma":[0.01303546,0.001014575,0.002743201,0.0007939327,0.0001010708,0.00001199517,0.001052232,0.9204199,0.000450077,0.05738835,0.001584097,0.001405086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1960417,0.001704665,0.6896763,0.0005396308,0.02786506,0.007377057,0.0001069659,0.002537699,0.07415088],"genre_scores_gemma":[0.9939166,0.000389026,0.00532571,0.00008666988,0.00003468606,0.0001137191,0.00005683147,0.00004217652,0.00003455],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7978749,"threshold_uncertainty_score":0.8520808,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005095691,0.0003761473,0.0004265643,0.0002570535,0.0005374802,0.0002435989,0.0008932159,0.000229567,0.00005470009],"category_scores_gemma":[0.00009553524,0.0003544259,0.0001001857,0.0009471363,0.0002143279,0.0007595091,0.0005935073,0.0003501607,0.000004614467],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005790539,"about_ca_system_score_gemma":0.00004945347,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001774212,"about_ca_topic_score_gemma":0.000002170982,"domain_scores_codex":[0.997371,0.0003719495,0.0004874486,0.0009290663,0.0003774741,0.0004630599],"domain_scores_gemma":[0.9981378,0.0002839437,0.0002978244,0.0007240046,0.0002847314,0.0002716684],"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.0006589633,0.005223076,0.01287757,0.00007767079,0.0002035409,0.00007833845,0.007076716,0.06059831,0.0003946297,0.7490392,0.0007044901,0.1630674],"study_design_scores_gemma":[0.001828072,0.001031662,0.007785321,0.00007982138,0.00001764348,0.00001334262,0.0001183865,0.9420012,0.0003370098,0.04607721,0.0001495048,0.0005608577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0961258,0.0001728075,0.8964904,0.0001675106,0.004467517,0.0005825065,0.000001474445,0.0005886187,0.001403367],"genre_scores_gemma":[0.8414016,0.00006374065,0.1581299,0.0002130635,0.0001112247,0.00002085964,0.00001849677,0.00002382465,0.00001733024],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8814029,"threshold_uncertainty_score":0.9998907,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003748073,0.0002005364,0.0002004618,0.0003192895,0.0003007562,0.0002654114,0.0006398744,0.00009365995,0.00003043791],"category_scores_gemma":[0.00004309657,0.0001871961,0.00007310578,0.000779294,0.00008258963,0.000664237,0.0003442777,0.000196675,0.000009117332],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002089444,"about_ca_system_score_gemma":0.00001948352,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001589849,"about_ca_topic_score_gemma":0.00000123649,"domain_scores_codex":[0.9985263,0.0001033983,0.0002389483,0.0005137721,0.0002830822,0.0003345366],"domain_scores_gemma":[0.999147,0.00007044239,0.000119435,0.0004497417,0.00007809215,0.0001352692],"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.00003457066,0.0002256628,0.0004501344,0.000009139567,0.00003847042,0.00002304458,0.0002886759,0.001043014,0.000005838023,0.9757508,0.0006763469,0.02145428],"study_design_scores_gemma":[0.005410295,0.001259476,0.005994101,0.0002066147,0.0000996941,0.00001434887,0.0002541125,0.5227361,0.0001985158,0.4583824,0.004115428,0.001328852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03340567,0.0004311917,0.920271,0.0007649724,0.01437534,0.001281954,0.000008649507,0.001021331,0.02843994],"genre_scores_gemma":[0.9617444,0.0008628866,0.03643734,0.00048764,0.0000705186,0.00006111381,0.00006406537,0.00002886929,0.0002431361],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9283388,"threshold_uncertainty_score":0.7633634,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003273829,0.0001738963,0.0002249866,0.00009875834,0.0001446984,0.00004437307,0.0001226254,0.0002247044,0.00000595154],"category_scores_gemma":[0.0001705865,0.0001590064,0.00007781047,0.0003371637,0.0001212837,0.00001086471,0.0001179149,0.00009753304,4.784549e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001859265,"about_ca_system_score_gemma":0.00005458063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001038904,"about_ca_topic_score_gemma":0.000004229938,"domain_scores_codex":[0.9988347,0.0001220008,0.0003085357,0.0003558009,0.0001566709,0.0002223473],"domain_scores_gemma":[0.9992289,0.00002679399,0.0001889876,0.0001801658,0.0002471555,0.000127996],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00250844,0.001440004,0.03085998,0.00006891532,0.000391664,0.00001467252,0.0002664632,0.6087973,0.2923834,0.05387708,0.004282332,0.005109772],"study_design_scores_gemma":[0.02201798,0.01549285,0.003714411,0.000427768,0.0005356175,0.00004153749,0.001113642,0.7971081,0.1235135,0.01679049,0.01597677,0.003267359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9930961,0.000541666,0.004115488,0.00004503164,0.001653661,0.0002676086,0.000006097862,0.00002506569,0.0002493223],"genre_scores_gemma":[0.9960214,0.0002678199,0.003245289,0.0001164786,0.0001682717,0.00001204393,0.0001124453,0.00001527862,0.00004089716],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1883108,"threshold_uncertainty_score":0.6484092,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004045586,0.0002335694,0.0002043687,0.0002288279,0.00052265,0.0003815482,0.000339234,0.0001539935,0.00001742111],"category_scores_gemma":[0.0002078429,0.0001802742,0.0001019011,0.0006598009,0.0000906532,0.0004972736,0.00009303512,0.0002146471,0.000007040894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004524428,"about_ca_system_score_gemma":0.00003413094,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001113082,"about_ca_topic_score_gemma":0.000004430785,"domain_scores_codex":[0.9984472,0.0000973865,0.0004303436,0.0004974673,0.0002533637,0.0002742418],"domain_scores_gemma":[0.9984235,0.0005442497,0.0002621149,0.0003708093,0.0003063727,0.00009294257],"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.0003114262,0.0002187128,0.00007959137,0.0000219379,0.00005734074,5.707496e-7,0.0004218055,0.4038171,0.00002278971,0.517488,0.003626039,0.0739347],"study_design_scores_gemma":[0.002585371,0.0005177658,0.000461687,0.00007617277,0.00002113308,0.000002565872,0.00009452016,0.9746991,0.00007081915,0.02015466,0.001068891,0.0002473416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003740962,0.00005247953,0.9835149,0.005480528,0.003310118,0.002213758,0.000006586271,0.0003115993,0.001369042],"genre_scores_gemma":[0.9047109,0.0005745836,0.09210498,0.001076344,0.0001537774,0.0008930585,0.0001152879,0.00004110836,0.0003299864],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9009699,"threshold_uncertainty_score":0.7351369,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005337748,0.0002414983,0.000223926,0.0003158841,0.0004971313,0.0002862466,0.0002900313,0.0001575286,0.000007994498],"category_scores_gemma":[0.00003633233,0.0002145381,0.00008929953,0.0005023472,0.0001178801,0.0003778323,0.0001098691,0.000189336,4.744922e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001330964,"about_ca_system_score_gemma":0.00002822463,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000291176,"about_ca_topic_score_gemma":0.000006271502,"domain_scores_codex":[0.9986451,0.00008275382,0.0003064385,0.0005128243,0.000153072,0.0002998383],"domain_scores_gemma":[0.998932,0.0002674092,0.0001836474,0.0002926957,0.0001844476,0.0001397925],"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.00008345642,0.0001818816,0.00006315533,0.00001416124,0.00002111374,0.000001202014,0.0005952482,0.0334302,0.0002825193,0.9306818,0.0000924971,0.03455272],"study_design_scores_gemma":[0.002019816,0.0003053145,0.0001155012,0.00001690997,0.00001982192,0.000006144967,0.000186265,0.7389553,0.0004330598,0.2575665,0.0001252804,0.0002501699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1786145,0.00009328746,0.8163972,0.0003834126,0.003368862,0.0008921557,0.00001674442,0.0001430505,0.00009080519],"genre_scores_gemma":[0.9737185,0.0001130717,0.02574651,0.0001239116,0.00006150304,0.0001514622,0.00004210164,0.00001810223,0.00002482193],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.795104,"threshold_uncertainty_score":0.874861,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000347777,0.0002230665,0.0002593283,0.00037949,0.0001614108,0.0001267253,0.000595538,0.0001737532,0.00002625821],"category_scores_gemma":[0.0001090619,0.0002260678,0.00005147868,0.001428539,0.0001027944,0.0004226231,0.0004489641,0.0003405324,0.000007905252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008181659,"about_ca_system_score_gemma":0.00003847085,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001748422,"about_ca_topic_score_gemma":0.000007374009,"domain_scores_codex":[0.9982179,0.0001354738,0.0003178074,0.0005783974,0.0002992063,0.0004512518],"domain_scores_gemma":[0.9990123,0.0001586406,0.0001111161,0.0004580463,0.0001079842,0.0001519366],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002869248,0.002560079,0.006295164,0.00009081994,0.0001276692,0.0003518696,0.00548781,0.4340152,0.00005389789,0.3212029,0.00119822,0.2257471],"study_design_scores_gemma":[0.005962053,0.001221788,0.008876815,0.0003329214,0.0000152226,0.00001534618,0.0001715357,0.9442329,0.0001969749,0.03716251,0.0008143586,0.0009975738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02878307,0.0003591633,0.960874,0.0004152178,0.00472634,0.000842096,0.000001470506,0.000429487,0.003569133],"genre_scores_gemma":[0.8808942,0.0005719739,0.1177374,0.0002216811,0.00006556069,0.00012227,0.000008523482,0.00004070835,0.000337669],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8521111,"threshold_uncertainty_score":0.9218778,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005911156,0.0001115652,0.0001445296,0.00009223835,0.00033591,0.00008641058,0.0002565027,0.00006117466,0.000009837463],"category_scores_gemma":[0.0001264381,0.00006584728,0.00004295408,0.0005847046,0.0001460873,0.0001993539,0.0001396137,0.0001243302,0.000002228433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001009729,"about_ca_system_score_gemma":0.000008491026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004770888,"about_ca_topic_score_gemma":0.00002911281,"domain_scores_codex":[0.9992557,0.00002327226,0.0002207768,0.0001487382,0.0001671161,0.0001843642],"domain_scores_gemma":[0.9994034,0.0001275799,0.0002024272,0.000163162,0.0001016166,0.000001790873],"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.0001717486,0.0001737181,0.003312188,0.00002347596,0.00001432334,0.000001884769,0.0003184774,0.0003750712,0.000002225597,0.9883559,0.00175428,0.005496703],"study_design_scores_gemma":[0.0051714,0.0003722266,0.1588107,0.0004854189,0.0002066423,0.000002092929,0.002468225,0.01678022,0.00004132006,0.8010898,0.01384425,0.0007276792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9122177,0.0008806227,0.0008689267,0.00204338,0.005890237,0.001134407,0.000001412909,0.00009348643,0.07686988],"genre_scores_gemma":[0.9988999,0.000466393,0.00006071846,0.0003842682,0.00009641108,0.00003478796,0.000004182312,0.000007363445,0.00004599498],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1872661,"threshold_uncertainty_score":0.2685174,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006440093,0.0002145547,0.0003115437,0.0008573948,0.0001512386,0.0001101705,0.0003195064,0.0001981157,0.000009127953],"category_scores_gemma":[0.000305218,0.000201652,0.00009752528,0.002782211,0.0001091865,0.000320987,0.000131028,0.000182014,0.000005275794],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002944346,"about_ca_system_score_gemma":0.00006306908,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002067332,"about_ca_topic_score_gemma":0.000001411758,"domain_scores_codex":[0.9982312,0.0001697756,0.0004291222,0.0004704095,0.0004225498,0.0002769755],"domain_scores_gemma":[0.9983474,0.0001922212,0.0002893701,0.000374037,0.0005731191,0.0002238337],"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.0004383569,0.001297522,0.002362732,0.00006299986,0.0001038017,0.00001432895,0.0006301356,0.07386598,0.00008034035,0.8587288,0.006326908,0.05608806],"study_design_scores_gemma":[0.00787937,0.002646253,0.0005447959,0.0002925135,0.00008943984,0.00001408915,0.0002730009,0.131751,0.0008542972,0.8542295,0.0006276077,0.0007981181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6875706,0.003825197,0.2790812,0.002362244,0.01922137,0.002079626,0.00002817257,0.001168769,0.004662885],"genre_scores_gemma":[0.9869564,0.0004384971,0.0122385,0.0001897764,0.0000121834,0.00003599958,0.00005321197,0.00001723313,0.00005818503],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2993859,"threshold_uncertainty_score":0.8223132,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}