{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001737478,0.0001555273,0.0001272645,0.0002376636,0.0002221309,0.0005010898,0.0001936096,0.00004271845,0.00001131985],"category_scores_gemma":[0.00001219653,0.0001293543,0.00004880376,0.0003028285,0.00003089447,0.001390133,0.0000397352,0.0001390636,0.0002291432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001399595,"about_ca_system_score_gemma":0.0000264006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004232665,"about_ca_topic_score_gemma":6.722917e-7,"domain_scores_codex":[0.9989842,0.0000630708,0.0003162145,0.0001673384,0.00025717,0.0002120764],"domain_scores_gemma":[0.9994742,0.00009715815,0.00006611767,0.0001492905,0.0001135382,0.00009971637],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009348316,0.00003546465,0.0000392348,0.00003708374,0.00001359783,9.325558e-7,0.004188499,0.02642502,0.0001139356,0.08788119,0.0007137584,0.8805419],"study_design_scores_gemma":[0.0004157382,0.0002832427,0.005088124,0.00002004113,0.000001833358,0.00001254679,0.00005169914,0.9628431,0.0001526632,0.0304728,0.0004809815,0.0001772399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4177762,0.00001154613,0.5807123,0.0006008924,0.0001563716,0.0001872722,0.000001394699,0.0001889084,0.0003651393],"genre_scores_gemma":[0.9938131,0.00000793812,0.004913846,0.001198404,0.00001581897,0.00001697668,0.00001740774,0.000005050982,0.00001145958],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9364181,"threshold_uncertainty_score":0.5274914,"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."}}