{"id":"W2407418246","doi":"10.1007/s11128-017-1569-z","title":"Systematic and deterministic graph minor embedding for Cartesian products of graphs","year":2017,"lang":"en","type":"preprint","venue":"Quantum Information Processing","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"QLT (Canada)","funders":"Mitacs","keywords":"Cartesian product; Embedding; Computer science; Bottleneck; Heuristic; Theoretical computer science; Overhead (engineering); Qubit; Graph; Algorithm; Quantum; Mathematics; Discrete mathematics; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008956547,0.0003662081,0.000719042,0.0005091344,0.0005956214,0.001304188,0.001153799,0.0001955189,1.963012e-7],"category_scores_gemma":[0.0006485167,0.0003172191,0.0001356825,0.0001832137,0.0001272662,0.001215338,0.0006250238,0.0003158421,0.000001285599],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002375956,"about_ca_system_score_gemma":0.0003591828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000124111,"about_ca_topic_score_gemma":8.082925e-7,"domain_scores_codex":[0.9977024,0.0000562031,0.001088116,0.0004141464,0.0003867899,0.0003523931],"domain_scores_gemma":[0.9960256,0.0001541068,0.002272688,0.0008815239,0.0005722482,0.00009384655],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"systematic_review","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003466988,0.00009269111,0.00009393434,0.7065382,0.0002103281,0.000007894866,0.036381,0.01269063,0.0001663594,0.03918905,0.0001759675,0.2044193],"study_design_scores_gemma":[0.0002390131,0.00007933421,0.0001061751,0.01236264,0.00006652284,0.00005176348,0.0001299343,0.9552245,0.0002578332,0.03108994,0.00003141045,0.0003609267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0599032,0.001431675,0.9350668,0.0003383101,0.001089406,0.001753128,0.00003705065,0.0002525092,0.000127961],"genre_scores_gemma":[0.9178216,0.00001606737,0.08186106,0.00005202178,0.00006428806,0.0001285851,0.00003034025,0.00001608543,0.000009941737],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9425339,"threshold_uncertainty_score":0.999928,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01593423637820039,"score_gpt":0.2732158089927692,"score_spread":0.2572815726145688,"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."}}