{"id":"W2159111594","doi":"10.1007/11534273_3","title":"Heap Building Bounds","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"","keywords":"Heap (data structure); Computer science; Programming language","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","open_science"],"consensus_categories":[],"category_scores_codex":[0.001003047,0.0006658649,0.0006255556,0.001252174,0.0005298835,0.001130663,0.005713522,0.0003592014,0.00006387063],"category_scores_gemma":[0.00006402631,0.0006542353,0.000243478,0.0009659621,0.001075241,0.0009449669,0.002468121,0.001239864,0.00008012934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003983729,"about_ca_system_score_gemma":0.0005742502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002423747,"about_ca_topic_score_gemma":0.0000785876,"domain_scores_codex":[0.9950795,0.0000319788,0.0006198456,0.001962643,0.001312626,0.0009934003],"domain_scores_gemma":[0.996846,0.0004435419,0.000268036,0.001968795,0.0002109824,0.0002626249],"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.000001827467,0.00002385571,0.00001213388,0.00001695149,0.000008722234,0.00006854819,0.0002753802,0.007702904,0.00005561001,0.1821365,0.00003898311,0.8096586],"study_design_scores_gemma":[0.00022505,0.0001298032,0.00006306035,0.000337942,0.000006123,0.0001620199,5.858964e-8,0.4562415,0.0006991116,0.5125263,0.02871845,0.0008905439],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00004164807,0.0009721681,0.984225,0.001538659,0.002867013,0.0002712562,0.000004870996,0.0003384818,0.009740902],"genre_scores_gemma":[0.0312233,0.00008825071,0.9633927,0.002717791,0.001580762,0.000008368082,0.000003261188,0.00004579169,0.0009398246],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.808768,"threshold_uncertainty_score":0.9999062,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02096265802757347,"score_gpt":0.2585022915845295,"score_spread":0.237539633556956,"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."}}