{"id":"W4407736999","doi":"10.1109/ickg63256.2024.00052","title":"OrbitSI: An Orbit-based Algorithm for the Subgraph Isomorphism Search Problem","year":2024,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Tezpur University; Queen's University; Engineering and Physical Sciences Research Council; Ministry of Education; Queen's University Belfast","keywords":"Subgraph isomorphism problem; Induced subgraph isomorphism problem; Isomorphism (crystallography); Computer science; Orbit (dynamics); Mathematics; Theoretical computer science; Engineering; Aerospace engineering","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006394736,0.0001689129,0.0001273393,0.0001290668,0.0003521526,0.0008455018,0.001395138,0.00006715207,0.00005014079],"category_scores_gemma":[0.000004885327,0.00009528612,0.0001060701,0.0005965139,0.00006908462,0.0007861032,0.000275672,0.00019896,0.00005676041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002414033,"about_ca_system_score_gemma":0.000206922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001997218,"about_ca_topic_score_gemma":0.00001301131,"domain_scores_codex":[0.9983671,0.00005732284,0.0001989093,0.0005892045,0.0003942173,0.0003931912],"domain_scores_gemma":[0.998471,0.0003950959,0.00002072241,0.0008606603,0.0001192441,0.0001333076],"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.000003051033,0.00006665503,0.000004713728,0.00002993392,0.00001913605,0.00001844014,0.0002164269,0.0000982251,0.0002290806,0.0551104,0.01726141,0.9269425],"study_design_scores_gemma":[0.0001920982,0.0001668953,0.00003900357,0.00003340996,0.000007852439,0.00001183664,0.00003149219,0.9151068,0.001495689,0.003213625,0.07954322,0.000158087],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00006616733,0.001179839,0.9935199,0.003088706,0.0005808371,0.0005501022,0.0000469277,0.0005408628,0.0004266398],"genre_scores_gemma":[0.006260877,0.00003581703,0.9910175,0.0008462804,0.0002878307,0.000161581,0.00004975229,0.00002660267,0.001313711],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9267845,"threshold_uncertainty_score":0.8153194,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02838795631835037,"score_gpt":0.2904489951535391,"score_spread":0.2620610388351887,"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."}}