{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001744967,0.0001528138,0.0002760355,0.001216769,0.0003660458,0.0004247622,0.002777323,0.00003980481,0.00001160236],"category_scores_gemma":[0.0002599822,0.0001492123,0.0002810349,0.00157808,0.000452427,0.001863103,0.0005217874,0.0001706419,0.00001397721],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000118419,"about_ca_system_score_gemma":0.0006078156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000205323,"about_ca_topic_score_gemma":0.000001913636,"domain_scores_codex":[0.9976048,0.00004352424,0.0007774711,0.0003407012,0.0009278258,0.0003056962],"domain_scores_gemma":[0.9958084,0.000484418,0.0006143108,0.0003792778,0.002577054,0.0001365756],"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.0000739476,0.000415744,0.0004227534,0.00003965461,0.0006095578,0.00004934111,0.00215291,0.04625621,0.03010556,0.06788132,0.001370123,0.8506229],"study_design_scores_gemma":[0.0006995448,0.0002252971,0.00170504,0.00007415492,0.00001625603,0.0001637039,0.00005621565,0.9841359,0.002313956,0.008734109,0.001712424,0.0001633888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02173292,0.0000145405,0.9722796,0.002244987,0.003343725,0.0001642926,0.00004325232,0.00007691263,0.00009975456],"genre_scores_gemma":[0.4289318,0.00001296486,0.5702441,0.00008737522,0.0005936281,0.000009673578,0.00001757581,0.00000862144,0.00009419388],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9378797,"threshold_uncertainty_score":0.6084703,"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."}}