{"id":"W1609598951","doi":"10.15517/rmta.v19i2.1334","title":"Variants of the mixed postman problem solvable using linear programming","year":2012,"lang":"en","type":"article","venue":"Revista de Matemática Teoría y Aplicaciones","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Sistema Nacional de Investigadores; University of Waterloo; Universidad Autónoma Metropolitana","keywords":"Mixed graph; Mathematics; Linear programming; Graph; Combinatorics; Time complexity; Discrete mathematics; Mathematical optimization; Line graph; Voltage graph","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001647843,0.0002219291,0.0003233725,0.0001248028,0.0003305383,0.0001425307,0.001454277,0.00009918533,0.00001768075],"category_scores_gemma":[0.0002118797,0.0001598941,0.0001508722,0.001047467,0.0001976848,0.000640517,0.0008249587,0.0002621778,0.00003675218],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008806321,"about_ca_system_score_gemma":0.0001030964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000104371,"about_ca_topic_score_gemma":6.675147e-7,"domain_scores_codex":[0.9974256,0.0003756826,0.0004655261,0.0003634543,0.0004693057,0.0009004754],"domain_scores_gemma":[0.9979073,0.0001987136,0.0002506864,0.001247996,0.0001794587,0.0002158705],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002645272,0.0003075341,0.007105345,0.0004594258,0.00005417156,0.00000427607,0.0007013306,0.0001206319,0.05465989,0.926154,0.00005881979,0.01034808],"study_design_scores_gemma":[0.004932811,0.001098957,0.06176924,0.00511881,0.0006109441,0.002469576,0.001530337,0.1815858,0.2940122,0.1872928,0.2539285,0.005649929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3641788,0.001505217,0.6299,0.001367637,0.000238518,0.001664564,0.00001237633,0.0003450694,0.0007878122],"genre_scores_gemma":[0.8046111,0.00001812143,0.1950725,0.00005562702,0.00007370763,0.00004156561,0.00000118967,0.00002855725,0.00009752707],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7388612,"threshold_uncertainty_score":0.6520292,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02947306442216141,"score_gpt":0.2974593725002789,"score_spread":0.2679863080781175,"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."}}