{"id":"W2097790167","doi":"10.1109/isit.2001.935987","title":"On the Poor-Verdu conjecture for the reliability function of channels with memory","year":2002,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Upper and lower bounds; Counterexample; Conjecture; Erasure; Computer science; Decoding methods; Reliability (semiconductor); Function (biology); Binary number; Coding (social sciences); Mathematics; Algorithm; Discrete mathematics; Statistics; Arithmetic","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.0002195816,0.00008015264,0.0000843538,0.00001973912,0.00007060555,0.00001212903,0.000241116,0.00004976755,0.0002781227],"category_scores_gemma":[0.00004303924,0.00003799247,0.00003918736,0.00009784416,0.00006320806,0.00004334043,0.00001926746,0.0001424761,0.000005491877],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002103391,"about_ca_system_score_gemma":0.000002334577,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001532224,"about_ca_topic_score_gemma":0.00001617374,"domain_scores_codex":[0.9996048,0.00002812654,0.0001123766,0.00007181999,0.0001005323,0.00008241154],"domain_scores_gemma":[0.9986451,0.0006303809,0.00002704095,0.0006303694,0.00005538039,0.00001175198],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002987759,0.0004002841,0.0001063955,0.000457807,0.0004898586,4.804765e-7,0.007350754,0.226919,0.006144838,0.3140151,0.3739782,0.06983846],"study_design_scores_gemma":[0.0008957914,0.0006836849,0.0005800354,0.0001040156,0.00007418843,0.000004711363,0.001096872,0.6764601,0.233171,0.01425522,0.07223251,0.0004419023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5026859,0.001474013,0.3958756,0.02381948,0.0004870453,0.004595888,0.00003911017,0.002585688,0.06843726],"genre_scores_gemma":[0.9988104,0.00006014471,0.0004875722,0.0002744609,0.00002200637,0.0001450017,0.000001626435,0.00001532617,0.0001834531],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4961245,"threshold_uncertainty_score":0.3045248,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01798386297064743,"score_gpt":0.2038228570142434,"score_spread":0.1858389940435959,"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."}}