def ingest_document(doc_path: str) -> DocumentRecord:
    raw = extract_text(doc_path)
    metadata = {
        "doc_id": generate_uuid(),
        "source": doc_path,
        "sections": extract_headings(raw),
        "cross_refs": extract_internal_links(raw),
        "timestamp": get_modification_time(doc_path),
        "domain": classify_domain(raw)
    }
    return DocumentRecord(raw=raw, metadata=metadata)

def chunk_with_boundaries(text: str, metadata: dict, max_tokens: int = 512) -> list[Chunk]:
    sections = split_by_headings(text, metadata["sections"])
    chunks = []
    for sec in sections:
        sub_chunks = semantic_split(sec, max_tokens=max_tokens)
        for i, sub in enumerate(sub_chunks):
            chunks.append(Chunk(
                content=sub,
                metadata={**metadata, "section": sec.heading, "chunk_index": i}
            ))
    return chunks

contexts. This prevents the retriever from collapsing multi-document requirements into a single vector search.

def multi_hop_retrieve(query: str, retriever: BaseRetriever, max_hops: int = 3) -> list[Chunk]:
    sub_queries = decompose_query(query, max_hops=max_hops)
    all_chunks = []
    for sq in sub_queries:
        hits = retriever.retrieve(query=sq, top_k=8)
        all_chunks.extend(hits)
    # Deduplicate by content hash + metadata provenance
    return deduplicate_chunks(all_chunks)

Step 4: Context-Aware Reranking

Use a cross-encoder reranker that scores chunk-query relevance while penalizing redundancy and rewarding cross-document complementarity. Standard dense retrieval cannot model inter-chunk relationships.

def rerank_with_complementarity(query: str, chunks: list[Chunk], model: CrossEncoder) -> list[Chunk]:
    scored = []
    for c in chunks:
        relevance = model.score(query, c.content)
        redundancy_penalty = compute_overlap(c.content, [x.content for x in chunks if x != c])
        complementarity_bonus = reward_cross_doc_coverage(c.metadata, chunks)
        final_score = relevance - redundancy_penalty + complementarity_bonus
        scored.append((c, final_score))
    scored.sort(key=lambda x: x[1], reverse=True)
    return [c for c, _ in scored[:6]]  # Hard cap to control context window

Step 5: Synthesis & Citation-Grounded Generation

Prompt the LLM with explicit cross-reference instructions, enforce citation formatting, and validate output against retrieved contexts. Never allow ungrounded synthesis.

def generate_multi_doc_response(query: str, reranked_chunks: list[Chunk], llm: ChatModel) -> str:
    context = format_context_with_provenance(reranked_chunks)
    prompt = f"""
    Answer the query using ONLY the provided contexts.
    Each statement must cite the exact doc_id and section.
    If information spans multiple documents, explicitly state the relationship.
    Do not infer or hallucinate connections not present in the contexts.
    
    Context:
    {context}
    
    Query: {query}
    """
    return llm.complete(prompt)

Architecture Decisions

• Dense vs. Sparse vs. Hybrid: Dense embeddings capture semantic similarity but miss exact terminology. BM25 handles precise matching. Hybrid retrieval (weighted fusion or learned cross-attention) consistently outperforms either alone on multi-doc workloads.
• Reranker Placement: Always rerank after initial retrieval. Cross-encoders add ~50-120ms but reduce context noise by 60-70%, improving downstream LLM accuracy more than any prompt engineering.
• Context Window Management: Cap retrieved chunks at 4-6 after reranking. LLMs degrade rapidly beyond ~8k tokens of mixed provenance. Use hierarchical summarization if deeper context is required.
• Citation Enforcement: Require structured output (JSON or markdown with explicit [doc_id:section] tags). Validate citations programmatically before returning to users.

Pitfall Guide

1. Treating Documents as Independent Bag-of-Chunks
   Ignoring document boundaries causes cross-references to break. Fix: Enforce chunking at section/doc boundaries and retain doc_id in all metadata.

