Paper Citation Record · LEDGER

New Algorithms for #2-SAT and #3-SAT

As of 18 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 2 inbound Pith citation observations for arXiv:2507.14504.

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

pith.paper-citation-record.v1
2507.14504 v1

Coverage vector

measured 42 of 42 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-06T16:15:08.135790Z

measured 44 of 44 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-18T06:34:40.430872+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-02T16:26:07.201958Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-10T11:00:04.010211Z

Reference resolution

42 of 42 outbound references displayed

verified exact18
verified fuzzy6
unresolved17
parse uncertain0
malformed identifier1
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 3700547b-0dea-4352-b13e-2b66635e3ae2 · outbound

This paper cites Algorithms and complexity results for #sat and bayesian inference.

New Algorithms for #2-SAT and #3-SAT Algorithms and complexity results for #sat and bayesian inference

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:15:11.898986Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 6c008a9a-463f-48e4-9e7b-88f2d70d1d8b · outbound

This paper cites 3-coloring in time o(1.3289 n).

New Algorithms for #2-SAT and #3-SAT 3-coloring in time o(1.3289 n)

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:15:11.891305Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 58ff8266-7d79-4ad9-a774-0e11b2b16ad1 · outbound

This paper cites Handbook of Satisfiability - Second Edition, volume 336 of Frontiers in Artificial Intelligence and Applications.

New Algorithms for #2-SAT and #3-SAT Handbook of Satisfiability - Second Edition, volume 336 of Frontiers in Artificial Intelligence and Applications

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:15:11.883810Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 8010aa8c-f3c5-426b-9c16-3bf649119be5 · outbound

This paper cites On probabilistic inference by weighted model counting.

New Algorithms for #2-SAT and #3-SAT On probabilistic inference by weighted model counting

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-06T16:15:05.414829Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0351ad19-c33e-43b8-afb7-f226e6e9f77e · outbound

This paper cites An improved upper bound for SAT.

New Algorithms for #2-SAT and #3-SAT An improved upper bound for SAT

Reference 5

Resolution: verified exact; doi, observed 2026-08-06T16:15:11.359175Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 30236536-361f-40f5-96b7-0e54891e2761 · outbound

This paper cites an unresolved cited work.

New Algorithms for #2-SAT and #3-SAT Unresolved cited work

Reference 6

Resolution: unresolved; raw_fallback, observed 2026-08-06T16:15:11.876584Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation a5fc5dfa-82dd-4095-b2aa-54e460d1ee53 · outbound

This paper cites On problems as hard as CNF-SAT.

New Algorithms for #2-SAT and #3-SAT On problems as hard as CNF-SAT

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-06T16:15:05.759618Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 045e905c-d477-4ef4-9d10-918ee24dc747 · outbound

This paper cites Counting models for 2sat and 3sat for- mulae.

New Algorithms for #2-SAT and #3-SAT Counting models for 2sat and 3sat for- mulae

Reference 8

Resolution: verified exact; doi, observed 2026-08-06T16:15:11.114299Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 4f4e894b-9103-4cf0-b474-5a17c14f2974 · outbound

This paper cites Counting the number of solutions for instances of satisfiability.

New Algorithms for #2-SAT and #3-SAT Counting the number of solutions for instances of satisfiability

Reference 9

Resolution: verified exact; doi, observed 2026-08-06T16:15:10.856931Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 283c53e7-163f-4934-9d7c-ef934a4bd0ec · outbound

This paper cites Dudek, Vu H.

New Algorithms for #2-SAT and #3-SAT Dudek, Vu H

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-06T16:15:05.970817Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 05f56f4b-9f2c-4475-af5f-7e6ca3036aeb · outbound

This paper cites Meel, Roger Paredes, and Moshe Y.

New Algorithms for #2-SAT and #3-SAT Meel, Roger Paredes, and Moshe Y

Reference 11

Resolution: malformed identifier; no resolver link, observed 2026-08-06T16:15:06.046077Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6f201450-ce67-4a1d-b576-81f5bac7594e · outbound

This paper cites An improved gpu-based SAT model counter.

New Algorithms for #2-SAT and #3-SAT An improved gpu-based SAT model counter

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-06T16:15:06.134901Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d0ab3739-7783-4d7e-945a-15bcba5f600d · outbound

This paper cites Exploiting database management systems and treewidth for counting.

New Algorithms for #2-SAT and #3-SAT Exploiting database management systems and treewidth for counting

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:15:11.868299Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 3a218b43-5666-41a4-b481-0f5bcb6ff6a7 · outbound

This paper cites The silent (r)evolution of SAT.

New Algorithms for #2-SAT and #3-SAT The silent (r)evolution of SAT

Reference 14

Resolution: verified exact; doi, observed 2026-08-06T16:15:10.490090Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 788bf2ce-6e11-4ea6-b84e-53dbe7f37d7d · outbound

