{"id":"W7133027849","doi":"","title":"Approximate truthful mechanisms for the knapsack problem, and negative results using a stack model for local ratio algorithms","year":2005,"lang":"","type":"dissertation","venue":"TSpace","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto; Library and Archives Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Knapsack problem; Approximation algorithm; Polynomial-time approximation scheme; Set (abstract data type); Stack (abstract data type); Set cover problem; Bandwidth (computing); Tree (set theory); Facility location problem","routes":{"ca_aff":true,"ca_fund":true,"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","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002014503,0.0008334252,0.0007711069,0.0002650896,0.001694696,0.00131213,0.00110364,0.000529373,0.00001580262],"category_scores_gemma":[0.0003196304,0.0006823527,0.0002876218,0.0006420613,0.000262851,0.0009211289,0.0002383014,0.0005517112,0.000004996818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002653423,"about_ca_system_score_gemma":0.001223142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001217141,"about_ca_topic_score_gemma":0.0002590126,"domain_scores_codex":[0.9950163,0.0002095794,0.001137543,0.001681905,0.0008039923,0.001150723],"domain_scores_gemma":[0.9951338,0.0010938,0.001022773,0.0008624929,0.001550741,0.0003364194],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000862902,0.0001363424,5.464247e-8,0.0004690575,0.000156879,8.036996e-7,0.06249487,0.8218862,0.0003277496,0.08516509,0.0002867975,0.02821329],"study_design_scores_gemma":[0.004199633,0.0005343783,6.829458e-7,0.0002847037,0.0001679648,0.000007682792,0.01080236,0.9544469,0.001824173,0.02669684,0.0002618164,0.0007729029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007896925,0.0003070045,0.9859398,0.002791662,0.0004179389,0.009617507,0.0002814327,0.000113182,0.0004525148],"genre_scores_gemma":[0.0113089,0.0003959789,0.9686376,0.0003260425,0.0002084243,0.001352588,0.0004264479,0.0001364379,0.01720761],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1325607,"threshold_uncertainty_score":0.9997246,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07379328664914889,"score_gpt":0.3665379199693105,"score_spread":0.2927446333201615,"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."}}