{"id":"W2001490112","doi":"10.1007/s10479-010-0813-z","title":"Using size for bounding expressions of graph invariants","year":2010,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Bounding overwatch; Vertex (graph theory); Graph; Theory of computation; Upper and lower bounds; Discrete mathematics; Computer science; Algorithm; 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.01027031,0.002153319,0.002505122,0.004427638,0.001875237,0.005652477,0.004711338,0.002337298,0.009227837],"category_scores_gemma":[0.06294374,0.001993329,0.003573591,0.004159758,0.006888167,0.02686287,0.01073418,0.005958972,0.001456683],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004484502,"about_ca_system_score_gemma":0.003158942,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0027116,"about_ca_topic_score_gemma":0.002496886,"domain_scores_codex":[0.9846288,0.004745591,0.0009485051,0.002175738,0.005112728,0.002388685],"domain_scores_gemma":[0.9253376,0.05490307,0.003320839,0.01165543,0.003491016,0.001292053],"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.0005048778,0.00009654793,0.002696445,0.0002258489,0.00006760049,0.0001317168,0.0005974419,0.04659582,0.005391653,0.8570347,0.005415017,0.08124229],"study_design_scores_gemma":[0.00003679629,0.00009277194,0.0003547996,0.00007735038,0.0001068836,0.00007887349,0.00009993048,0.1769186,0.007801699,0.8085158,0.005856701,0.00005971966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0473884,0.0006912099,0.9284413,0.001912969,0.0003704083,0.0001368595,0.0004420605,0.003275906,0.01734097],"genre_scores_gemma":[0.6038042,0.0009685911,0.3734495,0.001252496,0.001205335,0.0005813445,0.001129037,0.004019737,0.01358981],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01027031,"threshold_uncertainty_score":0.05431527,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.4182748333101212,"score_gpt":0.5393114654582573,"score_spread":0.1210366321481361,"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."}}