This paper cites Solving projected model counting by utilizing treewidth and its limits.

New Algorithms for #2-SAT and #3-SAT Solving projected model counting by utilizing treewidth and its limits

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-06T16:15:06.488553Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f5b7facc-3d0b-4fbb-8ba9-d97a7266f675 · outbound

This paper cites Fomin and Dieter Kratsch.

New Algorithms for #2-SAT and #3-SAT Fomin and Dieter Kratsch

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-06T16:15:06.538911Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 022771a7-6de5-4ec5-acda-36796e8dfecd · outbound

This paper cites Fomin, Serge Gaspers, Saket Saurabh, and Alexey A.

New Algorithms for #2-SAT and #3-SAT Fomin, Serge Gaspers, Saket Saurabh, and Alexey A

Reference 17

Resolution: verified exact; doi, observed 2026-08-06T16:15:10.266712Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation f56ae421-14cb-450f-86e9-534d000a3273 · outbound

This paper cites an unresolved cited work.

New Algorithms for #2-SAT and #3-SAT Unresolved cited work

Reference 18

Resolution: verified exact; doi, observed 2026-08-06T16:15:10.073334Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 393e73bb-c119-4aad-af37-648c3e16671e · outbound

This paper cites Gomes, Ashish Sabharwal, and Bart Selman.

New Algorithms for #2-SAT and #3-SAT Gomes, Ashish Sabharwal, and Bart Selman

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:15:11.860906Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 84265b9f-7c1e-4ce9-bb42-2789860ce4cb · outbound

This paper cites Taming high treewidth with abstraction, nested dynamic programming, and database technology.

New Algorithms for #2-SAT and #3-SAT Taming high treewidth with abstraction, nested dynamic programming, and database technology

Reference 20

Resolution: verified exact; doi, observed 2026-08-06T16:15:09.626821Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 669f413c-878e-4515-bd90-5e322e52d9d4 · outbound

This paper cites On the complexity of k-SAT.

New Algorithms for #2-SAT and #3-SAT On the complexity of k-SAT

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-06T16:15:07.049427Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7149a33a-3483-4a62-84d9-032a2748de9a · outbound

This paper cites CNF satisfiability test by counting and polynomial average time.

New Algorithms for #2-SAT and #3-SAT CNF satisfiability test by counting and polynomial average time

Reference 22

Resolution: verified exact; doi, observed 2026-08-06T16:15:09.471579Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation b1e3d18b-b62e-4f46-84f2-d458304eef34 · outbound

This paper cites Integrating tree decompositions into decision heuris- tics of propositional model counters (short paper).

New Algorithms for #2-SAT and #3-SAT Integrating tree decompositions into decision heuris- tics of propositional model counters (short paper)

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-06T16:15:07.191268Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2e3d6eda-1f2a-4363-b914-b7453ea31b0f · outbound

This paper cites New upper bound for the #3-sat problem.

New Algorithms for #2-SAT and #3-SAT New upper bound for the #3-sat problem

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T16:15:11.853342Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation a61681df-b407-45cc-a4b8-987cb6cf64e8 · outbound

This paper cites URL https://doi.org/10.3233/FAIA201009.

New Algorithms for #2-SAT and #3-SAT URL https://doi.org/10.3233/FAIA201009

Reference 25

Resolution: verified exact; doi, observed 2026-08-06T16:15:09.822937Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation e44505f9-99bd-42d9-b828-2392fe4c6480 · outbound

This paper cites Shrotri, Kuldeep S.

New Algorithms for #2-SAT and #3-SAT Shrotri, Kuldeep S

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-06T16:15:07.497300Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 90be9a19-c915-40ed-b24e-772aeb47e78a · outbound

This paper cites On the hardness of approximate reasoning.

New Algorithms for #2-SAT and #3-SAT On the hardness of approximate reasoning

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-06T16:15:07.551121Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e22dc4a8-f7a7-4780-bc20-8b8518245d02 · outbound

This paper cites Algorithms for propositional model counting.

New Algorithms for #2-SAT and #3-SAT Algorithms for propositional model counting

Reference 28

Resolution: verified exact; doi, observed 2026-08-06T16:15:08.968335Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation b091d314-8a04-4499-8d94-04932733f518 · outbound

This paper cites an unresolved cited work.

New Algorithms for #2-SAT and #3-SAT Unresolved cited work

Reference 29

Resolution: unresolved; raw_fallback, observed 2026-08-06T16:15:11.845048Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 635bb2ac-ed2d-49ce-a756-a751f5f87dc7 · outbound

This paper cites an unresolved cited work.

New Algorithms for #2-SAT and #3-SAT Unresolved cited work

Reference 30

Resolution: unresolved; raw_fallback, observed 2026-08-06T16:15:11.837559Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation c1e883f6-9267-4cf7-a720-207ec6c3c141 · outbound

