{"id":"W1569299273","doi":"10.1103/physreve.74.051903","title":"Subgraph ensembles and motif discovery using an alternative heuristic for graph isomorphism","year":2006,"lang":"en","type":"article","venue":"Physical Review E","topic":"Bioinformatics and Genomic Networks","field":"Biochemistry, Genetics and Molecular Biology","cited_by":31,"is_retracted":false,"has_abstract":true,"ca_institutions":"Perimeter Institute; University of Calgary","funders":"Institut Périmètre de physique théorique; Boettcher Foundation","keywords":"Combinatorics; Bipartite graph; Mathematics; Subgraph isomorphism problem; Graph; Zipf's law; Discrete mathematics; Computer science","routes":{"ca_aff":true,"ca_fund":true,"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.0000922257,0.0001366674,0.0002146863,0.00001356042,0.00006220215,0.00002864309,0.0000908631,0.00003131432,8.794637e-7],"category_scores_gemma":[0.00001609431,0.0001124891,0.0001177929,0.00004762603,0.00007439872,0.000008511653,0.00004622086,0.00004617489,9.088603e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004500456,"about_ca_system_score_gemma":0.00001450442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003527884,"about_ca_topic_score_gemma":0.00001191476,"domain_scores_codex":[0.9993564,0.00002522641,0.0001758399,0.000206377,0.00006242723,0.0001737567],"domain_scores_gemma":[0.9996054,0.00001972394,0.00009357996,0.0001888013,0.00004021187,0.00005231523],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003071383,0.001470771,0.00129996,0.007725316,0.000617435,0.00001307387,0.0002421037,0.002028838,0.7046999,0.1283215,0.01459442,0.1386795],"study_design_scores_gemma":[0.004724693,0.003033574,0.005650234,0.003612449,0.001572494,0.0001390818,0.00009245922,0.1316387,0.08695467,0.6963914,0.06244671,0.003743575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9064074,0.03590823,0.05667308,0.00008742448,0.00009216669,0.0005188885,0.00008820546,0.000008003238,0.0002166721],"genre_scores_gemma":[0.991532,0.006371883,0.0009641485,0.0004332943,0.0004766879,0.00002273684,0.0001543245,0.00001615188,0.00002874836],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6177453,"threshold_uncertainty_score":0.4587172,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01720424931890527,"score_gpt":0.2841520550106151,"score_spread":0.2669478056917098,"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."}}