{"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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.003163956,0.000243721,0.0004221785,0.003196595,0.0001169318,0.0007422168,0.009024988,0.0001048574,0.00002534622],"category_scores_gemma":[0.0003300962,0.0002347752,0.0002494567,0.00134995,0.002307264,0.002453971,0.002994777,0.0008584824,0.000008441695],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003143722,"about_ca_system_score_gemma":0.002269032,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001476307,"about_ca_topic_score_gemma":0.000008104966,"domain_scores_codex":[0.9951488,0.0001524175,0.001284889,0.0005780556,0.002448078,0.0003877569],"domain_scores_gemma":[0.9932474,0.0003520414,0.001494656,0.0007539334,0.003979479,0.0001725153],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001170629,0.001381466,0.02023875,0.0001717309,0.0005298219,0.0003945097,0.005316678,0.08054822,0.005879316,0.5765149,0.0003738719,0.3085336],"study_design_scores_gemma":[0.001051063,0.000351416,0.01865901,0.00188058,0.0000105919,0.0005299178,0.00003582708,0.1041615,0.003481223,0.8690251,0.0003425613,0.0004712186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08723027,0.0001026769,0.9059225,0.0009190527,0.004811277,0.0002113957,0.00001146458,0.00002353584,0.0007678407],"genre_scores_gemma":[0.7199014,0.00006725442,0.2796281,0.00009361222,0.0002884351,0.000004494393,0.000002706865,0.000008224988,0.000005800779],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6326711,"threshold_uncertainty_score":0.9963366,"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."}}