{"id":"W2521092122","doi":"10.21136/cmj.2017.0408-16","title":"A new algorithm for approximating the least concave majorant","year":2017,"lang":"en","type":"preprint","venue":"Czechoslovak Mathematical Journal","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Western University","funders":"","keywords":"Algorithm; Computer science","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","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.005108959,0.0005257094,0.0009322492,0.0001458195,0.001213687,0.00485809,0.005212844,0.0003699314,0.00006998049],"category_scores_gemma":[0.001461943,0.0003299969,0.0007582416,0.000100323,0.0001684964,0.0004461676,0.00191352,0.002199447,0.00008926341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001260766,"about_ca_system_score_gemma":0.0008145801,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006347869,"about_ca_topic_score_gemma":2.928334e-7,"domain_scores_codex":[0.9962432,0.000348687,0.001115729,0.0006342476,0.0008950056,0.0007630922],"domain_scores_gemma":[0.9948586,0.001167879,0.00128153,0.001829671,0.0004329153,0.0004294076],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001271653,0.00006646472,5.316436e-7,0.0002309128,0.0001909337,0.0001158076,0.001681268,0.00004322147,0.0001957803,0.02906406,0.0087595,0.9596388],"study_design_scores_gemma":[0.0008302499,0.00006055125,0.000004625442,0.000731164,0.00009574436,0.00128897,0.00005474801,0.3249002,0.0006706797,0.6688965,0.002115155,0.0003514444],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000308459,0.0007809401,0.9895586,0.003694657,0.001798138,0.0008137473,0.00001068125,0.000119761,0.003192614],"genre_scores_gemma":[0.000432109,0.00003709951,0.9945757,0.0004203341,0.002031671,0.00005543114,0.000002492647,0.00005556032,0.00238957],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9592873,"threshold_uncertainty_score":0.9999152,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06053468335902834,"score_gpt":0.3406560035180794,"score_spread":0.2801213201590511,"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."}}