{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.005291591,0.0001533633,0.0001709156,0.0001439605,0.001218625,0.0001309035,0.0007750884,0.00005932015,0.00003556603],"category_scores_gemma":[0.0004862887,0.00008243805,0.0001386069,0.0005226937,0.003574185,0.00008610866,0.0001629794,0.0001675177,0.00000385763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003012094,"about_ca_system_score_gemma":0.00002313237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.830711e-7,"about_ca_topic_score_gemma":5.766488e-7,"domain_scores_codex":[0.998372,0.00007972091,0.0002432586,0.0003453978,0.0004956778,0.0004639399],"domain_scores_gemma":[0.9964117,0.002749469,0.00006719267,0.0005560385,0.00009836094,0.0001172791],"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.0001725548,0.00003143715,0.00001137803,0.000006978835,0.000007935671,0.000001163152,0.0003934057,0.000004175745,0.0002940558,0.99179,0.0002036381,0.007083295],"study_design_scores_gemma":[0.0004841,0.0002304261,0.0002566615,0.00001977348,0.00001427405,0.00001160088,0.00001782191,0.006552978,0.007531444,0.9844534,0.0002990654,0.0001284309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3267691,0.000008420388,0.6670584,0.0004034869,0.0008499495,0.0003598804,0.000001590401,0.00007554454,0.004473636],"genre_scores_gemma":[0.9735404,0.000001280948,0.02544407,0.0007496388,0.0002221246,0.000009761578,3.589439e-7,0.00001261357,0.00001976543],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6467713,"threshold_uncertainty_score":0.9991375,"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."}}