{"id":"W3014010934","doi":"10.1137/18m1224672","title":"Multitasking Capacity: Hardness Results and Improved Constructions","year":2020,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"United States - Israel Binational Science Foundation; Simons Foundation; National Science Foundation","keywords":"Combinatorics; Bipartite graph; Mathematics; Matching (statistics); Cardinality (data modeling); Upper and lower bounds; Discrete mathematics; Hardness of approximation; Complete bipartite graph; Approximation algorithm; 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.003657436,0.002042958,0.002503664,0.002056362,0.002001866,0.005376529,0.005933817,0.003140456,0.01107317],"category_scores_gemma":[0.02803835,0.00132486,0.003228063,0.003687774,0.003628363,0.01237941,0.007072865,0.006563926,0.001792099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00359489,"about_ca_system_score_gemma":0.002226032,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002568723,"about_ca_topic_score_gemma":0.001585983,"domain_scores_codex":[0.994055,0.001599053,0.0002546883,0.001423618,0.001550793,0.001116866],"domain_scores_gemma":[0.9691738,0.02227279,0.001527674,0.004344974,0.0009342874,0.001746471],"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.001095167,0.0005563253,0.002802611,0.001066462,0.0002384304,0.0005340388,0.0009546495,0.3207535,0.006771373,0.5893121,0.02059795,0.05531741],"study_design_scores_gemma":[0.0001038022,0.00008800107,0.000510917,0.0000719154,0.00007322821,0.0002603959,0.0001514964,0.4679257,0.002513202,0.5227504,0.005495703,0.00005516344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1773161,0.002256964,0.748521,0.009263922,0.0003642682,0.0004404565,0.003141283,0.001900918,0.05679506],"genre_scores_gemma":[0.8714195,0.001415025,0.1114933,0.001221762,0.0007222216,0.000807667,0.00170389,0.0007522732,0.01046435],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01107317,"threshold_uncertainty_score":0.03704345,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04865152016433313,"score_gpt":0.2558573971456671,"score_spread":0.2072058769813339,"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."}}