<｜begin▁of▁sentence｜>### Instruction:
Given a graph with the edge set [('A', 'B'), ('B', 'C'), ('B', 'D'), ('C', 'D')] and percolation states for each node {'A': 0.5, 'B': 1.0, 'C': 0.75, 'D': 0.25}, can you compute the percolation centrality for each node using NetworkX?
### Response:
import networkx as nx

# Create a graph
G = nx.Graph()
G.add_edges_from([('A', 'B'), ('B', 'C'), ('B', 'D'), ('C', 'D')])

# Set percolation states
states = {'A': 0.5, 'B': 1.0, 'C': 0.75, 'D': 0.25}

# Compute the percolation centrality
percolation_centralities = nx.percolation_centrality(G, states=states)

# Output the percolation centrality for each node
for node, centrality in percolation_centralities.items():
    print(f'Node {node}: {centrality}')
<|EOT|>
