{"id":"W2234017799","doi":"10.1142/s0129054118500053","title":"Arbitrary Overlap Constraints in Graph Packing Problems","year":2018,"lang":"en","type":"preprint","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Induced subgraph; Graph; Function (biology); Discrete mathematics; Vertex (graph theory)","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.005718438,0.003310174,0.003916339,0.001949989,0.003218869,0.004188646,0.004394998,0.004992386,0.01209988],"category_scores_gemma":[0.0325278,0.002277532,0.002794636,0.005696166,0.003444097,0.01463777,0.006393544,0.005599778,0.001736662],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002244971,"about_ca_system_score_gemma":0.001702567,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002030012,"about_ca_topic_score_gemma":0.002037775,"domain_scores_codex":[0.9934383,0.00258988,0.0004815298,0.001407504,0.001241957,0.0008408704],"domain_scores_gemma":[0.9771433,0.01793936,0.001219761,0.001989152,0.0008599553,0.0008485119],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009890143,0.000888307,0.001980779,0.001337573,0.0002397726,0.0007193901,0.001099023,0.4047699,0.003115381,0.3890392,0.02280172,0.17302],"study_design_scores_gemma":[0.000168957,0.0002014682,0.0003727082,0.0001314239,0.00007313639,0.0003799723,0.0003499517,0.5047714,0.002546978,0.4805138,0.01043066,0.00005969104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06716128,0.001721298,0.9061982,0.002900132,0.000234958,0.0007129591,0.0007515296,0.0009790789,0.01934055],"genre_scores_gemma":[0.3474155,0.00153704,0.6308978,0.001387866,0.0006770271,0.001363401,0.002371353,0.001045314,0.01330479],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01209988,"threshold_uncertainty_score":0.04047817,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03772099834689924,"score_gpt":0.352113442025102,"score_spread":0.3143924436782027,"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."}}