{"id":"W2976570834","doi":"10.1109/isit.2019.8849758","title":"Decision Procedure for the Existence of Two-Channel Prefix-Free Codes","year":2019,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Prefix; Prefix code; Rectangle; Code (set theory); Computer science; Decision problem; Algorithm; Channel (broadcasting); Linear inequality; Mathematics; Mathematical optimization; Theoretical computer science; Inequality; Linear code; Block code; Telecommunications; Programming language; Decoding methods","routes":{"ca_aff":true,"ca_fund":false,"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.0002531486,0.00008457198,0.0001190598,0.0000282204,0.00008397486,0.00006296886,0.001761475,0.00003093349,0.00001771529],"category_scores_gemma":[0.00008289951,0.00004429383,0.00005296204,0.0001408541,0.00002590938,0.00038149,0.0007248395,0.00004918476,0.00001863014],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007023209,"about_ca_system_score_gemma":0.00004249004,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003342333,"about_ca_topic_score_gemma":0.00001407462,"domain_scores_codex":[0.9991464,0.00001047948,0.0001658165,0.0002716494,0.0002538422,0.0001518143],"domain_scores_gemma":[0.9982243,0.000445961,0.00007983714,0.001093898,0.0001217789,0.00003426276],"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.0001737712,0.0003099215,0.0009869178,0.000243728,0.00005647268,0.000002031801,0.001371568,0.004219034,0.005612778,0.6556489,0.07078657,0.2605883],"study_design_scores_gemma":[0.0009235273,0.0001942206,0.001265894,0.0001040203,0.000005809522,0.000008360842,0.00007211089,0.9177778,0.006536303,0.06845011,0.004517592,0.000144294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00688437,0.0001859216,0.9903334,0.0003581751,0.000376549,0.0004503629,0.00001498012,0.00005129104,0.001344891],"genre_scores_gemma":[0.5151376,0.00003473167,0.4824988,0.0003323316,0.0000752692,0.00004884879,0.000004044875,0.000009636447,0.001858763],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9135587,"threshold_uncertainty_score":0.3273288,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02071208964858298,"score_gpt":0.2749125890897304,"score_spread":0.2542004994411475,"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."}}