{"id":"W2137571436","doi":"10.1109/sfcs.1993.366864","title":"Time-space lower bounds for directed s-t connectivity on JAG models","year":2002,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Office of Naval Research; Max-Planck-Gesellschaft; University of Toronto","keywords":"Combinatorics; Omega; Upper and lower bounds; Vertex (graph theory); Path (computing); Graph; Directed graph; Mathematics; Space (punctuation); Discrete mathematics; Physics; Computer science","routes":{"ca_aff":true,"ca_fund":true,"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.00349214,0.002825878,0.002413938,0.002324732,0.002956555,0.005775009,0.005439208,0.003629373,0.01491246],"category_scores_gemma":[0.03363045,0.001314094,0.003314531,0.003506393,0.004854804,0.02004893,0.006769033,0.005580243,0.002075818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005365161,"about_ca_system_score_gemma":0.003009701,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005470606,"about_ca_topic_score_gemma":0.007389456,"domain_scores_codex":[0.9948568,0.001284257,0.0003293286,0.00117462,0.001204602,0.001150355],"domain_scores_gemma":[0.9493334,0.03884877,0.003089709,0.004384106,0.002062346,0.002281534],"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.002099157,0.0006208092,0.007290791,0.001147979,0.0002644844,0.0006812795,0.001397916,0.3861375,0.01538707,0.4544908,0.03374903,0.09673318],"study_design_scores_gemma":[0.000125765,0.0002238305,0.0006491108,0.00008030488,0.0001474927,0.0004311063,0.0002990897,0.6459156,0.006627757,0.3396278,0.005818456,0.00005371696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2202953,0.002773512,0.7196771,0.01061386,0.0003402804,0.0007463628,0.003096511,0.004415597,0.03804155],"genre_scores_gemma":[0.7777846,0.002231266,0.2026322,0.00135407,0.0004417085,0.0009306495,0.003472683,0.001112716,0.0100402],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01491246,"threshold_uncertainty_score":0.04988712,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04273537231301884,"score_gpt":0.2397068087434337,"score_spread":0.1969714364304148,"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."}}