{"id":"W7083460550","doi":"10.5281/zenodo.17206088","title":"Code of Publication : Communication-Constrained STL Task Decomposition Through Convex Optimization","year":2025,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Insurance, Mortality, Demography, Risk Management","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"European Commission","keywords":"Decomposition; Task (project management); Code (set theory); Convex optimization; Regular polygon; Upload","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001459236,0.001693854,0.000947601,0.0009053055,0.0004529741,0.001475192,0.001839619,0.001316151,0.3601063],"category_scores_gemma":[0.01276272,0.0005382059,0.0008342285,0.001057034,0.000396206,0.001086826,0.001420428,0.001668416,0.1096144],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009441678,"about_ca_system_score_gemma":0.002666357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007266794,"about_ca_topic_score_gemma":0.008548384,"domain_scores_codex":[0.9992251,0.0001543974,0.00006520859,0.000127873,0.0003356348,0.0000917047],"domain_scores_gemma":[0.9952668,0.002226113,0.0001297123,0.0005001736,0.00169955,0.0001776252],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003147431,0.0001716582,0.0008857442,0.001063396,0.00005313593,0.0001946063,0.00007541681,0.05632125,0.001773941,0.02567138,0.8339415,0.0795331],"study_design_scores_gemma":[0.0008173379,0.0001367796,0.001669344,0.0004292516,0.00003171346,0.0003514147,0.00008290172,0.487542,0.006733932,0.04770508,0.4543895,0.0001108103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003483521,0.0007537892,0.6789674,0.002192989,0.002191726,0.001484561,0.1533698,0.07869221,0.07886405],"genre_scores_gemma":[0.08494527,0.001451246,0.5420514,0.001665705,0.0006572565,0.006720804,0.2021039,0.06565908,0.09474541],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3601063,"threshold_uncertainty_score":0.9127307,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02988621379867451,"score_gpt":0.3088577265623687,"score_spread":0.2789715127636942,"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."}}