{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005267679,0.00007655001,0.00007372773,0.0001552628,0.0002014243,0.000155247,0.0005352594,0.000018734,0.00001052997],"category_scores_gemma":[0.0002155616,0.00005220101,0.0000369232,0.0006119494,0.0003289794,0.001858259,0.00003992533,0.0001397707,0.00002921433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001873177,"about_ca_system_score_gemma":0.00003353788,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001554542,"about_ca_topic_score_gemma":1.806059e-7,"domain_scores_codex":[0.9990807,0.00006943887,0.0002218067,0.00007983659,0.0003697028,0.0001785602],"domain_scores_gemma":[0.9992639,0.0001195239,0.0001783989,0.0003017749,0.0001061955,0.00003020554],"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.000005107938,0.000009959739,0.00009388354,0.00003201636,0.000003849873,2.788176e-7,0.001745101,0.0004211648,0.0007282491,0.9842945,0.0006752253,0.01199071],"study_design_scores_gemma":[0.0008256218,0.0001191764,0.002765731,0.0002117953,0.000004982593,0.00002617955,0.0004790116,0.0220872,0.06403176,0.8935759,0.01538622,0.000486426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.070916,0.00001150234,0.9150116,0.006906027,0.00006576494,0.0001485213,0.000001371583,0.00008504685,0.006854136],"genre_scores_gemma":[0.9858325,7.796078e-7,0.008545906,0.005598609,0.000003108967,0.000009962337,0.000001137306,0.000002572315,0.000005453549],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9149165,"threshold_uncertainty_score":0.2128695,"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."}}