{"id":"W4382866761","doi":"10.1609/socs.v16i1.27299","title":"Hybrid Search with Graph Neural Networks for Constraint-Based Navigation Planning [Extended Abstract]","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Safran Electronics (Canada)","funders":"","keywords":"Computer science; Artificial neural network; Constraint (computer-aided design); Graph; Overhead (engineering); Vehicle routing problem; Routing (electronic design automation); Inference; Artificial intelligence; Task (project management); Constraint programming; Route planning; Mathematical optimization; Machine learning; Theoretical computer science; Engineering; Computer network; Mathematics","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.0006901796,0.0008812551,0.0007215153,0.000680881,0.0003849559,0.0008261782,0.001438524,0.001150675,0.004433544],"category_scores_gemma":[0.00259262,0.000453486,0.0005368955,0.001318248,0.0007304518,0.00127883,0.001122789,0.001299022,0.0005443147],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009375737,"about_ca_system_score_gemma":0.001110932,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02068884,"about_ca_topic_score_gemma":0.02106985,"domain_scores_codex":[0.999666,0.0001248716,0.00001724903,0.00007603844,0.00007910231,0.00003674582],"domain_scores_gemma":[0.9989229,0.000741448,0.00007043208,0.00007584343,0.0001513417,0.00003803709],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002615301,0.00002012351,0.0001468821,0.00002525397,0.000019107,0.00002319429,0.0000115063,0.9655704,0.0004891132,0.004425457,0.0008250584,0.02841784],"study_design_scores_gemma":[0.000002159286,0.000003652756,0.00001199163,9.919155e-7,0.000001078552,0.000001622334,9.451177e-7,0.9987111,0.00009045035,0.001059057,0.0001157466,0.000001110719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01070371,0.0001985936,0.9853361,0.0002079594,0.00004514708,0.00005155546,0.0001004531,0.0007525469,0.00260393],"genre_scores_gemma":[0.4596807,0.0002352937,0.5330344,0.0003037342,0.00007580593,0.000375776,0.0004182388,0.0002825484,0.005593482],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02068884,"threshold_uncertainty_score":0.0411368,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02342475220236735,"score_gpt":0.2782809439319044,"score_spread":0.2548561917295371,"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."}}