Paper Citation Record · LEDGER

Learning-Augmented Algorithms for Boolean Satisfiability

As of 20 August 2026, this Paper Citation Record lists 63 of 63 outbound references and 1 inbound Pith citation observation for arXiv:2505.06146.

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

pith.paper-citation-record.v1
2505.06146 v2

Coverage vector

measured 63 of 63 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-15T23:03:17.663795Z

measured 64 of 64 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-20T06:33:59.587034+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-07-14T09:56:40.793890Z

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

63 of 63 outbound references displayed

verified exact1
verified fuzzy48
unresolved14
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation cbb0f819-aeca-48d6-867e-140cd0b119a1 · outbound

This paper cites Paging with succinct predictions.

Learning-Augmented Algorithms for Boolean Satisfiability Paging with succinct predictions

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:18.661279Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation f29db105-820f-4446-9457-0190954a2208 · outbound

This paper cites Improved approximation algorithms for max nae-sat and max sat.

Learning-Augmented Algorithms for Boolean Satisfiability Improved approximation algorithms for max nae-sat and max sat

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:18.645682Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation b48dfb71-32f5-4607-9b75-7c9595f32915 · outbound

This paper cites Proof verification and the hardness of approximation problems.

Learning-Augmented Algorithms for Boolean Satisfiability Proof verification and the hardness of approximation problems

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-15T23:03:17.369805Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4943fdbf-2a16-4e58-b477-f0d31d864e17 · outbound

This paper cites https://algorithms-with-predictions.github.io/, 2023.

Learning-Augmented Algorithms for Boolean Satisfiability https://algorithms-with-predictions.github.io/, 2023

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:18.620038Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation b9c6c91b-20a7-4bcb-a64f-3bb6057c742e · outbound

This paper cites Probabilistic checking of proofs: A new characterization of np.

Learning-Augmented Algorithms for Boolean Satisfiability Probabilistic checking of proofs: A new characterization of np

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-15T23:03:17.381193Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0e5e51a9-981a-491e-aa16-d4d2f9123a2a · outbound

This paper cites Balanced max 2-sat might not be the hardest.

Learning-Augmented Algorithms for Boolean Satisfiability Balanced max 2-sat might not be the hardest

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:18.593725Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 9a21812c-2ce4-4238-9b70-6724d4bcfaec · outbound

This paper cites Learning-augmented maximum independent set.

Learning-Augmented Algorithms for Boolean Satisfiability Learning-augmented maximum independent set

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:18.577377Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 49d44891-1182-4acc-afe0-7941a7408b26 · outbound

This paper cites Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems.

Learning-Augmented Algorithms for Boolean Satisfiability Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems

Reference 8

Resolution: verified exact; local_arxiv, observed 2026-08-15T23:03:17.728368Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 5efedb9b-7e46-49cc-83a0-677f31b2e006 · outbound

This paper cites Parsimonious learning-augmented approximations for dense instances of np-hard problems.

Learning-Augmented Algorithms for Boolean Satisfiability Parsimonious learning-augmented approximations for dense instances of np-hard problems

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:18.561759Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 1c10abba-ecf9-446f-8f0d-22352386f010 · outbound

This paper cites Tight approximability of max 2-sat and relatives, under ugc.

Learning-Augmented Algorithms for Boolean Satisfiability Tight approximability of max 2-sat and relatives, under ugc

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:18.545354Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 5e06a1e3-14aa-4b60-9eff-5aac8a3eab64 · outbound

This paper cites Improving a probabilistic 3-sat algorithm by dynamic search and independent clause pairs.

Learning-Augmented Algorithms for Boolean Satisfiability Improving a probabilistic 3-sat algorithm by dynamic search and independent clause pairs

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:18.528165Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation d1fb4dce-f80c-4697-8524-c0acc5b730c8 · outbound

This paper cites Learning-augmented approximation algorithms for maximum cut and related problems.