2. Skipping Cross-Encoder Reranking
   Dense retrieval alone returns topically related but factually misaligned chunks. Fix: Integrate a lightweight cross-encoder (e.g., bge-reranker, colbert-v2) post-retrieval.

3. Over-Fetching Top-K Without Deduplication
   Increasing top_k to 20+ creates context collision and token waste. Fix: Deduplicate by content hash + metadata, then hard-cap at 4-6 chunks post-reranking.

4. Missing Citation Tracking in LLM Output
   Unstructured responses make it impossible to verify cross-document claims. Fix: Enforce JSON/markdown citation schemas and validate against retrieved metadata.

5. Ignoring Latency-Accuracy Tradeoffs
   Multi-hop retrieval + reranking can exceed SLA thresholds. Fix: Cache frequent query decompositions, use async retrieval, and implement fallback to single-doc mode for simple queries.

6. Assuming Embeddings Capture Cross-Document Semantics
   Vector similarity measures local relevance, not relational structure. Fix: Use query decomposition, graph-based linking, or explicit cross-reference extraction during ingestion.

7. Skipping Consistency Validation
   LLMs may synthesize contradictory claims from different sources. Fix: Implement a lightweight consistency checker that flags conflicting citations before response delivery.

Production Bundle

Action Checklist

• Extract and store document-level metadata (boundaries, sections, cross-refs, timestamps)
• Implement boundary-aware chunking that never splits mid-reference
• Deploy hybrid retrieval (dense + BM25) with weighted fusion
• Integrate cross-encoder reranker with redundancy penalty logic
• Enforce structured citation output and validate against retrieved metadata
• Implement query decomposition for multi-hop retrieval paths
• Add consistency validation layer before response delivery
• Cache frequent sub-queries and implement latency fallbacks

Decision Matrix

Approach	Best For	Latency Impact	Accuracy Gain	Complexity	Production Readiness
Naive Multi-Vector	Simple lookups, low budget	Low	Low	Low	High
Hierarchical (Doc → Section → Chunk)	Structured corporates, legal, policy	Medium	High	Medium	High
Graph-Based (Cross-Ref Edges)	Research, technical docs, codebases	High	Very High	High	Medium
Agentic (Query Decomposition + Tool Use)	Dynamic enterprise, multi-source APIs	High	Very High	Very High	Low-Medium

Configuration Template

# multi_doc_rag_config.yaml
ingestion:
  boundary_aware_chunking: true
  max_chunk_tokens: 512
  preserve_sections: true
  extract_cross_refs: true

retrieval:
  strategy: hybrid
  dense_model: "BAAI/bge-large-en-v1.5"
  sparse_model: "BM25"
  fusion_weights: [0.7, 0.3]
  initial_top_k: 12

reranking:
  model: "cross-encoder/ms-marco-MiniLM-L-6-v2"
  redundancy_penalty: true
  complementarity_bonus: true
  max_final_chunks: 6

generation:
  citation_format: "json"
  enforce_provenance: true
  consistency_check: true
  llm_model: "anthropic/claude-3-5-sonnet"

performance:
  cache_sub_queries: true
  ttl_seconds: 3600
  latency_fallback: "single_doc_mode"
  max_latency_ms: 1200

Quick Start Guide

1. Ingest with Metadata: Run boundary-aware chunking on your corpus. Store doc_id, section, cross_refs, and timestamp alongside embeddings.
2. Deploy Hybrid Retrieval + Reranker: Initialize dense and sparse indexes. Fuse scores with weighted coefficients. Pass top-12 results through a cross-encoder reranker with redundancy penalties.
3. Enforce Citation Schema: Configure your LLM to output structured citations ([doc_id:section]). Validate each citation against the reranked chunk metadata before delivery.
4. Monitor & Iterate: Track cross-context accuracy, latency, and hallucination rate. Adjust max_final_chunks, fusion weights, and reranker thresholds based on workload characteristics.

Multi-document RAG is not a prompt trick. It is an architectural discipline that treats documents as relational entities, not isolated vectors. Implement the boundaries, rerank aggressively, cite explicitly, and validate consistently. The accuracy gains justify the added complexity; the operational cost of ignoring it compounds silently.