{"id":"W3081124664","doi":"10.1007/s11128-020-02758-7","title":"Quantum walk inspired algorithm for graph similarity and isomorphism","year":2020,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Graph isomorphism; Quantum walk; Quantum computer; Computer science; Quantum algorithm; Isomorphism (crystallography); Quantum; Graph; Algorithm; Theoretical computer science; Line graph; Physics; Quantum mechanics; Crystallography; Crystal structure","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.0003344128,0.0002600717,0.0002821958,0.0001664223,0.0005944306,0.0007453243,0.0005553339,0.0001159687,0.000003109261],"category_scores_gemma":[0.0001199468,0.0002387866,0.00008520881,0.0006056948,0.0000807574,0.002668103,0.0001786616,0.000266145,0.00001261604],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001563787,"about_ca_system_score_gemma":0.000134168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001277774,"about_ca_topic_score_gemma":4.832004e-7,"domain_scores_codex":[0.9983142,0.0000353003,0.0005666396,0.0003365297,0.0003384623,0.0004088451],"domain_scores_gemma":[0.9988745,0.00008799771,0.0003396925,0.0002214567,0.0002387967,0.0002375995],"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.000009416526,0.00001598369,0.00004028683,0.000252732,0.00001114928,0.000002093589,0.004563252,0.0008896278,0.00003721813,0.009641135,0.0003632584,0.9841738],"study_design_scores_gemma":[0.0006896091,0.000193345,0.0004648132,0.00005889231,0.000009080884,0.00002728912,0.000140496,0.976614,0.0002339002,0.01413724,0.007105671,0.0003256802],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01266514,0.0002858503,0.9803064,0.005518092,0.0002388031,0.0003493977,0.00002585377,0.0005127013,0.00009776085],"genre_scores_gemma":[0.6982352,0.0000249115,0.2951736,0.006275836,0.0001938434,0.00002477911,0.00005248536,0.00001628054,0.00000316057],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9838482,"threshold_uncertainty_score":0.9737436,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01682708285040525,"score_gpt":0.2355561352207956,"score_spread":0.2187290523703904,"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."}}