{"id":"W2010962367","doi":"10.1016/s0304-3975(00)00019-0","title":"A space lower bound for st-connectivity on node-named JAGs","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"University of Toronto","keywords":"Upper and lower bounds; Combinatorics; Mathematics; Turing machine; Discrete mathematics; Path (computing); Logarithm; Directed graph; Space (punctuation); Computation; Computer science; Algorithm","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00413496,0.003153161,0.004379938,0.004276139,0.004260413,0.00935687,0.007435946,0.004290523,0.02618931],"category_scores_gemma":[0.03200342,0.001647362,0.003000405,0.008818612,0.005178551,0.02384402,0.01006913,0.008285046,0.003877908],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004539959,"about_ca_system_score_gemma":0.003748452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003630427,"about_ca_topic_score_gemma":0.005536236,"domain_scores_codex":[0.993076,0.001548828,0.0003422663,0.001002937,0.002134155,0.001895897],"domain_scores_gemma":[0.9438062,0.03838978,0.002495506,0.008825491,0.003198345,0.003284698],"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.003077824,0.0006942692,0.004354126,0.001849674,0.0003712747,0.0005003954,0.00160435,0.2411789,0.01318972,0.5798799,0.05237912,0.1009205],"study_design_scores_gemma":[0.0001917708,0.0004010643,0.001124251,0.000199355,0.0003222286,0.0005179285,0.000437063,0.3828062,0.005632577,0.5969852,0.0112832,0.00009901651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2473429,0.006861178,0.6103158,0.01470755,0.001096306,0.0006259862,0.006905765,0.005769331,0.1063752],"genre_scores_gemma":[0.8329423,0.004221975,0.1277031,0.002410151,0.001539291,0.0007937949,0.004534501,0.001909467,0.02394549],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02618931,"threshold_uncertainty_score":0.08761191,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01434545290620183,"score_gpt":0.2586123640249335,"score_spread":0.2442669111187317,"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."}}