<｜begin▁of▁sentence｜>### Instruction:
Given a joint degree dictionary with degrees where there is 1 edge between nodes of degree 1 and nodes of degree 4, and 2 edges between nodes of degree 4, can you check if this joint degree dictionary is realizable as a simple graph using NetworkX?
### Response:
import networkx as nx

# Define a joint degree dictionary
joint_degrees = {1: {4: 1}, 4: {1: 1, 4: 2}}

# Check if the joint degree is realizable
is_realizable = nx.is_valid_joint_degree(joint_degrees)

print('Is the joint degree realizable?', is_realizable)
<|EOT|>
