{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003289591,0.0001717609,0.0002472527,0.00008757406,0.0003977188,0.000494639,0.0005197632,0.00005128346,0.00001017936],"category_scores_gemma":[0.0003381376,0.0001399148,0.000102964,0.000274198,0.0001381228,0.0003724005,0.0001949401,0.0004637947,0.00001379766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002162522,"about_ca_system_score_gemma":0.00003775081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001753726,"about_ca_topic_score_gemma":0.000001427215,"domain_scores_codex":[0.9987148,0.00005451664,0.0004386513,0.0002539625,0.0002916105,0.0002464408],"domain_scores_gemma":[0.9989157,0.0001656068,0.0002637095,0.000284603,0.00008647793,0.0002838996],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008091947,0.0002840271,0.0000903383,0.0003779541,0.0003195949,0.0002038203,0.03334225,0.0002593671,0.003726098,0.8991221,0.002856341,0.05933724],"study_design_scores_gemma":[0.002246442,0.0005453036,0.0002158949,0.0003680182,0.00004499173,0.001445545,0.001594766,0.8379981,0.001527213,0.1469673,0.006432264,0.0006141934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02849229,0.00008459063,0.9572183,0.009097549,0.0008454704,0.0002164223,0.00004632601,0.0001809456,0.003818057],"genre_scores_gemma":[0.462085,0.00005633622,0.536808,0.0007121191,0.0002563519,0.000003611521,0.000001400995,0.00001771054,0.00005946729],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8377388,"threshold_uncertainty_score":0.570556,"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."}}