Fix missing canonical examples + bib keys (#1021 review)

Surfaced during structural review of #1021:
- MaximumEdgeWeightedKClique has both i32 and f64 ReduceTo impls but
  only an i32 canonical example was registered; the example-db
  coverage test failed. Add an f64 spec mirroring the i32 instance.
- MaximumCoKPlex has both i32 and One ReduceTo impls but only an i32
  canonical example existed (also flagged by the coverage test). Add
  a One-weighted spec on the same C5 graph.
- Paper cited `@ParkLeePark1996EWClique` and `@GouveiaMartins2015EWClique`
  but neither bib key existed. Add both entries to references.bib
  while keeping the original `@GouveiaMartins2015MEWC` entry that the
  problem-def section still cites.

Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>

Author: isPANN

docs/paper/references.bib

@@ -1964,6 +1964,28 @@ @article{GouveiaMartins2015MEWC
   doi     = {10.1007/s13675-014-0028-1}
 }
 
+@article{ParkLeePark1996EWClique,
+  author  = {Kyungchul Park and Kyungsik Lee and Sungsoo Park},
+  title   = {An extended formulation approach to the edge-weighted maximal clique problem},
+  journal = {European Journal of Operational Research},
+  volume  = {95},
+  number  = {3},
+  pages   = {671--682},
+  year    = {1996},
+  doi     = {10.1016/0377-2217(95)00299-5}
+}
+
+@article{GouveiaMartins2015EWClique,
+  author  = {Luis Gouveia and Pedro Martins},
+  title   = {Solving the maximum edge-weight clique problem in sparse graphs with compact formulations},
+  journal = {EURO Journal on Computational Optimization},
+  volume  = {3},
+  number  = {1},
+  pages   = {1--30},
+  year    = {2015},
+  doi     = {10.1007/s13675-014-0028-1}
+}
+
 @article{HuntingFaigleKern2001,
   author  = {Marcel Hunting and Ulrich Faigle and Walter Kern},
   title   = {A {Lagrangian} relaxation approach to the edge-weighted clique problem},

src/rules/maximumcokplex_ilp.rs

@@ -111,17 +111,30 @@ impl ReduceTo<ILP<bool>> for MaximumCoKPlex<SimpleGraph, One, KN> {
 
 #[cfg(feature = "example-db")]
 pub(crate) fn canonical_rule_example_specs() -> Vec<crate::example_db::specs::RuleExampleSpec> {
-    vec![crate::example_db::specs::RuleExampleSpec {
-        id: "maximumcokplex_to_ilp",
-        build: || {
-            let source = MaximumCoKPlex::<_, i32, KN>::with_k(
-                SimpleGraph::new(5, vec![(0, 1), (1, 2), (2, 3), (3, 4), (4, 0)]),
-                vec![5, 1, 4, 1, 3],
-                2,
-            );
-            crate::example_db::specs::rule_example_via_ilp::<_, bool>(source)
+    vec![
+        crate::example_db::specs::RuleExampleSpec {
+            id: "maximumcokplex_i32_to_ilp",
+            build: || {
+                let source = MaximumCoKPlex::<_, i32, KN>::with_k(
+                    SimpleGraph::new(5, vec![(0, 1), (1, 2), (2, 3), (3, 4), (4, 0)]),
+                    vec![5, 1, 4, 1, 3],
+                    2,
+                );
+                crate::example_db::specs::rule_example_via_ilp::<_, bool>(source)
+            },
         },
-    }]
+        crate::example_db::specs::RuleExampleSpec {
+            id: "maximumcokplex_one_to_ilp",
+            build: || {
+                let source = MaximumCoKPlex::<_, One, KN>::with_k(
+                    SimpleGraph::new(5, vec![(0, 1), (1, 2), (2, 3), (3, 4), (4, 0)]),
+                    vec![One; 5],
+                    2,
+                );
+                crate::example_db::specs::rule_example_via_ilp::<_, bool>(source)
+            },
+        },
+    ]
 }
 
 #[cfg(test)]

src/rules/maximumedgeweightedkclique_ilp.rs

@@ -151,19 +151,32 @@ impl ReduceTo<ILP<bool>> for MaximumEdgeWeightedKClique<f64> {
 #[cfg(feature = "example-db")]
 pub(crate) fn canonical_rule_example_specs() -> Vec<crate::example_db::specs::RuleExampleSpec> {
     use crate::topology::SimpleGraph;
-    vec![crate::example_db::specs::RuleExampleSpec {
-        id: "maximumedgeweightedkclique_to_ilp",
-        build: || {
-            // Canonical issue #1020 instance: 4 vertices, 5 edges, k = 3.
-            // Optimum induced weight is 5 + 4 + (-1) = 8 on clique {0, 1, 2}.
-            let source = MaximumEdgeWeightedKClique::<i32>::new(
-                SimpleGraph::new(4, vec![(0, 1), (0, 2), (1, 2), (0, 3), (1, 3)]),
-                vec![5, 4, -1, 1, 0],
-                3,
-            );
-            crate::example_db::specs::rule_example_via_ilp::<_, bool>(source)
+    vec![
+        crate::example_db::specs::RuleExampleSpec {
+            id: "maximumedgeweightedkclique_i32_to_ilp",
+            build: || {
+                // Canonical issue #1020 instance: 4 vertices, 5 edges, k = 3.
+                // Optimum induced weight is 5 + 4 + (-1) = 8 on clique {0, 1, 2}.
+                let source = MaximumEdgeWeightedKClique::<i32>::new(
+                    SimpleGraph::new(4, vec![(0, 1), (0, 2), (1, 2), (0, 3), (1, 3)]),
+                    vec![5, 4, -1, 1, 0],
+                    3,
+                );
+                crate::example_db::specs::rule_example_via_ilp::<_, bool>(source)
+            },
         },
-    }]
+        crate::example_db::specs::RuleExampleSpec {
+            id: "maximumedgeweightedkclique_f64_to_ilp",
+            build: || {
+                let source = MaximumEdgeWeightedKClique::<f64>::new(
+                    SimpleGraph::new(4, vec![(0, 1), (0, 2), (1, 2), (0, 3), (1, 3)]),
+                    vec![5.0, 4.0, -1.0, 1.0, 0.0],
+                    3,
+                );
+                crate::example_db::specs::rule_example_via_ilp::<_, bool>(source)
+            },
+        },
+    ]
 }
 
 #[cfg(test)]