{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00353663,0.00008813807,0.0001883068,0.0006133108,0.0006623736,0.0001420008,0.001334203,0.00008024959,0.00006140238],"category_scores_gemma":[0.004084401,0.00007997143,0.0000973805,0.001479446,0.0004544363,0.0009016966,0.0004654542,0.0004203108,0.000004136406],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006742729,"about_ca_system_score_gemma":0.0004044347,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009838289,"about_ca_topic_score_gemma":0.00008380177,"domain_scores_codex":[0.9978316,0.0002805744,0.0003514289,0.0003214107,0.0007089704,0.0005060371],"domain_scores_gemma":[0.9952387,0.001485854,0.00004155817,0.0008981952,0.002183466,0.0001522034],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001681212,0.00009853287,0.0001008128,0.00002178432,0.00001327465,9.557906e-7,0.0003822999,0.0009587123,0.6368868,0.3603185,0.0001785874,0.001022852],"study_design_scores_gemma":[0.0004334766,0.0002728823,0.0007098306,0.00009239261,0.00000229641,0.000007548862,0.0002532617,0.07859649,0.73775,0.1809734,0.0007358185,0.0001726271],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6195061,0.00007741426,0.3768272,0.001800966,0.0001562366,0.0007328679,0.00004028097,0.00002377728,0.0008350998],"genre_scores_gemma":[0.824229,0.00003134038,0.1753732,0.00002384771,0.0000379931,0.00006515814,0.000002029116,0.0000108842,0.00022652],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2047229,"threshold_uncertainty_score":0.5094509,"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."}}