{"id":"W2160146903","doi":"10.1287/moor.1070.0254","title":"The Demand-Matching Problem","year":2007,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Bipartite graph; Mathematics; Knapsack problem; Cardinality (data modeling); Matching (statistics); Combinatorics; Tree (set theory); Clos network; Discrete mathematics; Approximation algorithm; Time complexity; Node (physics); 3-dimensional matching; Mathematical optimization; Graph; Computer science","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01318965,0.00008538624,0.0001250888,0.0003050964,0.001219528,0.0003586299,0.001892312,0.00004305293,0.00001125189],"category_scores_gemma":[0.0007439551,0.00005617104,0.00005017456,0.001243512,0.0003512672,0.0004223322,0.0006535216,0.0004135467,0.00007787811],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000489691,"about_ca_system_score_gemma":0.0001415651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001889436,"about_ca_topic_score_gemma":0.0001428264,"domain_scores_codex":[0.9973522,0.0002113459,0.0004373905,0.0002187303,0.001192334,0.000587941],"domain_scores_gemma":[0.9958153,0.00218031,0.0000306072,0.001001041,0.000867633,0.0001050774],"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.000003520671,0.00009046055,0.00001136319,0.00003489566,0.00001221949,0.000003657617,0.002553624,0.001476005,0.00833115,0.9815906,0.0001083848,0.005784075],"study_design_scores_gemma":[0.0002407234,0.0001465069,0.0001084288,0.00007734314,0.000001858812,0.00002279547,0.001969761,0.08510424,0.03580449,0.874994,0.001377327,0.0001525328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03455,0.0001894711,0.9509739,0.001086158,0.00003441048,0.0005497652,0.000001110423,0.00004646869,0.01256866],"genre_scores_gemma":[0.6031462,0.00005057067,0.3946923,0.00001012456,0.00002799861,0.0000525564,7.653765e-7,0.00001315538,0.002006274],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5685962,"threshold_uncertainty_score":0.9379747,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07242089226921299,"score_gpt":0.4165825610196921,"score_spread":0.3441616687504791,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}