{"id":"W4205934954","doi":"10.1007/978-3-030-92681-6_9","title":"A Linear-Time Streaming Algorithm for Cardinality-Constrained Maximizing Monotone Non-submodular Set Functions","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Submodular set function; Cardinality (data modeling); Monotone polygon; Time complexity; Function (biology); Combinatorics; Matching (statistics); Discrete mathematics; Constraint (computer-aided design); Set (abstract data type); Streaming algorithm; Binary logarithm; Mathematics; Computer science; Algorithm; Upper and lower bounds","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"],"consensus_categories":[],"category_scores_codex":[0.001302861,0.0008326712,0.001071785,0.0009726607,0.0008327846,0.0008457297,0.002963895,0.0004485051,0.00003988504],"category_scores_gemma":[0.0001181992,0.0008744735,0.0005692395,0.001165743,0.0008912478,0.0007090039,0.001732829,0.001069711,0.0000349746],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003493885,"about_ca_system_score_gemma":0.000928243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004934328,"about_ca_topic_score_gemma":0.00002838783,"domain_scores_codex":[0.9944786,0.00005984793,0.0008304856,0.002452729,0.001069956,0.001108329],"domain_scores_gemma":[0.9958374,0.0008661663,0.0003707623,0.001987739,0.0006347725,0.0003031559],"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.00000396397,0.00004935263,0.000005543641,0.00006278211,0.00007250888,0.0001417864,0.0004293539,0.01547283,0.0002717507,0.00390202,0.00003078823,0.9795573],"study_design_scores_gemma":[0.0005235652,0.0001908343,0.00002475254,0.0004849073,0.00003585698,0.0001873965,0.00000143535,0.9381923,0.001098027,0.05656262,0.001766356,0.0009319229],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00005827944,0.0004019348,0.9945548,0.0005495126,0.002261619,0.0008706675,0.0001152672,0.0002592494,0.0009286889],"genre_scores_gemma":[0.004286779,0.00002869889,0.9927081,0.0006124971,0.001110846,0.00006312417,0.00009280285,0.000061495,0.001035649],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9786254,"threshold_uncertainty_score":0.9993706,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02362179403439302,"score_gpt":0.2539519593697021,"score_spread":0.2303301653353091,"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."}}