{"id":"W3124630261","doi":"","title":"Minimum cost spanning tree problems with indifferent agents","year":2013,"lang":"en","type":"preprint","venue":"RePEc: Research Papers in Economics","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Spanning tree; Extension (predicate logic); Minimum spanning tree; Tree (set theory); Mathematical optimization; Enhanced Data Rates for GSM Evolution; Mathematics; Property (philosophy); Time complexity; Computer science; Combinatorics","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","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004328466,0.0003409905,0.0006152567,0.0008718516,0.0003568317,0.0007244598,0.001995612,0.0003817363,0.001110589],"category_scores_gemma":[0.0008671534,0.0002670535,0.0001571796,0.0004034078,0.0005672192,0.0002091317,0.00152654,0.001734537,0.0004452216],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005134819,"about_ca_system_score_gemma":0.0004519144,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004504754,"about_ca_topic_score_gemma":0.0002242473,"domain_scores_codex":[0.995184,0.0005646184,0.001082578,0.001474563,0.0009300496,0.000764195],"domain_scores_gemma":[0.9953105,0.00153051,0.0005406531,0.001944631,0.000336412,0.0003372501],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000145534,0.0004605135,0.02666499,0.00006365744,0.0001385476,0.00001554203,0.002413033,0.0381651,0.0001209332,0.004231559,0.002347594,0.925233],"study_design_scores_gemma":[0.003173723,0.0005068708,0.1419758,0.0009777005,0.00004151421,0.00006021551,0.01322298,0.07274126,0.000717937,0.3084303,0.4557229,0.002428765],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8689313,0.00003987961,0.000250389,0.00107737,0.0003386409,0.002428087,0.00006744024,0.00005458023,0.1268123],"genre_scores_gemma":[0.9758009,0.0006420393,0.0006195819,0.0001025671,0.0002026295,0.00171948,0.00005306731,0.00005426545,0.02080541],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9228042,"threshold_uncertainty_score":0.9999782,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.166698592111422,"score_gpt":0.40892886812279,"score_spread":0.242230276011368,"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."}}