{"meta":{"query_hash":"954733fab6d2","filters":{"venue":"Operations research proceedings"},"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/954733fab6d2","api":"https://metacan.xera.ac/api/v1/cohort?venue=Operations+research+proceedings"},"results":[{"id":"W146077644","doi":"10.1007/978-3-319-00795-3_40","title":"An Exact Approach for the Combined Cell Layout Problem","year":2013,"lang":"en","type":"book-chapter","venue":"Operations research proceedings","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"","keywords":"Cellular manufacturing; Computer science; Mathematical optimization; Algorithm; Exact solutions in general relativity; Mathematics","score_opus":0.053854966689786815,"score_gpt":0.30019854810135577,"score_spread":0.24634358141156895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W146077644","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012582671,0.00048299922,0.9825509,0.00012481936,0.0001360068,0.000030435795,0.000105988904,0.00015055946,0.015159994],"genre_scores_gemma":[0.07658046,0.0016395602,0.8942857,0.0002459758,0.00035173068,0.00026670872,0.00045636948,0.0004447694,0.025728663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993018,0.00012662509,0.000022344264,0.00008611397,0.0004014646,0.00006161112],"domain_scores_gemma":[0.99940264,0.00031095225,0.000025169784,0.00009658931,0.0001387312,0.00002595039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006261243,0.0013045024,0.0015430974,0.0010547749,0.0005624134,0.0016615893,0.002625044,0.0015537218,0.014489144],"category_scores_gemma":[0.002545393,0.0011367368,0.0016260179,0.0018540757,0.0006945328,0.0021699695,0.0018882612,0.0022834255,0.0024421576],"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.00003992586,0.0000716059,0.00014487996,0.00023164343,0.000047865862,0.00011473252,0.000060864633,0.7450042,0.0017650926,0.11783726,0.010714777,0.123967156],"study_design_scores_gemma":[0.000012594255,0.000016094138,0.000057980054,0.000019189043,0.000013261094,0.00006487095,0.000014007175,0.92811865,0.0003376718,0.06295831,0.008376659,0.00001080732],"about_ca_topic_score_codex":0.0058258446,"about_ca_topic_score_gemma":0.009292503,"teacher_disagreement_score":0.014489144,"about_ca_system_score_codex":0.0011150005,"about_ca_system_score_gemma":0.0013635338,"threshold_uncertainty_score":0.048471034},"labels":[],"label_agreement":null},{"id":"W1887915057","doi":"10.1007/3-540-32539-5_44","title":"On the Computational Performance of a Semidefinite Programming Approach to Single Row Layout Problems","year":2006,"lang":"en","type":"book-chapter","venue":"Operations research proceedings","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":5,"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 Waterloo","funders":"","keywords":"Semidefinite programming; Semidefinite embedding; Computer science; Mathematical optimization; Mathematics; Quadratically constrained quadratic program","score_opus":0.06524460943096541,"score_gpt":0.2697740335650589,"score_spread":0.2045294241340935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1887915057","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.068437345,0.0009583018,0.90292096,0.0011743184,0.0002716478,0.00007992297,0.00026324615,0.0011345027,0.024759656],"genre_scores_gemma":[0.5380212,0.0008515402,0.45056897,0.00049044617,0.00022666164,0.00028456267,0.00063565583,0.00085052114,0.00807039],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981889,0.001054669,0.00006147058,0.00016564454,0.00037010343,0.00015919917],"domain_scores_gemma":[0.9849701,0.0128199635,0.00031311624,0.00076991075,0.00083493517,0.00029199006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036470592,0.0017898934,0.0016677117,0.0007464781,0.000826049,0.0019724418,0.0019692061,0.001762264,0.008736439],"category_scores_gemma":[0.011546813,0.0009026285,0.0008587807,0.0014225033,0.0017218753,0.0033078275,0.0016675919,0.0034897297,0.0010436609],"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.0002910405,0.00017225911,0.00023168612,0.00009109617,0.000030963718,0.000031944175,0.000044879467,0.943374,0.0012672249,0.022559194,0.0032913655,0.02861441],"study_design_scores_gemma":[0.00001107839,0.000017189075,0.000020716117,0.000003373763,0.0000018799446,0.0000032629669,0.000004934287,0.996201,0.00016378103,0.0034798342,0.000090651665,0.000002250351],"about_ca_topic_score_codex":0.006478272,"about_ca_topic_score_gemma":0.0073452876,"teacher_disagreement_score":0.008736439,"about_ca_system_score_codex":0.001183547,"about_ca_system_score_gemma":0.0019546435,"threshold_uncertainty_score":0.029226303},"labels":[],"label_agreement":null},{"id":"W2398485474","doi":"10.1007/978-3-319-00795-3_76","title":"On the Application of a Multi-Objective Genetic Algorithm to the LORA-Spares Problem","year":2013,"lang":"en","type":"book-chapter","venue":"Operations research proceedings","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Department of National Defence; University of Waterloo","funders":"","keywords":"Computer science; Genetic algorithm; Algorithm; Machine learning","score_opus":0.05072552233507193,"score_gpt":0.33448200437743697,"score_spread":0.28375648204236503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398485474","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.008372946,0.001546157,0.9563537,0.0005715263,0.00025749052,0.000085357016,0.000031490756,0.00013532148,0.03264596],"genre_scores_gemma":[0.24310832,0.00390113,0.73394126,0.0004213188,0.00030050572,0.00024639835,0.00010742641,0.00023976805,0.01773395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995596,0.00022020495,0.000013566504,0.000040268933,0.00013559824,0.000030688996],"domain_scores_gemma":[0.9993869,0.00047232522,0.000022969172,0.000029910205,0.00007075044,0.00001702356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011797604,0.0011339993,0.0009453736,0.0009844388,0.0006395896,0.0010515547,0.0014951021,0.0016530346,0.004829341],"category_scores_gemma":[0.00314507,0.00038844603,0.0010790736,0.002044994,0.00096243585,0.0010025554,0.0013559886,0.0017258576,0.00056817714],"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.000030730844,0.000047311387,0.000148208,0.0000774063,0.000032188083,0.000071168986,0.000054220942,0.86256194,0.0006626184,0.05127083,0.0022322417,0.08281109],"study_design_scores_gemma":[0.0000073097117,0.000026034875,0.00006383374,0.000023001436,0.000007882884,0.000025661424,0.0000102801705,0.97699034,0.00021308476,0.020612275,0.0020145122,0.000005891959],"about_ca_topic_score_codex":0.006198921,"about_ca_topic_score_gemma":0.0052895243,"teacher_disagreement_score":0.006198921,"about_ca_system_score_codex":0.00086266367,"about_ca_system_score_gemma":0.0008545573,"threshold_uncertainty_score":0.01615578},"labels":[],"label_agreement":null},{"id":"W2461328301","doi":"10.1007/978-3-319-28697-6_3","title":"Solution Approaches for the Double-Row Equidistant Facility Layout Problem","year":2016,"lang":"en","type":"book-chapter","venue":"Operations research proceedings","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"","keywords":"Equidistant; Benchmark (surveying); Integer programming; Exploit; Mathematical optimization; Integer (computer science); Semidefinite programming; Computer science; Linear programming; Variety (cybernetics); Mathematics; Algorithm; Artificial intelligence; Programming language; Geometry","score_opus":0.19333365196722377,"score_gpt":0.32558833195850306,"score_spread":0.1322546799912793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2461328301","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.0031445236,0.0010673581,0.98489434,0.000219559,0.00010958604,0.000045869758,0.000089093934,0.000100885234,0.0103287175],"genre_scores_gemma":[0.09839122,0.0024726798,0.88298535,0.00024589783,0.00019269696,0.00028581722,0.00044440903,0.00024582047,0.014736125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944884,0.00018824727,0.000024000954,0.00012360248,0.00015120152,0.000064185544],"domain_scores_gemma":[0.99929774,0.00043873297,0.000050490897,0.00005727799,0.00011893395,0.00003680392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096870156,0.0016654887,0.0013591239,0.0008546033,0.00051175134,0.0014746947,0.0028000826,0.001845988,0.010449532],"category_scores_gemma":[0.0026502914,0.00089756976,0.0015079482,0.0020986423,0.0006481882,0.0016030036,0.0018398322,0.0023600692,0.0012910381],"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.000057954243,0.000091871334,0.00016077995,0.00038565113,0.00005994144,0.00008490068,0.00009848613,0.8187698,0.0012252941,0.08582206,0.007987944,0.085255235],"study_design_scores_gemma":[0.000026325552,0.00003615765,0.00005723495,0.000036689307,0.000013219695,0.000051360345,0.000040926683,0.9550798,0.00036512775,0.03848162,0.0058018956,0.000009753942],"about_ca_topic_score_codex":0.0040421644,"about_ca_topic_score_gemma":0.0048704273,"teacher_disagreement_score":0.010449532,"about_ca_system_score_codex":0.0012486344,"about_ca_system_score_gemma":0.0015399613,"threshold_uncertainty_score":0.03495717},"labels":[],"label_agreement":null}]}