Learning-Augmented Algorithms for Boolean Satisfiability Learning-augmented approximation algorithms for maximum cut and related problems

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:18.512237Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation ed6a3507-b536-4d07-9111-8ddf122739d8 · outbound

This paper cites The complexity of satisfiability of small depth circuits.

Learning-Augmented Algorithms for Boolean Satisfiability The complexity of satisfiability of small depth circuits

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-15T23:03:17.421557Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 97294657-fbff-4530-981f-31c90f897b64 · outbound

This paper cites The complexity of theorem-proving procedures.

Learning-Augmented Algorithms for Boolean Satisfiability The complexity of theorem-proving procedures

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:18.486265Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation a9db9252-ec82-490f-8e2d-b3ef5a2bea5c · outbound

This paper cites The adwords problem: online keyword matching with budgeted bidders under random permutations.

Learning-Augmented Algorithms for Boolean Satisfiability The adwords problem: online keyword matching with budgeted bidders under random permutations

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:18.471539Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation d4447dbc-701f-496d-9974-b8ae1b6683cb · outbound

This paper cites Mildly exponential reduction from gap-3sat to polynomial-gap label-cover.

Learning-Augmented Algorithms for Boolean Satisfiability Mildly exponential reduction from gap-3sat to polynomial-gap label-cover

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:18.456665Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 55b5d65c-45ed-4ebe-9218-82544d39f0ce · outbound

This paper cites Learning-augmented streaming algorithms for approximating max-cut.

Learning-Augmented Algorithms for Boolean Satisfiability Learning-augmented streaming algorithms for approximating max-cut

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:18.441126Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 8a3ad491-6468-4aba-a091-b76ebc39e5c0 · outbound

This paper cites Learning-augmented k -means clustering.

Learning-Augmented Algorithms for Boolean Satisfiability Learning-augmented k -means clustering

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:18.425518Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation c2dad4ae-61a8-4d9f-bbc3-5b36b56cceec · outbound

This paper cites Refuting smoothed 3cnf formulas.

Learning-Augmented Algorithms for Boolean Satisfiability Refuting smoothed 3cnf formulas

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:18.410049Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 9b4bfd69-a0ee-4e02-8a56-07d69e0692ef · outbound

This paper cites Approximating the value of two power proof systems, with applications to max 2sat and max dicut.

Learning-Augmented Algorithms for Boolean Satisfiability Approximating the value of two power proof systems, with applications to max 2sat and max dicut

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:18.394345Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation bf5e6b4f-ae35-4694-804d-0fe1f4d4538c · outbound

This paper cites Approximate cluster recovery from noisy labels.

Learning-Augmented Algorithms for Boolean Satisfiability Approximate cluster recovery from noisy labels

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:18.379038Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 72bbd366-cc8d-4c69-a453-6b8206f3ced0 · outbound

This paper cites Constraint satisfaction problems with advice.

Learning-Augmented Algorithms for Boolean Satisfiability Constraint satisfaction problems with advice

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:18.363731Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 948cb110-5233-4a5c-a89d-d04c6df2219c · outbound

This paper cites 878-approximation algorithms for max cut and max 2sat.

Learning-Augmented Algorithms for Boolean Satisfiability 878-approximation algorithms for max cut and max 2sat

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:18.347196Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 10948576-15e4-4f5a-a789-9eea48daff04 · outbound

This paper cites Some optimal inapproximability results.

Learning-Augmented Algorithms for Boolean Satisfiability Some optimal inapproximability results

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:18.329564Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation e2c825f2-0b76-41fb-80d5-f621598ecfce · outbound

This paper cites 3-sat faster and simpler---unique-sat bounds for ppsz hold in general.

Learning-Augmented Algorithms for Boolean Satisfiability 3-sat faster and simpler---unique-sat bounds for ppsz hold in general

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:18.313705Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 97afc032-38cc-45af-8403-0066a118dc13 · outbound

This paper cites Breaking the ppsz barrier for unique 3-sat.

