{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001217058,0.0003799124,0.0005969889,0.000211165,0.0002343624,0.0005463225,0.0009775251,0.0002585571,0.0001879512],"category_scores_gemma":[0.0001419462,0.0003171705,0.00007835227,0.0004037385,0.0001694349,0.001348336,0.0009656448,0.0006697106,0.0002025546],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003425597,"about_ca_system_score_gemma":0.0001033116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002163508,"about_ca_topic_score_gemma":0.000327695,"domain_scores_codex":[0.9972723,0.0001440607,0.0007297431,0.0007835939,0.0004716549,0.0005986341],"domain_scores_gemma":[0.9979394,0.0003178942,0.0002036779,0.001164512,0.0001142436,0.0002602349],"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.0009642067,0.002486177,0.08422075,0.005286437,0.000417998,0.003934653,0.0390227,0.0002274855,0.0183309,0.1994325,0.02815078,0.6175255],"study_design_scores_gemma":[0.01310745,0.000797119,0.3080345,0.00626254,0.0002006222,0.001190583,0.001804176,0.5818183,0.007717801,0.05185537,0.02308065,0.004130854],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.927765,0.001610857,0.0570186,0.001204115,0.003975555,0.00158726,0.00009051635,0.0001750838,0.006573069],"genre_scores_gemma":[0.9797289,0.0004458868,0.01884393,0.0002256111,0.0002033818,0.00004105414,0.00003832892,0.00003253548,0.0004403788],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6133946,"threshold_uncertainty_score":0.9999281,"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."}}