Function conceptEntriesFromGraph

deployments/desktop/static/desktop.js:3366–3384

(sourceNodes, sourceEdges)

  }

  function conceptEntriesFromGraph(sourceNodes, sourceEdges) {
    const degree = graphDegreeMap(sourceNodes, sourceEdges);
    const entries = new Map();
    sourceNodes.forEach((node) => {
      const nodeId = graphId(node);
      const type = graphType(node);
      const base = type === "paper" ? 2 : type === "frontier" ? 1.3 : type === "method" ? 0.9 : 1;
      candidateLabelsForNode(node).forEach((label, index) => {
        if (!entries.has(label)) {
          entries.set(label, { label, score: 0, nodeIds: new Set(), nodes: [] });
        }
        const entry = entries.get(label);
        entry.score += base + Math.min(2.5, degree[nodeId] || 0) * 0.18 + (8 - index) * 0.04;
        entry.nodeIds.add(nodeId);
        entry.nodes.push(node);
      });
    });
    return dedupeConceptEntries(Array.from(entries.values()).sort((a, b) => b.score - a.score));
  }

  function dedupeConceptEntries(entries) {
    const selected = [];