{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001943483,0.0001060606,0.0002159718,0.0001236635,0.00006914311,0.00001609686,0.0008369132,0.0000447953,0.00001019924],"category_scores_gemma":[0.00001530773,0.0001017992,0.00008422397,0.0004751619,0.0001023245,0.0005307534,0.0002590407,0.0001145241,0.00001536232],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000148233,"about_ca_system_score_gemma":0.00002972026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000628492,"about_ca_topic_score_gemma":7.533455e-7,"domain_scores_codex":[0.9989676,0.00005355998,0.000269678,0.0002257154,0.0003239391,0.0001594355],"domain_scores_gemma":[0.9990466,0.00005786055,0.0001506,0.0005718261,0.0001240112,0.00004909679],"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.000004902893,0.0002383811,0.005098753,0.00002294093,0.00002322829,0.00001419711,0.0001665658,0.000001222107,0.0008136427,0.9880742,0.002436533,0.00310544],"study_design_scores_gemma":[0.001716821,0.0004241954,0.07579271,0.00008467625,0.00002392374,0.00001498622,0.00002875218,0.01000628,0.03197945,0.8790021,0.0005868074,0.0003392907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9860077,0.0001066766,0.007524165,0.0001609605,0.001766419,0.0001703562,0.00001585946,0.00009768686,0.004150169],"genre_scores_gemma":[0.9955441,0.00006445659,0.004288508,0.00003726469,0.000002094358,0.000003561055,0.00001683555,0.000005053383,0.00003809483],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1090721,"threshold_uncertainty_score":0.4151252,"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."}}