{"id":"W2122388370","doi":"10.1016/j.tcs.2007.03.003","title":"Bounds on the bisection width for random d -regular graphs","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":32,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Generalitat de Catalunya","keywords":"Bisection; Mathematics; Upper and lower bounds; Asymptotically optimal algorithm; Combinatorics; Bisection method; Random graph; Discrete mathematics; Value (mathematics); Graph; Algorithm; Statistics; Geometry; Mathematical analysis","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01051798,0.003495175,0.004583542,0.007639469,0.003195653,0.01019489,0.009351167,0.004811378,0.01024077],"category_scores_gemma":[0.07719286,0.003158828,0.002566779,0.006451339,0.007688997,0.02435308,0.01039853,0.01333312,0.001773856],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005561382,"about_ca_system_score_gemma":0.002000535,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001190687,"about_ca_topic_score_gemma":0.001580367,"domain_scores_codex":[0.9934202,0.00199913,0.0003898205,0.001793846,0.001352345,0.001044702],"domain_scores_gemma":[0.8386626,0.1321593,0.006433904,0.01202853,0.003827272,0.006888462],"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.001858373,0.0003651694,0.004680716,0.0009574608,0.0003054616,0.0002392844,0.001455881,0.08737246,0.009507643,0.8432485,0.009660398,0.04034872],"study_design_scores_gemma":[0.00009565418,0.00009660302,0.000704533,0.0001872373,0.0001331395,0.0002348863,0.0002209463,0.1752601,0.0029157,0.8177299,0.002340016,0.00008131727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3139586,0.01177843,0.6104341,0.01231317,0.0005236136,0.0002334672,0.002607145,0.002546865,0.04560468],"genre_scores_gemma":[0.8711822,0.006465332,0.1061111,0.002246308,0.001180417,0.0008653993,0.001912071,0.001936088,0.008101034],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01051798,"threshold_uncertainty_score":0.05562508,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02249931548357978,"score_gpt":0.2983433027230205,"score_spread":0.2758439872394408,"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."}}