{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008463931,0.00161692,0.001657266,0.002070448,0.002356894,0.003603279,0.00384069,0.003020441,0.01483044],"category_scores_gemma":[0.003981428,0.001196247,0.001577056,0.004507965,0.001614061,0.005613757,0.004790154,0.002481724,0.003907851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001848211,"about_ca_system_score_gemma":0.002523592,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003493609,"about_ca_topic_score_gemma":0.005039864,"domain_scores_codex":[0.9988851,0.0001767585,0.0001015012,0.0003368193,0.0002766445,0.0002232999],"domain_scores_gemma":[0.9969258,0.001286348,0.0002502507,0.0008752259,0.0003090761,0.0003532447],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001011574,0.0009744744,0.002879915,0.000985136,0.0001881464,0.0003915268,0.001195057,0.0560699,0.02603804,0.1121498,0.03032837,0.7677881],"study_design_scores_gemma":[0.0005989967,0.0004484293,0.00145813,0.0001449553,0.0002373475,0.0006796551,0.0007686819,0.5042238,0.02451642,0.4467417,0.02004163,0.0001403003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07215099,0.000206785,0.9088176,0.0007985898,0.00014813,0.000489031,0.0008628506,0.005817136,0.01070884],"genre_scores_gemma":[0.09664979,0.0001129212,0.8966387,0.0001287763,0.00003250207,0.0002797848,0.001458363,0.0004053921,0.004293872],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01483044,"threshold_uncertainty_score":0.04961276,"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."}}