{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001924628,0.0006414873,0.0005549275,0.0008183975,0.0004734907,0.0008798581,0.001221644,0.0007947974,0.001565517],"category_scores_gemma":[0.01341688,0.0004761773,0.0004629635,0.0007186014,0.00175661,0.001762424,0.001314986,0.0012559,0.0003454463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001051034,"about_ca_system_score_gemma":0.001174173,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00117186,"about_ca_topic_score_gemma":0.001339254,"domain_scores_codex":[0.9985933,0.0004995442,0.00005301253,0.0002410113,0.0005169565,0.00009614381],"domain_scores_gemma":[0.9916306,0.005591439,0.0007559378,0.001034277,0.0007971535,0.0001905986],"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.00008293049,0.00003516887,0.0008222436,0.0001260242,0.00002536958,0.00009475793,0.0001099638,0.8317541,0.009444474,0.1171094,0.0006443711,0.03975122],"study_design_scores_gemma":[0.000005262631,0.00002846034,0.0001014258,0.000008434517,0.000005187379,0.000046634,0.00001521039,0.9710866,0.002383428,0.02560225,0.0007100431,0.000007197802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008981811,0.00006015427,0.9898998,0.000104852,0.0000115458,0.00003654098,0.00002534702,0.00009690873,0.0007830534],"genre_scores_gemma":[0.5676257,0.0004564892,0.4299415,0.0001537152,0.00004290215,0.0001813724,0.0001564735,0.0001440693,0.0012977],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001924628,"threshold_uncertainty_score":0.01017857,"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."}}