{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002013553,0.001174431,0.002094822,0.0007639931,0.001043842,0.002142204,0.003619857,0.002577072,0.008422211],"category_scores_gemma":[0.006190044,0.001172195,0.001382748,0.001698891,0.0009826593,0.004209535,0.003197061,0.002481065,0.001585559],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001360809,"about_ca_system_score_gemma":0.003275845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003129888,"about_ca_topic_score_gemma":0.004432934,"domain_scores_codex":[0.9979534,0.000677441,0.00008405308,0.0004460236,0.0003987198,0.0004402668],"domain_scores_gemma":[0.9964887,0.002000975,0.0001592723,0.0005310853,0.0005027836,0.0003171694],"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.002090466,0.0008398719,0.002959546,0.001706246,0.0003441152,0.00109698,0.0007079043,0.3607172,0.03987092,0.2707693,0.03621611,0.2826812],"study_design_scores_gemma":[0.00009316204,0.0001268879,0.0005022929,0.00002759422,0.00005430373,0.0002396999,0.00005349305,0.8736838,0.006930191,0.1157026,0.002552604,0.00003317996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02731958,0.0003013239,0.9595979,0.001028101,0.00009631531,0.0002073231,0.0004849345,0.0006469614,0.01031754],"genre_scores_gemma":[0.4235121,0.0003373745,0.554989,0.0005275371,0.0002672109,0.0004250591,0.0009398776,0.00059141,0.0184105],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008422211,"threshold_uncertainty_score":0.02817518,"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."}}