{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002647344,0.0008519206,0.001577264,0.00225064,0.001686896,0.002728572,0.002739032,0.001801157,0.00516465],"category_scores_gemma":[0.03044995,0.001494968,0.0007807022,0.001960975,0.003592568,0.006876342,0.00328349,0.001915841,0.0006854322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002310507,"about_ca_system_score_gemma":0.0006722602,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001569539,"about_ca_topic_score_gemma":0.001703316,"domain_scores_codex":[0.9980702,0.0008353993,0.00006550086,0.0004180924,0.0003342655,0.0002766152],"domain_scores_gemma":[0.9665859,0.02783015,0.001518141,0.001729335,0.001020229,0.001316277],"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.0004984345,0.0001514148,0.007781378,0.0005353034,0.00008195877,0.0003119103,0.0009237816,0.07077427,0.008349987,0.8720159,0.008093293,0.03048224],"study_design_scores_gemma":[0.00007855483,0.00009577419,0.003073971,0.00009965685,0.0000521576,0.0005951827,0.0002823892,0.2787012,0.003341826,0.709933,0.003700371,0.00004586085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5898058,0.003258615,0.3688424,0.00420713,0.0001062223,0.0001377292,0.001208393,0.0009881622,0.03144545],"genre_scores_gemma":[0.9429568,0.001536198,0.05094285,0.0003856908,0.0002050724,0.0002813581,0.0007124415,0.000260796,0.002718851],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00516465,"threshold_uncertainty_score":0.01727748,"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."}}