{"id":"W2159041520","doi":"10.1109/tcomm.2011.081111.100300","title":"On Computation of Performance Bounds of Optimal Index Assignment","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"Blackberry (Canada); McMaster University","funders":"","keywords":"Quadratic assignment problem; Mathematical optimization; Assignment problem; Heuristic; Computation; Index (typography); Computer science; Resilience (materials science); Channel (broadcasting); Weapon target assignment problem; Upper and lower bounds; Quadratic equation; Optimization problem; Algorithm; Frequency assignment; Mathematics; Telecommunications","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":[],"consensus_categories":[],"category_scores_codex":[0.0001637341,0.0001025077,0.0001438748,0.0001811195,0.0002343651,0.00001573939,0.001254576,0.0000527554,0.00002415315],"category_scores_gemma":[0.000002286092,0.0000972894,0.00006659187,0.0003267672,0.0001401057,0.0003508314,0.0000205533,0.0001998979,0.00001454381],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003574682,"about_ca_system_score_gemma":0.00006008229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006517717,"about_ca_topic_score_gemma":0.000007752088,"domain_scores_codex":[0.9990597,0.00008859131,0.0003288824,0.0001638707,0.000245647,0.000113252],"domain_scores_gemma":[0.9979736,0.0001369817,0.0001738111,0.001546439,0.0001207191,0.00004845333],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002675529,0.008991215,0.0002717179,0.0001269426,0.0002614299,0.000001511479,0.01025882,0.2401625,0.004470618,0.06781381,0.0004441861,0.6669297],"study_design_scores_gemma":[0.0005858653,0.0007601944,0.003162973,0.0001732053,0.00002175554,0.000004631405,0.00008644096,0.9510947,0.04243474,0.001153592,0.0003277425,0.0001941219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01172809,0.00003032752,0.9849982,0.00008576657,0.0001567107,0.0001360619,0.00002149886,0.00005237932,0.002791011],"genre_scores_gemma":[0.9174406,0.0001060923,0.08234799,0.00002696792,0.000002761868,0.00002730586,0.000004233586,0.000006411347,0.00003764351],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9057125,"threshold_uncertainty_score":0.3967347,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05360785198762334,"score_gpt":0.2732643919597287,"score_spread":0.2196565399721054,"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."}}