Unverified50% confidenceDecision RuleExact time
Retrieval is performed through whitelisted named queries, up to three hops, with a traversal policy deciding which predicates may be traversed.
1
Sources
50%
Confidence
Medium-term (~90 days)
Relevance
10/18/2026
First Seen
Valid until: 1/16/2027
Sources
Related Entities
Related Claims
UnverifiedSearch intent is usually divided into four categories: informational, navigational, commercial investigation, and transactional.65% similarUnverifiedKeyword retrieval tokenizes the query, counts the number of matched terms in each chunk, and scores and ranks them proportionally; it is simple to implement, costs nothing extra, and produces interpretable results, but can only match literal overlaps.64% similarUnverifiedAdvanced implementations of query rewriting include intent recognition, coreference resolution, and multi-intent decomposition.63% similarUnverifiedIn the hypergraph setting, the greedy algorithm at each step preferentially selects the sentence node participating in the greatest number of hyperedges, which is equivalent to preferentially selecting the sentence covering the most key topics.63% similarUnverifiedThe strategy is a research instruction rather than a mandatory whitelist; if the search scope needs to be restricted, request-level search configuration should be used; a cutoff date in the Prompt does not generate a historical snapshot of the underlying data.62% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1063243API
curl https://kongchang.com/api/v1/knowledge/claims/1063243MCP
get_claim(id=1063243)