{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Santosh N. Kabadi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004308315,0.001112608,0.0009579832,0.0007323948,0.001200151,0.004008469,0.001736957,0.001387493,0.02050815],"category_scores_gemma":[0.002336781,0.0005860595,0.0009289897,0.002200965,0.001550549,0.003581793,0.00120903,0.003611554,0.003302716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001630999,"about_ca_system_score_gemma":0.001083954,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003075133,"about_ca_topic_score_gemma":0.005071621,"domain_scores_codex":[0.9993126,0.0001435179,0.00002934599,0.0001314633,0.0002158015,0.0001672308],"domain_scores_gemma":[0.9992919,0.0004638814,0.00004556602,0.00009699268,0.00006676847,0.00003490594],"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.00007663794,0.0001053644,0.0001364019,0.0003521815,0.00002491955,0.0003420178,0.0001925877,0.01562673,0.0008117235,0.8709972,0.05872918,0.0526051],"study_design_scores_gemma":[0.0000278626,0.00001398818,0.0001441648,0.00005411133,0.00001206904,0.000357511,0.0001128491,0.01936826,0.0005503715,0.9191666,0.06018048,0.00001164743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.03682374,0.00922673,0.1494038,0.005526208,0.000910325,0.0001365853,0.0009804475,0.000401099,0.796591],"genre_scores_gemma":[0.500228,0.01943161,0.1529811,0.001625704,0.002214434,0.0003593572,0.002650311,0.0007684996,0.319741],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02050815,"threshold_uncertainty_score":0.06860656,"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","authors":[{"name":"Santosh N. Kabadi","is_ca":true},{"name":"Abraham P. Punnen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004496465,0.001085937,0.001064573,0.00144809,0.001120245,0.002831024,0.00165043,0.001237923,0.03661698],"category_scores_gemma":[0.001991378,0.0006814945,0.0005983245,0.00251391,0.001107169,0.004103457,0.001830511,0.002667969,0.01015887],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001894087,"about_ca_system_score_gemma":0.001863091,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002625506,"about_ca_topic_score_gemma":0.003232727,"domain_scores_codex":[0.9995697,0.00008397247,0.00001459736,0.0001234873,0.0001447547,0.00006341676],"domain_scores_gemma":[0.9996104,0.0001270356,0.0000240628,0.00009849501,0.00009463532,0.00004544781],"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.00005863585,0.00007751388,0.0001448338,0.0003256921,0.00003264056,0.0001025104,0.00009447841,0.02436587,0.001356816,0.6157845,0.1429327,0.2147238],"study_design_scores_gemma":[0.00001689395,0.00003037011,0.0002166029,0.000139113,0.00001976509,0.0002563435,0.00007329265,0.05395835,0.001760235,0.634424,0.3090871,0.00001796921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.009452607,0.0118611,0.2980329,0.003326153,0.001212097,0.0001016741,0.0009659933,0.001561058,0.6734865],"genre_scores_gemma":[0.2076681,0.01926695,0.2053238,0.002134413,0.001377918,0.0003944946,0.003186794,0.002649477,0.557998],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.03661698,"threshold_uncertainty_score":0.122496,"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","authors":[{"name":"Tao Jiang","is_ca":true},{"name":"Lusheng Wang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002184359,0.001175597,0.0007380613,0.0007029286,0.0005025216,0.001399557,0.00162438,0.0005559325,0.01244179],"category_scores_gemma":[0.001160356,0.0005437008,0.0004883236,0.001994307,0.0006561036,0.002800325,0.000863991,0.001189465,0.003133711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008251821,"about_ca_system_score_gemma":0.0006002371,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007551742,"about_ca_topic_score_gemma":0.001546182,"domain_scores_codex":[0.9998345,0.00002201029,0.000007903515,0.00004956596,0.00006663528,0.0000193315],"domain_scores_gemma":[0.9997851,0.0001037045,0.00001328427,0.00005233213,0.00003259493,0.00001305143],"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.00007097961,0.00005182659,0.0002060715,0.0006315584,0.00005731278,0.00006533662,0.0001066793,0.1912051,0.004877516,0.3355718,0.0483285,0.4188273],"study_design_scores_gemma":[0.00002788531,0.00004124279,0.0001560498,0.00009725413,0.00002951234,0.000125843,0.00005074833,0.2151749,0.005348565,0.6655277,0.1133973,0.0000229862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01886245,0.005426538,0.8434344,0.001146025,0.0007202966,0.00008495623,0.0004740096,0.001637452,0.1282138],"genre_scores_gemma":[0.1723963,0.0111754,0.7248652,0.0003323363,0.0005068478,0.0002844379,0.001624841,0.001002969,0.08781171],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01244179,"threshold_uncertainty_score":0.04162192,"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","authors":[{"name":"Andrea Lodi","is_ca":false},{"name":"Abraham P. Punnen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000397065,0.001207832,0.0006698185,0.001586548,0.0007361104,0.001657598,0.001857225,0.0008367016,0.1124898],"category_scores_gemma":[0.001528205,0.0006548189,0.0009013725,0.002465976,0.0003529435,0.001752526,0.001177297,0.001459563,0.05466143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009083045,"about_ca_system_score_gemma":0.001306458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003248854,"about_ca_topic_score_gemma":0.005473032,"domain_scores_codex":[0.9995071,0.00006693575,0.00002559844,0.00009321974,0.0002591772,0.00004796592],"domain_scores_gemma":[0.9994967,0.0001232383,0.00002238117,0.0001378675,0.0001878949,0.00003187309],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004108296,0.0001125151,0.0002187958,0.0003533572,0.00003726177,0.00008856935,0.00007421037,0.03144864,0.002278883,0.1023968,0.4031732,0.4597767],"study_design_scores_gemma":[0.00003490623,0.00002719215,0.0002073132,0.0001060673,0.00002369926,0.0002095089,0.00002894183,0.1007946,0.003769754,0.07393397,0.8208385,0.0000255234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.003195806,0.00110486,0.531707,0.0008326708,0.0004708764,0.0002529397,0.006454616,0.02414399,0.4318372],"genre_scores_gemma":[0.03857471,0.002694065,0.5038901,0.000818835,0.0002137632,0.0007099899,0.02192442,0.01096715,0.420207],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.1124898,"threshold_uncertainty_score":0.376316,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}