Paper Citation Record · LEDGER

Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width

As of 22 August 2026, this Paper Citation Record lists 16 of 16 outbound references and 0 inbound Pith citation observations for arXiv:2505.16012.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2505.16012 v2

Coverage vector

measured 16 of 16 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T15:19:06.449541Z

measured 16 of 16 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-21T06:32:19.484+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

16 of 16 outbound references displayed

verified exact0
verified fuzzy15
unresolved1
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 076b0c15-252c-473a-9c86-afd4d4b8fed8 · outbound

This paper cites Connecting knowledge compilation classes and width parameters.

Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width Connecting knowledge compilation classes and width parameters

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:19:08.765965Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 6cd9484c-2098-4c3a-9879-b538c3fa6566 · outbound

This paper cites Lower bounds for exact model counting and applications in probabilistic databases.

Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width Lower bounds for exact model counting and applications in probabilistic databases

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:19:08.537329Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 63cad391-4052-443f-85b6-8931b3ee933e · outbound

This paper cites A Strongly Exponential Separation of DNNFs from CNF Formulas.

Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width A Strongly Exponential Separation of DNNFs from CNF Formulas

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-07T15:19:05.552783Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 10b15c27-901b-472f-af95-19b6d5d4dda3 · outbound

This paper cites Decomposable negation normal form.

Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width Decomposable negation normal form

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:19:08.302293Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 57088f30-51c1-429c-be49-e0a0ba824b3c · outbound

This paper cites SDD: A new canonical representation of propositional knowledge bases.

Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width SDD: A new canonical representation of propositional knowledge bases

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:19:08.100973Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 924c1fd7-63a5-486e-b1a0-6b2b0223c8ff · outbound

This paper cites Demaine, Fedor V.

Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width Demaine, Fedor V

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:19:07.869410Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 2cf9e870-6ab9-4bc6-8a24-4d6127eaaf1d · outbound

This paper cites Graph Theory, 3d Edition , volume 173 of Graduate texts in.

Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width Graph Theory, 3d Edition , volume 173 of Graduate texts in

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:19:07.745590Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation d725fd2f-cbf5-4f65-9a1d-36e218894750 · outbound

This paper cites Hypertree decompo- sitions and tractable queries.

Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width Hypertree decompo- sitions and tractable queries

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:19:07.621376Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 715d8880-999c-4b93-bcd2-725000443b98 · outbound

This paper cites Generalized hy- pertree decompositions: NP-hardness and tractable variants.

Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width Generalized hy- pertree decompositions: NP-hardness and tractable variants

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:19:07.475768Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation cbd6af99-c4e8-428e-8174-65e67db00e71 · outbound

This paper cites Lower bounds on dynamic programming for maximum weight independent set.

Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width Lower bounds on dynamic programming for maximum weight independent set

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:19:07.358401Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 37e69491-b69d-4981-b6f4-e22001ee2c2a · outbound

This paper cites New canonical representations by augmenting obdds with conjunctive decomposition.

Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width New canonical representations by augmenting obdds with conjunctive decomposition

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:19:07.166668Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 7bc6c53c-d71d-44b7-a50a-76ae09fd968a · outbound

This paper cites On compiling CNF into decision-dnnf.

Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width On compiling CNF into decision-dnnf

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:19:07.045744Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation ad90a0bb-5c4f-4f3e-bd66-f63db9a331ca · outbound

This paper cites On the read-once property of branching programs and cnfs of bounded treewidth.

Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width On the read-once property of branching programs and cnfs of bounded treewidth

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:19:06.922165Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation aa399257-acf3-4307-b210-fefa9f129b61 · outbound

This paper cites On oblivious branching programs with bounded repetition that cannot efficiently compute cnfs of bounded treewidth.

Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width On oblivious branching programs with bounded repetition that cannot efficiently compute cnfs of bounded treewidth

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:19:06.804003Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 521b7335-af25-4793-b2af-5687cdb0235c · outbound

This paper cites New width parameters of graphs.

Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width New width parameters of graphs

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:19:06.696109Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation fa72ebe8-adaf-40ba-b076-4670b4e6b606 · outbound

This paper cites Let a ∈ S(B)|{(x,0)}.

Decision DNNFs with imbalanced conjunction cannot efficiently represent CNFs of bounded width Let a ∈ S(B)|{(x,0)}

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T15:19:06.594519Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Pith citing papers

No inbound Pith citation observations are available.