{"id":"W2401927767","doi":"","title":"Counting embeddings of a chain into a binary tree.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Binary tree; Random binary tree; Tree (set theory); Chain (unit); Binary number; Combinatorics; Arithmetic; Physics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003067699,0.0001335557,0.0002374884,0.00009474704,0.0001068985,0.00002682534,0.0004142467,0.00004643099,0.00000309447],"category_scores_gemma":[0.00007211443,0.0001262211,0.00005833186,0.0004429963,0.00004274287,0.0006930367,0.0001521353,0.00009716074,0.00001189723],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003601552,"about_ca_system_score_gemma":0.00004762894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005033441,"about_ca_topic_score_gemma":0.000003744098,"domain_scores_codex":[0.9988977,0.00003858433,0.0002921107,0.0002870945,0.000251994,0.0002325051],"domain_scores_gemma":[0.999063,0.00006108182,0.000175507,0.0005335716,0.00009958514,0.0000672689],"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.000004924405,0.00006054412,0.0002225967,0.00001880965,0.000005679419,0.0000160923,0.000915731,0.00001069491,0.005813267,0.9833953,0.0005457004,0.008990637],"study_design_scores_gemma":[0.002078085,0.001155606,0.006742878,0.0004469241,0.0000145698,0.00004805551,0.0004370537,0.02678553,0.01966633,0.8999234,0.04185069,0.0008508219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.874488,0.0008761959,0.1147146,0.001204022,0.002209891,0.0003719511,0.000004929259,0.0004190841,0.005711333],"genre_scores_gemma":[0.9694424,0.00001103815,0.03025094,0.0001452088,0.000009282066,0.000006173326,0.000003449848,0.000006592739,0.0001249288],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0949544,"threshold_uncertainty_score":0.5147145,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008191358697005907,"score_gpt":0.2461654199363602,"score_spread":0.2379740612393543,"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."}}