{"id":"W2026608328","doi":"10.5555/1756384.1756394","title":"Prime decompositions of regular prefix codes","year":2002,"lang":"en","type":"article","venue":"International Conference on Implementation and application of automata","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Prefix code; Prefix; Prime (order theory); Computer science; Automaton; Decomposition; Code (set theory); Theoretical computer science; Discrete mathematics; Mathematics; Algorithm; Linear code; Combinatorics; Block code; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009419193,0.0004760905,0.0006883824,0.0015648,0.001251407,0.002392285,0.0005874147,0.0007054227,0.008816199],"category_scores_gemma":[0.003389585,0.0005613404,0.0008306215,0.0009585863,0.001699082,0.002808382,0.001934842,0.001573812,0.001397382],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001011326,"about_ca_system_score_gemma":0.0008928381,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006686886,"about_ca_topic_score_gemma":0.0007718299,"domain_scores_codex":[0.9993273,0.0001463383,0.00005150654,0.0001180771,0.0001842326,0.0001726729],"domain_scores_gemma":[0.9979681,0.0008803933,0.0001869773,0.0003556001,0.0003201456,0.0002886895],"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.00008556152,0.00002110874,0.0001866696,0.00002075729,0.000005011608,0.00005615614,0.0001907673,0.002279461,0.00153551,0.9851022,0.00112368,0.009393143],"study_design_scores_gemma":[0.00001621793,0.00002353387,0.0001094523,0.00001152765,0.000007680611,0.0000699923,0.00006052028,0.01201783,0.001346078,0.983275,0.003051956,0.00001015073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4589841,0.000668467,0.4686506,0.001048887,0.0003300314,0.0001657976,0.000587642,0.000773675,0.06879069],"genre_scores_gemma":[0.8594021,0.0005379826,0.1023566,0.0003954719,0.000228865,0.0001977004,0.0008948232,0.0004504743,0.03553604],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008816199,"threshold_uncertainty_score":0.02949315,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03602243854098058,"score_gpt":0.336521889736297,"score_spread":0.3004994511953165,"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."}}