{"id":"W4205250726","doi":"10.1007/978-3-030-91434-9_6","title":"Differentially Private Submodular Maximization over Integer Lattice","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Submodular set function; Monotone polygon; Computer science; Maximization; Cardinality (data modeling); Automatic summarization; Greedy algorithm; Integer (computer science); Theoretical computer science; Mathematical optimization; Mathematics; Artificial intelligence; Data mining; Algorithm","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":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006155834,0.0006461673,0.0006428398,0.0008495954,0.0003362029,0.001158185,0.003853418,0.0003772406,0.0001512447],"category_scores_gemma":[0.0001133008,0.0006251307,0.0002442061,0.001022873,0.0006633589,0.0008119429,0.002820936,0.001065748,0.00003513518],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002549625,"about_ca_system_score_gemma":0.0004238766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002210172,"about_ca_topic_score_gemma":0.00008384531,"domain_scores_codex":[0.9952782,0.00006843547,0.000626798,0.001951047,0.001325271,0.0007502062],"domain_scores_gemma":[0.9967979,0.0003459002,0.0003138904,0.001992177,0.0003471097,0.0002030373],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006500817,0.00008691274,0.0001225364,0.00007972845,0.00004034474,0.000275288,0.0005171369,0.01252254,0.0002387694,0.3726929,0.0000245319,0.6133928],"study_design_scores_gemma":[0.0003164565,0.00008805824,0.0006759031,0.0004676368,0.00001543411,0.00007321504,8.342224e-8,0.6270894,0.001260752,0.3656794,0.003474948,0.0008586183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003390257,0.0005061934,0.9931391,0.0005676407,0.003165596,0.0003148793,0.000006980329,0.0002204312,0.001740151],"genre_scores_gemma":[0.06401144,0.0002000781,0.9306382,0.00277467,0.001005635,0.00001483644,0.00004287946,0.00008527265,0.001227003],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6145669,"threshold_uncertainty_score":0.9998787,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01746079052434353,"score_gpt":0.2340155430445845,"score_spread":0.216554752520241,"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."}}