analyze_creation_pattern_v4.py 47 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345
  1. #!/usr/bin/env python3
  2. # -*- coding: utf-8 -*-
  3. """
  4. 创作模式分析 V4(完整流程)
  5. 整合三步流程:
  6. 1. 数据准备:根据帖子图谱 + 人设图谱,提取待分析数据
  7. 2. 起点分析:AI分析创意起点(新版prompt)
  8. 3. 模式推导:基于共现关系的迭代推导
  9. 输入:帖子图谱 + 人设图谱
  10. 输出:完整的创作模式分析结果
  11. """
  12. import asyncio
  13. import json
  14. from pathlib import Path
  15. from typing import Dict, List, Optional, Set
  16. import sys
  17. # 添加项目根目录到路径
  18. project_root = Path(__file__).parent.parent.parent
  19. sys.path.insert(0, str(project_root))
  20. from lib.llm_cached import analyze, LLMConfig, AnalyzeResult
  21. from lib.my_trace import set_trace_smith as set_trace
  22. from script.data_processing.path_config import PathConfig
  23. # ===== 配置 =====
  24. TASK_NAME = "creation_pattern_v4" # 缓存任务名称
  25. OUTPUT_DIR_NAME = "creation_pattern_v4" # 输出目录名称
  26. MATCH_SCORE_THRESHOLD = 0.8 # 匹配分数阈值
  27. GLOBAL_RATIO_THRESHOLD = 0.7 # 全局占比阈值(>=0.7 算常量)
  28. ORIGIN_SCORE_THRESHOLD = 0.8 # 起点分数阈值
  29. # ===== 数据加载 =====
  30. def load_json(file_path: Path) -> Dict:
  31. """加载JSON文件"""
  32. with open(file_path, "r", encoding="utf-8") as f:
  33. return json.load(f)
  34. def get_post_graph_files(config: PathConfig) -> List[Path]:
  35. """获取所有帖子图谱文件"""
  36. post_graph_dir = config.intermediate_dir / "post_graph"
  37. return sorted(post_graph_dir.glob("*_帖子图谱.json"))
  38. # ===== 第一步:数据准备 =====
  39. def extract_post_detail(post_graph: Dict) -> Dict:
  40. """提取帖子详情"""
  41. meta = post_graph.get("meta", {})
  42. post_detail = meta.get("postDetail", {})
  43. return {
  44. "postId": meta.get("postId", ""),
  45. "postTitle": meta.get("postTitle", ""),
  46. "body_text": post_detail.get("body_text", ""),
  47. "images": post_detail.get("images", []),
  48. "video": post_detail.get("video"),
  49. "publish_time": post_detail.get("publish_time", ""),
  50. "like_count": post_detail.get("like_count", 0),
  51. "collect_count": post_detail.get("collect_count", 0),
  52. }
  53. def extract_analysis_nodes(post_graph: Dict, persona_graph: Dict) -> tuple:
  54. """
  55. 提取待分析节点列表
  56. 待分析节点 = 灵感点 + 目的点 + 关键点
  57. """
  58. nodes = post_graph.get("nodes", {})
  59. edges = post_graph.get("edges", {})
  60. persona_nodes = persona_graph.get("nodes", {})
  61. persona_index = persona_graph.get("index", {})
  62. # 1. 收集关键点信息
  63. keypoints = {}
  64. for node_id, node in nodes.items():
  65. if node.get("type") == "标签" and node.get("dimension") == "关键点":
  66. keypoints[node_id] = {
  67. "名称": node.get("name", ""),
  68. "描述": node.get("detail", {}).get("description", ""),
  69. }
  70. # 2. 分析支撑关系
  71. support_map = {}
  72. for edge_id, edge in edges.items():
  73. if edge.get("type") == "支撑":
  74. source_id = edge.get("source", "")
  75. target_id = edge.get("target", "")
  76. if source_id in keypoints:
  77. if target_id not in support_map:
  78. support_map[target_id] = []
  79. support_map[target_id].append(keypoints[source_id])
  80. # 3. 分析关联关系
  81. relation_map = {}
  82. for edge_id, edge in edges.items():
  83. if edge.get("type") == "关联":
  84. source_id = edge.get("source", "")
  85. target_id = edge.get("target", "")
  86. source_name = nodes.get(source_id, {}).get("name", "")
  87. target_name = nodes.get(target_id, {}).get("name", "")
  88. if source_id not in relation_map:
  89. relation_map[source_id] = []
  90. relation_map[source_id].append(target_name)
  91. if target_id not in relation_map:
  92. relation_map[target_id] = []
  93. relation_map[target_id].append(source_name)
  94. # 4. 分析人设匹配
  95. match_map = {}
  96. persona_out_edges = persona_index.get("outEdges", {})
  97. def get_node_info(node_id: str) -> Optional[Dict]:
  98. """获取人设节点的标准信息"""
  99. node = persona_nodes.get(node_id, {})
  100. if not node:
  101. return None
  102. detail = node.get("detail", {})
  103. parent_path = detail.get("parentPath", [])
  104. return {
  105. "节点ID": node_id,
  106. "节点名称": node.get("name", ""),
  107. "节点分类": "/".join(parent_path) if parent_path else "",
  108. "节点维度": node.get("dimension", ""),
  109. "节点类型": node.get("type", ""),
  110. "人设全局占比": detail.get("probGlobal", 0),
  111. "父类下占比": detail.get("probToParent", 0),
  112. }
  113. def get_parent_category_id(node_id: str) -> Optional[str]:
  114. """通过属于边获取父分类节点ID"""
  115. belong_edges = persona_out_edges.get(node_id, {}).get("属于", [])
  116. for edge in belong_edges:
  117. target_id = edge.get("target", "")
  118. target_node = persona_nodes.get(target_id, {})
  119. if target_node.get("type") == "分类":
  120. return target_id
  121. return None
  122. for edge_id, edge in edges.items():
  123. if edge.get("type") == "匹配":
  124. source_id = edge.get("source", "")
  125. target_id = edge.get("target", "")
  126. if source_id.startswith("帖子:") and target_id.startswith("人设:"):
  127. match_score = edge.get("score", 0)
  128. persona_node = persona_nodes.get(target_id, {})
  129. if persona_node:
  130. node_type = persona_node.get("type", "")
  131. match_node_info = get_node_info(target_id)
  132. if not match_node_info:
  133. continue
  134. if node_type == "标签":
  135. category_id = get_parent_category_id(target_id)
  136. else:
  137. category_id = target_id
  138. category_info = None
  139. if category_id:
  140. category_node = persona_nodes.get(category_id, {})
  141. if category_node:
  142. category_detail = category_node.get("detail", {})
  143. category_path = category_detail.get("parentPath", [])
  144. category_info = {
  145. "节点ID": category_id,
  146. "节点名称": category_node.get("name", ""),
  147. "节点分类": "/".join(category_path) if category_path else "",
  148. "节点维度": category_node.get("dimension", ""),
  149. "节点类型": "分类",
  150. "人设全局占比": category_detail.get("probGlobal", 0),
  151. "父类下占比": category_detail.get("probToParent", 0),
  152. "历史共现分类": [],
  153. }
  154. co_occur_edges = persona_out_edges.get(category_id, {}).get("分类共现", [])
  155. co_occur_edges_sorted = sorted(co_occur_edges, key=lambda x: x.get("score", 0), reverse=True)
  156. for co_edge in co_occur_edges_sorted[:5]:
  157. co_target_id = co_edge.get("target", "")
  158. co_score = co_edge.get("score", 0)
  159. co_node = persona_nodes.get(co_target_id, {})
  160. if co_node:
  161. co_detail = co_node.get("detail", {})
  162. co_path = co_detail.get("parentPath", [])
  163. category_info["历史共现分类"].append({
  164. "节点ID": co_target_id,
  165. "节点名称": co_node.get("name", ""),
  166. "节点分类": "/".join(co_path) if co_path else "",
  167. "节点维度": co_node.get("dimension", ""),
  168. "节点类型": "分类",
  169. "人设全局占比": co_detail.get("probGlobal", 0),
  170. "父类下占比": co_detail.get("probToParent", 0),
  171. "共现度": round(co_score, 4),
  172. })
  173. if source_id not in match_map:
  174. match_map[source_id] = []
  175. match_map[source_id].append({
  176. "匹配节点": match_node_info,
  177. "匹配分数": round(match_score, 4),
  178. "所属分类": category_info,
  179. })
  180. # 5. 构建待分析节点列表
  181. analysis_nodes = []
  182. for node_id, node in nodes.items():
  183. if node.get("type") == "标签" and node.get("domain") == "帖子":
  184. dimension = node.get("dimension", "")
  185. if dimension in ["灵感点", "目的点", "关键点"]:
  186. match_info = match_map.get(node_id)
  187. analysis_nodes.append({
  188. "节点ID": node_id,
  189. "节点名称": node.get("name", ""),
  190. "节点分类": node.get("category", ""),
  191. "节点维度": dimension,
  192. "节点类型": node.get("type", ""),
  193. "节点描述": node.get("detail", {}).get("description", ""),
  194. "人设匹配": match_info,
  195. })
  196. # 6. 构建关系列表
  197. relation_list = []
  198. for edge_id, edge in edges.items():
  199. if edge.get("type") == "支撑":
  200. source_id = edge.get("source", "")
  201. target_id = edge.get("target", "")
  202. if source_id in keypoints:
  203. relation_list.append({
  204. "来源节点": source_id,
  205. "目标节点": target_id,
  206. "关系类型": "支撑",
  207. })
  208. seen_relations = set()
  209. for edge_id, edge in edges.items():
  210. if edge.get("type") == "关联":
  211. source_id = edge.get("source", "")
  212. target_id = edge.get("target", "")
  213. key = tuple(sorted([source_id, target_id]))
  214. if key not in seen_relations:
  215. seen_relations.add(key)
  216. relation_list.append({
  217. "来源节点": source_id,
  218. "目标节点": target_id,
  219. "关系类型": "关联",
  220. })
  221. return analysis_nodes, relation_list
  222. def prepare_analysis_data(post_graph: Dict, persona_graph: Dict) -> Dict:
  223. """
  224. 准备完整的分析数据
  225. 输出扁平化的节点列表 + 独立的人设共现关系数据
  226. """
  227. analysis_nodes, relation_list = extract_analysis_nodes(post_graph, persona_graph)
  228. # 扁平化节点,提取人设共现关系数据
  229. flat_nodes = []
  230. persona_co_occur = {} # {分类ID: {名称, 共现分类列表}}
  231. for node in analysis_nodes:
  232. # 基础节点字段
  233. flat_node = {
  234. "节点ID": node["节点ID"],
  235. "节点名称": node["节点名称"],
  236. "节点分类": node.get("节点分类", ""),
  237. "节点维度": node["节点维度"],
  238. "节点描述": node.get("节点描述", ""),
  239. "是否已知": False,
  240. "发现编号": None,
  241. }
  242. # 提取人设匹配信息(list格式,支持多个匹配)
  243. match_list = node.get("人设匹配") or []
  244. if match_list:
  245. flat_node["人设匹配"] = []
  246. for match_info in match_list:
  247. category_info = match_info.get("所属分类")
  248. category_id = category_info.get("节点ID") if category_info else None
  249. # 保留完整的匹配信息,但去掉历史共现分类(拆到外面)
  250. clean_match = {
  251. "匹配节点": match_info.get("匹配节点"),
  252. "匹配分数": match_info.get("匹配分数", 0),
  253. }
  254. if category_info:
  255. # 复制所属分类,但不包含历史共现分类
  256. clean_category = {k: v for k, v in category_info.items() if k != "历史共现分类"}
  257. clean_match["所属分类"] = clean_category
  258. flat_node["人设匹配"].append(clean_match)
  259. # 收集人设共现关系(去重)- 从历史共现分类拆出来
  260. if category_id and category_id not in persona_co_occur:
  261. co_occur_list = category_info.get("历史共现分类", [])
  262. if co_occur_list:
  263. persona_co_occur[category_id] = [
  264. {
  265. "节点ID": c.get("节点ID"),
  266. "节点名称": c.get("节点名称"),
  267. "节点分类": c.get("节点分类", ""),
  268. "节点维度": c.get("节点维度", ""),
  269. "节点类型": c.get("节点类型", ""),
  270. "人设全局占比": c.get("人设全局占比", 0),
  271. "父类下占比": c.get("父类下占比", 0),
  272. "共现度": c.get("共现度", 0),
  273. }
  274. for c in co_occur_list
  275. if c.get("节点ID")
  276. ]
  277. else:
  278. flat_node["人设匹配"] = []
  279. flat_nodes.append(flat_node)
  280. return {
  281. "帖子详情": extract_post_detail(post_graph),
  282. "节点列表": flat_nodes,
  283. "关系列表": relation_list,
  284. "人设共现关系": persona_co_occur,
  285. }
  286. # ===== 第二步:起点分析(新版prompt) =====
  287. def get_best_match(node: Dict) -> Optional[Dict]:
  288. """获取节点的最佳人设匹配(分数最高的)"""
  289. match_list = node.get("人设匹配") or []
  290. if not match_list:
  291. return None
  292. return max(match_list, key=lambda m: m.get("匹配分数", 0))
  293. def get_match_score(node: Dict) -> float:
  294. """获取节点的最高人设匹配分数"""
  295. best_match = get_best_match(node)
  296. if best_match:
  297. return best_match.get("匹配分数", 0)
  298. return 0
  299. def get_category_id(node: Dict) -> Optional[str]:
  300. """获取节点的所属分类ID(最佳匹配的)"""
  301. best_match = get_best_match(node)
  302. if best_match:
  303. category = best_match.get("所属分类")
  304. if category:
  305. return category.get("节点ID")
  306. return None
  307. def get_all_category_ids(node: Dict) -> List[str]:
  308. """获取节点所有匹配的分类ID"""
  309. match_list = node.get("人设匹配") or []
  310. result = []
  311. for m in match_list:
  312. category = m.get("所属分类")
  313. if category and category.get("节点ID"):
  314. result.append(category.get("节点ID"))
  315. return result
  316. def get_category_global_ratio(node: Dict) -> float:
  317. """获取节点所属分类的人设全局占比(最佳匹配的)"""
  318. best_match = get_best_match(node)
  319. if best_match:
  320. category = best_match.get("所属分类")
  321. if category:
  322. return category.get("人设全局占比", 0)
  323. return 0
  324. def is_persona_constant(node: Dict) -> bool:
  325. """判断节点是否为人设常量(匹配分数 >= 0.8 且 分类全局占比 >= 0.8)"""
  326. match_score = get_match_score(node)
  327. global_ratio = get_category_global_ratio(node)
  328. return match_score >= MATCH_SCORE_THRESHOLD and global_ratio >= GLOBAL_RATIO_THRESHOLD
  329. def build_origin_context(nodes: List[Dict]) -> Dict:
  330. """构造AI分析的上下文(新版格式)"""
  331. # 所有创意标签
  332. all_tags = []
  333. for node in nodes:
  334. all_tags.append({
  335. "名称": node["节点名称"],
  336. "人设匹配度": round(get_match_score(node), 2),
  337. "所属分类全局占比": round(get_category_global_ratio(node), 2),
  338. })
  339. # 起点候选集(灵感点 + 目的点)
  340. candidates = [
  341. node["节点名称"]
  342. for node in nodes
  343. if node["节点维度"] in ["灵感点", "目的点"]
  344. ]
  345. return {
  346. "all_tags": all_tags,
  347. "candidates": candidates,
  348. }
  349. def format_origin_prompt(context: Dict) -> str:
  350. """格式化起点分析的prompt(新版)"""
  351. all_tags = context["all_tags"]
  352. candidates = context["candidates"]
  353. # 创意标签列表
  354. tags_text = ""
  355. for tag in all_tags:
  356. tags_text += f"- {tag['名称']}\n"
  357. tags_text += f" 人设匹配度: {tag['人设匹配度']} | 所属分类全局占比: {tag['所属分类全局占比']}\n\n"
  358. # 起点候选集(一行)
  359. candidates_text = "、".join(candidates)
  360. prompt = f"""# Role
  361. 你是小红书爆款内容的"逆向工程"专家。你的核心能力是透过内容的表象,还原创作者最初的脑回路。
  362. # Task
  363. 我提供一组笔记的【创意标签】和一个【起点候选集】。
  364. 请推理出哪些选项是真正的**创意起点**。
  365. # Input Data
  366. ## 创意标签
  367. {tags_text}
  368. ## 起点候选集
  369. {candidates_text}
  370. # 推理约束
  371. - 无法被其他项或人设推理出的点,即为起点(推理关系局限在起点候选集中)
  372. - 包含/被包含关系代表一种顺序:由大节点推导出被包含节点
  373. - 目的推理手段
  374. - 实质推理形式
  375. - 和人设匹配度越低的帖子是起点概率越大,证明这个起点具备外部性
  376. # Output Format
  377. 请输出一个标准的 JSON 格式。
  378. - Key: 候选集中的词。
  379. - Value: 一个对象,包含:
  380. - `score`: 0.0 到 1.0 的浮点数(代表是起点的可能性)。
  381. - `analysis`: 一句话推理"""
  382. return prompt
  383. async def analyze_origin(nodes: List[Dict], force_llm: bool = False) -> Dict:
  384. """
  385. 执行起点分析
  386. 输入: 节点列表
  387. 输出: 节点列表(加了起点分析、是否已知、发现编号字段)+ 中间结果
  388. """
  389. context = build_origin_context(nodes)
  390. prompt = format_origin_prompt(context)
  391. print(f"\n 起点候选: {len(context['candidates'])} 个")
  392. result = await analyze(
  393. prompt=prompt,
  394. task_name=f"{TASK_NAME}/origin",
  395. force=force_llm,
  396. parse_json=True,
  397. )
  398. # 把分析结果合并到节点
  399. llm_result = result.data or {}
  400. output_nodes = []
  401. current_order = 1 # 已知节点的发现编号计数
  402. for node in nodes:
  403. new_node = dict(node) # 复制原节点
  404. name = node["节点名称"]
  405. if name in llm_result:
  406. score = llm_result[name].get("score", 0)
  407. analysis = llm_result[name].get("analysis", "")
  408. # 加起点分析
  409. new_node["起点分析"] = {
  410. "分数": score,
  411. "说明": analysis,
  412. }
  413. # 高分起点标记为已知
  414. if score >= ORIGIN_SCORE_THRESHOLD:
  415. new_node["是否已知"] = True
  416. new_node["发现编号"] = current_order
  417. current_order += 1
  418. else:
  419. new_node["起点分析"] = None
  420. output_nodes.append(new_node)
  421. return {
  422. "输入上下文": {
  423. "创意标签": context["all_tags"],
  424. "起点候选": context["candidates"],
  425. },
  426. "中间结果": llm_result,
  427. "输出节点": output_nodes,
  428. "cache_hit": result.cache_hit,
  429. "model": result.model_name,
  430. "log_url": result.log_url,
  431. }
  432. # ===== 第三步:模式推导 =====
  433. def derive_patterns(
  434. nodes: List[Dict],
  435. persona_co_occur: Dict[str, Dict],
  436. ) -> Dict:
  437. """
  438. 基于共现关系的迭代推导
  439. 输入: 带起点分析的节点列表 + 人设共现关系数据
  440. 输出: 节点列表(加了推导轮次、未知原因字段)+ 推导边列表
  441. """
  442. node_by_name: Dict[str, Dict] = {n["节点名称"]: n for n in nodes}
  443. # 构建共现查找表 {节点ID: {共现节点ID: 共现度}}
  444. co_occur_lookup = {}
  445. for cat_id, co_occur_list in persona_co_occur.items():
  446. co_occur_lookup[cat_id] = {
  447. c["节点ID"]: c["共现度"]
  448. for c in co_occur_list
  449. }
  450. # 1. 初始化已知点集合(已经是已知的节点)
  451. known_names: Set[str] = set()
  452. node_round: Dict[str, int] = {} # {节点名称: 加入轮次}
  453. for node in nodes:
  454. if node.get("是否已知"):
  455. known_names.add(node["节点名称"])
  456. node_round[node["节点名称"]] = 0
  457. unknown_names: Set[str] = set(node_by_name.keys()) - known_names
  458. edges: List[Dict] = []
  459. # 2. 迭代推导
  460. round_num = 0
  461. new_known_this_round = known_names.copy()
  462. while new_known_this_round:
  463. round_num += 1
  464. new_known_next_round: Set[str] = set()
  465. for known_name in new_known_this_round:
  466. known_node = node_by_name.get(known_name)
  467. if not known_node:
  468. continue
  469. if get_match_score(known_node) < MATCH_SCORE_THRESHOLD:
  470. continue
  471. # 获取该节点所属分类的共现列表
  472. known_cat_id = get_category_id(known_node)
  473. if not known_cat_id or known_cat_id not in co_occur_lookup:
  474. continue
  475. co_occur_map = co_occur_lookup[known_cat_id]
  476. for unknown_name in list(unknown_names):
  477. unknown_node = node_by_name.get(unknown_name)
  478. if not unknown_node:
  479. continue
  480. if get_match_score(unknown_node) < MATCH_SCORE_THRESHOLD:
  481. continue
  482. # 检查未知节点的分类是否在已知节点的共现列表中
  483. unknown_cat_id = get_category_id(unknown_node)
  484. if unknown_cat_id and unknown_cat_id in co_occur_map:
  485. co_occur_score = co_occur_map[unknown_cat_id]
  486. new_known_next_round.add(unknown_name)
  487. node_round[unknown_name] = round_num
  488. edges.append({
  489. "来源": known_node["节点ID"],
  490. "目标": unknown_node["节点ID"],
  491. "关系类型": "共现推导",
  492. "推导轮次": round_num,
  493. "共现分类ID": unknown_cat_id,
  494. "共现度": co_occur_score,
  495. })
  496. known_names.update(new_known_next_round)
  497. unknown_names -= new_known_next_round
  498. new_known_this_round = new_known_next_round
  499. if not new_known_next_round:
  500. break
  501. # 3. 构建输出节点(只更新是否已知、发现编号)
  502. # 先找出当前最大发现编号
  503. max_order = 0
  504. for node in nodes:
  505. if node.get("发现编号") and node["发现编号"] > max_order:
  506. max_order = node["发现编号"]
  507. # 按推导轮次排序新发现的节点,分配发现编号
  508. new_known_by_round = {}
  509. for name, r in node_round.items():
  510. if r > 0: # 排除起点(轮次0)
  511. if r not in new_known_by_round:
  512. new_known_by_round[r] = []
  513. new_known_by_round[r].append(name)
  514. # 分配发现编号
  515. order_map = {}
  516. current_order = max_order + 1
  517. for r in sorted(new_known_by_round.keys()):
  518. for name in new_known_by_round[r]:
  519. order_map[name] = current_order
  520. current_order += 1
  521. output_nodes = []
  522. for node in nodes:
  523. new_node = dict(node)
  524. name = node["节点名称"]
  525. # 如果是新推导出来的(非起点),更新已知状态和发现编号
  526. if name in node_round and node_round[name] > 0:
  527. new_node["是否已知"] = True
  528. new_node["发现编号"] = order_map.get(name)
  529. output_nodes.append(new_node)
  530. return {
  531. "输出节点": output_nodes,
  532. "推导边列表": edges,
  533. "推导轮次": round_num,
  534. }
  535. # ===== 第四步:下一步分析 =====
  536. def build_next_step_context(known_nodes: List[Dict], unknown_nodes: List[Dict], all_nodes: List[Dict]) -> Dict:
  537. """构造下一步分析的上下文(简化版)"""
  538. # 已知点信息(按发现顺序排序,只保留名称和维度)
  539. known_sorted = sorted(known_nodes, key=lambda n: n.get("发现编号") or 999)
  540. known_info = [
  541. {"名称": n["节点名称"], "维度": n["节点维度"]}
  542. for n in known_sorted
  543. ]
  544. # 未知点信息(只保留名称和维度)
  545. unknown_info = [
  546. {"名称": n["节点名称"], "维度": n["节点维度"]}
  547. for n in unknown_nodes
  548. ]
  549. return {
  550. "known_nodes": known_info,
  551. "unknown_nodes": unknown_info,
  552. }
  553. def format_next_step_prompt(context: Dict) -> str:
  554. """格式化下一步分析的prompt(简化版)"""
  555. # 已知点:- 名称 (维度)
  556. known_text = "\n".join([
  557. f"- {n['名称']} ({n['维度']})"
  558. for n in context["known_nodes"]
  559. ])
  560. # 未知点:- 名称 (维度)
  561. unknown_text = "\n".join([
  562. f"- {n['名称']} ({n['维度']})"
  563. for n in context["unknown_nodes"]
  564. ])
  565. prompt = f"""# Role
  566. 你是小红书爆款内容的"逆向工程"专家。你的任务是还原创作者的思维路径。
  567. # Task
  568. 基于已知的创意点,推理哪些未知点最可能是创作者**下一步直接想到**的点。
  569. 可以有多个点同时被想到(如果它们在逻辑上是并列的)。
  570. ## 已知点
  571. {known_text}
  572. ## 未知点(待推理)
  573. {unknown_text}
  574. # 推理约束
  575. - 创作者的思维是有逻辑的:先有实质,再想形式
  576. - 包含/被包含关系代表一种顺序:由大节点推导出被包含节点
  577. - 只输出"下一步直接能想到"的点,不是所有未知点
  578. # Output Format
  579. 输出 JSON,对每个未知点评分:
  580. - Key: 未知点名称
  581. - Value: 对象,包含:
  582. - `score`: 0.0-1.0(下一步被想到的可能性)
  583. - `from`: 从哪个已知点推导出来(已知点名称),数组
  584. - `reason`: 如何从该已知点推导出来(一句话)"""
  585. return prompt
  586. async def analyze_next_step(
  587. nodes: List[Dict],
  588. force_llm: bool = False
  589. ) -> Dict:
  590. """
  591. 执行下一步分析
  592. 输入: 节点列表(有已知和未知)
  593. 输出: 最可能的下一步点列表
  594. """
  595. # 分离已知和未知
  596. known_nodes = [n for n in nodes if n.get("是否已知")]
  597. unknown_nodes = [n for n in nodes if not n.get("是否已知")]
  598. if not unknown_nodes:
  599. return {
  600. "输入上下文": {"已知点": [], "未知点": []},
  601. "中间结果": [],
  602. "下一步点": [],
  603. }
  604. context = build_next_step_context(known_nodes, unknown_nodes, nodes)
  605. prompt = format_next_step_prompt(context)
  606. print(f"\n 已知点: {len(known_nodes)} 个")
  607. print(f" 未知点: {len(unknown_nodes)} 个")
  608. result = await analyze(
  609. prompt=prompt,
  610. task_name=f"{TASK_NAME}/next_step",
  611. force=force_llm,
  612. parse_json=True,
  613. )
  614. # 解析结果(现在是 {name: {score, from, reason}} 格式)
  615. llm_result = result.data or {}
  616. # 构建候选列表,按分数排序
  617. candidates = []
  618. for name, info in llm_result.items():
  619. # from 现在是数组
  620. from_list = info.get("from", [])
  621. if isinstance(from_list, str):
  622. from_list = [from_list] # 兼容旧格式
  623. candidates.append({
  624. "节点名称": name,
  625. "可能性分数": info.get("score", 0),
  626. "推导来源": from_list,
  627. "推理说明": info.get("reason", ""),
  628. })
  629. candidates.sort(key=lambda x: x["可能性分数"], reverse=True)
  630. return {
  631. "输入上下文": {
  632. "已知点": context["known_nodes"],
  633. "未知点": context["unknown_nodes"],
  634. },
  635. "中间结果": llm_result,
  636. "下一步候选": candidates,
  637. "cache_hit": result.cache_hit,
  638. "model": result.model_name,
  639. "log_url": result.log_url,
  640. }
  641. # ===== 完整流程 =====
  642. def save_result(post_id: str, post_detail: Dict, steps: List, config: PathConfig) -> Path:
  643. """保存结果到文件"""
  644. output_dir = config.intermediate_dir / OUTPUT_DIR_NAME
  645. output_dir.mkdir(parents=True, exist_ok=True)
  646. output_file = output_dir / f"{post_id}_创作模式.json"
  647. result = {
  648. "帖子详情": post_detail,
  649. "步骤列表": steps,
  650. }
  651. with open(output_file, "w", encoding="utf-8") as f:
  652. json.dump(result, f, ensure_ascii=False, indent=2)
  653. print(f" [已保存] {output_file.name}")
  654. return output_file
  655. async def process_single_post(
  656. post_file: Path,
  657. persona_graph: Dict,
  658. config: PathConfig,
  659. force_llm: bool = False,
  660. max_step: int = 3,
  661. ) -> Dict:
  662. """
  663. 处理单个帖子
  664. Args:
  665. force_llm: 强制重新调用LLM(跳过LLM缓存)
  666. max_step: 最多运行到第几步 (1=数据准备, 2=起点分析, 3=模式推导)
  667. """
  668. post_graph = load_json(post_file)
  669. post_id = post_graph.get("meta", {}).get("postId", "unknown")
  670. print(f"\n{'=' * 60}")
  671. print(f"处理帖子: {post_id}")
  672. print("-" * 60)
  673. steps = []
  674. # ===== 步骤1:数据准备 =====
  675. print("\n[步骤1] 数据准备...")
  676. data = prepare_analysis_data(post_graph, persona_graph)
  677. post_detail = data["帖子详情"]
  678. nodes_step1 = data["节点列表"]
  679. relations_step1 = data["关系列表"]
  680. persona_co_occur = data["人设共现关系"]
  681. # 步骤1所有节点都是新的
  682. new_known_step1 = [n["节点名称"] for n in nodes_step1 if n.get("是否已知")]
  683. step1 = {
  684. "步骤": "数据准备",
  685. "输入": {
  686. "帖子图谱": str(post_file.name),
  687. "人设图谱": "人设图谱.json",
  688. },
  689. "输出": {
  690. "新的已知节点": new_known_step1,
  691. "新的边": [],
  692. "节点列表": nodes_step1,
  693. "边列表": relations_step1,
  694. },
  695. "人设共现关系": persona_co_occur,
  696. "摘要": {
  697. "节点数": len(nodes_step1),
  698. "边数": len(relations_step1),
  699. "人设共现数": len(persona_co_occur),
  700. },
  701. }
  702. steps.append(step1)
  703. print(f" 节点数: {len(nodes_step1)}")
  704. print(f" 关系数: {len(relations_step1)}")
  705. print(f" 人设共现数: {len(persona_co_occur)}")
  706. # 步骤1完成,保存
  707. save_result(post_id, post_detail, steps, config)
  708. if max_step == 1:
  709. return {"帖子详情": post_detail, "步骤列表": steps}
  710. # ===== 步骤2:起点分析 =====
  711. print("\n[步骤2] 起点分析...")
  712. origin_result = await analyze_origin(nodes_step1, force_llm=force_llm)
  713. nodes_step2 = origin_result["输出节点"]
  714. # 统计高分起点
  715. def get_origin_score(node):
  716. analysis = node.get("起点分析")
  717. if analysis:
  718. return analysis.get("分数", 0)
  719. return 0
  720. high_score_origins = [
  721. (n["节点名称"], get_origin_score(n))
  722. for n in nodes_step2
  723. if get_origin_score(n) >= 0.7
  724. ]
  725. # 新发现的已知节点(起点)
  726. new_known_nodes = [n["节点名称"] for n in nodes_step2 if n.get("是否已知")]
  727. step2 = {
  728. "步骤": "起点分析",
  729. "输入": {
  730. "节点列表": nodes_step1,
  731. "创意标签": origin_result["输入上下文"]["创意标签"],
  732. "起点候选": origin_result["输入上下文"]["起点候选"],
  733. },
  734. "中间结果": origin_result["中间结果"],
  735. "输出": {
  736. "新的已知节点": new_known_nodes,
  737. "新的边": [],
  738. "节点列表": nodes_step2,
  739. "边列表": relations_step1, # 边没变化
  740. },
  741. "摘要": {
  742. "新已知数": len(new_known_nodes),
  743. "model": origin_result["model"],
  744. "cache_hit": origin_result["cache_hit"],
  745. "log_url": origin_result.get("log_url"),
  746. },
  747. }
  748. steps.append(step2)
  749. print(f" 高分起点 (>=0.7): {len(high_score_origins)} 个")
  750. for name, score in sorted(high_score_origins, key=lambda x: -x[1]):
  751. print(f" ★ {name}: {score:.2f}")
  752. # 步骤2完成,保存
  753. save_result(post_id, post_detail, steps, config)
  754. if max_step == 2:
  755. return {"帖子详情": post_detail, "步骤列表": steps}
  756. # ===== 步骤3:模式推导 =====
  757. print("\n[步骤3] 模式推导...")
  758. derivation_result = derive_patterns(nodes_step2, persona_co_occur)
  759. nodes_step3 = derivation_result["输出节点"]
  760. edges = derivation_result["推导边列表"]
  761. # 统计
  762. known_count = sum(1 for n in nodes_step3 if n.get("是否已知"))
  763. unknown_count = len(nodes_step3) - known_count
  764. # 新发现的已知节点(本步骤推导出来的,不包括之前的起点)
  765. prev_known = {n["节点名称"] for n in nodes_step2 if n.get("是否已知")}
  766. new_known_nodes = [n["节点名称"] for n in nodes_step3 if n.get("是否已知") and n["节点名称"] not in prev_known]
  767. # 合并边列表(原有边 + 推导边)
  768. all_edges = relations_step1 + edges
  769. step3 = {
  770. "步骤": "模式推导",
  771. "输入": {
  772. "节点列表": nodes_step2,
  773. "人设共现关系": persona_co_occur,
  774. },
  775. "输出": {
  776. "新的已知节点": new_known_nodes,
  777. "新的边": edges,
  778. "节点列表": nodes_step3,
  779. "边列表": all_edges,
  780. },
  781. "摘要": {
  782. "已知点数": known_count,
  783. "新已知数": len(new_known_nodes),
  784. "新边数": len(edges),
  785. "未知点数": unknown_count,
  786. },
  787. }
  788. steps.append(step3)
  789. print(f" 已知点: {known_count} 个")
  790. print(f" 推导边: {len(edges)} 条")
  791. print(f" 未知点: {unknown_count} 个")
  792. # 步骤3完成,保存
  793. save_result(post_id, post_detail, steps, config)
  794. if max_step == 3:
  795. return {"帖子详情": post_detail, "步骤列表": steps}
  796. # ===== 步骤4:下一步分析 =====
  797. print("\n[步骤4] 下一步分析...")
  798. next_step_result = await analyze_next_step(nodes_step3, force_llm=force_llm)
  799. # 获取候选列表
  800. candidates = next_step_result["下一步候选"]
  801. # 筛选高分候选 (>= 0.8)
  802. NEXT_STEP_THRESHOLD = 0.8
  803. high_score_candidates = [c for c in candidates if c["可能性分数"] >= NEXT_STEP_THRESHOLD]
  804. # 构建节点名称到节点的映射
  805. node_by_name = {n["节点名称"]: n for n in nodes_step3}
  806. # 找出当前最大发现编号
  807. max_order = max((n.get("发现编号") or 0) for n in nodes_step3)
  808. # 更新节点:把高分候选标记为已知
  809. nodes_step4 = []
  810. new_known_names = []
  811. current_order = max_order + 1
  812. for node in nodes_step3:
  813. new_node = dict(node)
  814. name = node["节点名称"]
  815. # 检查是否在高分候选中
  816. matching = [c for c in high_score_candidates if c["节点名称"] == name]
  817. if matching and not node.get("是否已知"):
  818. new_node["是否已知"] = True
  819. new_node["发现编号"] = current_order
  820. current_order += 1
  821. new_known_names.append(name)
  822. nodes_step4.append(new_node)
  823. # 创建新的边(推导边,from 是数组,为每个来源创建一条边)
  824. new_edges = []
  825. for c in high_score_candidates:
  826. target_node = node_by_name.get(c["节点名称"])
  827. if not target_node:
  828. continue
  829. for source_name in c["推导来源"]:
  830. source_node = node_by_name.get(source_name)
  831. if source_node:
  832. new_edges.append({
  833. "来源": source_node["节点ID"],
  834. "目标": target_node["节点ID"],
  835. "关系类型": "AI推导",
  836. "可能性分数": c["可能性分数"],
  837. "推理说明": c["推理说明"],
  838. })
  839. # 合并边列表
  840. all_edges_step4 = all_edges + new_edges
  841. step4 = {
  842. "步骤": "下一步分析",
  843. "输入": {
  844. "已知点": next_step_result["输入上下文"]["已知点"],
  845. "未知点": next_step_result["输入上下文"]["未知点"],
  846. },
  847. "中间结果": next_step_result["中间结果"],
  848. "输出": {
  849. "新的已知节点": new_known_names,
  850. "新的边": new_edges,
  851. "节点列表": nodes_step4,
  852. "边列表": all_edges_step4,
  853. },
  854. "摘要": {
  855. "已知点数": sum(1 for n in nodes_step4 if n.get("是否已知")),
  856. "新已知数": len(new_known_names),
  857. "新边数": len(new_edges),
  858. "未知点数": sum(1 for n in nodes_step4 if not n.get("是否已知")),
  859. "model": next_step_result.get("model"),
  860. "cache_hit": next_step_result.get("cache_hit"),
  861. "log_url": next_step_result.get("log_url"),
  862. },
  863. }
  864. steps.append(step4)
  865. # 打印高分候选
  866. print(f" 候选数: {len(candidates)} 个")
  867. print(f" 高分候选 (>={NEXT_STEP_THRESHOLD}): {len(high_score_candidates)} 个")
  868. for c in high_score_candidates:
  869. from_str = " & ".join(c["推导来源"])
  870. print(f" ★ {c['节点名称']} ({c['可能性分数']:.2f}) ← {from_str}")
  871. print(f" {c['推理说明']}")
  872. # 步骤4完成,保存
  873. save_result(post_id, post_detail, steps, config)
  874. if max_step == 4:
  875. return {"帖子详情": post_detail, "步骤列表": steps}
  876. # ===== 循环:步骤3→步骤4 直到全部已知 =====
  877. iteration = 1
  878. current_nodes = nodes_step4
  879. current_edges = all_edges_step4
  880. MAX_ITERATIONS = 10 # 防止无限循环
  881. while True:
  882. # 检查是否还有未知节点
  883. unknown_count = sum(1 for n in current_nodes if not n.get("是否已知"))
  884. if unknown_count == 0:
  885. print(f"\n[完成] 所有节点已变为已知")
  886. break
  887. if iteration > MAX_ITERATIONS:
  888. print(f"\n[警告] 达到最大迭代次数 {MAX_ITERATIONS},停止循环")
  889. break
  890. # ===== 迭代步骤3:共现推导 =====
  891. print(f"\n[迭代{iteration}-步骤3] 模式推导...")
  892. derivation_result = derive_patterns(current_nodes, persona_co_occur)
  893. nodes_iter3 = derivation_result["输出节点"]
  894. edges_iter3 = derivation_result["推导边列表"]
  895. # 统计新推导的
  896. prev_known_names = {n["节点名称"] for n in current_nodes if n.get("是否已知")}
  897. new_known_step3 = [n["节点名称"] for n in nodes_iter3 if n.get("是否已知") and n["节点名称"] not in prev_known_names]
  898. new_edges_step3 = edges_iter3 # derive_patterns 返回的是本轮新增的边
  899. all_edges_iter3 = current_edges + new_edges_step3
  900. step_iter3 = {
  901. "步骤": f"迭代{iteration}-模式推导",
  902. "输入": {
  903. "节点列表": current_nodes,
  904. "人设共现关系": persona_co_occur,
  905. },
  906. "输出": {
  907. "新的已知节点": new_known_step3,
  908. "新的边": new_edges_step3,
  909. "节点列表": nodes_iter3,
  910. "边列表": all_edges_iter3,
  911. },
  912. "摘要": {
  913. "已知点数": sum(1 for n in nodes_iter3 if n.get("是否已知")),
  914. "新已知数": len(new_known_step3),
  915. "新边数": len(new_edges_step3),
  916. "未知点数": sum(1 for n in nodes_iter3 if not n.get("是否已知")),
  917. },
  918. }
  919. steps.append(step_iter3)
  920. print(f" 新已知: {len(new_known_step3)} 个")
  921. print(f" 新边: {len(new_edges_step3)} 条")
  922. save_result(post_id, post_detail, steps, config)
  923. # 检查是否还有未知
  924. unknown_after_step3 = sum(1 for n in nodes_iter3 if not n.get("是否已知"))
  925. if unknown_after_step3 == 0:
  926. print(f"\n[完成] 所有节点已变为已知")
  927. break
  928. # ===== 迭代步骤4:AI推导 =====
  929. print(f"\n[迭代{iteration}-步骤4] 下一步分析...")
  930. next_step_result = await analyze_next_step(nodes_iter3, force_llm=force_llm)
  931. candidates_iter4 = next_step_result["下一步候选"]
  932. high_score_iter4 = [c for c in candidates_iter4 if c["可能性分数"] >= NEXT_STEP_THRESHOLD]
  933. # 更新节点
  934. node_by_name_iter4 = {n["节点名称"]: n for n in nodes_iter3}
  935. max_order_iter4 = max((n.get("发现编号") or 0) for n in nodes_iter3)
  936. nodes_iter4 = []
  937. new_known_iter4 = []
  938. current_order_iter4 = max_order_iter4 + 1
  939. for node in nodes_iter3:
  940. new_node = dict(node)
  941. name = node["节点名称"]
  942. matching = [c for c in high_score_iter4 if c["节点名称"] == name]
  943. if matching and not node.get("是否已知"):
  944. new_node["是否已知"] = True
  945. new_node["发现编号"] = current_order_iter4
  946. current_order_iter4 += 1
  947. new_known_iter4.append(name)
  948. nodes_iter4.append(new_node)
  949. # 创建新边(from 是数组,为每个来源创建一条边)
  950. new_edges_iter4 = []
  951. for c in high_score_iter4:
  952. target_node = node_by_name_iter4.get(c["节点名称"])
  953. if not target_node:
  954. continue
  955. for source_name in c["推导来源"]:
  956. source_node = node_by_name_iter4.get(source_name)
  957. if source_node:
  958. new_edges_iter4.append({
  959. "来源": source_node["节点ID"],
  960. "目标": target_node["节点ID"],
  961. "关系类型": "AI推导",
  962. "可能性分数": c["可能性分数"],
  963. "推理说明": c["推理说明"],
  964. })
  965. all_edges_iter4 = all_edges_iter3 + new_edges_iter4
  966. step_iter4 = {
  967. "步骤": f"迭代{iteration}-下一步分析",
  968. "输入": {
  969. "已知点": next_step_result["输入上下文"]["已知点"],
  970. "未知点": next_step_result["输入上下文"]["未知点"],
  971. },
  972. "中间结果": next_step_result["中间结果"],
  973. "输出": {
  974. "新的已知节点": new_known_iter4,
  975. "新的边": new_edges_iter4,
  976. "节点列表": nodes_iter4,
  977. "边列表": all_edges_iter4,
  978. },
  979. "摘要": {
  980. "已知点数": sum(1 for n in nodes_iter4 if n.get("是否已知")),
  981. "新已知数": len(new_known_iter4),
  982. "新边数": len(new_edges_iter4),
  983. "未知点数": sum(1 for n in nodes_iter4 if not n.get("是否已知")),
  984. "model": next_step_result.get("model"),
  985. "cache_hit": next_step_result.get("cache_hit"),
  986. },
  987. }
  988. steps.append(step_iter4)
  989. print(f" 新已知: {len(new_known_iter4)} 个")
  990. print(f" 新边: {len(new_edges_iter4)} 条")
  991. save_result(post_id, post_detail, steps, config)
  992. # 如果这轮没有新进展,停止
  993. if len(new_known_step3) == 0 and len(new_known_iter4) == 0:
  994. print(f"\n[停止] 本轮无新进展,停止循环")
  995. break
  996. # 更新状态,进入下一轮
  997. current_nodes = nodes_iter4
  998. current_edges = all_edges_iter4
  999. iteration += 1
  1000. return {"帖子详情": post_detail, "步骤列表": steps}
  1001. # ===== 主函数 =====
  1002. async def main(
  1003. post_id: str = None,
  1004. all_posts: bool = False,
  1005. force_llm: bool = False,
  1006. max_step: int = 3,
  1007. ):
  1008. """主函数"""
  1009. _, log_url = set_trace()
  1010. config = PathConfig()
  1011. print(f"账号: {config.account_name}")
  1012. print(f"Trace URL: {log_url}")
  1013. print(f"输出目录: {OUTPUT_DIR_NAME}")
  1014. # 加载人设图谱
  1015. persona_graph_file = config.intermediate_dir / "人设图谱.json"
  1016. if not persona_graph_file.exists():
  1017. print(f"错误: 人设图谱文件不存在: {persona_graph_file}")
  1018. return
  1019. persona_graph = load_json(persona_graph_file)
  1020. print(f"人设图谱节点数: {len(persona_graph.get('nodes', {}))}")
  1021. # 获取帖子图谱文件
  1022. post_graph_files = get_post_graph_files(config)
  1023. if not post_graph_files:
  1024. print("错误: 没有找到帖子图谱文件")
  1025. return
  1026. # 确定要处理的帖子
  1027. if post_id:
  1028. target_file = next(
  1029. (f for f in post_graph_files if post_id in f.name),
  1030. None
  1031. )
  1032. if not target_file:
  1033. print(f"错误: 未找到帖子 {post_id}")
  1034. return
  1035. files_to_process = [target_file]
  1036. elif all_posts:
  1037. files_to_process = post_graph_files
  1038. else:
  1039. files_to_process = [post_graph_files[0]]
  1040. print(f"待处理帖子数: {len(files_to_process)}")
  1041. # 处理
  1042. results = []
  1043. for i, post_file in enumerate(files_to_process, 1):
  1044. print(f"\n{'#' * 60}")
  1045. print(f"# 处理帖子 {i}/{len(files_to_process)}")
  1046. print(f"{'#' * 60}")
  1047. result = await process_single_post(
  1048. post_file=post_file,
  1049. persona_graph=persona_graph,
  1050. config=config,
  1051. force_llm=force_llm,
  1052. max_step=max_step,
  1053. )
  1054. results.append(result)
  1055. # 汇总
  1056. print(f"\n{'#' * 60}")
  1057. print(f"# 完成! 共处理 {len(results)} 个帖子")
  1058. print(f"{'#' * 60}")
  1059. print(f"Trace: {log_url}")
  1060. print("\n汇总:")
  1061. for result in results:
  1062. post_id = result["帖子详情"]["postId"]
  1063. steps = result.get("步骤列表", [])
  1064. num_steps = len(steps)
  1065. if num_steps == 1:
  1066. step1_summary = steps[0].get("摘要", {})
  1067. print(f" {post_id}: 节点数={step1_summary.get('节点数', 0)} (仅数据准备)")
  1068. elif num_steps == 2:
  1069. step2_summary = steps[1].get("摘要", {})
  1070. print(f" {post_id}: 起点={step2_summary.get('新已知数', 0)} (未推导)")
  1071. elif num_steps == 3:
  1072. step3_summary = steps[2].get("摘要", {})
  1073. print(f" {post_id}: 已知={step3_summary.get('已知点数', 0)}, "
  1074. f"未知={step3_summary.get('未知点数', 0)}")
  1075. elif num_steps >= 4:
  1076. step4_summary = steps[3].get("摘要", {})
  1077. print(f" {post_id}: 已知={step4_summary.get('已知点数', 0)}, "
  1078. f"新已知={step4_summary.get('新已知数', 0)}, "
  1079. f"新边={step4_summary.get('新边数', 0)}, "
  1080. f"未知={step4_summary.get('未知点数', 0)}")
  1081. else:
  1082. print(f" {post_id}: 无步骤数据")
  1083. if __name__ == "__main__":
  1084. import argparse
  1085. parser = argparse.ArgumentParser(description="创作模式分析 V4")
  1086. parser.add_argument("--post-id", type=str, help="帖子ID")
  1087. parser.add_argument("--all-posts", action="store_true", help="处理所有帖子")
  1088. parser.add_argument("--force-llm", action="store_true", help="强制重新调用LLM(跳过LLM缓存)")
  1089. parser.add_argument("--step", type=int, default=5, choices=[1, 2, 3, 4, 5],
  1090. help="运行到第几步 (1=数据准备, 2=起点分析, 3=模式推导, 4=下一步分析, 5=完整循环)")
  1091. args = parser.parse_args()
  1092. asyncio.run(main(
  1093. post_id=args.post_id,
  1094. all_posts=args.all_posts,
  1095. force_llm=args.force_llm,
  1096. max_step=args.step,
  1097. ))