{"id":"W7125595225","doi":"10.1109/cascon66301.2025.00064","title":"Efficient Compilation of Algorithms into Compact Linear Programs","year":2025,"lang":"","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Solver; Linear programming; Rounding; Integer programming; Abstraction; Compiler; Extension (predicate logic); Tree (set theory); Reduction (mathematics)","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009269031,0.001561202,0.0007627371,0.0008383213,0.0004036021,0.001389498,0.001259019,0.0005963208,0.004758096],"category_scores_gemma":[0.007307737,0.0007595761,0.001177546,0.001022843,0.0009729675,0.002078868,0.001988492,0.001612091,0.001424381],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008345939,"about_ca_system_score_gemma":0.001863495,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001285855,"about_ca_topic_score_gemma":0.002254848,"domain_scores_codex":[0.9984576,0.000330145,0.0001142261,0.0002772575,0.0006251283,0.0001957198],"domain_scores_gemma":[0.9960747,0.002403123,0.0002858523,0.0007402871,0.0004242497,0.00007184465],"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.0002754347,0.0002360798,0.001271988,0.0008027744,0.00007984364,0.0002761804,0.0003626863,0.5931622,0.02791788,0.07372902,0.009191727,0.2926942],"study_design_scores_gemma":[0.00006878078,0.00009883032,0.0001603286,0.0000443276,0.00002763281,0.0000619517,0.00006561787,0.9433813,0.01279225,0.03569804,0.007588696,0.00001229063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02247417,0.0002275098,0.9639935,0.000177928,0.00005208663,0.0001361063,0.0002652139,0.008441237,0.004232195],"genre_scores_gemma":[0.2112085,0.0003970704,0.7820244,0.0001882233,0.00006498641,0.0005344268,0.001345208,0.001760727,0.002476449],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004758096,"threshold_uncertainty_score":0.01591742,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01753358055278374,"score_gpt":0.287138950852305,"score_spread":0.2696053702995213,"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."}}