{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005724675,0.0005306982,0.0006121192,0.001331381,0.0008804859,0.001610038,0.001134225,0.001362004,0.006532608],"category_scores_gemma":[0.004928533,0.0002712599,0.0005712155,0.002048573,0.0009769291,0.002543711,0.0017896,0.001629968,0.002179747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005061815,"about_ca_system_score_gemma":0.0006463114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004955449,"about_ca_topic_score_gemma":0.0004911473,"domain_scores_codex":[0.9992585,0.0001760451,0.00005312165,0.0001718727,0.0002337859,0.0001066126],"domain_scores_gemma":[0.9981601,0.000872809,0.00008661616,0.000540965,0.0002564681,0.00008313605],"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.0006598349,0.0001818279,0.001516904,0.0004546448,0.00003274634,0.0009342876,0.000571947,0.02273989,0.02636796,0.6875259,0.00954277,0.2494713],"study_design_scores_gemma":[0.00005033114,0.0001518028,0.0004643176,0.00008690455,0.00004892457,0.0006180516,0.0002702316,0.1183071,0.02174049,0.8384082,0.01979848,0.00005502679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1236785,0.0002308974,0.8523408,0.001239074,0.0004003194,0.0001519909,0.0008807266,0.00181832,0.01925942],"genre_scores_gemma":[0.5569551,0.0004065681,0.4261902,0.0003466128,0.0001154795,0.0002000846,0.001430427,0.0008973047,0.01345829],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006532608,"threshold_uncertainty_score":0.02185374,"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."}}