{"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":"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.000024172796,0.0002265311,0.2911118,0.00011405322,0.00007506062,0.003587216,0.00006666861,0.00035957864,0.70443493],"genre_scores_gemma":[0.075114205,0.0009032261,0.17957821,0.000033302505,0.0006953937,0.0032281107,0.00082507165,0.00036026302,0.7392622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998518,0.0000058271016,0.00027330156,0.00037729673,0.00039652703,0.0004290706],"domain_scores_gemma":[0.99859506,0.00010178639,0.0000243729,0.00027700354,0.0008750964,0.00012671029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049081125,0.00028355836,0.00021609142,0.00021185735,0.0007126277,0.00057300064,0.0004786683,0.00028123218,0.00017118218],"category_scores_gemma":[0.000052899646,0.00021667825,0.00006094594,0.00006810167,0.00014391208,0.00036952444,0.000059013557,0.00083242386,0.000073712436],"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.0000100711295,0.000032362997,2.766633e-7,0.00033932846,0.0000389391,1.9455432e-7,0.00036358333,0.85752946,0.00029362744,0.12178181,0.018443605,0.0011667488],"study_design_scores_gemma":[0.00029804648,0.00020453303,0.0000012199479,0.000040820636,0.000028114904,0.0000016895907,0.00017641463,0.93076605,0.00074668595,0.004715387,0.06267964,0.00034139186],"about_ca_topic_score_codex":0.000017509234,"about_ca_topic_score_gemma":0.000004629854,"teacher_disagreement_score":0.11706642,"about_ca_system_score_codex":0.00014478512,"about_ca_system_score_gemma":0.00005743718,"threshold_uncertainty_score":0.88358825},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029453468,0.000095590185,0.067804575,0.00017747597,0.00006143998,0.0023130276,0.00006473915,0.00026745224,0.92627037],"genre_scores_gemma":[0.8002855,0.00006575446,0.07550254,0.00004367752,0.00022981389,0.00075752934,0.00043979596,0.0002045309,0.12247082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831706,0.000006864814,0.00035051635,0.00030783945,0.00068343774,0.00033430025],"domain_scores_gemma":[0.99884987,0.00011999478,0.000035334204,0.00015706512,0.0007654689,0.0000722761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046756899,0.00024298251,0.00021464683,0.00037741603,0.00036469885,0.00020173322,0.0002757735,0.0001629108,0.000022142693],"category_scores_gemma":[0.00012872601,0.00019730277,0.00004796238,0.00018794167,0.0001452345,0.00013997336,0.000075901145,0.00070841843,0.000041895164],"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.0000062015874,0.00003652482,0.000001267516,0.00023466493,0.000020434192,1.5395894e-7,0.0002769804,0.8808652,0.00005839221,0.11422253,0.003597873,0.0006797506],"study_design_scores_gemma":[0.00017077796,0.00037304856,0.000008860784,0.00062069454,0.00001604043,0.000005608529,0.000065283086,0.9651864,0.0005778032,0.0043154373,0.028254764,0.000405274],"about_ca_topic_score_codex":0.000009551806,"about_ca_topic_score_gemma":0.0000042053894,"teacher_disagreement_score":0.8037995,"about_ca_system_score_codex":0.0001871862,"about_ca_system_score_gemma":0.00004959133,"threshold_uncertainty_score":0.80457735},"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":"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.000011075255,0.000109423025,0.9383593,0.0042244755,0.000068708956,0.0064276205,0.00004451835,0.00009949313,0.050655343],"genre_scores_gemma":[0.0020975566,0.00018638716,0.8141289,0.00043570387,0.00024513016,0.005360281,0.000018870682,0.00011328305,0.1774139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964142,0.00007323262,0.000532705,0.0010316735,0.0014313865,0.00051679584],"domain_scores_gemma":[0.9933889,0.0004109804,0.0001588987,0.00089491403,0.004971752,0.00017453593],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010893482,0.00039022643,0.00032107448,0.00055958086,0.0011280751,0.0006444274,0.0023809236,0.00021526491,0.00010831214],"category_scores_gemma":[0.00054419914,0.00024519904,0.000103439284,0.0007910954,0.00040113286,0.0005023615,0.0008879848,0.0010791343,0.00095761573],"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.000009983373,0.00014360677,0.0000011816257,0.000036034253,0.00009456556,0.0000014819594,0.0039596236,0.0404566,0.00044896625,0.82094896,0.00776215,0.12613685],"study_design_scores_gemma":[0.00029090364,0.0004023851,0.00004554651,0.0001772576,0.000011246702,0.0000114294735,0.00025822286,0.95133805,0.001018158,0.013756415,0.032291085,0.00039932606],"about_ca_topic_score_codex":0.00014534568,"about_ca_topic_score_gemma":0.000054859483,"teacher_disagreement_score":0.9108814,"about_ca_system_score_codex":0.0003607324,"about_ca_system_score_gemma":0.00034267828,"threshold_uncertainty_score":0.9998927},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010788916,0.0005881189,0.5473342,0.0010743618,0.00014805223,0.0032419765,0.00045939747,0.0003707162,0.4467724],"genre_scores_gemma":[0.11163378,0.0013911405,0.020713016,0.000020123209,0.0009720118,0.0034124772,0.0005229767,0.00022924914,0.8611052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99825376,0.0000050891713,0.000338835,0.00042242935,0.00047466293,0.0005052405],"domain_scores_gemma":[0.99879545,0.00013629429,0.000029517789,0.0002495415,0.0006933205,0.00009588788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087347487,0.00029063004,0.00022079765,0.00017844496,0.00090135133,0.00032245842,0.0003508929,0.0002960731,0.000085878055],"category_scores_gemma":[0.00010030448,0.00019707272,0.00008991912,0.00006146389,0.0002726205,0.00030074516,0.00011107898,0.00060959306,0.000077994264],"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.00007877651,0.000016464093,5.937885e-7,0.0005170559,0.00011735034,4.445064e-7,0.00040995062,0.2291612,0.00028156882,0.749032,0.010092708,0.010291862],"study_design_scores_gemma":[0.0011308013,0.0001993614,0.0000035466758,0.00035267326,0.00008184806,0.000007649501,0.00018898929,0.36641195,0.0015091592,0.037536945,0.5917003,0.00087676954],"about_ca_topic_score_codex":0.000008252559,"about_ca_topic_score_gemma":0.000043434746,"teacher_disagreement_score":0.7114951,"about_ca_system_score_codex":0.00038283298,"about_ca_system_score_gemma":0.00009014923,"threshold_uncertainty_score":0.8036392},"labels":[],"label_agreement":null}]}