{"id":"W4392245251","doi":"10.1016/j.tcs.2024.114469","title":"Two-stage BP maximization under p-matroid constraint","year":2024,"lang":"en","type":"article","venue":"Theoretical 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":"Qinglan Project of Jiangsu Province of China; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Submodular set function; Matroid; Parameterized complexity; Maximization; Mathematics; Constraint (computer-aided design); Combinatorics; Monotonic function; Function (biology); Approximation algorithm; Discrete mathematics; Mathematical optimization; Mathematical analysis","routes":{"ca_aff":true,"ca_fund":true,"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":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001349751,0.0002178975,0.0001871648,0.0003420046,0.0004493263,0.001713342,0.002310881,0.00003722198,0.0001835199],"category_scores_gemma":[0.00003146954,0.0001826185,0.0001087535,0.002079531,0.003759007,0.00100831,0.001154302,0.0003025451,0.0002136225],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008370593,"about_ca_system_score_gemma":0.0002417763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005660397,"about_ca_topic_score_gemma":0.000001053844,"domain_scores_codex":[0.9972466,0.00009807193,0.0002987092,0.0009547165,0.0007801293,0.0006217393],"domain_scores_gemma":[0.9984251,0.0003074435,0.00003511182,0.0008291253,0.0001328008,0.000270451],"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.0000014765,0.00002756181,0.000003659245,0.0000126871,0.000005307244,0.0000384765,0.0002295909,0.001967112,0.0003468143,0.9499421,0.00005187618,0.04737341],"study_design_scores_gemma":[0.00008749804,0.00005086953,0.00004504942,0.00003533882,0.000002685177,0.00007120529,0.000008595244,0.5986454,0.001101813,0.399474,0.0003128591,0.0001646544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002876157,0.0001139014,0.9852151,0.002440848,0.001818835,0.0001515526,0.000005011092,0.0007870772,0.006591538],"genre_scores_gemma":[0.6862743,0.000005549452,0.3127682,0.000762923,0.0001464111,0.000004406894,0.000001166129,0.000007923726,0.00002907727],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6833982,"threshold_uncertainty_score":0.999323,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01619748579927043,"score_gpt":0.274274897290326,"score_spread":0.2580774114910556,"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."}}