{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001492875,0.0007149292,0.001122736,0.0004146447,0.0006224476,0.002416031,0.00133883,0.0007871295,0.006840777],"category_scores_gemma":[0.005773833,0.0004831752,0.0004959494,0.001579204,0.001242089,0.00422689,0.002159904,0.00298835,0.001630511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002321436,"about_ca_system_score_gemma":0.001350224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006483084,"about_ca_topic_score_gemma":0.0009391924,"domain_scores_codex":[0.9985499,0.000602071,0.000041624,0.0002207913,0.0003786908,0.0002069428],"domain_scores_gemma":[0.997933,0.00123723,0.0001235596,0.0004588959,0.0001125897,0.0001346952],"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.0003516812,0.000123415,0.000229645,0.0002251629,0.00003170959,0.00006746859,0.0001107295,0.07638684,0.003115445,0.8240876,0.02392333,0.07134694],"study_design_scores_gemma":[0.00005769106,0.00003815081,0.0001028684,0.00002925272,0.00001191738,0.00008869534,0.00002984069,0.1653662,0.001736576,0.824472,0.008051844,0.00001505636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07546539,0.002047923,0.8063117,0.006055843,0.0003719075,0.0001705012,0.002202569,0.001492219,0.105882],"genre_scores_gemma":[0.7861071,0.001974181,0.1648774,0.0008946379,0.0006353623,0.0002485047,0.001340404,0.0005517203,0.04337069],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006840777,"threshold_uncertainty_score":0.02288467,"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."}}