{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001727002,0.0005641999,0.0005208915,0.0007690199,0.0004330815,0.0007444276,0.001055904,0.0006722266,0.001289471],"category_scores_gemma":[0.01149516,0.0004213063,0.0004376453,0.0006394638,0.001499129,0.00151108,0.00104236,0.0009897494,0.0002752615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009209456,"about_ca_system_score_gemma":0.001060569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001114921,"about_ca_topic_score_gemma":0.001194783,"domain_scores_codex":[0.9988452,0.0004130853,0.00004461951,0.0001902171,0.0004297518,0.00007701528],"domain_scores_gemma":[0.9927709,0.004816499,0.0006866325,0.0008762093,0.000699842,0.0001499895],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007367703,0.00003013629,0.0007481269,0.0001070945,0.00002168956,0.00008702389,0.00008915219,0.8671415,0.008997825,0.08578984,0.0004609279,0.03645312],"study_design_scores_gemma":[0.000004938218,0.00002753049,0.0001002077,0.000006708749,0.000004880017,0.00004558983,0.00001276482,0.9777055,0.002305758,0.01920212,0.0005772944,0.000006707937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01015075,0.00004619083,0.9889218,0.0000801894,0.000008831182,0.00003415256,0.00002172286,0.0000884372,0.0006480353],"genre_scores_gemma":[0.5855052,0.0003680361,0.4125724,0.0001122317,0.00003205697,0.0001652319,0.0001341158,0.0001101884,0.001000483],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001727002,"threshold_uncertainty_score":0.009133339,"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."}}