{"id":"W2950175273","doi":"10.48550/arxiv.1211.3201","title":"Truthful Mechanism Design for Multidimensional Covering Problems","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Covering problems; Set cover problem; Combinatorics; Mathematics; Facility location problem; Cover (algebra); Dimension (graph theory); Set (abstract data type); Graph; Approximation algorithm; Vertex (graph theory); Class (philosophy); Computer science; Discrete mathematics; Mathematical optimization; Artificial intelligence","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.002213301,0.000279348,0.0003644596,0.0002692369,0.0004325098,0.00007494399,0.0009101025,0.000320977,0.0004794102],"category_scores_gemma":[0.0003904958,0.0002718388,0.0003220419,0.0004575857,0.0001282577,0.0003130768,0.0006898628,0.0003394437,0.0005807577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001231645,"about_ca_system_score_gemma":0.000146947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001395836,"about_ca_topic_score_gemma":0.000004073725,"domain_scores_codex":[0.9977122,0.0002589395,0.0003873275,0.001054153,0.0002258726,0.0003615037],"domain_scores_gemma":[0.9963986,0.001486896,0.0005088879,0.0009909373,0.0003894224,0.0002252123],"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.00007019852,0.00008305489,0.00006690562,0.00001221176,0.00004066558,0.000002659211,0.0001490113,0.3295613,0.0005156362,0.6683931,0.000731896,0.0003733802],"study_design_scores_gemma":[0.0004439703,0.00002872174,0.00008792285,0.00002793184,0.00008466709,0.000003971796,0.0002822694,0.1538383,0.001776055,0.8337952,0.009268552,0.0003624437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06875017,0.00003481121,0.9285204,0.00008387325,0.0007242198,0.0009544705,0.00009810821,0.0001137534,0.0007202212],"genre_scores_gemma":[0.9811209,0.00001718665,0.01049353,0.0000639702,0.0001685921,0.00001795086,0.00002328898,0.00002515227,0.008069373],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9180269,"threshold_uncertainty_score":0.9999734,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.3478497647561668,"score_gpt":0.2765838969273129,"score_spread":0.07126586782885391,"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."}}