pith. sign in
Pith Number

pith:5QTGG5GI

pith:2026:5QTGG5GIUTOMOO3627CJGJOIE5
not attested not anchored not stored refs resolved

Do CFLOBDDs Actually Make Use of Linear Structure?

Meghana Aparna Sistla, Swarat Chaudhuri, Thomas W. Reps

Linear structure works with hierarchy in CFLOBDDs to enable efficient Boolean function compression.

arxiv:2605.15552 v1 · 2026-05-15 · cs.FL

Add to your LaTeX paper
\usepackage{pith}
\pithnumber{5QTGG5GIUTOMOO3627CJGJOIE5}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more

Record completeness

1 Bitcoin timestamp
2 Internet Archive
3 Author claim open · sign in to claim
4 Citations open
5 Replications open
Portable graph bundle live · download bundle · merged state
The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest claim

We demonstrate that linear structure, in conjunction with hierarchical structure, plays a crucial role in enabling CFLOBDDs to achieve efficient function compression. Furthermore, we show that removing linearity from CFLOBDDs leads to a significant blowup in representation size, resulting in degraded performance in the domain of quantum-circuit simulation.

C2weakest assumption

That modifications removing linearity from CFLOBDDs isolate the effect of linear structure without altering other representational properties or implementation details that could independently affect size and performance.

C3one line summary

Linear structure combined with hierarchy is crucial for CFLOBDD compression efficiency; its removal produces significant blowup and degraded results in quantum simulation.

References

21 extracted · 21 resolved · 0 Pith anchors

[1] Reps, and Mihalis Yannakakis 2005
[2] Rajeev Alur and Parthasarathy Madhusudan. 2009. Adding nesting structure to words.Journal of the ACM (JACM)56, 3 (2009), 1–43 2009
[3] Anuchit Anuchitanukul, Zohar Manna, and Tomás E. Uribe. 1995. Differential BDDs. InComputer Science Today: Recent Trends and Developments (Lecture Notes in Computer Science, Vol. 1000), J. van Leeuwen 1995
[4] Iris Bahar, Erica A
[5] Des.10, 2/3 (1997), 171–206 1997 · doi:10.1023/a:1008699807402
Receipt and verification
First computed 2026-05-20T00:01:05.003759Z
Builder pith-number-builder-2026-05-17-v1
Signature Pith Ed25519 (pith-v1-2026-05) · public key
Schema pith-number/v1.0

Canonical hash

ec266374c8a4dcc73b7ed7c49325c8276ffba7165d211ba935fcd5b80a577049

Aliases

arxiv: 2605.15552 · arxiv_version: 2605.15552v1 · doi: 10.48550/arxiv.2605.15552 · pith_short_12: 5QTGG5GIUTOM · pith_short_16: 5QTGG5GIUTOMOO36 · pith_short_8: 5QTGG5GI
Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/5QTGG5GIUTOMOO3627CJGJOIE5 \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: ec266374c8a4dcc73b7ed7c49325c8276ffba7165d211ba935fcd5b80a577049
Canonical record JSON
{
  "metadata": {
    "abstract_canon_sha256": "03f0b047b7e37c223a63d7efbfb0e70c5d0122f7f26671a542bc064355980d96",
    "cross_cats_sorted": [],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "primary_cat": "cs.FL",
    "submitted_at": "2026-05-15T02:45:02Z",
    "title_canon_sha256": "aa0bedc261916d8a5bb2c8000f5de86f94f0f0d5442a5c8d79df4f392270513f"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.15552",
    "kind": "arxiv",
    "version": 1
  }
}