{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002033193,0.002005662,0.001301911,0.001585357,0.0007180879,0.00252319,0.002494889,0.001144426,0.02131932],"category_scores_gemma":[0.007973906,0.001395518,0.00241576,0.002151778,0.001675958,0.003354381,0.003174328,0.004503794,0.008823865],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001257378,"about_ca_system_score_gemma":0.002069889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001685898,"about_ca_topic_score_gemma":0.001871708,"domain_scores_codex":[0.9973623,0.0006589807,0.0001876074,0.0004876302,0.001120404,0.0001830594],"domain_scores_gemma":[0.9969638,0.002080773,0.0001203296,0.0004468307,0.0003026942,0.00008564394],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002182007,0.0001527988,0.0002872613,0.00162904,0.0001115582,0.0002827684,0.0004032842,0.0919589,0.004122002,0.463217,0.09184224,0.3457749],"study_design_scores_gemma":[0.0002175984,0.00008392182,0.0001515177,0.0002467533,0.00002973754,0.0002835566,0.00006259738,0.2730178,0.006598782,0.4812098,0.2380444,0.00005358702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001025088,0.0005772457,0.9772524,0.0004803074,0.000122255,0.0001465789,0.00060277,0.009899721,0.009893642],"genre_scores_gemma":[0.025812,0.001113389,0.9560429,0.0005637796,0.0001856512,0.001068068,0.002741532,0.005127076,0.007345626],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02131932,"threshold_uncertainty_score":0.07132024,"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."}}