This paper cites A tighter bound for counting max-weight solutions to 2sat instances.

New Algorithms for #2-SAT and #3-SAT A tighter bound for counting max-weight solutions to 2sat instances

Reference 31

Resolution: verified exact; doi, observed 2026-08-06T16:15:08.791357Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 9ae4d012-fc34-4673-a29e-2ce5254e4035 · outbound

This paper cites Lozinskii.

New Algorithms for #2-SAT and #3-SAT Lozinskii

Reference 32

Resolution: verified exact; doi, observed 2026-08-06T16:15:09.163987Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 05fbb911-525f-43ac-809b-3f31ef535a03 · outbound

This paper cites Number of models and satisfiability of sets of clauses.

New Algorithms for #2-SAT and #3-SAT Number of models and satisfiability of sets of clauses

Reference 33

Resolution: verified exact; doi, observed 2026-08-06T16:15:08.496291Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 7730ff83-7d40-4670-b8a8-699a5a6078f3 · outbound

This paper cites at least two clauses are removed when we assign a value to x.

New Algorithms for #2-SAT and #3-SAT at least two clauses are removed when we assign a value to x

Reference 34

Resolution: verified exact; doi, observed 2026-08-06T16:15:08.335814Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 98d257f8-6753-44c4-aae0-4bc15d40dee3 · outbound

This paper cites An exact maxsat algorithm: Further observations and further improvements.

New Algorithms for #2-SAT and #3-SAT An exact maxsat algorithm: Further observations and further improvements

Reference 40

Resolution: verified exact; doi, observed 2026-08-06T16:15:08.633227Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 568a6301-afe3-4d68-8b4e-df7e7121ce44 · outbound

This paper cites an unresolved cited work.

New Algorithms for #2-SAT and #3-SAT Unresolved cited work

Reference 1971

Resolution: unresolved; no resolver link, observed 2026-08-06T16:15:05.675589Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 18deffcd-d814-46b4-880d-d9405ac18bb8 · outbound

This paper cites URL https://doi.org/10.1016/0304-3975(79)90044-6.

New Algorithms for #2-SAT and #3-SAT URL https://doi.org/10.1016/0304-3975(79)90044-6

Reference 1979

Resolution: unresolved; no resolver link, observed 2026-08-06T16:15:07.853906Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b01988cb-3a4b-4e84-928a-05fb2e0c66ab · outbound

This paper cites PyMatting: A Python Library for Alpha Matting.

New Algorithms for #2-SAT and #3-SAT PyMatting: A Python Library for Alpha Matting

Reference 2003

Resolution: unresolved; no resolver link, observed 2026-08-06T16:15:04.966872Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9adb9a17-c64e-4132-9afb-a333291cbaf9 · outbound

This paper cites URL https://doi.org/10.1016/j.jalgor.2004.06.008.

New Algorithms for #2-SAT and #3-SAT URL https://doi.org/10.1016/j.jalgor.2004.06.008

Reference 2005

Resolution: verified exact; doi, observed 2026-08-06T16:15:11.519229Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 05763aec-7f8b-43a7-8415-120a34950bb9 · outbound

This paper cites URL https://doi.org/10.1016/j.ipl.2007.06.017.

New Algorithms for #2-SAT and #3-SAT URL https://doi.org/10.1016/j.ipl.2007.06.017

Reference 2007

Resolution: verified exact; doi, observed 2026-08-06T16:15:09.284144Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 746d50f1-8aa2-462b-9016-e941a6aa4829 · outbound

This paper cites URL https://doi.org/10.3233/FAIA336.

New Algorithms for #2-SAT and #3-SAT URL https://doi.org/10.3233/FAIA336

Reference 2021

Resolution: unresolved; no resolver link, observed 2026-08-06T16:15:05.334530Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8554df3b-ddff-44d4-8a22-b1c12e5ce44b · outbound

This paper cites URL https://doi.org/10.1017/S147106842100003X.

New Algorithms for #2-SAT and #3-SAT URL https://doi.org/10.1017/S147106842100003X

Reference 2022

Resolution: verified exact; doi, observed 2026-08-06T16:15:10.688092Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Pith citing papers

Observation 056405f5-ce3a-4c8d-a607-2373803f0471 · inbound

A Hypergraph Container Method for Spread SAT: Approximation and Speedup cites this paper.

A Hypergraph Container Method for Spread SAT: Approximation and Speedup New Algorithms for #2-SAT and #3-SAT

Reference 4

Resolution: verified exact; arxiv_id, observed 2026-05-10T11:00:04.011876Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation fe1395f0-7664-4030-a635-4b4dc29bdfa5 · inbound

A Hypergraph Container Method for Spread SAT: Approximation and Speedup cites this paper.

A Hypergraph Container Method for Spread SAT: Approximation and Speedup New Algorithms for #2-SAT and #3-SAT

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-02T16:26:07.201958Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.