{"id":"W2049562387","doi":"10.1007/s11512-009-0118-0","title":"Long and short paths in uniform random recursive dags","year":2010,"lang":"sv","type":"article","venue":"Arkiv för matematik","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Directed acyclic graph; Combinatorics; Mathematics; Path (computing); Node (physics); Binary logarithm; Random graph; Root (linguistics); Shortest path problem; Constant (computer programming); Discrete mathematics; Graph; Computer science; Physics","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.003711881,0.0005691598,0.001061303,0.003495514,0.001532281,0.002153454,0.001891711,0.00151333,0.005455755],"category_scores_gemma":[0.03513972,0.001081238,0.0009032966,0.002737735,0.003004833,0.005946704,0.002751677,0.001679513,0.0007408737],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002768342,"about_ca_system_score_gemma":0.001241899,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003654738,"about_ca_topic_score_gemma":0.006794535,"domain_scores_codex":[0.9981012,0.0006502157,0.0001330495,0.0004277054,0.0002912299,0.0003966659],"domain_scores_gemma":[0.9726573,0.0204339,0.002740817,0.001795781,0.001063355,0.001308783],"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.000386984,0.00007961236,0.006217264,0.000318206,0.00005735762,0.0005015616,0.0009918549,0.1599643,0.00180774,0.7931849,0.004393016,0.03209735],"study_design_scores_gemma":[0.00005972787,0.00005221615,0.001192746,0.00006746595,0.00003261158,0.000246399,0.0001756,0.2690707,0.0007705416,0.7255554,0.002735118,0.00004144693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4901194,0.002111064,0.4937763,0.001978772,0.0001025419,0.0001600065,0.001707971,0.001022702,0.009021202],"genre_scores_gemma":[0.9406714,0.001131236,0.04719181,0.0003967878,0.0001002105,0.0002871597,0.001137502,0.000317974,0.008765868],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005455755,"threshold_uncertainty_score":0.02008581,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01136807914886571,"score_gpt":0.2503085451580031,"score_spread":0.2389404660091374,"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."}}