{"id":"W4300866431","doi":"","title":"Arbitrary Overlap Constraints in Graph Packing Problems","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"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.005927154,0.003562717,0.004144722,0.00167294,0.003184585,0.00425959,0.005205475,0.005184391,0.01073321],"category_scores_gemma":[0.03255804,0.002104436,0.002534642,0.004818161,0.003188889,0.01313258,0.006590256,0.005608906,0.001529196],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002344439,"about_ca_system_score_gemma":0.001549779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002160146,"about_ca_topic_score_gemma":0.0022475,"domain_scores_codex":[0.993004,0.002783191,0.0004591592,0.001654863,0.001165995,0.0009327176],"domain_scores_gemma":[0.9746442,0.01987009,0.001439544,0.002167324,0.0007927795,0.001086006],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00096909,0.0009362652,0.002395766,0.001194644,0.0002628081,0.0007035416,0.001087695,0.4103529,0.002973593,0.4376467,0.02712143,0.1143555],"study_design_scores_gemma":[0.0001575052,0.0002268286,0.0004422845,0.000116662,0.00007009455,0.0003921352,0.0003577578,0.5552122,0.001742994,0.4306558,0.01056993,0.00005582469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08695406,0.002021556,0.8802683,0.003528372,0.0002687188,0.0006942173,0.001183132,0.0009234942,0.02415803],"genre_scores_gemma":[0.4765199,0.001831978,0.4970276,0.001852954,0.0008810217,0.00155812,0.003227121,0.001082586,0.01601871],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01073321,"threshold_uncertainty_score":0.0359062,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04924595412843806,"score_gpt":0.1660453584740916,"score_spread":0.1167994043456536,"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."}}