{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0001718729,0.0003983621,0.0003863825,0.000274762,0.0002485927,0.0002983645,0.008424852,0.000323225,0.00001553445],"category_scores_gemma":[0.0007852868,0.000432722,0.00005646228,0.0006803924,0.0007627089,0.0006358874,0.07144602,0.0007465617,0.00001917415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001067667,"about_ca_system_score_gemma":0.0001301273,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003066236,"about_ca_topic_score_gemma":0.00001296955,"domain_scores_codex":[0.9975402,0.00009453876,0.0002014894,0.001651105,0.0001346566,0.0003780114],"domain_scores_gemma":[0.9942638,0.00006943501,0.000246893,0.00508321,0.0001229248,0.0002136955],"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.0003157028,0.0004995491,0.1180797,0.001823879,0.002090927,0.005282045,0.0007755248,0.09635497,0.001172185,0.7262998,0.02078273,0.02652301],"study_design_scores_gemma":[0.000730315,0.0001055555,0.004420807,0.0001343485,0.0001079561,0.0000676506,0.00008452782,0.7162458,0.0001752757,0.276864,0.0004024669,0.0006613754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1518638,0.00009136152,0.8431442,0.003119085,0.00015417,0.0003725799,0.00009589726,0.0008038383,0.0003550875],"genre_scores_gemma":[0.9102179,0.0003985988,0.08909215,0.0001004368,0.00002547495,0.000002351368,0.00005625865,0.00002652447,0.00008029988],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7583541,"threshold_uncertainty_score":0.9998125,"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."}}