Learning-Augmented Algorithms for Boolean Satisfiability Breaking the ppsz barrier for unique 3-sat

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:18.296579Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 9bd9daad-0bd6-4ec6-87b0-d8352fffbbc3 · outbound

This paper cites Faster k-sat algorithms using biased-ppsz.

Learning-Augmented Algorithms for Boolean Satisfiability Faster k-sat algorithms using biased-ppsz

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:18.280741Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 2fc66836-3cc5-451b-903a-dc6133d137c3 · outbound

This paper cites A probabilistic 3—sat algorithm further improved.

Learning-Augmented Algorithms for Boolean Satisfiability A probabilistic 3—sat algorithm further improved

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:18.264880Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 0fb58794-8407-438a-92fb-48fa3bd9967a · outbound

This paper cites On the complexity of k-sat.

Learning-Augmented Algorithms for Boolean Satisfiability On the complexity of k-sat

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-15T23:03:17.499866Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8209a917-5b54-4d06-b108-bd9c5946c9dd · outbound

This paper cites Improved upper bounds for 3-sat.

Learning-Augmented Algorithms for Boolean Satisfiability Improved upper bounds for 3-sat

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:18.236674Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 0c430b50-4d26-49e2-8cb8-7548132acf96 · outbound

This paper cites Approximation algorithms for combinatorial problems.

Learning-Augmented Algorithms for Boolean Satisfiability Approximation algorithms for combinatorial problems

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:18.218916Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 868539b0-9549-4dda-85f7-405f7133d13d · outbound

This paper cites Reducibility among combinatorial problemst.

Learning-Augmented Algorithms for Boolean Satisfiability Reducibility among combinatorial problemst

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:18.201564Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation b6f1867e-5b32-49da-9a65-476f7db6a531 · outbound

This paper cites On coloring resilient graphs.

Learning-Augmented Algorithms for Boolean Satisfiability On coloring resilient graphs

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:18.186148Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation d48371a7-fe62-48fd-b7a4-81b7a56c244d · outbound

This paper cites New methods for 3-sat decision and worst-case analysis.

Learning-Augmented Algorithms for Boolean Satisfiability New methods for 3-sat decision and worst-case analysis

Reference 34

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:18.169915Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 69c1764b-5570-4ef1-8f41-2a2a89d4546d · outbound

This paper cites A 7/8-approximation algorithm for max 3sat? In Proceedings 38th Annual Symposium on Foundations of Computer Science , pages 406--415.

Learning-Augmented Algorithms for Boolean Satisfiability A 7/8-approximation algorithm for max 3sat? In Proceedings 38th Annual Symposium on Foundations of Computer Science , pages 406--415

Reference 35

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:18.153533Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 59794d6f-8351-450b-acdc-67d363739a11 · outbound

This paper cites an unresolved cited work.

Learning-Augmented Algorithms for Boolean Satisfiability Unresolved cited work

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-15T23:03:17.533437Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 79cb242a-b028-498d-a398-19d0038fa297 · outbound

This paper cites Chain, generalization of covering code, and deterministic algorithm for k-sat.

Learning-Augmented Algorithms for Boolean Satisfiability Chain, generalization of covering code, and deterministic algorithm for k-sat

Reference 37

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:18.125683Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 3f9ec015-3864-4b6b-a270-63a12135004e · outbound

This paper cites Online scheduling via learned weights.

Learning-Augmented Algorithms for Boolean Satisfiability Online scheduling via learned weights

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-15T23:03:17.542854Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation eb9013e5-3022-478d-8d5f-e660ddc7b4f1 · outbound

This paper cites Improved rounding techniques for the max 2-sat and max di-cut problems.

Learning-Augmented Algorithms for Boolean Satisfiability Improved rounding techniques for the max 2-sat and max di-cut problems

Reference 39

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:18.099040Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 1247ed75-3aad-4703-8ec9-f8f8212dbbac · outbound

This paper cites Competitive caching with machine learned advice.

