{"meta":{"query_hash":"0ad3df362faa","filters":{"venue":"Combinatorial optimization"},"cohort_total":4,"direct_labels_cover":0,"predictions_cover":4,"exported":4,"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/0ad3df362faa","api":"https://metacan.xera.ac/api/v1/cohort?venue=Combinatorial+optimization"},"results":[{"id":"W193329722","doi":"10.1007/978-1-4757-3171-2_4","title":"Computing Shortest Networks with Fixed Topologies","year":2000,"lang":"en","type":"book-chapter","venue":"Combinatorial optimization","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Network topology; Computer science; Computer network; Topology (electrical circuits); Mathematics; Combinatorics","score_opus":0.010670663957425598,"score_gpt":0.2017735368791837,"score_spread":0.1911028729217581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W193329722","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.018862454,0.005426538,0.8434344,0.0011460246,0.00072029664,0.00008495623,0.00047400958,0.0016374524,0.12821384],"genre_scores_gemma":[0.17239629,0.011175399,0.7248652,0.00033233632,0.0005068478,0.0002844379,0.0016248414,0.001002969,0.08781171],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99983454,0.000022010288,0.000007903515,0.000049565955,0.00006663528,0.0000193315],"domain_scores_gemma":[0.9997851,0.000103704515,0.000013284271,0.00005233213,0.000032594933,0.000013051429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021843587,0.0011755968,0.0007380613,0.00070292864,0.0005025216,0.001399557,0.00162438,0.0005559325,0.012441794],"category_scores_gemma":[0.0011603555,0.00054370076,0.00048832357,0.0019943072,0.0006561036,0.0028003252,0.00086399104,0.0011894646,0.003133711],"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.00007097961,0.000051826588,0.0002060715,0.00063155836,0.000057312776,0.000065336615,0.000106679305,0.1912051,0.0048775156,0.3355718,0.0483285,0.41882733],"study_design_scores_gemma":[0.000027885308,0.000041242794,0.00015604983,0.00009725413,0.000029512335,0.000125843,0.00005074833,0.21517491,0.0053485646,0.6655277,0.113397285,0.000022986202],"about_ca_topic_score_codex":0.0007551742,"about_ca_topic_score_gemma":0.0015461817,"teacher_disagreement_score":0.012441794,"about_ca_system_score_codex":0.00082518207,"about_ca_system_score_gemma":0.0006002371,"threshold_uncertainty_score":0.041621923},"labels":[],"label_agreement":null},{"id":"W2283042507","doi":"10.1007/0-306-48213-4_15","title":"The Bottleneck TSP","year":2006,"lang":"en","type":"book-chapter","venue":"Combinatorial optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":18,"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 New Brunswick","funders":"","keywords":"Bottleneck; Computer science; Embedded system","score_opus":0.009923679561488942,"score_gpt":0.2187868876056296,"score_spread":0.20886320804414066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2283042507","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0094526075,0.011861101,0.29803288,0.0033261534,0.0012120975,0.0001016741,0.0009659933,0.0015610582,0.6734865],"genre_scores_gemma":[0.20766811,0.019266952,0.20532376,0.0021344132,0.0013779177,0.0003944946,0.0031867938,0.0026494765,0.557998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995697,0.00008397247,0.000014597363,0.00012348733,0.00014475474,0.00006341676],"domain_scores_gemma":[0.99961036,0.00012703557,0.000024062798,0.00009849501,0.000094635325,0.00004544781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044964647,0.0010859371,0.0010645726,0.0014480898,0.001120245,0.0028310244,0.0016504303,0.0012379233,0.03661698],"category_scores_gemma":[0.0019913777,0.0006814945,0.0005983245,0.0025139097,0.0011071686,0.0041034566,0.0018305107,0.0026679693,0.010158868],"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.000058635847,0.00007751388,0.0001448338,0.00032569215,0.000032640557,0.000102510356,0.00009447841,0.024365874,0.0013568157,0.61578447,0.14293274,0.21472381],"study_design_scores_gemma":[0.000016893953,0.000030370107,0.00021660294,0.00013911299,0.000019765088,0.00025634348,0.00007329265,0.053958345,0.0017602352,0.634424,0.3090871,0.000017969205],"about_ca_topic_score_codex":0.002625506,"about_ca_topic_score_gemma":0.0032327273,"teacher_disagreement_score":0.03661698,"about_ca_system_score_codex":0.0018940874,"about_ca_system_score_gemma":0.0018630906,"threshold_uncertainty_score":0.12249601},"labels":[],"label_agreement":null},{"id":"W28955333","doi":"10.1007/0-306-48213-4_11","title":"Polynomially Solvable Cases of the TSP","year":2006,"lang":"en","type":"book-chapter","venue":"Combinatorial optimization","topic":"Graph theory and applications","field":"Mathematics","cited_by":29,"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 New Brunswick","funders":"","keywords":"Combinatorics; Digraph; Mathematics; Travelling salesman problem; Diagonal; Permutation (music); Graph; Discrete mathematics; Physics; Algorithm","score_opus":0.026080830322034468,"score_gpt":0.2523124332487871,"score_spread":0.22623160292675265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W28955333","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.036823742,0.00922673,0.14940384,0.005526208,0.00091032503,0.0001365853,0.0009804475,0.00040109904,0.79659104],"genre_scores_gemma":[0.50022805,0.019431613,0.15298107,0.0016257039,0.0022144336,0.00035935716,0.002650311,0.00076849957,0.319741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931264,0.00014351793,0.000029345989,0.00013146328,0.00021580147,0.0001672308],"domain_scores_gemma":[0.9992919,0.00046388138,0.000045566023,0.00009699268,0.000066768465,0.000034905945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043083154,0.0011126084,0.0009579832,0.0007323948,0.0012001507,0.004008469,0.0017369573,0.0013874929,0.020508153],"category_scores_gemma":[0.0023367808,0.00058605947,0.00092898967,0.0022009653,0.0015505487,0.0035817928,0.0012090304,0.0036115542,0.0033027162],"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.00007663794,0.000105364416,0.00013640188,0.00035218152,0.000024919545,0.00034201777,0.00019258767,0.015626732,0.00081172347,0.8709972,0.058729175,0.052605096],"study_design_scores_gemma":[0.0000278626,0.0000139881795,0.00014416482,0.00005411133,0.000012069045,0.00035751102,0.000112849135,0.019368257,0.00055037154,0.9191666,0.060180478,0.000011647427],"about_ca_topic_score_codex":0.0030751328,"about_ca_topic_score_gemma":0.005071621,"teacher_disagreement_score":0.020508153,"about_ca_system_score_codex":0.001630999,"about_ca_system_score_gemma":0.0010839538,"threshold_uncertainty_score":0.068606555},"labels":[],"label_agreement":null},{"id":"W4249802611","doi":"10.1007/0-306-48213-4_16","title":"TSP Software","year":2006,"lang":"en","type":"book-chapter","venue":"Combinatorial optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Fortran; Travelling salesman problem; Java; Software; Pascal (unit); Heuristic; Programming language; Theoretical computer science; Focus (optics); Source code; Mathematical optimization; Algorithm; Artificial intelligence; Mathematics","score_opus":0.011471762972186987,"score_gpt":0.2210551803163071,"score_spread":0.20958341734412012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249802611","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031958064,0.0011048603,0.531707,0.0008326708,0.00047087643,0.00025293967,0.0064546163,0.02414399,0.4318372],"genre_scores_gemma":[0.03857471,0.0026940648,0.5038901,0.00081883505,0.0002137632,0.00070998986,0.021924417,0.01096715,0.42020702],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950707,0.00006693575,0.000025598443,0.000093219736,0.0002591772,0.00004796592],"domain_scores_gemma":[0.9994967,0.00012323832,0.000022381168,0.00013786751,0.00018789487,0.000031873093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039706504,0.0012078321,0.00066981855,0.0015865482,0.0007361104,0.001657598,0.0018572251,0.0008367016,0.11248984],"category_scores_gemma":[0.0015282051,0.0006548189,0.00090137246,0.0024659764,0.00035294346,0.001752526,0.0011772969,0.0014595628,0.054661434],"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.000041082963,0.00011251511,0.00021879582,0.00035335723,0.00003726177,0.00008856935,0.00007421037,0.031448636,0.002278883,0.10239676,0.40317324,0.45977673],"study_design_scores_gemma":[0.00003490623,0.00002719215,0.00020731322,0.00010606725,0.00002369926,0.00020950889,0.000028941835,0.100794576,0.003769754,0.07393397,0.82083845,0.000025523403],"about_ca_topic_score_codex":0.0032488543,"about_ca_topic_score_gemma":0.0054730317,"teacher_disagreement_score":0.11248984,"about_ca_system_score_codex":0.0009083045,"about_ca_system_score_gemma":0.0013064581,"threshold_uncertainty_score":0.376316},"labels":[],"label_agreement":null}]}