What the documents look like
MCN operations manage long-term account compliance for many creators at once. The work differs from a single brand's live-selling session, because the materials cover several creators across several months rather than one campaign. The documents handled day to day include creator signing contracts, training records, violation handling forms, and account schedules. Sources include the MCN back office, platform violation notices, creator account data, and the contract ledger.
During an operations handover these materials sit in different states. A contract may be signed or awaiting renewal. A violation handling form may be closed or awaiting review. A schedule may be confirmed or awaiting the creator's reply. Retrieval at this step lets the incoming operator find the relevant document by keyword or by meaning, then check who holds the permission and what the handover status is. A retrieval result does not by itself grant authorization, and it does not mean the handover is complete.
Constraints at the retrieval step
The knowledge base is organized into libraries, collections, and data. The smallest search unit is the library, so a search runs against an entire library; a collection only groups data for management and does not affect search results. A knowledge base search node can be linked to one or more knowledge bases that use the same vector model. Knowledge bases with different vector models cannot be linked together.
Search modes are semantic retrieval, full-text retrieval, and hybrid retrieval. Hybrid retrieval combines multiple retrieval paths through RRF, and ReRank reorders candidate text. The reference cap is measured in tokens. The minimum relevance value applies only during semantic retrieval or when result reordering is used. Question optimization performs reference resolution and question expansion, and it adds one model call.
Hypothetical paper exercise: an MCN operations handover. The source text for comparison is: "Creator A's signing contract number HT-2024-031, signing date 15 March 2024, valid until 14 March 2025, current status signed." "Violation handling form V-2024-017, concerning Creator A, handling date 10 June 2024, handling result closed." The draft sentence to be judged is: "Creator A's contract has been renewed through 2026, and live sessions can be scheduled directly after handover." Retrieval compares the draft sentence against the source text. The source shows the contract valid until 14 March 2025 and does not mention renewal. The renewal claim in the draft sentence has no corresponding record in the source.
Configuration and implementation checks
| Configuration item | Hypothetical starting value for this exercise | Reason and comparison method |
|---|---|---|
| Linked knowledge bases | Creator contract library, violation handling library | Both libraries use the same vector model; first check whether the vector model identifiers match |
| Search mode | Hybrid retrieval | Contract numbers and violation form numbers need exact matching, while descriptive text needs approximate matching; compare recall differences between the two modes |
| Reference cap | 3000 tokens | Contracts and violation forms are moderate in length; compare whether referenced content stays complete at 2000 and at 3000 |
| Minimum relevance | 0.45 | First label relevant and irrelevant samples, then compare whether irrelevant fragments are filtered at 0.3 and at 0.45 |
| Question optimization | Enabled | Handover questions often contain references; compare whether the subject in the original question matches the subject in the optimized question |
| Result reordering | Enabled | When candidates are numerous, compare ranking before and after reordering; a ReRank model is required |
Three common errors
- Treating a retrieval result as the basis for authorization. Finding a contract document does not mean the incoming operator has obtained signing or renewal authority. The check inputs the draft sentence "the contract has been renewed through 2026," compares it against the validity field in the source text, finds no renewal record in the source, and observes that a retrieved contract document does not change the authorization state.
- Linking knowledge bases across vector models. When the vector model identifiers of two knowledge bases differ, the node cannot link them together. The check inputs the vector model identifiers of both libraries, compares whether they match, excludes the mismatched one, and does not run a cross-model search.
- Treating minimum relevance as a permission filter. Minimum relevance is a filtering threshold that applies only during semantic retrieval or result reordering, and it does not exclude unrelated business or unauthorized records. The check inputs an unrelated query, compares whether returned results contain unrelated fragments, and observes that low relevance does not equal permission isolation.
How to verify the setup
- Input the draft sentence from the hypothetical exercise, "Creator A's contract has been renewed through 2026, and live sessions can be scheduled directly after handover," and compare it against the validity field in the retrieved contract source text, "valid until 14 March 2025." Observe whether the returned content contains renewal information. The expected result is that the source has no renewal field, and the renewal claim in the draft sentence has no corresponding record in the retrieved material.
- Input the vector model identifiers of the two knowledge bases and compare whether they match. Observe whether the node allows them to be linked together. The expected result is that matching identifiers allow linking, while differing identifiers exclude the mismatched one. Record the actual observation and do not infer missed recall or redundant results.
- Input an empty query or a paper input with a clearly stated absence of matches, and observe whether the referenced content output array has length 0. The expected result is that the output path runs through with an empty reference array, and the downstream design accommodates an empty result. Do not claim that a search under a fictional rule necessarily returns an empty array.