{"id":"W3037630572","doi":"10.48550/arxiv.2006.15744","title":"Fast and Private Submodular and $k$-Submodular Functions Maximization\\n with Matroid Constraints","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Submodular set function; Matroid; Monotone polygon; Mathematics; Automatic summarization; Constraint (computer-aided design); Generalization; Maximization; Set function; Combinatorics; Discrete mathematics; Approximation algorithm; Function (biology); Mathematical optimization; Computer science; Set (abstract data type); Artificial intelligence","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.002658346,0.001592426,0.001834264,0.0006000315,0.0007936304,0.002202201,0.002263109,0.001800533,0.005440637],"category_scores_gemma":[0.0111008,0.000674159,0.001337051,0.00218071,0.001512861,0.005348502,0.002852662,0.003528641,0.001407814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002511564,"about_ca_system_score_gemma":0.002302061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00214134,"about_ca_topic_score_gemma":0.002894607,"domain_scores_codex":[0.9978491,0.0008384564,0.00007841099,0.0005603701,0.0003968266,0.0002768994],"domain_scores_gemma":[0.9956713,0.002566544,0.0002982051,0.001081279,0.0002210358,0.0001617568],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009358138,0.0004525427,0.001954915,0.0006308468,0.0001745572,0.0003106276,0.0004200887,0.3837847,0.007301945,0.3268458,0.02830782,0.2488803],"study_design_scores_gemma":[0.00005241116,0.00006767608,0.0002574844,0.00002636585,0.00002057554,0.0001270147,0.00004798678,0.8400623,0.002174376,0.1539425,0.003205595,0.00001567258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03342905,0.001053771,0.9519907,0.002045864,0.00008486015,0.0001266774,0.0005672191,0.001060864,0.009640951],"genre_scores_gemma":[0.5382028,0.001105372,0.4471383,0.0008315009,0.0002571025,0.0003869051,0.001329386,0.0004306662,0.01031803],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005440637,"threshold_uncertainty_score":0.01822275,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05043255897996517,"score_gpt":0.1766693308186923,"score_spread":0.1262367718387272,"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."}}