{"id":"W1969856863","doi":"10.1137/120898528","title":"On the Maximum Density of Graphs with Unique-Path Labelings","year":2013,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics; Edge-graceful labeling; Vertex (graph theory); Lemma (botany); Path graph; Path (computing); Graph labeling; Graph; Discrete mathematics; Induced path; Upper and lower bounds; Simple graph; Longest path problem; Graph power; Shortest path problem; Line graph; Computer science","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.0008423724,0.000217079,0.0002839199,0.0001539647,0.0002605485,0.0002371616,0.0008245114,0.00006083285,0.00004740983],"category_scores_gemma":[0.0001286156,0.0001066158,0.0001298407,0.0004153807,0.0001307772,0.0002108061,0.0001026164,0.0004467474,0.00008228142],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001789079,"about_ca_system_score_gemma":0.00005429432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001144729,"about_ca_topic_score_gemma":0.000001321061,"domain_scores_codex":[0.9982343,0.0001056061,0.0004575287,0.0002051703,0.0006956763,0.0003016824],"domain_scores_gemma":[0.9979528,0.0003718333,0.0004752305,0.0007184821,0.0003241697,0.0001575502],"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.00001007494,0.0001683098,0.00008259999,0.00003892644,0.00005780497,0.00001570071,0.001074944,0.0001744266,0.001074062,0.9940097,0.002760638,0.0005327913],"study_design_scores_gemma":[0.0003419086,0.0006397748,0.0001367165,0.0005152702,0.00001919394,0.0001518308,0.0002005341,0.01064968,0.004168018,0.9829473,0.00004553275,0.0001842136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9280582,0.00005604411,0.06374734,0.004184078,0.0001391937,0.0003393249,0.00000182158,0.00008580936,0.003388213],"genre_scores_gemma":[0.9257663,0.0000351882,0.07307968,0.0009122454,0.000006152798,0.00000786932,3.942392e-7,0.00002035263,0.000171761],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0110624,"threshold_uncertainty_score":0.4347667,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01161458247781246,"score_gpt":0.2120082200075993,"score_spread":0.2003936375297868,"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."}}