{"id":"W2080646231","doi":"10.1109/isit.2012.6281807","title":"Analysis and design of irregular graphs for node-based verification-based recovery algorithms in compressed sensing","year":2012,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Algorithm; Computer science; Probabilistic analysis of algorithms; Node (physics); Compressed sensing; Context (archaeology); Probabilistic logic; Computational complexity theory; Iterative method; Dimension (graph theory); Decoding methods; Theoretical computer science; Mathematics; Combinatorics","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.0002192219,0.0001255726,0.0002617646,0.0004142385,0.00002546652,0.00001577617,0.00005754599,0.00007502909,0.000006102868],"category_scores_gemma":[0.00001971071,0.0001281836,0.00008509786,0.0004390703,0.0000343963,0.00007875599,0.000005664486,0.00005006043,3.116845e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002255723,"about_ca_system_score_gemma":0.00001154542,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008172208,"about_ca_topic_score_gemma":0.000008273823,"domain_scores_codex":[0.9993227,0.00004221456,0.0002239988,0.0001299479,0.00008711239,0.0001940954],"domain_scores_gemma":[0.999321,0.0002758963,0.00004559776,0.0002507255,0.00006166844,0.00004508902],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007392158,0.00008215637,0.008362346,0.00007162977,0.000271379,0.000001133148,0.000072551,0.841725,0.1354115,0.00009380512,0.0003723867,0.01346219],"study_design_scores_gemma":[0.000245834,0.00001527677,0.003883539,0.00002583426,0.000101324,2.000854e-7,0.000009669693,0.7213991,0.2740259,0.0001387899,0.00004006863,0.0001144588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05773421,0.0002552413,0.9414389,0.00001751713,0.00004711701,0.0002421808,0.000007457087,0.0001910868,0.00006627144],"genre_scores_gemma":[0.7406452,0.000008908161,0.2592519,0.00004009165,0.000009283229,0.00000815963,0.00001844558,0.00001594815,0.000002125327],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.682911,"threshold_uncertainty_score":0.5227176,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02701347738049434,"score_gpt":0.2402903385315523,"score_spread":0.213276861151058,"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."}}