StrictParity-GraphAudit: When Graph Retrieval Gains Do Not Become RAG Context Gains

Under review. A graph-RAG evaluation paper on when graph retrieval gains deserve graph-specific credit under matched interfaces, leakage controls, and answer-boundary checks.

Authors: Iman YeckehZaare · Venue/status: EMNLP

This submitted manuscript introduces StrictParity-GraphAudit, a reusable audit protocol for separating exact-ID graph retrieval repairs from broader RAG context-utility or answer-generation claims.

Public artifact boundary: this route exposes status, authorship, visual summary, citation metadata, and the contribution boundary; manuscript files are posted only when review and prepublication rules allow it.

The rendered manuscript page adds status, visual summary, review boundary, citation metadata, and contribution notes. Key links: home, systems, papers, manuscripts, Google Scholar, GitHub, LinkedIn, ORCID, MIT profile, and CV PDF.