<｜begin▁of▁sentence｜>### Instruction:
Imagine you're coordinating a relief effort after a major hurricane. In the aftermath, the communication between different teams and resource centers is crucial. To manage this, you've mapped out a network that represents the flow of information and resources between various nodes—each node represents either a team or a resource hub, and the directed edges connecting them symbolize the transmission direction.

To facilitate efficient planning, you've collected some data about the network's structure. Each node has a certain number of incoming and outgoing communication lines—this is crucial as it ensures that all messages and supplies are circulated properly. Specifically, your latest reports show that you have three key points in your network with the following number of connections: Node A with 2 incoming and 3 outgoing, Node B with 2 incoming and 1 outgoing, and Node C with 4 incoming and 4 outgoing lines.

Additionally, you've kept a detailed record, almost like a ledger, which highlights direct interactions between nodes of specific in-and out-degrees. This ledger is summarized as follows: nodes with 3 outgoing lines have 2 incoming lines; those with 1 outgoing line have 2 incoming lines; and the one handling 4 of both types of lines is a standalone case.

In amidst the chaos, your task is to assess whether this pattern of communication and resource exchange is actually feasible—can such a network exist based on the information at hand? To aid in this evaluation, think of this as determining if the communication structure you have on paper can be realized in the field, given the communication capabilities (incoming and outgoing lines) of each team or resource hub. This analysis is similar to using the 'is_valid_directed_joint_degree' function in NetworkX, which mathematically confirms the possibility of constructing a network from such specific degree sequences. If feasible, your plan can move forward onto the next stage of implementation in the disaster-affected area.
### Response:
import networkx as nx

# Define in and out degree sequences
in_degrees = [2, 2, 4]
out_degrees = [3, 1, 4]

# Define directed joint degree dictionary
nkk = {
    3: {2: 2},
    1: {2: 1},
    4: {4: 1}
}

# Check if the directed joint degree is valid
is_valid = nx.is_valid_directed_joint_degree(in_degrees, out_degrees, nkk)
print('Is the joint degree valid?', is_valid)
<|EOT|>
