{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002047026,0.001224629,0.001452009,0.0008021856,0.001136328,0.003374215,0.00272876,0.003979512,0.02645551],"category_scores_gemma":[0.006537085,0.0007078254,0.001148924,0.002294999,0.0008971564,0.007811904,0.002571944,0.00246903,0.003031382],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00173681,"about_ca_system_score_gemma":0.001254578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001255444,"about_ca_topic_score_gemma":0.001139995,"domain_scores_codex":[0.9976948,0.0008504767,0.000140825,0.0005583831,0.0004084836,0.0003469473],"domain_scores_gemma":[0.9976072,0.001462167,0.0002297425,0.0002613891,0.0002034175,0.0002360787],"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.0004278555,0.0005398655,0.001248831,0.0007792002,0.000125414,0.0003527485,0.000223814,0.1205022,0.002240437,0.7328247,0.0492887,0.09144631],"study_design_scores_gemma":[0.000137639,0.0001618566,0.0004886585,0.0000879049,0.00004835321,0.0006095121,0.0003534044,0.3174341,0.001706328,0.611775,0.06716072,0.0000365196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05896506,0.001741949,0.8370247,0.009193605,0.0005197439,0.0007334494,0.004402379,0.0006055561,0.08681356],"genre_scores_gemma":[0.5927047,0.003819551,0.3420208,0.001994025,0.0009131331,0.0009379509,0.007540961,0.0005393058,0.04952964],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02645551,"threshold_uncertainty_score":0.08850253,"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."}}