{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001209304,0.000203717,0.0002905187,0.0005848433,0.001912848,0.000593608,0.001601666,0.0002339068,0.03055684],"category_scores_gemma":[0.0005962342,0.0002491727,0.0001016439,0.001148372,0.0007899039,0.0003165132,0.000599539,0.0002689332,0.0008188931],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002021389,"about_ca_system_score_gemma":0.00003044699,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001016002,"about_ca_topic_score_gemma":0.00007251568,"domain_scores_codex":[0.9969811,0.001115623,0.0004683854,0.0004570218,0.0006468897,0.0003309466],"domain_scores_gemma":[0.997175,0.0000489559,0.0005926323,0.0008581113,0.001230133,0.00009514408],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001967319,0.0002018155,0.00001221051,0.000157351,0.0001585903,9.493321e-7,0.001920899,0.0002203738,0.0000192258,0.1339788,0.8472303,0.01607983],"study_design_scores_gemma":[0.0003769045,0.00003920634,0.0001498127,0.0001608036,0.00006003448,0.000001189982,0.0007969341,0.0003198562,0.00001194195,0.0005741164,0.9972946,0.0002146204],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00001532809,0.0002806881,0.04601682,0.001719354,0.0001540631,0.001224132,0.0009782847,0.0009723144,0.948639],"genre_scores_gemma":[0.2882673,0.02173587,0.03469741,0.001847642,0.001126271,0.000004253679,0.07821587,0.01356731,0.5605381],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.388101,"threshold_uncertainty_score":0.9999961,"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."}}