{"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000002714124,0.00020007219,0.71010774,0.000065533844,0.0067351195,0.00031329747,0.0000014319616,0.0003861193,0.28218797],"genre_scores_gemma":[0.5189126,0.0020195614,0.12841578,0.001365065,0.020641243,0.000104666426,0.0010040017,0.00076017174,0.3267769],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981431,0.000055856905,0.00050612155,0.00063168496,0.00034006988,0.00032320805],"domain_scores_gemma":[0.9984733,0.00014549698,0.0003692558,0.00065226795,0.00026785687,0.00009181565],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001865127,0.0004118055,0.00050534296,0.00015079393,0.00028244613,0.000419358,0.0007156322,0.00051689375,0.00015604738],"category_scores_gemma":[0.000012631438,0.00036873794,0.00011945583,0.00012587353,0.00007940597,0.00030767987,0.00016674626,0.00043459653,0.00002745658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016234359,0.000010786818,0.000005772239,0.0000044875787,0.000035351128,0.00001294149,0.000036743608,0.63219255,5.4305726e-8,0.36354622,0.0018755029,0.00226334],"study_design_scores_gemma":[0.000568156,0.00031600703,0.0000029059795,0.00027264282,0.000029562936,0.00003895764,0.0000047614762,0.96576893,0.0000020948128,0.006766635,0.025683355,0.00054599106],"about_ca_topic_score_codex":0.000014347845,"about_ca_topic_score_gemma":0.0000046011255,"teacher_disagreement_score":0.581692,"about_ca_system_score_codex":0.00013294318,"about_ca_system_score_gemma":0.00008944861,"threshold_uncertainty_score":0.99987644},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000011995945,0.0009506553,0.28329453,0.000061024293,0.009256366,0.0003760054,0.000015531336,0.0008195039,0.70522517],"genre_scores_gemma":[0.0020469634,0.004777906,0.13097426,0.00009568628,0.006838535,0.00011946774,0.001390505,0.0015644577,0.8521922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984432,0.000042224747,0.00055365067,0.0002830632,0.00037900958,0.00029888676],"domain_scores_gemma":[0.99873,0.0002378594,0.0001798684,0.0005522429,0.00022375984,0.00007625835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036814116,0.00041141704,0.00033495293,0.000110660425,0.0003072555,0.00020097784,0.0003537422,0.0005660164,0.00013982037],"category_scores_gemma":[0.00009087188,0.0003819746,0.00014078672,0.000090239795,0.00008384598,0.00011040229,0.00006477831,0.00045279087,0.00007645169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000519009,0.0000040506516,0.0000012596735,0.000019331203,0.000038168626,0.0000017822456,0.000008317215,0.8590354,0.0000021279686,0.11435073,0.024960557,0.0015730914],"study_design_scores_gemma":[0.000505329,0.000026927939,0.000001983364,0.0000665916,0.00007430483,0.0000029422386,0.0000013126678,0.6854066,0.000049496644,0.014542289,0.29882288,0.00049931643],"about_ca_topic_score_codex":0.0000024711953,"about_ca_topic_score_gemma":8.2528334e-7,"teacher_disagreement_score":0.27386233,"about_ca_system_score_codex":0.0002600663,"about_ca_system_score_gemma":0.000054004784,"threshold_uncertainty_score":0.9998632},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041245954,0.000149768,0.0066611674,0.00014187268,0.0033122618,0.0012441436,0.00014236072,0.0001376234,0.98779833],"genre_scores_gemma":[0.16968921,0.00011647807,0.012492395,0.00010289476,0.0018703386,0.000121288,0.0004070723,0.0003819341,0.8148184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989494,0.000033073655,0.0004463395,0.00021014131,0.00023683245,0.0001241884],"domain_scores_gemma":[0.99830145,0.00029258433,0.00056912104,0.0006014281,0.00020459095,0.000030825566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016799374,0.00022375117,0.00032302702,0.00007229764,0.00017565596,0.000024694147,0.00032626136,0.0003181373,0.00023665925],"category_scores_gemma":[0.00013293473,0.00018438902,0.0002086773,0.00007141062,0.00013655968,0.000053223772,0.000092723785,0.00019439761,0.000009044529],"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.000015335705,0.00005867251,0.0000028584318,0.000044085242,0.000029129436,6.943113e-7,0.000016156862,0.0042952765,0.000016605265,0.97803605,0.017460607,0.000024514406],"study_design_scores_gemma":[0.0004235979,0.000037454494,0.0000017727019,0.00011536434,0.00018659611,0.000003951718,0.000002776323,0.0004012346,0.00049119064,0.97648287,0.02164656,0.00020662202],"about_ca_topic_score_codex":0.000013081191,"about_ca_topic_score_gemma":0.0000032442185,"teacher_disagreement_score":0.17297995,"about_ca_system_score_codex":0.000051081755,"about_ca_system_score_gemma":0.000104823725,"threshold_uncertainty_score":0.7519166},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000012858392,0.0003297791,0.5795809,0.000010177171,0.0055469535,0.00027885442,0.000028782193,0.0013679037,0.41285536],"genre_scores_gemma":[0.0006563603,0.00061825383,0.63268894,0.00007038014,0.003731081,0.000053264088,0.002743041,0.0012426187,0.35819605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983987,0.000028700584,0.0005580059,0.00035960966,0.0003733748,0.00028156035],"domain_scores_gemma":[0.9989119,0.00010950846,0.00016986599,0.0004730251,0.00023571364,0.00009995963],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019682579,0.00048940163,0.0004761152,0.0002475518,0.00011067812,0.00010535591,0.00025814038,0.0008101025,0.00059028843],"category_scores_gemma":[0.00009210894,0.00061051577,0.00015188374,0.00010066867,0.000049847644,0.00015804476,0.00006091703,0.0004545894,0.00011269477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044746926,0.000008436168,0.000004754239,0.00006283446,0.000041012838,0.00000512854,0.000011188264,0.95327306,0.0000025626894,0.028310938,0.017005607,0.0012699882],"study_design_scores_gemma":[0.0011484066,0.000057315072,0.0000038137466,0.00021220578,0.00016919251,0.000007156406,0.0000010905376,0.8211206,0.0000921632,0.01744962,0.15849623,0.0012422005],"about_ca_topic_score_codex":0.0000026246764,"about_ca_topic_score_gemma":3.1663475e-7,"teacher_disagreement_score":0.14149062,"about_ca_system_score_codex":0.0003094077,"about_ca_system_score_gemma":0.00005608203,"threshold_uncertainty_score":0.9996346},"labels":[],"label_agreement":null}]}