{"id":"W4300001996","doi":"","title":"Portfolios of Subgraph Isomorphism Algorithms","year":2016,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Subgraph isomorphism problem; Induced subgraph isomorphism problem; Isomorphism (crystallography); Computer science; Algorithm; Theoretical computer science; Graph; Crystal structure; Crystallography","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":[],"consensus_categories":[],"category_scores_codex":[0.00355536,0.0001834653,0.0002339956,0.0002278994,0.0001929594,0.00009441192,0.001719513,0.00009039556,0.0001006713],"category_scores_gemma":[0.0004361575,0.000143617,0.0001746896,0.0007591296,0.0003090663,0.0004507768,0.0004394523,0.0001156609,0.00004790718],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002219677,"about_ca_system_score_gemma":0.00008681263,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009813122,"about_ca_topic_score_gemma":0.00003352169,"domain_scores_codex":[0.9965755,0.001840725,0.0004031311,0.0004928053,0.000361934,0.0003258777],"domain_scores_gemma":[0.9957064,0.00100679,0.0003008304,0.001751253,0.001068223,0.000166553],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00000299978,0.000246852,0.001260541,0.00001128973,0.0000271823,0.00000615772,0.001734148,8.07787e-7,0.01668428,0.7834953,0.0004268126,0.1961036],"study_design_scores_gemma":[0.002089689,0.000002970668,0.01089131,0.001189045,0.00003037912,0.00009954379,0.00009115275,0.009799151,0.7582676,0.1984207,0.01827112,0.0008473285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03825762,0.0003055551,0.9400792,0.006867158,0.0001837064,0.0001515292,0.00001810161,0.0002188976,0.01391829],"genre_scores_gemma":[0.8797645,0.0001788047,0.115321,0.00009536979,0.00001174781,0.00001677961,0.000008122989,0.00001658035,0.004587063],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8415068,"threshold_uncertainty_score":0.5856532,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008477213805286161,"score_gpt":0.2001707014341412,"score_spread":0.1916934876288551,"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."}}