{"id":"W2952534663","doi":"10.48550/arxiv.1204.5136","title":"Analysis and Design of Irregular Graphs for Node-Based Verification-Based Recovery Algorithms in Compressed Sensing","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Algorithm; Compressed sensing; Node (physics); Computer science; Context (archaeology); Probabilistic analysis of algorithms; Probabilistic logic; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002311226,0.0002874418,0.0005395843,0.0008998187,0.00004641177,0.00002640901,0.0002262573,0.0002943501,0.000004809677],"category_scores_gemma":[0.0000193778,0.0003701402,0.0002412942,0.0006866697,0.00009602041,0.00007858931,0.00006242316,0.0002341676,5.392851e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001058556,"about_ca_system_score_gemma":0.00005552094,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001978246,"about_ca_topic_score_gemma":0.00002439442,"domain_scores_codex":[0.9988599,0.0001087961,0.0002554641,0.0004568189,0.00006236239,0.0002566804],"domain_scores_gemma":[0.9986579,0.0003099719,0.0001690479,0.0006439864,0.0001435391,0.00007553818],"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.00008418431,0.00004109144,0.002506423,0.0001264626,0.0003223192,0.00001147137,0.00002725748,0.9932075,0.002844017,0.0001286879,0.00003141442,0.0006691348],"study_design_scores_gemma":[0.0004831624,0.00001944367,0.002339395,0.0001698879,0.00070207,2.220598e-7,0.00001547084,0.9713248,0.02238175,0.002196899,0.00001986114,0.0003470163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1619241,0.0001666504,0.8370956,0.000006267801,0.0001005615,0.0004116325,0.00004519441,0.0002077845,0.0000421953],"genre_scores_gemma":[0.9598121,0.00007303037,0.03993877,0.00001809213,0.00001593779,0.000001963221,0.00009614844,0.00003689016,0.000007040224],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.797888,"threshold_uncertainty_score":0.9998751,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07079817843483065,"score_gpt":0.1925939438491626,"score_spread":0.121795765414332,"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."}}