{"id":"W4387377762","doi":"10.1142/s0129054123410083","title":"Improved Linear-Time Streaming Algorithms for Maximizing Monotone Cardinality-Constrained Set Functions","year":2023,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"Fundamental Research Funds for the Central Universities; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Cardinality (data modeling); Monotone polygon; Streaming algorithm; Time complexity; Set (abstract data type); Ideal (ethics); Algorithm; Function (biology); Computer science; Running time; Approximation algorithm; Integer (computer science); Mathematics; Discrete mathematics; 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.003722192,0.001844925,0.002148424,0.001266939,0.0009396905,0.001932955,0.00402585,0.001762482,0.004201464],"category_scores_gemma":[0.0165187,0.0008513071,0.001530089,0.002713194,0.001158272,0.006522851,0.002628602,0.002902534,0.001084888],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002310999,"about_ca_system_score_gemma":0.002752365,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003349094,"about_ca_topic_score_gemma":0.004409054,"domain_scores_codex":[0.9973722,0.0007451162,0.0001879368,0.0006424302,0.0006897537,0.0003626489],"domain_scores_gemma":[0.9909043,0.005964834,0.0005701427,0.00143702,0.0007856205,0.0003380926],"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.0009356344,0.0005149551,0.002269057,0.0005956301,0.0001572449,0.0002038678,0.0004522789,0.5082949,0.01271898,0.12605,0.01494615,0.3328612],"study_design_scores_gemma":[0.00004750712,0.00006597743,0.0001215478,0.00001274416,0.0000167936,0.00008304153,0.00003105771,0.954518,0.002264455,0.0416169,0.001207845,0.00001416004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02717078,0.0007988033,0.9663149,0.0006214887,0.00007698889,0.0001871598,0.0003009819,0.001492737,0.003036062],"genre_scores_gemma":[0.2530295,0.0004843046,0.7417522,0.0003342725,0.0002157511,0.0003444801,0.0007830284,0.000389334,0.002667159],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004201464,"threshold_uncertainty_score":0.01968509,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0469455290462242,"score_gpt":0.333160625608366,"score_spread":0.2862150965621418,"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."}}