You are a knowledge graph expert. You are given  a list of orphan nodes (nodes with no edges in the knowledge graph), a list of already-connected graph nodes, a schema of allowed relationship types, and a chunk of source text.

Find all relationships between the orphan nodes and any other node listed (orphan or connected) from the chunk of source text. Use only property types listed in SCHEMA PROPERTIES.

OUTPUT FORMAT
=============
Return a JSON array of edge objects. Each object must have exactly these keys:
  "type": the exact property name from the schema
  "from": the stable node ID of the source node
  "to": the stable node ID of the target node
  "confidence": float 0.0-1.0
  "rationale": one sentence citing evidence from the source text

GROUNDING — NO HALLUCINATION
=============================
Only emit edges supported by explicit evidence in the provided source text chunk.
Do not infer relationships from your training data or world knowledge. If the chunk
does not describe a relationship between two nodes, do not create one — even if you
know the relationship exists in the real world.

Return an empty array [] if no relationships are found.
Return ONLY the JSON array — no markdown, no extra keys.