dayan 0.2.0__tar.gz

dayan-0.2.0/.gitattributes

@@ -0,0 +1 @@
+* text=auto eol=lf

dayan-0.2.0/.github/workflows/ci.yml

@@ -0,0 +1,41 @@
+name: ci
+
+on:
+  push:
+    branches: [main]
+  pull_request:
+
+jobs:
+  test:
+    strategy:
+      matrix:
+        os: [ubuntu-latest, windows-latest, macos-latest]
+        python-version: ["3.10", "3.11", "3.12", "3.13"]
+    runs-on: ${{ matrix.os }}
+    steps:
+      - uses: actions/checkout@v4
+
+      - uses: actions/setup-python@v5
+        with:
+          python-version: ${{ matrix.python-version }}
+
+      - name: Install package (dependency-free core)
+        run: pip install -e .
+
+      - name: Compile check
+        run: python -m compileall -q src tests
+
+      - name: Offline tests (scripted LLM backends, no endpoint)
+        run: python -m unittest discover -s tests -v
+
+  lint:
+    runs-on: ubuntu-latest
+    steps:
+      - uses: actions/checkout@v4
+      - uses: actions/setup-python@v5
+        with:
+          python-version: "3.12"
+      - name: Ruff
+        run: |
+          pip install ruff
+          ruff check src tests

dayan-0.2.0/.github/workflows/publish.yml

