{"id":"W2598880527","doi":"10.1007/978-3-319-55911-7_48","title":"Fast Searching on Cartesian Products of Graphs","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina","funders":"","keywords":"Cartesian product; Upper and lower bounds; Eulerian path; Hypercube; Computer science; Cartesian coordinate system; Graph; Lattice graph; Product (mathematics); Combinatorics; Path (computing); Search tree; Discrete mathematics; Search algorithm; Theoretical computer science; Mathematics; Algorithm; Parallel computing; Line graph; Voltage graph; Applied mathematics; Geometry","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.0007182717,0.0009905782,0.001332634,0.001322912,0.000668087,0.001343845,0.001558596,0.0007372206,0.01317703],"category_scores_gemma":[0.004298588,0.000827,0.00102609,0.002474281,0.001112458,0.003638945,0.00215568,0.001378025,0.002862867],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007287251,"about_ca_system_score_gemma":0.0006167858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00188744,"about_ca_topic_score_gemma":0.002735595,"domain_scores_codex":[0.9993584,0.0001896333,0.00003366521,0.0001428204,0.000204019,0.00007139598],"domain_scores_gemma":[0.9978834,0.001317281,0.00009511784,0.0003860257,0.0002325977,0.00008558667],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000518335,0.0001223738,0.001184784,0.001395517,0.0001151923,0.0002018032,0.0006069983,0.09404514,0.01009859,0.3726981,0.03557837,0.4834348],"study_design_scores_gemma":[0.00009477584,0.0002085726,0.0005323944,0.000158565,0.00006244783,0.0004205783,0.0001906777,0.2992914,0.004823801,0.6672781,0.02690361,0.00003515328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1145053,0.002508212,0.8336662,0.0005007022,0.0002139461,0.0001759542,0.000805112,0.003015518,0.04460908],"genre_scores_gemma":[0.2099604,0.001390628,0.7677342,0.0001330057,0.00006945437,0.0001392461,0.001392487,0.0008583184,0.01832228],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01317703,"threshold_uncertainty_score":0.04408157,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02726990183530854,"score_gpt":0.2719971306015393,"score_spread":0.2447272287662308,"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."}}