{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001167522,0.002100899,0.001566236,0.001487916,0.0008528461,0.001633315,0.00305278,0.00126077,0.05835878],"category_scores_gemma":[0.005819712,0.001462313,0.003027779,0.003310015,0.001161085,0.003382044,0.002704541,0.00426866,0.01149976],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001472289,"about_ca_system_score_gemma":0.001238787,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00379475,"about_ca_topic_score_gemma":0.006430387,"domain_scores_codex":[0.9982197,0.0003503293,0.0001265563,0.0004204874,0.0007897459,0.00009306452],"domain_scores_gemma":[0.9968293,0.002087117,0.00004716089,0.0007960032,0.000187549,0.00005287842],"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.0002985884,0.0004410195,0.0004859304,0.0009175757,0.0002312665,0.0003836137,0.0002253879,0.07200044,0.008246549,0.1638514,0.1318102,0.6211081],"study_design_scores_gemma":[0.0003620634,0.0002226871,0.001315002,0.0001933433,0.0002041513,0.0005984826,0.000102735,0.2206818,0.008470875,0.6522542,0.1154758,0.0001188856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008501389,0.002230125,0.8912321,0.002429762,0.001767726,0.0004894371,0.002293605,0.005222466,0.08583344],"genre_scores_gemma":[0.08423492,0.003130702,0.8375118,0.00160347,0.001446927,0.0009331444,0.01006185,0.00330201,0.05777507],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.05835878,"threshold_uncertainty_score":0.1952296,"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."}}