{"id":"W4301509221","doi":"","title":"Parking functions, tree depth and factorizations of the full cycle into transpositions","year":2016,"lang":"en","type":"article","venue":"BIROn (Birkbeck, University of London)","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Tree (set theory); Computer science; Theoretical computer science; Mathematics; Combinatorics","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.0004953385,0.0004283183,0.0004942912,0.001866599,0.0008692341,0.001585653,0.0004772045,0.0003941269,0.004838599],"category_scores_gemma":[0.002568414,0.0002337388,0.0005235226,0.001128794,0.002115441,0.002806259,0.0008701618,0.0008954779,0.0007084092],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008634639,"about_ca_system_score_gemma":0.0004648684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001412174,"about_ca_topic_score_gemma":0.001431806,"domain_scores_codex":[0.9997146,0.00004094224,0.00001457916,0.00006488666,0.00006831198,0.00009671598],"domain_scores_gemma":[0.9988445,0.0004499043,0.000227531,0.00009766631,0.0001350964,0.0002452625],"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.00004307531,0.00001563452,0.001087568,0.00003105091,0.000004850134,0.00008439063,0.0002552937,0.002578328,0.001627643,0.9827567,0.0007955353,0.01071998],"study_design_scores_gemma":[0.00001022444,0.000037886,0.001480294,0.00001973737,0.000009476001,0.0002752652,0.0001604686,0.01320181,0.001759343,0.9792924,0.003726394,0.00002671818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7908804,0.001116122,0.1522855,0.000622871,0.0001080363,0.00003547251,0.0006265735,0.0003345272,0.05399049],"genre_scores_gemma":[0.9794281,0.0004980995,0.0128187,0.00009225273,0.0001080035,0.000030292,0.0003002545,0.00008184207,0.006642463],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004838599,"threshold_uncertainty_score":0.01618665,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01790564097244673,"score_gpt":0.2234475988749557,"score_spread":0.205541957902509,"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."}}