Update CP-7.6, assign it to IC14-new

Author: szarnyasg

bib/references.bib

@@ -11,7 +11,6 @@ @article{facebook_anatomy
     bibsource = {DBLP, http://dblp.uni-trier.de}
 }
 
-
 @misc{test_driver,
     author = {Alex Averbuch},
     title = {https://github.com/ldbc/ldbc_driver},
@@ -2215,3 +2214,19 @@ @article{DBLP:journals/pvldb/SzarnyasWSSBWZB22
  volume = {16},
  year = {2022}
 }
+
+@article{DBLP:journals/jal/MeyerS03,
+  author       = {Ulrich Meyer and
+                  Peter Sanders},
+  title        = {Delta-stepping: {A} parallelizable shortest path algorithm},
+  journal      = {J. Algorithms},
+  volume       = {49},
+  number       = {1},
+  pages        = {114--152},
+  year         = {2003},
+  url          = {https://doi.org/10.1016/S0196-6774(03)00076-2},
+  doi          = {10.1016/S0196-6774(03)00076-2},
+  timestamp    = {Tue, 25 Jul 2017 16:35:21 +0200},
+  biburl       = {https://dblp.org/rec/journals/jal/MeyerS03.bib},
+  bibsource    = {dblp computer science bibliography, https://dblp.org}
+}

choke-points.tex

@@ -337,9 +337,10 @@ \section{Graph Specifics}
 
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 
-\cpSection{7.6}{QEXE}{Weighted shortest paths}
+\cpSection{7.6}{QEXE}{Cheapest paths (weighted shortest paths)}
 
-Computing single-source shortest path is a fundamental problem in graph queries. While there are well-known algorithms to compute it, \eg Dijkstra's algorithm or the Bellman-Ford algorithm, system often use na\"ive approaches such as enumerating all paths which makes these queries intractable.
+Computing \emph{cheapest paths} (weighted shortest paths) is a fundamental problem in graph queries.
+While there are well-known algorithms to compute it, \eg Dijkstra's algorithm, Bellman--Ford, and delta-stepping~\cite{DBLP:journals/jal/MeyerS03}, system often use na\"ive approaches such as enumerating all paths which makes these queries unnecessarily complex.
 
 \input{choke-points/cp-7-6}
 

query-specifications/interactive-complex-read-14-new.yaml

@@ -34,7 +34,6 @@ result:
   - name: pathWeight
     type: 64-bit Integer
     category: calculated
-choke_points: [3.3, 5.3, 7.2, 7.3, 7.5, 7.7, 7.8, 8.1, 8.2, 8.3, 8.6] #TODO
+choke_points: [3.3, 5.3, 7.6, 7.7, 7.8, 8.1, 8.2, 8.3, 8.6]
 relevance: |
   This query tests the performance of cheapest path (weighted shortest path) computation.
-  It uses integer edge weights to prevent inaccuracies introduced by floating-point number representation to cause differences in query results.