{"id":"W2032198109","doi":"10.1007/s00493-008-2157-8","title":"An algorithm for packing non-zero A-paths in group-labelled graphs","year":2008,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Disjoint sets; Path (computing); Abelian group; Graph; Group (periodic table); Matching (statistics); Induced path; Zero (linguistics); Discrete mathematics; Algorithm; Longest path problem; Shortest path problem; Computer science","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004197679,0.000272428,0.0003837286,0.0003901434,0.0005008682,0.0001072937,0.001576306,0.0001254588,0.000006146809],"category_scores_gemma":[0.00003317845,0.0002864658,0.000164247,0.001483777,0.0001152663,0.0006951499,0.0002541119,0.000275771,0.00001457457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008794863,"about_ca_system_score_gemma":0.00007097103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006646295,"about_ca_topic_score_gemma":0.000006561118,"domain_scores_codex":[0.9978061,0.00008838769,0.0003979508,0.0007145689,0.0003600366,0.0006329534],"domain_scores_gemma":[0.9983854,0.0002187443,0.0001192749,0.000939846,0.0001283493,0.0002083595],"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.00001744908,0.00232438,0.005148842,0.0000418114,0.00004679074,0.0002823388,0.002971631,0.00002741076,0.0004877612,0.5042565,0.002805366,0.4815896],"study_design_scores_gemma":[0.003751209,0.001173977,0.009552467,0.00005041936,0.000009090466,0.00008048987,0.00004269608,0.3836365,0.0008060572,0.5923803,0.007693621,0.000823151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03981626,0.0003318084,0.9564139,0.0001624394,0.001625167,0.0005861061,0.000007741158,0.000324529,0.0007321074],"genre_scores_gemma":[0.8261514,0.0000931208,0.1732409,0.00021337,0.00005264,0.0001378694,0.00001293261,0.0000265817,0.00007116362],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7863352,"threshold_uncertainty_score":0.9999588,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02376304741433146,"score_gpt":0.2586423356285821,"score_spread":0.2348792882142506,"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."}}