{"id":"W2169742131","doi":"10.1109/dcc.1996.488312","title":"Free energy coding","year":2002,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Information Technology Research Centre","keywords":"Code word; Maximization; Computer science; Algorithm; Code (set theory); Parity-check matrix; Energy (signal processing); Source code; Coding (social sciences); Mathematics; Mathematical optimization; Decoding methods; Statistics","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":[],"consensus_categories":[],"category_scores_codex":[0.00002957165,0.00004134987,0.00004096423,0.00002538739,0.00006334468,0.00007766799,0.0007146267,0.00001698714,0.0003603749],"category_scores_gemma":[0.000007544552,0.00003115809,0.00001597548,0.00009797331,0.00000688173,0.0003505493,0.0004402623,0.00002459784,0.00006307957],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000537389,"about_ca_system_score_gemma":0.000001864902,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004953059,"about_ca_topic_score_gemma":0.000003523304,"domain_scores_codex":[0.9995741,0.000008582126,0.00005907243,0.0001428799,0.0001090178,0.0001063316],"domain_scores_gemma":[0.999395,0.00002072116,0.00001377504,0.0005141981,0.0000123828,0.00004393066],"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":[1.231092e-7,0.00002005847,0.00001748437,6.702924e-7,0.000001663004,0.000008457502,0.00004127343,0.000005455259,0.0002214431,0.5832409,0.2085686,0.2078739],"study_design_scores_gemma":[0.0001290368,0.0000156815,0.00008112727,0.000004323707,4.44347e-7,0.000008587447,0.000002512397,0.7667803,0.001562397,0.006336642,0.2249955,0.00008351363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00004681034,0.0001042844,0.9299994,0.0005984302,0.0001695391,0.000007585639,0.000001054434,0.0001361731,0.06893672],"genre_scores_gemma":[0.4945796,0.0001824389,0.4783034,0.003045689,0.000285944,0.000007363143,0.000003073463,0.00001009909,0.02358233],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7667748,"threshold_uncertainty_score":0.3945853,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02306089588655706,"score_gpt":0.2083030601445635,"score_spread":0.1852421642580064,"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."}}