{"id":"W1631636474","doi":"10.1016/j.dam.2015.06.011","title":"A tie-break model for graph search","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Graph; Theoretical 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.001022919,0.0002145344,0.0002859755,0.0001845823,0.0001348403,0.0001555505,0.001409218,0.0000814661,0.00000228396],"category_scores_gemma":[0.00007988932,0.000182452,0.000109045,0.0005004382,0.0001338161,0.0002626867,0.000484953,0.0001836022,0.00006961945],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005112031,"about_ca_system_score_gemma":0.0001132212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001116838,"about_ca_topic_score_gemma":0.00000165248,"domain_scores_codex":[0.9979805,0.00001831015,0.0003124096,0.0004359536,0.0006485961,0.0006042666],"domain_scores_gemma":[0.9980971,0.0002393531,0.00008154778,0.001071109,0.0001947164,0.0003161702],"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.00002268119,0.00007059652,0.000001346118,0.00009225441,0.0000201162,0.000001540885,0.003586892,0.004232825,0.001151899,0.9868618,0.001193279,0.002764748],"study_design_scores_gemma":[0.0003704452,0.0000305723,3.109332e-7,0.000007333661,0.000004340573,0.000003455911,0.0002616924,0.475597,0.001676143,0.5217174,0.0001941799,0.0001371064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002019223,0.00003783179,0.9864867,0.0003675911,0.00004200674,0.0008513321,0.00001671551,0.0002360075,0.00994259],"genre_scores_gemma":[0.1772195,0.000005265396,0.8216083,0.000171704,0.00003620104,0.0003444412,0.00001029502,0.00004398177,0.000560299],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4713642,"threshold_uncertainty_score":0.7440175,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08109971346624698,"score_gpt":0.3344557456080762,"score_spread":0.2533560321418292,"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."}}