{"id":"W1977168723","doi":"10.5555/338219.338594","title":"Restructuring ordered binary trees","year":2000,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Restructuring; Displacement (psychology); Binary tree; Node (physics); Binary number; Tree (set theory); Sequence (biology); Order (exchange); Mathematics; Value (mathematics); Combinatorics; Computer science; Algorithm; Engineering; Structural engineering; Statistics; Arithmetic; Business; Chemistry","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00003809344,0.00006121269,0.00005719448,0.00002974798,0.0000941916,0.00008965887,0.0005280186,0.00002296015,0.000944773],"category_scores_gemma":[0.000002499396,0.0000448783,0.00001921357,0.0001341467,0.00001216349,0.000472657,0.0001457375,0.00004639585,0.0001815749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005873151,"about_ca_system_score_gemma":0.00001335616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007022454,"about_ca_topic_score_gemma":0.000005148074,"domain_scores_codex":[0.9994433,0.00001461734,0.00008418028,0.000205419,0.0001166305,0.0001358841],"domain_scores_gemma":[0.9994749,0.000015865,0.00001163823,0.0004382975,0.000009416828,0.00004982195],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000043617,0.00002154165,0.0001127518,0.000001840859,0.000003198911,0.000027967,0.00009446902,0.0003147429,0.0007396842,0.008393467,0.007853122,0.9824328],"study_design_scores_gemma":[0.0007754772,0.0001595497,0.0678292,0.00003903052,0.000003241698,0.00008105592,0.00002284088,0.6038841,0.004774131,0.01518671,0.3067273,0.0005173885],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5234181,0.0003317952,0.3323481,0.001665349,0.0005074216,0.0001729757,0.000004466619,0.001115855,0.1404359],"genre_scores_gemma":[0.6833749,0.00006769018,0.3055416,0.0004225544,0.000120136,0.000004392329,0.000005868143,0.00000778909,0.01045507],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9819155,"threshold_uncertainty_score":0.9999685,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00995584618535748,"score_gpt":0.2252059394536154,"score_spread":0.215250093268258,"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."}}