Learning-Augmented Algorithms for Boolean Satisfiability Competitive caching with machine learned advice

Reference 40

Resolution: unresolved; no resolver link, observed 2026-08-15T23:03:17.553104Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 467e16f6-75d5-4f19-a22c-7ddbe411e4ff · outbound

This paper cites Scheduling with predictions and the price of misprediction.

Learning-Augmented Algorithms for Boolean Satisfiability Scheduling with predictions and the price of misprediction

Reference 41

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:18.071918Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 91c237a0-7b6f-41b2-b68d-2cf7a244e2e9 · outbound

This paper cites 0.935-approximation randomized algorithm for max 2sat and its derandomization.

Learning-Augmented Algorithms for Boolean Satisfiability 0.935-approximation randomized algorithm for max 2sat and its derandomization

Reference 42

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:18.055349Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 370329ec-2518-41c9-982f-5d0fa49a3848 · outbound

This paper cites A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs.

Learning-Augmented Algorithms for Boolean Satisfiability A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs

Reference 43

Resolution: unresolved; no resolver link, observed 2026-08-15T23:03:17.567570Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3a4a372a-6fff-4918-a3e7-ec0241c30794 · outbound

This paper cites Solving satisfiability in less than 2n steps.

Learning-Augmented Algorithms for Boolean Satisfiability Solving satisfiability in less than 2n steps

Reference 44

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:18.039375Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 157dc311-9c1c-4434-8634-93ab61b76823 · outbound

This paper cites A full derandomization of sch \"o ning's k-sat algorithm.

Learning-Augmented Algorithms for Boolean Satisfiability A full derandomization of sch \"o ning's k-sat algorithm

Reference 45

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:18.023228Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation c9bd39a7-b461-43aa-aba9-78fe1d8aa381 · outbound

This paper cites Algorithms with predictions.

Learning-Augmented Algorithms for Boolean Satisfiability Algorithms with predictions

Reference 46

Resolution: unresolved; no resolver link, observed 2026-08-15T23:03:17.582221Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 13cee999-d2d9-479f-b3c7-317d1c644291 · outbound

This paper cites Improved learning-augmented algorithms for k-means and k-medians clustering.

Learning-Augmented Algorithms for Boolean Satisfiability Improved learning-augmented algorithms for k-means and k-medians clustering

Reference 47

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:17.988105Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation ea76153f-f376-428a-abcb-73e3c6db46ef · outbound

This paper cites An improved exponential-time algorithm for k-sat.

Learning-Augmented Algorithms for Boolean Satisfiability An improved exponential-time algorithm for k-sat

Reference 48

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:17.971508Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation b3733679-03bb-4fd2-9e92-fe7614c00d6e · outbound

This paper cites Satisfiability coding lemma.

Learning-Augmented Algorithms for Boolean Satisfiability Satisfiability coding lemma

Reference 49

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:17.955648Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 29b46c47-a990-49eb-99fe-754e77ab9559 · outbound

This paper cites Improving online algorithms via ml predictions.

Learning-Augmented Algorithms for Boolean Satisfiability Improving online algorithms via ml predictions

Reference 50

Resolution: unresolved; no resolver link, observed 2026-08-15T23:03:17.601692Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a342db9e-e041-45f7-a092-c5ffac8a480c · outbound

This paper cites An improvement of the algorithm of hertli for the unique 3sat problem.

Learning-Augmented Algorithms for Boolean Satisfiability An improvement of the algorithm of hertli for the unique 3sat problem

Reference 51

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:17.929331Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 99ead743-09f6-4909-b36f-4e796b303593 · outbound

This paper cites A new approach on solving 3-satisfiability.

Learning-Augmented Algorithms for Boolean Satisfiability A new approach on solving 3-satisfiability

Reference 52

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:17.912109Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 3408c134-c8dd-4c58-94a6-bcce85047548 · outbound

This paper cites Near-optimal bounds for online caching with machine learned advice.

