{"id":"W2592557380","doi":"10.1016/j.tcs.2017.02.016","title":"Constructing an indeterminate string from its associated graph","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Cardinality (data modeling); Discrete mathematics; Heuristics; Clique; Alphabet; String (physics); Vertex cover; Heuristic; Graph; Computer science; Mathematical optimization","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":["sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001242273,0.0002077863,0.0002474056,0.0001300382,0.002016138,0.002830208,0.006636079,0.00008201687,0.00002705662],"category_scores_gemma":[0.0002940755,0.0001742777,0.00005558661,0.0002947494,0.002092517,0.003719265,0.003680938,0.000295388,0.00003281864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000617182,"about_ca_system_score_gemma":0.0001018696,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003806224,"about_ca_topic_score_gemma":0.000004199874,"domain_scores_codex":[0.9972719,0.0001158038,0.0002775923,0.0009618365,0.0007513333,0.0006215419],"domain_scores_gemma":[0.997015,0.0001910219,0.0002534236,0.001936344,0.0002210545,0.0003831416],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002757655,0.00003796098,0.0007371766,0.000001278234,0.00000396325,0.00003121922,0.0001648305,0.00001177297,0.0006118069,0.7934161,0.000006105313,0.2049751],"study_design_scores_gemma":[0.0003207952,0.000111344,0.0127883,0.00007259988,0.000004508784,0.00001485685,0.00001058294,0.8162909,0.008645186,0.161437,0.00001330368,0.0002906688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3153108,0.00001029235,0.682184,0.0001931471,0.0009189884,0.000081005,0.00001393734,0.0001835106,0.001104364],"genre_scores_gemma":[0.8729733,0.000002057534,0.1267484,0.0001179093,0.0001416388,0.000002238743,0.000003838689,0.000006975976,0.00000364552],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8162791,"threshold_uncertainty_score":0.9992831,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0205353994028989,"score_gpt":0.2824883555088229,"score_spread":0.261952956105924,"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."}}