{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001753461,0.0002933769,0.0003081476,0.0002080353,0.0009195508,0.0006980173,0.003215709,0.00007778283,0.0002727649],"category_scores_gemma":[0.0001314587,0.0002503784,0.0001717041,0.00136635,0.003125418,0.0007367032,0.0005395399,0.0003220273,0.0001634704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008922304,"about_ca_system_score_gemma":0.0001579074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006808429,"about_ca_topic_score_gemma":0.000001751653,"domain_scores_codex":[0.9965746,0.0001172984,0.0002854766,0.001230534,0.0008542654,0.0009378703],"domain_scores_gemma":[0.9971441,0.0008863285,0.00005973914,0.001352517,0.0001832058,0.0003741311],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004449286,0.000155393,0.000007561368,0.000005547255,0.000004458155,0.000009272608,0.0002175149,0.0002589908,0.00007325662,0.8749421,0.0002342529,0.1240472],"study_design_scores_gemma":[0.000419302,0.0006257218,0.0005302933,0.00003589476,0.000003927867,0.00002340885,0.00000214138,0.5550535,0.001487702,0.4383555,0.003133981,0.0003285946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09331227,0.00001535928,0.8937805,0.004185045,0.00111916,0.0003898416,0.00001094207,0.000318085,0.006868763],"genre_scores_gemma":[0.8387733,0.000004383018,0.1591988,0.001658619,0.0002449026,0.00002624062,9.457408e-7,0.00001167552,0.00008112418],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.745461,"threshold_uncertainty_score":0.9999949,"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."}}