{"id":"W2602804099","doi":"10.1145/3052973.3052974","title":"BinSequence","year":2017,"lang":"en","type":"article","venue":"","topic":"Software Engineering Research","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministère de la Défense Nationale","keywords":"Computer science; Longest common subsequence problem; Compiler; Block (permutation group theory); Key (lock); Code (set theory); Reuse; Source code; Programming language; Process (computing); Theoretical computer science; Data mining; Algorithm","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":[],"consensus_categories":[],"category_scores_codex":[0.0001112567,0.0000282723,0.00002777458,0.00002406836,0.0001394702,0.0003425181,0.001687161,0.00001225832,0.00002091834],"category_scores_gemma":[0.0005745683,0.00002361383,0.00001139348,0.00002812605,0.00002651065,0.0003966492,0.0003304025,0.00004467876,0.0003472598],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001035119,"about_ca_system_score_gemma":0.00002173901,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004499706,"about_ca_topic_score_gemma":0.000001683153,"domain_scores_codex":[0.9996003,0.000003184654,0.00002969612,0.0001176786,0.0001268576,0.0001223192],"domain_scores_gemma":[0.9988094,0.00007440425,0.00001027331,0.001037187,0.00002356261,0.00004516966],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.000001073527,0.00003132412,0.1180679,0.00001503435,0.00001246005,0.0001832956,0.0001845972,0.00008227089,0.007387091,0.6408877,0.01095084,0.2221963],"study_design_scores_gemma":[0.0002224241,0.00004577198,0.9099168,0.00001351865,4.713573e-7,0.00003105974,0.000001544433,0.03399209,0.0299946,0.007745682,0.01779098,0.0002450253],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03388331,0.00001380969,0.9492257,0.001633054,0.0002636072,0.00003235356,8.374273e-8,0.0003582942,0.01458979],"genre_scores_gemma":[0.9404541,0.000002105857,0.0574577,0.00004002266,0.00001941206,0.000002866891,2.406432e-8,0.000001906287,0.002021856],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9065708,"threshold_uncertainty_score":0.4463437,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03803123773101391,"score_gpt":0.308092317794876,"score_spread":0.2700610800638621,"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."}}