@@ -0,0 +1,47 @@
+name: publish
+
+on:
+  release:
+    types: [published]
+
+jobs:
+  build:
+    runs-on: ubuntu-latest
+    steps:
+      - uses: actions/checkout@v4
+      - uses: actions/setup-python@v5
+        with:
+          python-version: "3.12"
+      - name: Build sdist and wheel
+        run: |
+          pip install build
+          python -m build
+      - name: Twine check
+        run: |
+          pip install twine
+          twine check dist/*
+      - name: Upload artifacts
+        uses: actions/upload-artifact@v4
+        with:
+          name: dayan-dist
+          path: dist/
+
+  pypi:
+    # PyPI Trusted Publishing (OIDC): no stored token.  Configure once on
+    # pypi.org — Manage project → Publishing → add GitHub publisher with
+    # owner ruochunjin, repository dayan, workflow publish.yml,
+    # environment name "pypi".
+    needs: build
+    runs-on: ubuntu-latest
+    environment:
+      name: pypi
+      url: https://pypi.org/p/dayan
+    permissions:
+      id-token: write
+    steps:
+      - uses: actions/download-artifact@v4
+        with:
+          name: dayan-dist
+          path: dist/
+      - name: Publish to PyPI
+        uses: pypa/gh-action-pypi-publish@release/v1

dayan-0.2.0/.gitignore

@@ -0,0 +1,17 @@
+__pycache__/
+*.py[cod]
+*.egg-info/
+.eggs/
+build/
+dist/
+.venv/
+venv/
+.pytest_cache/
+.ruff_cache/
+log/
+data/
+output/
+.DS_Store
+Thumbs.db
+.idea/
+.vscode/

dayan-0.2.0/CITATION.cff

@@ -0,0 +1,11 @@
+cff-version: 1.2.0
+title: "DaYan (大衍): thought-graph modeling and process evaluation for LLM reasoning"
+message: >-
+  If you use this software, please cite both the software and the
+  underlying research papers (Thought Mining; Logical DA).
+type: software
+# TODO: add author list and repository URL before public release.
+authors: []
+url: "https://github.com/ruochunjin/dayan"
+version: 0.1.0
+license: Apache-2.0

dayan-0.2.0/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any licenses granted to
+      You under this License for that Work shall terminate as of the date
+      such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your use of permissions.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

dayan-0.2.0/PKG-INFO

@@ -0,0 +1,134 @@
+Metadata-Version: 2.5
+Name: dayan
+Version: 0.2.0
+Summary: DaYan (大衍): thought-graph modeling, process-level evaluation, pattern mining and verified data augmentation for LLM reasoning
+Project-URL: Homepage, https://github.com/ruochunjin/dayan
+Project-URL: Issues, https://github.com/ruochunjin/dayan/issues
+Author: DaYan Developers
+License: Apache-2.0
+License-File: LICENSE
+Keywords: LLM reasoning,RL process reward,data augmentation,process evaluation,thought graph
+Classifier: Development Status :: 3 - Alpha
+Classifier: Intended Audience :: Science/Research
+Classifier: License :: OSI Approved :: Apache Software License
+Classifier: Programming Language :: Python :: 3
+Classifier: Topic :: Scientific/Engineering :: Artificial Intelligence
+Requires-Python: >=3.10
+Provides-Extra: augment
+Requires-Dist: z3-solver>=4.12; extra == 'augment'
+Provides-Extra: dev
+Requires-Dist: pytest>=8.0; extra == 'dev'
+Requires-Dist: ruff>=0.6; extra == 'dev'
+Provides-Extra: llm
+Requires-Dist: openai>=1.30; extra == 'llm'
+Description-Content-Type: text/markdown
+
+# DaYan 大衍
+
+> *大衍之数五十，其用四十有九。* — The I Ching's Great Expansion generates
+> structured hexagram states through a formal derivation procedure.
+> **DaYan** does the same for LLM reasoning: it turns the reasoning *process*
+> into structured data — a Thought Graph — and then analyzes it.
+
+DaYan is a toolkit for **modeling, evaluating, and enhancing LLM reasoning as
+data**. Where standard evaluation only checks final answers, DaYan answers
+*how* the model reasoned — and feeds the findings back as improvements.
+
+```text
+reasoning program (your code calling an LLM)
+  → @analysis instrumentation (sys.settrace, no source changes)
+  → program trace → data-flow graph → Thought Graph
+        (nodes = LLM outputs "thoughts", edges = data dependencies)
+  → process evaluation: 5 metrics beyond accuracy
+  → pattern mining: frequent thinking patterns (successful vs. failed)
+  → enhancement: prompt rules / verifiable RL process rewards
+```
+
+An auxiliary subpackage, `dayan.augment`, provides **symbolically verified
+data augmentation** (Logical DA): LLM-generated samples whose labels are
+checked by Z3 / Prover9 / rule / CSP solvers before they enter your training
+set.
+
+## Quickstart
+
+```python
+from dayan import analysis, query, set_backend, AnalysisOutput
+
+# Inject any LLM: (context, instruction, temperature) -> str
+set_backend(my_llm_fn)
+
+@analysis(output_type=AnalysisOutput.THOUGHT)
+def solve(nums):
+    step = query("Add the numbers in {} and get [total]", nums)  # LLM step
+    return int(step) * 2
+
+result, thought_graph = solve([4, 4])
+print(result)                       # program output
+print(thought_graph.print_summary())  # nodes/edges of the reasoning process
+```
+
+Evaluate a cohort of reasoning runs:
+
+```python
+from dayan import ThoughtSample, mine_frequent_patterns, reasoning_efficiency, stepwise_consistency
+
+patterns = mine_frequent_patterns([g1, g2, g3], length=3, min_support=2)
+print(reasoning_efficiency(patterns))          # κ (branching) / λ (first layer)
+print(stepwise_consistency(ThoughtSample(g1, success=True, step_matches={...})))
+```
+
+Mine patterns from successful vs. failed runs and turn them into prompt
+rules or RL process rewards:
+
+```python
+from dayan import contrastive_patterns, patterns_to_prompt_rules, PatternProcessReward
+
+good, bad = contrastive_patterns(success_graphs, failure_graphs)
+rules = patterns_to_prompt_rules(good, bad)          # inject into prompts
+reward_fn = PatternProcessReward(good, bad)           # per-step RL reward
+reward = reward_fn(label_sequence_of_a_trajectory)
+```
+
+## Verified data augmentation
+
+```bash
+dayan augment --dataset records.json --output augmented.json --solver z3
+```
+
+The pipeline (attribute extraction → diversity filtering → label-flipped
+generation → symbolic verification → reflection) runs on any OpenAI-compatible
+endpoint; `DAYAN_API_KEY` / `DAYAN_BASE_URL` / `DAYAN_MODEL` configure it
+(falling back to `OPENAI_*`).  An Anthropic-messages endpoint (e.g. K3) works
+via `DAYAN_BACKEND=anthropic`.  Solvers: `z3`, `prover9`, `rules`, `csp`
+(auto-detected), with an `llm` fallback.
+
+## Measured end-to-end (K3 endpoint)
+
+| Suite | Result |
+| --- | --- |
+| Instrumented reasoning smoke | program → 4-node Thought Graph, correct answer, metrics on the real trace |
+| Game24 thought mining (6 puzzles, single-shot) | **0.83 accuracy**; multipath reliability gain +0.17; SCS 1.00 |
+| Metric discrimination (synthetic) | branched κ=3.00 vs linear κ=1.00 — efficiency metric separates backtracking from chains |
+| Logical DA on RTE-style samples | 4 inputs → 11 generated, **7/11 verified by Z3** (symbolic), 5 rejected |
+
+## Installation
+
+```bash
+pip install -e .              # core is dependency-free
+pip install -e ".[llm]"       # optional OpenAI SDK backend (stdlib works too)
+pip install -e ".[augment]"   # z3-solver for label verification
+pip install -e ".[dev]"       # tests + lint
+```
+
+## Research lineage
+
+- **Thought Mining for Large Language Model Reasoning** — the Thought Graph
+  data model, the five process metrics, and both enhancement strategies.
+- **Logical DA** (ACL 2025 Findings) — multi-agent data augmentation with
+  symbolic label verification.
+
+If you use DaYan, please cite these works (see CITATION.cff).
+
+## License
+
+Apache-2.0 (see LICENSE).

dayan-0.2.0/README.md

@@ -0,0 +1,109 @@
+# DaYan 大衍
+
+> *大衍之数五十，其用四十有九。* — The I Ching's Great Expansion generates
+> structured hexagram states through a formal derivation procedure.
+> **DaYan** does the same for LLM reasoning: it turns the reasoning *process*
+> into structured data — a Thought Graph — and then analyzes it.
+
+DaYan is a toolkit for **modeling, evaluating, and enhancing LLM reasoning as
+data**. Where standard evaluation only checks final answers, DaYan answers
+*how* the model reasoned — and feeds the findings back as improvements.
+
+```text
+reasoning program (your code calling an LLM)
+  → @analysis instrumentation (sys.settrace, no source changes)
+  → program trace → data-flow graph → Thought Graph
+        (nodes = LLM outputs "thoughts", edges = data dependencies)
+  → process evaluation: 5 metrics beyond accuracy
+  → pattern mining: frequent thinking patterns (successful vs. failed)
+  → enhancement: prompt rules / verifiable RL process rewards
+```
+
+An auxiliary subpackage, `dayan.augment`, provides **symbolically verified
+data augmentation** (Logical DA): LLM-generated samples whose labels are
+checked by Z3 / Prover9 / rule / CSP solvers before they enter your training
+set.
+
+## Quickstart
+
+```python
+from dayan import analysis, query, set_backend, AnalysisOutput
+
+# Inject any LLM: (context, instruction, temperature) -> str
+set_backend(my_llm_fn)
+
+@analysis(output_type=AnalysisOutput.THOUGHT)
+def solve(nums):
+    step = query("Add the numbers in {} and get [total]", nums)  # LLM step
+    return int(step) * 2
+
+result, thought_graph = solve([4, 4])
+print(result)                       # program output
+print(thought_graph.print_summary())  # nodes/edges of the reasoning process
+```
+
+Evaluate a cohort of reasoning runs:
+
+```python
+from dayan import ThoughtSample, mine_frequent_patterns, reasoning_efficiency, stepwise_consistency
+
+patterns = mine_frequent_patterns([g1, g2, g3], length=3, min_support=2)
+print(reasoning_efficiency(patterns))          # κ (branching) / λ (first layer)
+print(stepwise_consistency(ThoughtSample(g1, success=True, step_matches={...})))
+```
+
+Mine patterns from successful vs. failed runs and turn them into prompt
+rules or RL process rewards:
+
+```python
+from dayan import contrastive_patterns, patterns_to_prompt_rules, PatternProcessReward
+
+good, bad = contrastive_patterns(success_graphs, failure_graphs)
+rules = patterns_to_prompt_rules(good, bad)          # inject into prompts
+reward_fn = PatternProcessReward(good, bad)           # per-step RL reward
+reward = reward_fn(label_sequence_of_a_trajectory)
+```
+
+## Verified data augmentation
+
+```bash
+dayan augment --dataset records.json --output augmented.json --solver z3
+```
+
+The pipeline (attribute extraction → diversity filtering → label-flipped
+generation → symbolic verification → reflection) runs on any OpenAI-compatible
+endpoint; `DAYAN_API_KEY` / `DAYAN_BASE_URL` / `DAYAN_MODEL` configure it
+(falling back to `OPENAI_*`).  An Anthropic-messages endpoint (e.g. K3) works
+via `DAYAN_BACKEND=anthropic`.  Solvers: `z3`, `prover9`, `rules`, `csp`
+(auto-detected), with an `llm` fallback.
+
+## Measured end-to-end (K3 endpoint)
+
+| Suite | Result |
+| --- | --- |
+| Instrumented reasoning smoke | program → 4-node Thought Graph, correct answer, metrics on the real trace |
+| Game24 thought mining (6 puzzles, single-shot) | **0.83 accuracy**; multipath reliability gain +0.17; SCS 1.00 |
+| Metric discrimination (synthetic) | branched κ=3.00 vs linear κ=1.00 — efficiency metric separates backtracking from chains |
+| Logical DA on RTE-style samples | 4 inputs → 11 generated, **7/11 verified by Z3** (symbolic), 5 rejected |
+
+## Installation
+
+```bash
+pip install -e .              # core is dependency-free
+pip install -e ".[llm]"       # optional OpenAI SDK backend (stdlib works too)
+pip install -e ".[augment]"   # z3-solver for label verification
+pip install -e ".[dev]"       # tests + lint
+```
+
+## Research lineage
+
+- **Thought Mining for Large Language Model Reasoning** — the Thought Graph
+  data model, the five process metrics, and both enhancement strategies.
+- **Logical DA** (ACL 2025 Findings) — multi-agent data augmentation with
+  symbolic label verification.
+
+If you use DaYan, please cite these works (see CITATION.cff).
+
+## License
+
+Apache-2.0 (see LICENSE).

dayan-0.2.0/README_zh.md

@@ -0,0 +1,54 @@
+# DaYan 大衍
+
+> 《易经》"大衍之数五十，其用四十有九"——以形式化推演程序生成结构化的卦象状态。**大衍**对大模型推理做同样的事：把推理*过程*变成结构化数据（Thought Graph），再加以分析。
+
+[English README](README.md)
+
+大衍是一个**"思维数据"的建模、评估与增强工具包**。传统评测只看最终答案对不对，大衍回答"模型是怎么推理的"，并把发现回流为改进。
+
+```text
+推理程序（您的代码调用 LLM）
+  → @analysis 插桩（sys.settrace，不改源代码）
+  → 程序 trace → 数据流图 → Thought Graph（节点=LLM 输出的"思维"，边=数据依赖）
+  → 过程评估：五个超越准确率的指标
+  → 模式挖掘：频繁思维模式（成功 vs 失败对比挖掘）
+  → 增强：prompt 规则注入 / 可验证的 RL 过程奖励
+```
+
+辅助子包 `dayan.augment` 提供**符号验证的数据增广**（Logical DA）：LLM 生成的样本，标签先经 Z3 / Prover9 / 规则 / CSP 求解器校验才进入训练集。
+
+## 快速开始
+
+```python
+from dayan import analysis, query, set_backend, AnalysisOutput
+
+set_backend(my_llm_fn)  # 注入任意 LLM：(context, instruction, temperature) -> str
+
+@analysis(output_type=AnalysisOutput.THOUGHT)
+def solve(nums):
+    step = query("Add the numbers in {} and get [total]", nums)  # LLM 步骤
+    return int(step) * 2
+
+result, thought_graph = solve([4, 4])
+```
+
+## 五个过程评估指标
+
+推理效率（频繁模式的分支因子 κ / 首现层 λ）· 关键节点判断（节点影响力相关性 NIS）· 推理共性（路径分布 KL 散度）· 多路径可靠性（路径聚合增益）· 逐步一致性（深度加权 SCS）。
+
+## 可信数据增广
+
+```bash
+dayan augment --dataset records.json --output augmented.json --solver z3
+```
+
+端点配置：`DAYAN_API_KEY` / `DAYAN_BASE_URL` / `DAYAN_MODEL`（兼容 `OPENAI_*`）。
+
+## 学术脉络
+
+- *Thought Mining for Large Language Model Reasoning*——Thought Graph 数据模型、五个过程指标、两种增强策略
+- *Logical DA*（ACL 2025 Findings）——多智能体数据增广与符号标签验证
+
+## 许可
+
+Apache-2.0（见 LICENSE）。