{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001415259,0.001955041,0.001400134,0.002668737,0.002198488,0.006382676,0.004193977,0.001848203,0.09241145],"category_scores_gemma":[0.007732794,0.001744899,0.001492381,0.004439024,0.001553333,0.01375247,0.005920674,0.005951171,0.04114534],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0023416,"about_ca_system_score_gemma":0.001920816,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001684585,"about_ca_topic_score_gemma":0.00242935,"domain_scores_codex":[0.9976152,0.0002952694,0.0001496886,0.0005248268,0.001020181,0.0003948392],"domain_scores_gemma":[0.9957283,0.001385694,0.0001168143,0.001953441,0.0006321424,0.0001835631],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001500944,0.0001174817,0.0003303556,0.0004380467,0.00002977959,0.00006909081,0.0003139433,0.005196861,0.002525511,0.632215,0.09078821,0.2678255],"study_design_scores_gemma":[0.00002649333,0.00003690269,0.0003797832,0.0003433847,0.00007346602,0.0002216287,0.0001211089,0.01477803,0.009494212,0.727181,0.2472958,0.00004825096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006935499,0.004806861,0.5253119,0.002468644,0.001138002,0.0001693896,0.002572233,0.009241675,0.4473558],"genre_scores_gemma":[0.2070169,0.008940041,0.4523842,0.001682868,0.001441591,0.0005998848,0.01121079,0.01058346,0.3061402],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.09241145,"threshold_uncertainty_score":0.3091471,"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."}}