{"id":"W166953216","doi":"","title":"Vertex-Neighbor-Integrity of Composition Graphs of Paths.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Composition (language); Combinatorics; Graph; Art","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003894296,0.00063146,0.001041954,0.001976321,0.002861974,0.004921243,0.002461764,0.001976576,0.009154364],"category_scores_gemma":[0.03272441,0.000886447,0.0009389311,0.002428351,0.00306304,0.01541011,0.004203301,0.003382317,0.001937454],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001360923,"about_ca_system_score_gemma":0.002102877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002311626,"about_ca_topic_score_gemma":0.002264215,"domain_scores_codex":[0.994406,0.001417591,0.0004744913,0.001186632,0.001817322,0.0006978357],"domain_scores_gemma":[0.9689457,0.01253337,0.003471051,0.008841191,0.004774753,0.001434023],"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.0008994709,0.0002513529,0.00909613,0.0004377743,0.0001515711,0.0006182847,0.001477587,0.01752968,0.005548035,0.8372651,0.01109945,0.1156256],"study_design_scores_gemma":[0.00004053559,0.00007839174,0.001065262,0.00006322883,0.0001140131,0.0006267542,0.000591282,0.0431909,0.009998803,0.930934,0.01326915,0.00002770938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2130751,0.0007593595,0.7173731,0.003856082,0.0003337031,0.0003263658,0.003350765,0.002421001,0.05850443],"genre_scores_gemma":[0.8242564,0.0005550184,0.1527857,0.0005007586,0.0002687914,0.0001720024,0.003885747,0.0006216836,0.01695391],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009154364,"threshold_uncertainty_score":0.03062433,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01766759921015729,"score_gpt":0.2298022084600512,"score_spread":0.2121346092498939,"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."}}