{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001150551,0.000371473,0.0004533016,0.001047896,0.0003915837,0.0005910991,0.004371412,0.0001811205,0.0000114465],"category_scores_gemma":[0.0002129881,0.000325042,0.0001021067,0.0003441326,0.0009020948,0.0005818019,0.001126383,0.0008105128,0.00002770726],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001041751,"about_ca_system_score_gemma":0.0007134448,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002484859,"about_ca_topic_score_gemma":0.00003303077,"domain_scores_codex":[0.9963776,0.0000510537,0.0004050501,0.001313486,0.001270174,0.0005826767],"domain_scores_gemma":[0.9966393,0.0002310952,0.0003513804,0.002178397,0.0004261064,0.0001737162],"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.000006095123,0.00004815041,0.00004811095,0.0001013006,0.00001229408,0.00005296922,0.001590669,0.07652821,0.0002544011,0.1202305,0.00004058644,0.8010867],"study_design_scores_gemma":[0.0005080386,0.0007029998,0.0002855675,0.001372494,0.00000638871,0.0000458642,2.571462e-7,0.7381259,0.006072817,0.249975,0.001925288,0.0009794515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003129779,0.0000971238,0.9792044,0.001679472,0.0009145436,0.0004564085,0.000004749047,0.00008698563,0.01752503],"genre_scores_gemma":[0.2945789,0.0001175749,0.7012224,0.001087887,0.0003982233,0.00001268642,0.000009336723,0.00006311749,0.002509841],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8001072,"threshold_uncertainty_score":0.9999202,"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."}}