{"id":"W2132852182","doi":"10.1007/978-3-642-13059-5_36","title":"Notes on Generating Satisfiable SAT Instances Using Random Subgraph Isomorphism","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"MacEwan University; University of Alberta","funders":"","keywords":"Induced subgraph isomorphism problem; Subgraph isomorphism problem; Preprocessor; Isomorphism (crystallography); Computer science; Combinatorics; Algorithm; Theoretical computer science; Mathematics; Artificial intelligence; Graph","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.0008141645,0.0006055515,0.0005955833,0.001063782,0.0007002069,0.0009430183,0.001554671,0.0004325466,0.0000864474],"category_scores_gemma":[0.000188743,0.0005473668,0.0001627631,0.0007212766,0.0007615613,0.0008130697,0.0004618463,0.001151863,0.00002893962],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002267244,"about_ca_system_score_gemma":0.0006103067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006744228,"about_ca_topic_score_gemma":0.0004752492,"domain_scores_codex":[0.9962161,0.00005401179,0.0006313474,0.00147382,0.001005755,0.0006189669],"domain_scores_gemma":[0.9972458,0.0007756181,0.0004468676,0.001083582,0.0002649922,0.000183072],"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.00001394117,0.00002218624,0.0003448523,0.0000234542,0.00001487146,0.00004765757,0.0006069505,0.3951462,0.004243504,0.01399887,0.000005246641,0.5855323],"study_design_scores_gemma":[0.0007122332,0.00009816496,0.0001164815,0.0003494004,0.00001039645,0.00008461687,2.20892e-7,0.9631619,0.004908674,0.02934354,0.0004600903,0.0007542943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001058777,0.0002063826,0.9927843,0.0005861392,0.003368343,0.0004421879,0.000007831082,0.0002020667,0.001343938],"genre_scores_gemma":[0.1945543,0.00005936708,0.8029797,0.001794435,0.0004883877,0.000006250291,0.000008462745,0.00003616759,0.0000729385],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.584778,"threshold_uncertainty_score":0.9996978,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01926370018363353,"score_gpt":0.2408738540385624,"score_spread":0.2216101538549288,"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."}}