Learning-Augmented Algorithms for Boolean Satisfiability Near-optimal bounds for online caching with machine learned advice

Reference 53

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:17.894882Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 5e89b27c-4a41-47fc-af74-41fd878c0519 · outbound

This paper cites Beyond the worst-case analysis of algorithms.

Learning-Augmented Algorithms for Boolean Satisfiability Beyond the worst-case analysis of algorithms

Reference 54

Resolution: unresolved; no resolver link, observed 2026-08-15T23:03:17.621461Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 29923d8f-5b7d-492d-b98d-eefbe4f0b457 · outbound

This paper cites Approximating csps with global cardinality constraints using sdp hierarchies.

Learning-Augmented Algorithms for Boolean Satisfiability Approximating csps with global cardinality constraints using sdp hierarchies

Reference 55

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:17.866583Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation e5c1936c-8ef0-46fe-ac7e-2a58404fcaae · outbound

This paper cites Solving 3-satisfiability in less than 1, 579 n steps.

Learning-Augmented Algorithms for Boolean Satisfiability Solving 3-satisfiability in less than 1, 579 n steps

Reference 56

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:17.847863Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation b18fc5f0-ef51-4d63-b42a-b4234dd879ef · outbound

This paper cites A probabilistic algorithm for k-sat and constraint satisfaction problems.

Learning-Augmented Algorithms for Boolean Satisfiability A probabilistic algorithm for k-sat and constraint satisfaction problems

Reference 57

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:17.830815Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation f738f0b0-8bde-4adf-8824-ea8cfa761daa · outbound

This paper cites Ppsz is better than you think.

Learning-Augmented Algorithms for Boolean Satisfiability Ppsz is better than you think

Reference 58

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:17.813303Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation c2d88551-8fb5-406b-86ce-056b4e773c0c · outbound

This paper cites Generating hard satisfiability problems.

Learning-Augmented Algorithms for Boolean Satisfiability Generating hard satisfiability problems

Reference 59

Resolution: unresolved; no resolver link, observed 2026-08-15T23:03:17.644385Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5ccc11ea-377e-4311-a767-1d7307ca9e9e · outbound

This paper cites Ppsz for general k-sat-making hertli's analysis simpler and 3-sat faster.

Learning-Augmented Algorithms for Boolean Satisfiability Ppsz for general k-sat-making hertli's analysis simpler and 3-sat faster

Reference 60

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:17.784265Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 1dd1a2c5-116d-4cc2-b0d8-0ba159491081 · outbound

This paper cites Optimal online assignment with forecasts.

Learning-Augmented Algorithms for Boolean Satisfiability Optimal online assignment with forecasts

Reference 61

Resolution: unresolved; no resolver link, observed 2026-08-15T23:03:17.654950Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9abf02d2-cba2-4294-a630-197ebc72474d · outbound

This paper cites Optimal robustness-consistency trade-offs for learning-augmented online algorithms.

Learning-Augmented Algorithms for Boolean Satisfiability Optimal robustness-consistency trade-offs for learning-augmented online algorithms

Reference 62

Resolution: unresolved; no resolver link, observed 2026-08-15T23:03:17.659372Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0ddcde2b-075a-46a1-81a6-d9791945244b · outbound

This paper cites Analyzing the max 2-sat and max di-cut approximation algorithms of feige and goemans.

Learning-Augmented Algorithms for Boolean Satisfiability Analyzing the max 2-sat and max di-cut approximation algorithms of feige and goemans

Reference 63

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T23:03:17.745844Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Pith citing papers

Observation 2cc6fb09-a2d4-4981-bf73-69a86c9b6439 · inbound

A Better Analysis For PPSZ For 3-SAT cites this paper.

A Better Analysis For PPSZ For 3-SAT Learning-Augmented Algorithms for Boolean Satisfiability

Reference 1

Resolution: unresolved; no resolver link, observed 2026-07-14T09:56:40.793890Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.