Guest Editor’s notes

(“No PANE, No Gain: Scaling Attributed Network Embedding in a Single Server”); (f) key innova-tions for bipartite matching that significantly improve the computation of the assignment costs (“Bipartite Matching: What to do in the Real World When Computing Assignment Costs Dominates Finding the Optimal Assignment”); (g) a system that combines the advantages of imperative and functional dataflow systems (“Imperative or Functional Control Flow Handling: Why not the Best of Both Worlds?”); (h) new insights for estimating quantiles in streams with strong theoretical guar-antees, which are already available in the Apache Datasketches library (“Relative Error Streaming Quantiles”); (i) characterizations and answers to foundational questions on the consistency prob-lem for relations under bag semantics (“Structure and Complexity of Bag Consistency”); and (j) an interesting new connection between counting the number of models of a CNF formula and the distinct elements in a data stream (“Model Counting Meets Distinct Elements in a Data Stream”).