{"id":"W3021430041","doi":"10.1080/10556788.2020.1864370","title":"Sparktope: linear programs from algorithms","year":2021,"lang":"en","type":"preprint","venue":"Optimization methods & software","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick; McGill University","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Compiler; Computer science; Algorithm; Polynomial; Matching (statistics); Bipartite graph; Extension (predicate logic); TRACE (psycholinguistics); Time complexity; Linear programming; Exponential function; Graph; Programming language; Theoretical computer science; Mathematics","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":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001153813,0.0006436518,0.0008534903,0.0002394739,0.0003338582,0.00134913,0.002606049,0.0006620169,0.0003591493],"category_scores_gemma":[0.0006768039,0.0006916993,0.0004756084,0.001102594,0.0001373508,0.0005435194,0.004349287,0.001216142,0.00001619333],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001121104,"about_ca_system_score_gemma":0.0004511882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002455628,"about_ca_topic_score_gemma":0.00001099303,"domain_scores_codex":[0.9948321,0.001255433,0.0007949201,0.001866139,0.0006899954,0.0005614193],"domain_scores_gemma":[0.9954471,0.0005629772,0.0005163986,0.002449766,0.0007432008,0.0002805842],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003303016,0.0001695498,0.0001574316,0.00006641261,0.00012265,0.00004136776,0.0007042774,0.2696024,0.000004122311,0.0002929191,0.0001839492,0.7286516],"study_design_scores_gemma":[0.0002960733,0.00003913993,0.0001111327,0.0003012327,0.00006692334,0.0000114058,0.00005606351,0.9799572,0.0004038063,0.0117802,0.006143112,0.0008337041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003913335,0.002141033,0.9910559,0.0005355574,0.003973543,0.0006137078,0.00006244987,0.001371957,0.0002067069],"genre_scores_gemma":[0.00001906723,0.000512813,0.9965581,0.0003920518,0.0005387972,0.0001812656,0.001455976,0.00007122213,0.0002707131],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.727818,"threshold_uncertainty_score":0.9996876,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06472395234384083,"score_gpt":0.3537934815381213,"score_spread":0.2890695291942805,"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."}}