solvi 0.1.0__tar.gz

solvi-0.1.0/LICENSE

@@ -0,0 +1,202 @@
+
+                                 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 patent 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 exercise of permissions under this License.
+
+   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 warranty or 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.

solvi-0.1.0/PKG-INFO

@@ -0,0 +1,250 @@
+Metadata-Version: 2.4
+Name: solvi
+Version: 0.1.0
+Summary: Decision systems from a catalog of Python functions and checks: a strategist plans the flow, every answer comes with a quote or formula and a verifiable trace
+Keywords: decision systems,rules,document extraction,ModernBERT,explainability,verification,audit trail
+Author: mxkuzn
+Author-email: mxkuzn <hi@mxkuzn.dev>
+License-Expression: Apache-2.0
+License-File: LICENSE
+Classifier: Development Status :: 3 - Alpha
+Classifier: Intended Audience :: Developers
+Classifier: Intended Audience :: Science/Research
+Classifier: Programming Language :: Python :: 3
+Classifier: Topic :: Scientific/Engineering :: Artificial Intelligence
+Classifier: Topic :: Software Development :: Libraries
+Requires-Dist: numpy
+Requires-Dist: scipy
+Requires-Dist: torch ; extra == 'model'
+Requires-Dist: transformers ; extra == 'model'
+Requires-Python: >=3.10
+Project-URL: Homepage, https://github.com/solvi-ai/solvi
+Project-URL: Documentation, https://github.com/solvi-ai/solvi/blob/main/docs/guide.md
+Project-URL: Issues, https://github.com/solvi-ai/solvi/issues
+Project-URL: Models, https://huggingface.co/solvi-ai
+Provides-Extra: model
+Description-Content-Type: text/markdown
+
+# solvi
+
+Build decision systems from a catalog of Python functions and checks plus typed questions, and get answers you can verify.
+
+## Why
+
+You describe a task with plain Python functions (computations, checks, answer rules) and questions with typed answers
+(yes/no, or a choice from a list). For each request, a strategist plans which functions and checks to run for the asked
+questions. Every answer comes with:
+
+- a **confidence** (calibratable per question);
+- a **reason you can check**: the rule inputs, a formula over computed facts, or a quote with character offsets in the
+  source document;
+- a **hash-chained trace** of every step, which can be re-executed later to confirm the answer or pinpoint the step that
+  was altered.
+
+When something cannot be computed, a function fails, or a rule returns an answer outside the allowed options, solvi
+abstains instead of guessing. A failed hard check always overrides any model confidence.
+
+And it is fast. The strategist plans a flow over a 10 000-part catalog in about 6 ms and runs only the parts the questions
+need (2.4% of that catalog). Hard checks run first, so a failing one skips the expensive rest; independent slow parts (API
+calls, model inference) run in parallel. On an insurance-claim desk with slow services
+([examples/09_strategy_at_scale.py](examples/09_strategy_at_scale.py)) a full decision takes 463 ms instead of 1 122 ms for a
+script that computes everything, and 152 ms when an expired policy settles the claim first.
+
+## Install
+
+```bash
+pip install solvi              # core: rules, checks, learned answer heads (numpy, scipy)
+pip install "solvi[model]"     # + torch, transformers: ModernBERT field extractors for documents
+```
+
+Requires Python 3.10+.
+
+## Quickstart (core only, no model)
+
+```python
+from datetime import date
+from solvi import Answer, Catalog, Question, System
+
+cat = Catalog()
+
+@cat.fn                                            # argument names = facts it reads; function name = fact it sets
+def days_requested(start, end):
+    return (end - start).days + 1
+
+@cat.fn
+def remaining_after(balance, days_requested):
+    return balance - days_requested
+
+@cat.check(hard=True, then={"approve": "reject"})  # if this check is False, "approve" is forced to "reject"
+def enough_balance(remaining_after):
+    return remaining_after >= 0
+
+@cat.check
+def enough_notice(start, today, days_requested):
+    return days_requested < 5 or (start - today).days >= 14
+
+@cat.rule("approve")
+def approve(enough_notice):
+    return "approve" if enough_notice else "needs_manager"
+
+system = System(cat, [Question("approve", "Approve the leave?",
+                               Answer.choice(["approve", "needs_manager", "reject"]),
+                               checkpoints=["enough_balance"])])
+res = system.ask({"start": date(2026, 10, 19), "end": date(2026, 10, 23),
+                  "today": date(2026, 9, 25), "balance": 14})
+print(res["approve"].answer, res["approve"].confidence, res["approve"].why)
+print(res.computed_state)
+print(res.trace.replay(cat))
+```
+
+Output:
+
+```
+approve 1.0 enough_notice = True
+days_requested           = 5
+remaining_after          = 9
+enough_balance           = True
+enough_notice            = True
+{'ok': True, 'steps': 5, 'mismatches': []}
+```
+
+With `"balance": 3` the hard check fails and the answer is `reject` with `status == "forced"`, whatever the rule says.
+`solvi.show.show(res, cat)` prints answers, the planned flow, the computed state and the replay result in one go.
+
+## How it works
+
+- **Catalog.** `@cat.fn` (computation), `@cat.check` (bool), `@cat.extract` (value from text, returned as a `Quote` with
+  offsets) and `@cat.rule(question)` (answer rule). A part's contract is its signature: argument names are the facts it
+  reads, the function name is the fact it sets.
+- **Questions.** `Question(name, text, Answer.yes_no() | Answer.choice([...]), checkpoints=[...])`. Questions without a
+  rule get a small answer head trained from labeled examples (`system.fit`) or a readable learned rule list
+  (`system.learn_rule`).
+- **Strategist.** For each question it walks backwards from the rule's arguments (or the learned features) through the
+  catalog signatures to the keys of `init_state`, adds the question's checkpoints and every check that touches a computed
+  fact. Everything else in the catalog is not executed; the flow records why each part was taken or skipped.
+- **Execution.** Each part runs once, even if several questions need it. Hard checks and their inputs run first; when one
+  fails, the steps only the settled questions needed are skipped (`res.trace.skipped`). With `System(..., workers=8)`
+  independent steps run in parallel threads as soon as their inputs are ready. Results go into `computed_state` with their
+  provenance; extracted values keep their quote. Each step record is hashed and chained to the previous one in flow order,
+  so the trace does not depend on scheduling.
+- **Answers and trace.** `res[q].answer / .confidence / .why / .status` (`ok`, `forced`, `abstain`), plus
+  `res.trace.replay(catalog)`, which recomputes every step from recorded inputs and reports mismatches, broken hash links
+  and quotes outside the text.
+
+## Extract from documents
+
+With `solvi[model]`, fields are found by a fine-tuned ModernBERT extractor. The extracted value is always a span of the
+document, so every answer built on it can be cited.
+
+```python
+from solvi.extract_multi import MultiSpanExtractor
+
+ex = MultiSpanExtractor(["total", "date"])          # ModernBERT-large, one pass per document for all fields
+ex.fit(train_docs, train_spans, epochs=4)           # train_spans: [{"total": (start, end), "date": (start, end) | None}]
+cat.extract(ex.field("total"))                      # doc -> Quote(text, start, end, confidence)
+cat.extract(ex.field("date"))
+
+@cat.fn
+def amount(total):                                  # extracted values are strings; parse them in ordinary functions
+    return float(total.replace(",", ""))
+```
+
+For long documents (contracts), `solvi.extract_long.LongSpanExtractor` reads the whole text in overlapping 1024-token
+windows, takes a field description instead of a fixed field list, and supports "no answer" with a per-field threshold.
+See [docs/guide.md](docs/guide.md#extracting-fields-from-documents).
+
+## Results
+
+Same training documents for both sides. The baseline, Laya, is a ModernBERT-large model that answers the typed questions
+directly, fine-tuned with its authors' recipe. Details and caveats: [docs/benchmarks.md](docs/benchmarks.md).
+
+| Task (test set) | solvi | Baseline |
+|---|---|---|
+| SROIE receipts, 6 questions (361 receipts) | **97.8%** | 92.6% |
+| SROIE, only 100 labeled training receipts | **95.9%** | 80.0% |
+| CORD receipts, 4 questions (100 receipts) | **98.5%** | 96.0% |
+| CORD, share of questions answered at >= 99% precision | **99.7%** | 14.2% |
+| CUAD contracts, 5 questions (102 contracts, median 33k chars) | **94.8%** | 77.5% (sees first 1024 tokens only) |
+
+- Calibrated confidence: ECE 0.008 (SROIE), 0.011 (CORD), 0.027 (CUAD).
+- On the document benchmarks, 100% of answers are backed by a quote at stated offsets, or the system abstains.
+- Speed: about 0.4 ms per decision when no model is involved; about 39 ms per receipt with the one-pass extractor on an
+  A100 GPU.
+
+## Speed
+
+Strategist on random layered catalogs ([benchmarks/strategist_scale.py](benchmarks/strategist_scale.py), one CPU core):
+
+| catalog parts | plan | plan + run + trace | parts run | share of catalog |
+|---:|---:|---:|---:|---:|
+| 100 | 0.2 ms | 1.3 ms | 31 | 31% |
+| 1 000 | 0.7 ms | 2.6 ms | 115 | 12% |
+| 10 000 | 6 ms | 10 ms | 236 | 2.4% |
+
+Insurance claim desk with six slow services of 100-300 ms ([examples/09_strategy_at_scale.py](examples/09_strategy_at_scale.py)):
+
+| questions asked | script computing everything | solvi, one by one | solvi, `workers=8` |
+|---|---:|---:|---:|
+| fast track? | 1 122 ms | 503 ms | 313 ms |
+| full decision + payout | 1 122 ms | 773 ms | 461 ms |
+| all five questions | 1 122 ms | 1 025 ms | 463 ms |
+| expired policy (hard check settles it) | 1 122 ms | 152 ms | 153 ms |
+
+A rule-only decision on a small catalog takes well under a millisecond; on documents the extractor dominates (about 39 ms per
+receipt with the one-pass extractor on an A100).
+
+## When to use it
+
+- The answer is a computation or a rule over a few values found in a document or a record: receipts, invoices,
+  contracts, requests, orders.
+- You need to show why: auditors, compliance, or a human reviewing low-confidence cases.
+- Some rules are non-negotiable (hard checks), and the rest can be learned from about 100 labeled examples.
+
+## When not to use it
+
+- Open-ended free-text questions or generated answers. solvi answers yes/no and choice questions only.
+- New fields with no labeled examples. Extracting a field from its description alone does not work yet (14% and 66% on
+  two held-out fields); a universal extractor is coming.
+- No labels at all. Plan on roughly 100 labeled documents (field positions) per task.
+- CPU-only deployment with a quantized model: the int8 ONNX extractor loses up to 12 points on amounts, company
+  names and addresses. fp32 on CPU keeps accuracy but takes about 0.7 s per receipt on 2 cores.
+
+## Examples
+
+| File | What it shows |
+|---|---|
+| [examples/01_leave_request.py](examples/01_leave_request.py) | Leave request from a plain dict: rules, hard checks, parts the strategist skips |
+| [examples/02_shop_order.py](examples/02_shop_order.py) | Shop order: two rule-based questions plus a "suspicious?" question learned from history with `fit` |
+| [examples/03_invoices.py](examples/03_invoices.py) | Invoice approval from text: regex extractors with quotes, four questions, one learned |
+| [examples/04_refunds.py](examples/04_refunds.py) | Refund e-mails: yes/no learned from examples under a hard "within 30 days" check |
+| [examples/05_tic_tac_toe.py](examples/05_tic_tac_toe.py) | Tic-tac-toe agent: each move is an answer with its reason (win, block, fork, ...); a hard check rejects invalid boards |
+| [examples/06_learned_rules.py](examples/06_learned_rules.py) | `learn_rule`: route parcels to delivery zones from free-form addresses with a readable if-then list learned from labels |
+| [examples/09_strategy_at_scale.py](examples/09_strategy_at_scale.py) | Insurance claim desk: the strategist generates a different plan per question set, hard checks first with early exit, slow services in parallel; timed |
+| [examples/07_receipts_model.py](examples/07_receipts_model.py) | Expense check on a scanned receipt: a receipts-tuned extractor cites each field, rules and a hard check decide (needs `solvi[model]`) |
+| [examples/08_contracts_by_description.py](examples/08_contracts_by_description.py) | Contract review with fields defined only in words: the general extractor reads the whole contract, cites clauses or says "absent" (needs `solvi[model]`) |
+
+Run them from a clone: `python examples/01_leave_request.py`.
+
+## More
+
+- [docs/guide.md](docs/guide.md): full API walkthrough.
+- [docs/benchmarks.md](docs/benchmarks.md): setups, per-question numbers, caveats.
+- [benchmarks/](benchmarks/): dataset loaders and benchmark scripts (SROIE, CORD, CUAD, Kleister-NDA).
+- Tests: `pytest`.
+
+## License
+
+Apache-2.0. See [LICENSE](LICENSE).
+
+## Citation
+
+A paper is in preparation. Until then, please cite the repository:
+
+```bibtex
+@software{solvi,
+  title  = {solvi: verifiable decision systems from catalogs of functions and checks},
+  author = {mxkuzn and solvi contributors},
+  year   = {2026},
+  url    = {https://github.com/solvi-ai/solvi}
+}
+```

solvi-0.1.0/README.md

@@ -0,0 +1,223 @@
+# solvi
+
+Build decision systems from a catalog of Python functions and checks plus typed questions, and get answers you can verify.
+
+## Why
+
+You describe a task with plain Python functions (computations, checks, answer rules) and questions with typed answers
+(yes/no, or a choice from a list). For each request, a strategist plans which functions and checks to run for the asked
+questions. Every answer comes with:
+
+- a **confidence** (calibratable per question);
+- a **reason you can check**: the rule inputs, a formula over computed facts, or a quote with character offsets in the
+  source document;
+- a **hash-chained trace** of every step, which can be re-executed later to confirm the answer or pinpoint the step that
+  was altered.
+
+When something cannot be computed, a function fails, or a rule returns an answer outside the allowed options, solvi
+abstains instead of guessing. A failed hard check always overrides any model confidence.
+
+And it is fast. The strategist plans a flow over a 10 000-part catalog in about 6 ms and runs only the parts the questions
+need (2.4% of that catalog). Hard checks run first, so a failing one skips the expensive rest; independent slow parts (API
+calls, model inference) run in parallel. On an insurance-claim desk with slow services
+([examples/09_strategy_at_scale.py](examples/09_strategy_at_scale.py)) a full decision takes 463 ms instead of 1 122 ms for a
+script that computes everything, and 152 ms when an expired policy settles the claim first.
+
+## Install
+
+```bash
+pip install solvi              # core: rules, checks, learned answer heads (numpy, scipy)
+pip install "solvi[model]"     # + torch, transformers: ModernBERT field extractors for documents
+```
+
+Requires Python 3.10+.
+
+## Quickstart (core only, no model)
+
+```python
+from datetime import date
+from solvi import Answer, Catalog, Question, System
+
+cat = Catalog()
+
+@cat.fn                                            # argument names = facts it reads; function name = fact it sets
+def days_requested(start, end):
+    return (end - start).days + 1
+
+@cat.fn
+def remaining_after(balance, days_requested):
+    return balance - days_requested
+
+@cat.check(hard=True, then={"approve": "reject"})  # if this check is False, "approve" is forced to "reject"
+def enough_balance(remaining_after):
+    return remaining_after >= 0
+
+@cat.check
+def enough_notice(start, today, days_requested):
+    return days_requested < 5 or (start - today).days >= 14
+
+@cat.rule("approve")
+def approve(enough_notice):
+    return "approve" if enough_notice else "needs_manager"
+
+system = System(cat, [Question("approve", "Approve the leave?",
+                               Answer.choice(["approve", "needs_manager", "reject"]),
+                               checkpoints=["enough_balance"])])
+res = system.ask({"start": date(2026, 10, 19), "end": date(2026, 10, 23),
+                  "today": date(2026, 9, 25), "balance": 14})
+print(res["approve"].answer, res["approve"].confidence, res["approve"].why)
+print(res.computed_state)
+print(res.trace.replay(cat))
+```
+
+Output:
+
+```
+approve 1.0 enough_notice = True
+days_requested           = 5
+remaining_after          = 9
+enough_balance           = True
+enough_notice            = True
+{'ok': True, 'steps': 5, 'mismatches': []}
+```
+
+With `"balance": 3` the hard check fails and the answer is `reject` with `status == "forced"`, whatever the rule says.
+`solvi.show.show(res, cat)` prints answers, the planned flow, the computed state and the replay result in one go.
+
+## How it works
+
+- **Catalog.** `@cat.fn` (computation), `@cat.check` (bool), `@cat.extract` (value from text, returned as a `Quote` with
+  offsets) and `@cat.rule(question)` (answer rule). A part's contract is its signature: argument names are the facts it
+  reads, the function name is the fact it sets.
+- **Questions.** `Question(name, text, Answer.yes_no() | Answer.choice([...]), checkpoints=[...])`. Questions without a
+  rule get a small answer head trained from labeled examples (`system.fit`) or a readable learned rule list
+  (`system.learn_rule`).
+- **Strategist.** For each question it walks backwards from the rule's arguments (or the learned features) through the
+  catalog signatures to the keys of `init_state`, adds the question's checkpoints and every check that touches a computed
+  fact. Everything else in the catalog is not executed; the flow records why each part was taken or skipped.
+- **Execution.** Each part runs once, even if several questions need it. Hard checks and their inputs run first; when one
+  fails, the steps only the settled questions needed are skipped (`res.trace.skipped`). With `System(..., workers=8)`
+  independent steps run in parallel threads as soon as their inputs are ready. Results go into `computed_state` with their
+  provenance; extracted values keep their quote. Each step record is hashed and chained to the previous one in flow order,
+  so the trace does not depend on scheduling.
+- **Answers and trace.** `res[q].answer / .confidence / .why / .status` (`ok`, `forced`, `abstain`), plus
+  `res.trace.replay(catalog)`, which recomputes every step from recorded inputs and reports mismatches, broken hash links
+  and quotes outside the text.
+
+## Extract from documents
+
+With `solvi[model]`, fields are found by a fine-tuned ModernBERT extractor. The extracted value is always a span of the
+document, so every answer built on it can be cited.
+
+```python
+from solvi.extract_multi import MultiSpanExtractor
+
+ex = MultiSpanExtractor(["total", "date"])          # ModernBERT-large, one pass per document for all fields
+ex.fit(train_docs, train_spans, epochs=4)           # train_spans: [{"total": (start, end), "date": (start, end) | None}]
+cat.extract(ex.field("total"))                      # doc -> Quote(text, start, end, confidence)
+cat.extract(ex.field("date"))
+
+@cat.fn
+def amount(total):                                  # extracted values are strings; parse them in ordinary functions
+    return float(total.replace(",", ""))
+```
+
+For long documents (contracts), `solvi.extract_long.LongSpanExtractor` reads the whole text in overlapping 1024-token
+windows, takes a field description instead of a fixed field list, and supports "no answer" with a per-field threshold.
+See [docs/guide.md](docs/guide.md#extracting-fields-from-documents).
+
+## Results
+
+Same training documents for both sides. The baseline, Laya, is a ModernBERT-large model that answers the typed questions
+directly, fine-tuned with its authors' recipe. Details and caveats: [docs/benchmarks.md](docs/benchmarks.md).
+
+| Task (test set) | solvi | Baseline |
+|---|---|---|
+| SROIE receipts, 6 questions (361 receipts) | **97.8%** | 92.6% |
+| SROIE, only 100 labeled training receipts | **95.9%** | 80.0% |
+| CORD receipts, 4 questions (100 receipts) | **98.5%** | 96.0% |
+| CORD, share of questions answered at >= 99% precision | **99.7%** | 14.2% |
+| CUAD contracts, 5 questions (102 contracts, median 33k chars) | **94.8%** | 77.5% (sees first 1024 tokens only) |
+
+- Calibrated confidence: ECE 0.008 (SROIE), 0.011 (CORD), 0.027 (CUAD).
+- On the document benchmarks, 100% of answers are backed by a quote at stated offsets, or the system abstains.
+- Speed: about 0.4 ms per decision when no model is involved; about 39 ms per receipt with the one-pass extractor on an
+  A100 GPU.
+
+## Speed
+
+Strategist on random layered catalogs ([benchmarks/strategist_scale.py](benchmarks/strategist_scale.py), one CPU core):
+
+| catalog parts | plan | plan + run + trace | parts run | share of catalog |
+|---:|---:|---:|---:|---:|
+| 100 | 0.2 ms | 1.3 ms | 31 | 31% |
+| 1 000 | 0.7 ms | 2.6 ms | 115 | 12% |
+| 10 000 | 6 ms | 10 ms | 236 | 2.4% |
+
+Insurance claim desk with six slow services of 100-300 ms ([examples/09_strategy_at_scale.py](examples/09_strategy_at_scale.py)):
+
+| questions asked | script computing everything | solvi, one by one | solvi, `workers=8` |
+|---|---:|---:|---:|
+| fast track? | 1 122 ms | 503 ms | 313 ms |
+| full decision + payout | 1 122 ms | 773 ms | 461 ms |
+| all five questions | 1 122 ms | 1 025 ms | 463 ms |
+| expired policy (hard check settles it) | 1 122 ms | 152 ms | 153 ms |
+
+A rule-only decision on a small catalog takes well under a millisecond; on documents the extractor dominates (about 39 ms per
+receipt with the one-pass extractor on an A100).
+
+## When to use it
+
+- The answer is a computation or a rule over a few values found in a document or a record: receipts, invoices,
+  contracts, requests, orders.
+- You need to show why: auditors, compliance, or a human reviewing low-confidence cases.
+- Some rules are non-negotiable (hard checks), and the rest can be learned from about 100 labeled examples.
+
+## When not to use it
+
+- Open-ended free-text questions or generated answers. solvi answers yes/no and choice questions only.
+- New fields with no labeled examples. Extracting a field from its description alone does not work yet (14% and 66% on
+  two held-out fields); a universal extractor is coming.
+- No labels at all. Plan on roughly 100 labeled documents (field positions) per task.
+- CPU-only deployment with a quantized model: the int8 ONNX extractor loses up to 12 points on amounts, company
+  names and addresses. fp32 on CPU keeps accuracy but takes about 0.7 s per receipt on 2 cores.
+
+## Examples
+
+| File | What it shows |
+|---|---|
+| [examples/01_leave_request.py](examples/01_leave_request.py) | Leave request from a plain dict: rules, hard checks, parts the strategist skips |
+| [examples/02_shop_order.py](examples/02_shop_order.py) | Shop order: two rule-based questions plus a "suspicious?" question learned from history with `fit` |
+| [examples/03_invoices.py](examples/03_invoices.py) | Invoice approval from text: regex extractors with quotes, four questions, one learned |
+| [examples/04_refunds.py](examples/04_refunds.py) | Refund e-mails: yes/no learned from examples under a hard "within 30 days" check |
+| [examples/05_tic_tac_toe.py](examples/05_tic_tac_toe.py) | Tic-tac-toe agent: each move is an answer with its reason (win, block, fork, ...); a hard check rejects invalid boards |
+| [examples/06_learned_rules.py](examples/06_learned_rules.py) | `learn_rule`: route parcels to delivery zones from free-form addresses with a readable if-then list learned from labels |
+| [examples/09_strategy_at_scale.py](examples/09_strategy_at_scale.py) | Insurance claim desk: the strategist generates a different plan per question set, hard checks first with early exit, slow services in parallel; timed |
+| [examples/07_receipts_model.py](examples/07_receipts_model.py) | Expense check on a scanned receipt: a receipts-tuned extractor cites each field, rules and a hard check decide (needs `solvi[model]`) |
+| [examples/08_contracts_by_description.py](examples/08_contracts_by_description.py) | Contract review with fields defined only in words: the general extractor reads the whole contract, cites clauses or says "absent" (needs `solvi[model]`) |
+
+Run them from a clone: `python examples/01_leave_request.py`.
+
+## More
+
+- [docs/guide.md](docs/guide.md): full API walkthrough.
+- [docs/benchmarks.md](docs/benchmarks.md): setups, per-question numbers, caveats.
+- [benchmarks/](benchmarks/): dataset loaders and benchmark scripts (SROIE, CORD, CUAD, Kleister-NDA).
+- Tests: `pytest`.
+
+## License
+
+Apache-2.0. See [LICENSE](LICENSE).
+
+## Citation
+
+A paper is in preparation. Until then, please cite the repository:
+
+```bibtex
+@software{solvi,
+  title  = {solvi: verifiable decision systems from catalogs of functions and checks},
+  author = {mxkuzn and solvi contributors},
+  year   = {2026},
+  url    = {https://github.com/solvi-ai/solvi}
+}
+```