{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001777039,0.0001556431,0.0001773127,0.00009776192,0.0002368475,0.0001683344,0.0005852217,0.00006232069,0.0002369731],"category_scores_gemma":[0.00004743059,0.0001391486,0.0001284165,0.0003685919,0.00007203583,0.0004525468,0.0001332652,0.0001071505,0.0002209963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003335671,"about_ca_system_score_gemma":0.00001174695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001686531,"about_ca_topic_score_gemma":0.00001261571,"domain_scores_codex":[0.9988315,0.00004079225,0.0001297935,0.0004493046,0.0002219606,0.0003266342],"domain_scores_gemma":[0.9988103,0.0003780285,0.0000417491,0.0005858803,0.00008864431,0.00009543152],"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.00002345876,0.0006658701,0.000005839233,0.00001157773,0.00004375552,0.000008493567,0.0005047327,0.001850021,0.0001789892,0.8745927,0.06842293,0.05369169],"study_design_scores_gemma":[0.0003432528,0.0002720222,0.00003110791,0.000009111479,0.00000292811,0.000003554355,0.000003198126,0.923847,0.0004999743,0.05837771,0.01640513,0.0002050589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007462964,0.00006037081,0.9169396,0.003372792,0.0005805272,0.0003283696,0.00001105691,0.0009641006,0.07028024],"genre_scores_gemma":[0.8236124,0.00001101116,0.1511323,0.001404288,0.0001586834,0.00006609153,0.000003910963,0.00002214225,0.02358914],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.921997,"threshold_uncertainty_score":0.5674314,"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."}}