{"id":"W4386041537","doi":"10.26599/tst.2022.9010013","title":"Maximizing Submodular+Supermodular Functions Subject to a Fairness Constraint","year":2023,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"Beijing University of Technology; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Submodular set function; Constraint (computer-aided design); Greedy algorithm; Mathematical optimization; Mathematics; Function (biology); Approximation algorithm; Curvature","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.001301763,0.0002461614,0.0002885966,0.004023801,0.001256035,0.0003831216,0.00350804,0.0001290674,0.0000180086],"category_scores_gemma":[0.0004298534,0.0002507454,0.00009523724,0.02191206,0.002149567,0.0007269792,0.001842276,0.0003778875,0.0006809539],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001772137,"about_ca_system_score_gemma":0.000394052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004581332,"about_ca_topic_score_gemma":0.00002029468,"domain_scores_codex":[0.9965762,0.00003578423,0.0003316891,0.001201117,0.0006642762,0.001190961],"domain_scores_gemma":[0.9978609,0.00007172224,0.00007228697,0.001513785,0.0002482418,0.0002330278],"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.000004827532,0.00009241667,0.001178786,0.00001365942,0.00001551529,0.0001845737,0.001332208,0.0009212996,0.1153599,0.6096541,0.0004695815,0.2707731],"study_design_scores_gemma":[0.001287425,0.001093728,0.01813721,0.0002496594,0.00003360713,0.001610073,0.004504402,0.3300948,0.1265557,0.4656685,0.04814696,0.002617865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.367152,0.00003329023,0.6167834,0.009857308,0.001208911,0.0002981764,0.000005609377,0.003190198,0.00147112],"genre_scores_gemma":[0.9574276,0.000005930439,0.04192271,0.0003182144,0.00004408208,0.00006214336,0.00000179061,0.00001356209,0.0002039997],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5902756,"threshold_uncertainty_score":0.9999945,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02530050457586893,"score_gpt":0.2690948986667293,"score_spread":0.2437943940908603,"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."}}