{"id":"W2067491157","doi":"10.1016/s0020-0190(02)00478-7","title":"On the complexity of digraph packings","year":2003,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Bishop's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Computer science; Combinatorics; Theoretical computer science; Mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.001695656,0.001288962,0.002478145,0.002931605,0.002349973,0.008083901,0.003051089,0.002982547,0.02206405],"category_scores_gemma":[0.02649535,0.001492293,0.001743179,0.005877666,0.002919878,0.01558701,0.004536455,0.00427413,0.001783577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003481746,"about_ca_system_score_gemma":0.001681119,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003362587,"about_ca_topic_score_gemma":0.003986509,"domain_scores_codex":[0.9971834,0.0007059081,0.0002006623,0.0004076076,0.0009361851,0.0005663428],"domain_scores_gemma":[0.9624023,0.03013725,0.002044393,0.002798446,0.001133418,0.001484272],"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.001152253,0.0005334754,0.007363934,0.0008583978,0.0001487002,0.0005358336,0.001094824,0.2260833,0.003249417,0.6251023,0.03607433,0.0978033],"study_design_scores_gemma":[0.00008338907,0.00006434719,0.001038619,0.00005168036,0.00004825411,0.0002641016,0.0002667572,0.214607,0.0008374767,0.7791457,0.003556307,0.0000363658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7297903,0.003664761,0.1616489,0.01036795,0.0005435913,0.0002775715,0.004990496,0.001102935,0.08761344],"genre_scores_gemma":[0.914411,0.002939738,0.05906828,0.0006508891,0.0006114077,0.0002240374,0.004365492,0.0005840228,0.01714503],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02206405,"threshold_uncertainty_score":0.07381165,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03886923167219776,"score_gpt":0.2733865819034409,"score_spread":0.2345173502312431,"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."}}