{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":4,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":4,"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"},"query_hash":"0ad3df362faa","filters":{"venue":"Combinatorial optimization"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02608083032203447,"gpt":0.2523124332487871,"spread":0.2262316029267527,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001679937,0.0002237512,0.000323027,0.00007229764,0.000175656,0.00002469415,0.0003262614,0.0003181373,0.0002366593],"category_scores_gemma":[0.0001329347,0.000184389,0.0002086773,0.00007141062,0.0001365597,0.00005322377,0.00009272379,0.0001943976,0.000009044529],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005108176,"about_ca_system_score_gemma":0.0001048237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001308119,"about_ca_topic_score_gemma":0.000003244219,"domain_scores_codex":[0.9989494,0.00003307365,0.0004463395,0.0002101413,0.0002368324,0.0001241884],"domain_scores_gemma":[0.9983014,0.0002925843,0.000569121,0.0006014281,0.0002045909,0.00003082557],"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.00001533571,0.00005867251,0.000002858432,0.00004408524,0.00002912944,6.943113e-7,0.00001615686,0.004295276,0.00001660527,0.978036,0.01746061,0.00002451441],"study_design_scores_gemma":[0.0004235979,0.00003745449,0.000001772702,0.0001153643,0.0001865961,0.000003951718,0.000002776323,0.0004012346,0.0004911906,0.9764829,0.02164656,0.000206622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0004124595,0.000149768,0.006661167,0.0001418727,0.003312262,0.001244144,0.0001423607,0.0001376234,0.9877983],"genre_scores_gemma":[0.1696892,0.0001164781,0.0124924,0.0001028948,0.001870339,0.000121288,0.0004070723,0.0003819341,0.8148184],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.17298,"threshold_uncertainty_score":0.7519166,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Bottleneck; Computer science; Embedded system","retraction":null,"screen_n_in":null,"score":{"opus":0.009923679561488942,"gpt":0.2187868876056296,"spread":0.2088632080441407,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003681412,0.000411417,0.0003349529,0.0001106604,0.0003072555,0.0002009778,0.0003537422,0.0005660164,0.0001398204],"category_scores_gemma":[0.00009087188,0.0003819746,0.0001407867,0.0000902398,0.00008384598,0.0001104023,0.00006477831,0.0004527909,0.00007645169],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002600663,"about_ca_system_score_gemma":0.00005400478,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002471195,"about_ca_topic_score_gemma":8.252833e-7,"domain_scores_codex":[0.9984432,0.00004222475,0.0005536507,0.0002830632,0.0003790096,0.0002988868],"domain_scores_gemma":[0.99873,0.0002378594,0.0001798684,0.0005522429,0.0002237598,0.00007625835],"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.00000519009,0.000004050652,0.000001259673,0.0000193312,0.00003816863,0.000001782246,0.000008317215,0.8590354,0.000002127969,0.1143507,0.02496056,0.001573091],"study_design_scores_gemma":[0.000505329,0.00002692794,0.000001983364,0.0000665916,0.00007430483,0.000002942239,0.000001312668,0.6854066,0.00004949664,0.01454229,0.2988229,0.0004993164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.000001199595,0.0009506553,0.2832945,0.00006102429,0.009256366,0.0003760054,0.00001553134,0.0008195039,0.7052252],"genre_scores_gemma":[0.002046963,0.004777906,0.1309743,0.00009568628,0.006838535,0.0001194677,0.001390505,0.001564458,0.8521922],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.2738623,"threshold_uncertainty_score":0.9998632,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Network topology; Computer science; Computer network; Topology (electrical circuits); Mathematics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.0106706639574256,"gpt":0.2017735368791837,"spread":0.1911028729217581,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001865127,0.0004118055,0.000505343,0.0001507939,0.0002824461,0.000419358,0.0007156322,0.0005168937,0.0001560474],"category_scores_gemma":[0.00001263144,0.0003687379,0.0001194558,0.0001258735,0.00007940597,0.0003076799,0.0001667463,0.0004345965,0.00002745658],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001329432,"about_ca_system_score_gemma":0.00008944861,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001434784,"about_ca_topic_score_gemma":0.000004601126,"domain_scores_codex":[0.9981431,0.0000558569,0.0005061215,0.000631685,0.0003400699,0.000323208],"domain_scores_gemma":[0.9984733,0.000145497,0.0003692558,0.0006522679,0.0002678569,0.00009181565],"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.00001623436,0.00001078682,0.000005772239,0.000004487579,0.00003535113,0.00001294149,0.00003674361,0.6321926,5.430573e-8,0.3635462,0.001875503,0.00226334],"study_design_scores_gemma":[0.000568156,0.000316007,0.000002905979,0.0002726428,0.00002956294,0.00003895764,0.000004761476,0.9657689,0.000002094813,0.006766635,0.02568335,0.0005459911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000002714124,0.0002000722,0.7101077,0.00006553384,0.00673512,0.0003132975,0.000001431962,0.0003861193,0.282188],"genre_scores_gemma":[0.5189126,0.002019561,0.1284158,0.001365065,0.02064124,0.0001046664,0.001004002,0.0007601717,0.3267769],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.581692,"threshold_uncertainty_score":0.9998764,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01147176297218699,"gpt":0.2210551803163071,"spread":0.2095834173441201,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001968258,0.0004894016,0.0004761152,0.0002475518,0.0001106781,0.0001053559,0.0002581404,0.0008101025,0.0005902884],"category_scores_gemma":[0.00009210894,0.0006105158,0.0001518837,0.0001006687,0.00004984764,0.0001580448,0.00006091703,0.0004545894,0.0001126948],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003094077,"about_ca_system_score_gemma":0.00005608203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002624676,"about_ca_topic_score_gemma":3.166348e-7,"domain_scores_codex":[0.9983987,0.00002870058,0.0005580059,0.0003596097,0.0003733748,0.0002815604],"domain_scores_gemma":[0.9989119,0.0001095085,0.000169866,0.0004730251,0.0002357136,0.00009995963],"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.000004474693,0.000008436168,0.000004754239,0.00006283446,0.00004101284,0.00000512854,0.00001118826,0.9532731,0.000002562689,0.02831094,0.01700561,0.001269988],"study_design_scores_gemma":[0.001148407,0.00005731507,0.000003813747,0.0002122058,0.0001691925,0.000007156406,0.000001090538,0.8211206,0.0000921632,0.01744962,0.1584962,0.0012422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000001285839,0.0003297791,0.5795809,0.00001017717,0.005546954,0.0002788544,0.00002878219,0.001367904,0.4128554],"genre_scores_gemma":[0.0006563603,0.0006182538,0.6326889,0.00007038014,0.003731081,0.00005326409,0.002743041,0.001242619,0.358196],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1414906,"threshold_uncertainty_score":0.9996346,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}