{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00159189,0.001967063,0.002696799,0.001060281,0.001000657,0.002378867,0.00423803,0.001938956,0.01502704],"category_scores_gemma":[0.005404557,0.001149261,0.001518567,0.003024487,0.0007389248,0.004765628,0.003410021,0.00298577,0.00267589],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00243459,"about_ca_system_score_gemma":0.003278427,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00390271,"about_ca_topic_score_gemma":0.006808506,"domain_scores_codex":[0.9987016,0.000209803,0.0001016903,0.0004133912,0.0003711072,0.0002024845],"domain_scores_gemma":[0.9975213,0.001413172,0.0001341512,0.0004367094,0.0003230819,0.000171561],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001161329,0.0007755433,0.001075894,0.0007883049,0.0001542506,0.0001838204,0.0002798155,0.1614617,0.01396865,0.04872838,0.04099639,0.730426],"study_design_scores_gemma":[0.000226533,0.0001348651,0.0002760599,0.00003742997,0.00003311485,0.0001504375,0.0001033053,0.9334834,0.003012519,0.05900714,0.003509949,0.00002517631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03368455,0.0007304883,0.946992,0.0007742494,0.0001772429,0.0006842123,0.001608173,0.005131328,0.01021773],"genre_scores_gemma":[0.1165435,0.0002578208,0.8743124,0.0002484035,0.000112525,0.0004803085,0.002731029,0.0005691071,0.004744851],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01502704,"threshold_uncertainty_score":0.0502705,"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."}}