{"id":"W206344181","doi":"10.26421/qic13.5-6-10","title":"Perfect state transfer on signed graphs","year":2013,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Perfect graph theorem; Trivially perfect graph; Perfect graph; Mathematics; Combinatorics; Transfer (computing); Discrete mathematics; Induced subgraph; Distance-hereditary graph; State (computer science); Graph; Perfect power; Induced subgraph isomorphism problem; Line graph; Computer science; Algorithm; Pathwidth; Graph power; Vertex (graph theory); Voltage graph","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.0004804465,0.0003431863,0.0003606846,0.0005847525,0.0007942084,0.0009048484,0.000548845,0.000731669,0.004507635],"category_scores_gemma":[0.003408531,0.000189718,0.0006059157,0.0005300668,0.001540226,0.003275183,0.001046767,0.0009891763,0.0003925143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005973419,"about_ca_system_score_gemma":0.0003887276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004111185,"about_ca_topic_score_gemma":0.0002780689,"domain_scores_codex":[0.9995049,0.0001505428,0.00002429672,0.00008595554,0.0001193952,0.0001149207],"domain_scores_gemma":[0.9984737,0.0006783154,0.0002254547,0.0003406649,0.000131134,0.0001507495],"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.0001299109,0.00008346806,0.0006190455,0.00007553825,0.00001361862,0.0003441536,0.0002769612,0.03128655,0.01258085,0.9349926,0.0008152843,0.01878206],"study_design_scores_gemma":[0.00002542176,0.0001231195,0.0003719438,0.00001523424,0.000009860986,0.0001513302,0.0001066779,0.1652208,0.008662772,0.8228834,0.002407549,0.00002186041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6969795,0.0001848299,0.2732786,0.0004292837,0.00009046012,0.00008552349,0.0001194521,0.0003006209,0.0285317],"genre_scores_gemma":[0.976695,0.0001574557,0.0170108,0.00009034682,0.0000360981,0.00005587497,0.0001225709,0.0000657069,0.005765977],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004507635,"threshold_uncertainty_score":0.01507956,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006731649378793569,"score_gpt":0.2116086545933717,"score_spread":0.2048770052145781,"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."}}