跳到正文
研踪PaperTrail
← 研踪 PaperTrail
正在查看已观测的 v1。查看最新 v2 →

arXiv:2611.11295 · v1

Samyama-SDG: A Declarative GraphQL @count and Regex/Ontology Synthetic Data Compiler with $O(1)$-Memory Referential Integrity and Causal Ground Truth

首次提交 2026-11-08 18:40
版本更新 2026-11-08 18:40
雷达观测 2026-11-10 12:16
arXiv ↗PDF ↗

摘要

Synthetic data generators face a divide between declarative relational mockets and domain causal simulators. Declarative generators specify entities, regexes, and foreign keys via schemas, but buffer parent primary-key pools in RAM (O(N)O(N) memory) and lack ontology bindings or causal ground truth. Conversely, domain simulators emit realistic streams and ground-truth labels, but require thousands of lines of procedural code per domain. We present Samyama-SDG (sdg-rs), a Rust synthetic data compiler unifying declarative schema compilation with ontology-bound causal simulation. At Layer 1, Samyama-SDG compiles Cardinality-Extended GraphQL schemas (@count, @pk, @ontology, @regex, @dist, @fk, @after) and an Attribute Data Dictionary into a topologically sorted DAG. Combining stateless counter-based seekable PRNGs (SplitMix64 over (seed,entity,row,field)(\text{seed}, \text{entity}, \text{row}, \text{field})) with index-bijective primary keys fPK(s,E,i)f_{\text{PK}}(s, E, i) lets child tables resolve uniform or Zipfian foreign keys and multi-hop @after constraints in O(1)O(1) memory without buffering parent tables. At Layer 2, causal processes layer fault propagation and machine-scorable ground truth (ground_truth.jsonl) over the same seekable PRNG and samyama-ontologies binder. Across three schemas, Samyama-SDG generates 1,000,0001{,}000{,}000 records in 128.79 ms128.79\text{ ms}--172.43 ms172.43\text{ ms} (5.80M5.80\text{M}--7.76M7.76\text{M} rows/s) and 5,000,0005{,}000{,}000 records in 676.12 ms676.12\text{ ms}--808.56 ms808.56\text{ ms} at flat 31.4 MiB31.4\text{ MiB}--35.1 MiB35.1\text{ MiB} memory, with 00 conformance errors across 1,150,0001{,}150{,}000 foreign keys and 900,000900{,}000 temporal constraints.

作者备注:7 pages, 3 figures, 3 tables. Code: https://github.com/samyama-ai/samyama-synthetic-data-generator

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

仅对比实际观测的元数据,不代表 PDF 正文或实验变化。版本可能不连续;带删除线为移除,下划线为新增。

作者备注变化

78 pages, 3 figures, 34 tables. v2 adds an end-to-end differentially private fit-generate-audit example on a public table (Section 4) and positioning on orthogonal differential-privacy marginal fitting via the post-processing theorem and updates companion citations. Code: https://github.com/samyama-ai/samyama-synthetic-data-generator (tag v2.1.0)

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v2 · 2026-11-13 23:33 · 最新观测版本

Samyama-SDG: A Declarative GraphQL @count and Regex/Ontology Synthetic Data Compiler with $O(1)$-Memory Referential Integrity and Causal Ground Truth

Synthetic data generators face a divide between declarative relational mockets and domain causal simulators. Declarative generators specify entities, regexes, and foreign keys via schemas, but buffer parent primary-key pools in RAM (O(N)O(N) memory) and lack ontology bindings or causal ground truth. Conversely, domain simulators emit realistic streams and ground-truth labels, but require thousands of lines of procedural code per domain. We present Samyama-SDG (sdg-rs), a Rust synthetic data compiler unifying declarative schema compilation with ontology-bound causal simulation. At Layer 1, Samyama-SDG compiles Cardinality-Extended GraphQL schemas (@count, @pk, @ontology, @regex, @dist, @fk, @after) and an Attribute Data Dictionary into a topologically sorted DAG. Combining stateless counter-based seekable PRNGs (SplitMix64 over (seed,entity,row,field)(\text{seed}, \text{entity}, \text{row}, \text{field})) with index-bijective primary keys fPK(s,E,i)f_{\text{PK}}(s, E, i) lets child tables resolve uniform or Zipfian foreign keys and multi-hop @after constraints in O(1)O(1) memory without buffering parent tables. At Layer 2, causal processes layer fault propagation and machine-scorable ground truth (ground_truth.jsonl) over the same seekable PRNG and samyama-ontologies binder. Across three schemas, Samyama-SDG generates 1,000,0001{,}000{,}000 records in 128.79 ms128.79\text{ ms}--172.43 ms172.43\text{ ms} (5.80M5.80\text{M}--7.76M7.76\text{M} rows/s) and 5,000,0005{,}000{,}000 records in 676.12 ms676.12\text{ ms}--808.56 ms808.56\text{ ms} at flat 31.4 MiB31.4\text{ MiB}--35.1 MiB35.1\text{ MiB} memory, with 00 conformance errors across 1,150,0001{,}150{,}000 foreign keys and 900,000900{,}000 temporal constraints.

查看此版本解读 →查看此版本原文 ↗
v1 · 2026-11-08 18:40

Samyama-SDG: A Declarative GraphQL @count and Regex/Ontology Synthetic Data Compiler with $O(1)$-Memory Referential Integrity and Causal Ground Truth

Synthetic data generators face a divide between declarative relational mockets and domain causal simulators. Declarative generators specify entities, regexes, and foreign keys via schemas, but buffer parent primary-key pools in RAM (O(N)O(N) memory) and lack ontology bindings or causal ground truth. Conversely, domain simulators emit realistic streams and ground-truth labels, but require thousands of lines of procedural code per domain. We present Samyama-SDG (sdg-rs), a Rust synthetic data compiler unifying declarative schema compilation with ontology-bound causal simulation. At Layer 1, Samyama-SDG compiles Cardinality-Extended GraphQL schemas (@count, @pk, @ontology, @regex, @dist, @fk, @after) and an Attribute Data Dictionary into a topologically sorted DAG. Combining stateless counter-based seekable PRNGs (SplitMix64 over (seed,entity,row,field)(\text{seed}, \text{entity}, \text{row}, \text{field})) with index-bijective primary keys fPK(s,E,i)f_{\text{PK}}(s, E, i) lets child tables resolve uniform or Zipfian foreign keys and multi-hop @after constraints in O(1)O(1) memory without buffering parent tables. At Layer 2, causal processes layer fault propagation and machine-scorable ground truth (ground_truth.jsonl) over the same seekable PRNG and samyama-ontologies binder. Across three schemas, Samyama-SDG generates 1,000,0001{,}000{,}000 records in 128.79 ms128.79\text{ ms}--172.43 ms172.43\text{ ms} (5.80M5.80\text{M}--7.76M7.76\text{M} rows/s) and 5,000,0005{,}000{,}000 records in 676.12 ms676.12\text{ ms}--808.56 ms808.56\text{ ms} at flat 31.4 MiB31.4\text{ MiB}--35.1 MiB35.1\text{ MiB} memory, with 00 conformance errors across 1,150,0001{,}150{,}000 foreign keys and 900,000900{,}000 temporal constraints.

查看此版本解读 →查看此版本原文 ↗