Pith. sign in

Paper Citation Record · LEDGER

Extracting Problem Structure with LLMs for Optimized SAT Local Search

As of 19 August 2026, this Paper Citation Record lists 46 of 46 outbound references and 0 inbound Pith citation observations for arXiv:2501.14630.

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

pith.paper-citation-record.v1
2501.14630 v2

Coverage vector

measured 46 of 46 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-10T15:00:54.897618Z

measured 46 of 46 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-19T06:32:44.657259+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

46 of 46 outbound references displayed

  • verified exact13
  • verified fuzzy14
  • unresolved18
  • parse uncertain0
  • malformed identifier1
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 84cdb05b-524d-4bf9-b679-92c7bb9ad643 · outbound

This paper cites Efficient inference of optimal decision trees.

Extracting Problem Structure with LLMs for Optimized SAT Local Search Efficient inference of optimal decision trees

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T15:00:55.961839Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-10T15:00:54.626778Z digest=sha256:0f2d8f87ca53fe2902d5f419a75d9e1e0d8aaba07fd15ddb51ecf5cb0cf4e7a3

Observation 74ea0d19-c842-45e2-b53f-943cffda8979 · outbound

This paper cites Boosting the performance of SLS and CDCL solvers by preprocessor tuning.

Extracting Problem Structure with LLMs for Optimized SAT Local Search Boosting the performance of SLS and CDCL solvers by preprocessor tuning

Reference 2

Resolution
malformed identifier
doi_truncated, observed 2026-08-10T15:00:55.478753Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-10T15:00:54.632909Z digest=sha256:5683cd3c39097a2aba9120d24708b9a44953b468e06cc93ae9963dd61b73557a

Observation fb25ce43-aee8-499a-b398-106f6749ac1b · outbound

This paper cites Minimising decision tree size as combinatorial optimisation.

Extracting Problem Structure with LLMs for Optimized SAT Local Search Minimising decision tree size as combinatorial optimisation

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T15:00:55.947132Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-10T15:00:54.644098Z digest=sha256:e5d5b64faf013b1e1530563ecaa9cad96dbb53b57030886cc9e200546c4f29cf

Observation 741c9132-c3c5-4855-b21c-2acc3d68387e · outbound

This paper cites CaDiCaL , Kissat , Paracooba , Plingeling , and Treengeling entering the SAT competition 2020.

Extracting Problem Structure with LLMs for Optimized SAT Local Search CaDiCaL , Kissat , Paracooba , Plingeling , and Treengeling entering the SAT competition 2020

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T15:00:55.932035Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-10T15:00:54.648879Z digest=sha256:9ef3a67de06483812e1dfbdb03319523a2014ebda7642efe3a9277187cead1cf

Observation 73e0528f-c5b2-4235-9fda-8a3cd650f830 · outbound

This paper cites Cadical 2.0.

Extracting Problem Structure with LLMs for Optimized SAT Local Search Cadical 2.0

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-10T15:00:54.653662Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-10T15:00:54.653662Z digest=sha256:f6205adfeae84760baf94ded2928670d5cfff175ca06421a098fe083e6ba3c90

Observation 5ae711dc-34cf-47ad-ae34-0542abecb15e · outbound

This paper cites Yet another local search solver and Lingeling and friends entering the SAT Competition 2014.

Extracting Problem Structure with LLMs for Optimized SAT Local Search Yet another local search solver and Lingeling and friends entering the SAT Competition 2014

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T15:00:55.917920Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-10T15:00:54.658888Z digest=sha256:523ad3581108d14433975afa8f33f155fd1d6c5b1a302a8da0691d61544750d5

Observation feb2742d-18ef-437d-8ae2-3b658a04c525 · outbound

This paper cites CaDiCaL at the SAT race 2019.

Extracting Problem Structure with LLMs for Optimized SAT Local Search CaDiCaL at the SAT race 2019

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T15:00:55.903522Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-10T15:00:54.664414Z digest=sha256:9d7a17af346cde40f505eca5dd3375e44807178f117f27b991d972bad37f13d5

Observation f1cf30a1-173c-40eb-8f21-2fd21d4e2998 · outbound

This paper cites New methods to color the vertices of a graph.

Extracting Problem Structure with LLMs for Optimized SAT Local Search New methods to color the vertices of a graph

Reference 9

Resolution
unresolved
no resolver link, observed 2026-08-10T15:00:54.670436Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-10T15:00:54.670436Z digest=sha256:c5c44820c4ff3d5a6fbb4fea64ab42aad108c0a39d9cb77966b92227c0733c7c

Observation 52344670-8347-4901-b050-692736499b16 · outbound

This paper cites Deep cooperation of CDCL and local search for SAT.

Extracting Problem Structure with LLMs for Optimized SAT Local Search Deep cooperation of CDCL and local search for SAT

Reference 10

Resolution
verified exact
doi, observed 2026-08-10T15:00:55.440752Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-10T15:00:54.676770Z digest=sha256:550bf0189d0fe81fa4eac5beb595c873a6b2f6724a6e57ae2acad6d2ca27b43e

Observation fa415553-e974-4e21-9f79-e0e3910a5e07 · outbound

This paper cites Better decision heuristics in CDCL through local search and target phases.

Extracting Problem Structure with LLMs for Optimized SAT Local Search Better decision heuristics in CDCL through local search and target phases

Reference 11

Resolution
verified exact
doi, observed 2026-08-10T15:00:55.422199Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-10T15:00:54.682953Z digest=sha256:30e77e2740f6bb0d734774af4b479f5d8003968465bbf3e12773ac19e1a585ad

Observation 4d276cd7-9f83-4b86-b331-c0fc9db78d7e · outbound

This paper cites Large Language Models for Compiler Optimization.

Extracting Problem Structure with LLMs for Optimized SAT Local Search Large Language Models for Compiler Optimization

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-10T15:00:54.689679Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-10T15:00:54.689679Z digest=sha256:fb1781c137f20998c99664cc60dfe1f33a6c61a5795f239c34640f69d3a65d8f

Observation 82f98701-1406-4145-a470-f0256a605e49 · outbound

This paper cites SAT -based local improvement for finding tree decompositions of small width.

Extracting Problem Structure with LLMs for Optimized SAT Local Search SAT -based local improvement for finding tree decompositions of small width

Reference 13

Resolution
unresolved
no resolver link, observed 2026-08-10T15:00:54.696442Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-10T15:00:54.696442Z digest=sha256:fadf604587fb43d13509f87a2446e34dee5bb2811dcd395e8300e8de0b809b3d

Observation 13914a02-4889-49a6-af51-9120d58d81b5 · outbound

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

Extracting Problem Structure with LLMs for Optimized SAT Local Search The silent (r)evolution of SAT

Reference 14

Resolution
unresolved
no resolver link, observed 2026-08-10T15:00:54.707565Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-10T15:00:54.707565Z digest=sha256:a0cc1695bae57b5fa47ecf38ded35138741064dbf7940d2259588e9f31ec9488

Observation 0a394338-a6c3-4d7e-b9d5-9f290a5c62f0 · outbound

This paper cites Another look at graph coloring via propositional satisfiability.

Extracting Problem Structure with LLMs for Optimized SAT Local Search Another look at graph coloring via propositional satisfiability

Reference 15

Resolution
unresolved
no resolver link, observed 2026-08-10T15:00:54.713297Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-10T15:00:54.713297Z digest=sha256:86d67825107cd9a531cdf85ceef08346ba8bb53e33c7a397fe76416a4754c7e0

Observation dc5c49fb-1f64-4c86-9b36-8ccf5b1c02d3 · outbound

This paper cites The PACE 2022 parameterized algorithms and computational experiments challenge: Directed feedback vertex set.

Extracting Problem Structure with LLMs for Optimized SAT Local Search The PACE 2022 parameterized algorithms and computational experiments challenge: Directed feedback vertex set

Reference 16

Resolution
verified exact
doi, observed 2026-08-10T15:00:55.354385Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-10T15:00:54.718334Z digest=sha256:bd170858002b62f7505749ea3dc9a7ebc2c7f91d35ee7bf2fba26d3f72f61bf8

Observation b2a91d8e-54cd-4cdd-8296-ced5be8905f8 · outbound

This paper cites an unresolved cited work.

Extracting Problem Structure with LLMs for Optimized SAT Local Search Unresolved cited work

Reference 17

Resolution
unresolved
raw_fallback, observed 2026-08-10T15:00:55.889051Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-10T15:00:54.726592Z digest=sha256:5dd99c81d5f71d4cd819024de33000561476eef249e619310b6db81e51339d76

Observation d0177a5d-2306-437e-80fd-97c9868a6b6a · outbound

This paper cites PySAT: A Python toolkit for prototyping with SAT oracles.

Extracting Problem Structure with LLMs for Optimized SAT Local Search PySAT: A Python toolkit for prototyping with SAT oracles

Reference 18

Resolution
unresolved
no resolver link, observed 2026-08-10T15:00:54.731158Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-10T15:00:54.731158Z digest=sha256:dbaeac009adb5a05a86c07610f39736f27caa43ad8c96e7e468ec84e79de2b34

Observation c6b3c2ef-004e-4f95-83f3-542ef86ba10f · outbound

This paper cites Towards universally accessible SAT technology.

Extracting Problem Structure with LLMs for Optimized SAT Local Search Towards universally accessible SAT technology

Reference 19

Resolution
unresolved
no resolver link, observed 2026-08-10T15:00:54.735790Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-10T15:00:54.735790Z digest=sha256:09d84e7d5a820f3982c608ef81dc79fa1f9813ddd62da1bf29fee2dbc7a9abee

Observation 054f5fb3-c946-4090-a133-78c388e655cd · outbound

This paper cites On the quest for an acyclic graph.

Extracting Problem Structure with LLMs for Optimized SAT Local Search On the quest for an acyclic graph

Reference 20

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T15:00:55.873071Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-10T15:00:54.740530Z digest=sha256:a375a0f2d30953203b33c5a809af79fecd26d25a39163699d2ec1b936503e15a

Observation bfbd3c9c-6bb9-450b-9ddd-d99a374a67c7 · outbound

This paper cites A Survey on Large Language Models for Code Generation.

Extracting Problem Structure with LLMs for Optimized SAT Local Search A Survey on Large Language Models for Code Generation

Reference 21

Resolution
unresolved
no resolver link, observed 2026-08-10T15:00:54.745609Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-10T15:00:54.745609Z digest=sha256:dbee185add8f67b4d879cb70b90aa01b6f58b727505453b359229eb357a9920c

Observation f011eec6-b8ef-4279-a2db-a88222f52832 · outbound

This paper cites an unresolved cited work.

Extracting Problem Structure with LLMs for Optimized SAT Local Search Unresolved cited work

Reference 22

Resolution
unresolved
no resolver link, observed 2026-08-10T15:00:54.751150Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-10T15:00:54.751150Z digest=sha256:55f6e62dcbd62030f182a79d62f7f117ea1c0252d0ebe0ada46f52dedda73169

Observation 4b48afd9-e693-4257-8365-96d0bb416c60 · outbound

This paper cites PACE solver description: Dager - cutting out cycles with maxsat.

Extracting Problem Structure with LLMs for Optimized SAT Local Search PACE solver description: Dager - cutting out cycles with maxsat

Reference 23

Resolution
verified exact
doi, observed 2026-08-10T15:00:55.273674Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-10T15:00:54.755369Z digest=sha256:8080a0a993b3598badc3b7bb90ce45a81e0e7555765634d381004107c3275b90

Observation 3799790c-6013-420d-8e7f-a1fab630a40d · outbound

This paper cites A dynamic MaxSAT -based approach to directed feedback vertex sets.

Extracting Problem Structure with LLMs for Optimized SAT Local Search A dynamic MaxSAT -based approach to directed feedback vertex sets

Reference 24

Resolution
verified exact
doi, observed 2026-08-10T15:00:55.255093Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-10T15:00:54.759701Z digest=sha256:19dd37947282a1e701cceadf452768aeaa272f25c1e140078c594b3617ca8f84

Observation 9f082213-d1ac-4f27-92e7-40b65f3326af · outbound

This paper cites Satisfying versus falsifying in local search for satisfiability - (poster presentation).

Extracting Problem Structure with LLMs for Optimized SAT Local Search Satisfying versus falsifying in local search for satisfiability - (poster presentation)

Reference 25

Resolution
unresolved
no resolver link, observed 2026-08-10T15:00:54.764663Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-10T15:00:54.764663Z digest=sha256:2187ee09094fa96800682f77094b36befb8e550c63507479817359c349d68b20

Observation 40e04e5d-690e-46fa-9094-164b08ee19ce · outbound

This paper cites Competition-Level Code Generation with AlphaCode.

Extracting Problem Structure with LLMs for Optimized SAT Local Search Competition-Level Code Generation with AlphaCode

Reference 26

Resolution
unresolved
no resolver link, observed 2026-08-10T15:00:54.769751Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-10T15:00:54.769751Z digest=sha256:931e572d35c4de9cac4e63666a6815b21545b85b4d74893a86c5d16e25298f67

Observation c773b4d7-cced-42c2-8dd7-d3f73669778c · outbound

This paper cites Conflict-driven clause learning SAT solvers.

Extracting Problem Structure with LLMs for Optimized SAT Local Search Conflict-driven clause learning SAT solvers

Reference 27

Resolution
unresolved
no resolver link, observed 2026-08-10T15:00:54.777281Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-10T15:00:54.777281Z digest=sha256:09991d9280e78cb566e0c4fa0710c367e5ec92d0feb2820d12f8e94ca358265c

Observation e72b9e23-d7a2-4611-8dcf-e2844333a751 · outbound

This paper cites McAllester, Bart Selman, and Henry A.

Extracting Problem Structure with LLMs for Optimized SAT Local Search McAllester, Bart Selman, and Henry A

Reference 28

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T15:00:55.857228Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-10T15:00:54.786461Z digest=sha256:eb2e14fd127b2ed0a9d5c7bf71b7c532810586f8dfe1cc6ab234becddbfa4242

Observation 997c2e5b-1706-4348-8a31-293ccb9b95a5 · outbound

This paper cites Learning optimal decision trees with SAT.

Extracting Problem Structure with LLMs for Optimized SAT Local Search Learning optimal decision trees with SAT

Reference 29

Resolution
verified exact
doi, observed 2026-08-10T15:00:55.209646Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-10T15:00:54.795010Z digest=sha256:900fcdf78ec3b0180c9b479ceab55f488f156dab0e5a69feacbf17cc862a34ae

Observation c6629eb6-c280-4806-bc40-fed504b10acf · outbound

This paper cites Codegen: An open large language model for code with multi-turn program synthesis.

Extracting Problem Structure with LLMs for Optimized SAT Local Search Codegen: An open large language model for code with multi-turn program synthesis

Reference 30

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T15:00:55.839586Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-10T15:00:54.804833Z digest=sha256:1fb7078ea41bed488f0c6969c6756a4ba45af311a81456acb83ae919959bdd84

Observation f3def39e-c4ce-41dc-b560-4bed0b38c10c · outbound

This paper cites Olson, William La Cava, Patryk Orzechowski, Ryan J.

Extracting Problem Structure with LLMs for Optimized SAT Local Search Olson, William La Cava, Patryk Orzechowski, Ryan J

Reference 31

Resolution
unresolved
no resolver link, observed 2026-08-10T15:00:54.810580Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-10T15:00:54.810580Z digest=sha256:c7efe8ffcd5dc028d679628f4961339782d4566f6abba49720233f41df1d0882

Observation 16a6ee61-427a-4846-9836-20eceee10e01 · outbound

This paper cites SAT -based decision tree learning for large data sets.

Extracting Problem Structure with LLMs for Optimized SAT Local Search SAT -based decision tree learning for large data sets

Reference 32

Resolution
verified exact
doi, observed 2026-08-10T15:00:55.177014Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-10T15:00:54.816840Z digest=sha256:4351e5dc00efaa4ec288d635fd1a59218475df355fc63baaf915cf90bd76738b

Observation 906ad2bc-30fa-4e7b-8d82-8176effd03dd · outbound

This paper cites Extracting problem structure with LLMs for optimized SAT local search, January 2025.

Extracting Problem Structure with LLMs for Optimized SAT Local Search Extracting problem structure with LLMs for optimized SAT local search, January 2025

Reference 33

Resolution
verified exact
doi, observed 2026-08-10T15:00:55.157593Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-10T15:00:54.821689Z digest=sha256:ae3d856b67317701b85a0fe63e3e90a69fd24f86c0369485ab71e7f474548e9c

Observation 767804c5-9f2f-4041-a9e0-c42990fde771 · outbound

This paper cites Levesque, and David G.

Extracting Problem Structure with LLMs for Optimized SAT Local Search Levesque, and David G

Reference 34

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T15:00:55.821628Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-10T15:00:54.827262Z digest=sha256:fae6f96484ecbe8c7083291a4bfc820fd2d0e633efed94f6470d66e179bba219

Observation 3a7fa4c8-144b-48af-82bf-8315a4f888c7 · outbound

This paper cites Kautz, and Bram Cohen.

Extracting Problem Structure with LLMs for Optimized SAT Local Search Kautz, and Bram Cohen

Reference 35

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T15:00:55.804254Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-10T15:00:54.832551Z digest=sha256:cc702ef2980920e9d66450010e17892875632a57924d4b87c5830217ab2013b4

Observation 881a462c-bd14-4bfc-aee1-8ee00b094a73 · outbound

This paper cites an unresolved cited work.

Extracting Problem Structure with LLMs for Optimized SAT Local Search Unresolved cited work

Reference 36

Resolution
verified exact
doi, observed 2026-08-10T15:00:55.137722Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-10T15:00:54.838295Z digest=sha256:caa5c832d0a5618825f0920060ca8b2a2e6689be197250abc7f690e1aa1c82f9

Observation 4e95e8fb-e971-4f3e-b328-7fb71f4d901e · outbound

This paper cites McIlraith.

Extracting Problem Structure with LLMs for Optimized SAT Local Search McIlraith

Reference 37

Resolution
verified exact
doi, observed 2026-08-10T15:00:55.120664Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-10T15:00:54.843610Z digest=sha256:8b696d7ca91e0269400e1285d0fa1e77d1a8ca1446fcc3b0d3504b394528043d

Observation dedcc232-717d-4e79-826a-a6fa43a9624a · outbound

This paper cites Marques Silva and Karem A.

Extracting Problem Structure with LLMs for Optimized SAT Local Search Marques Silva and Karem A

Reference 38

Resolution
unresolved
no resolver link, observed 2026-08-10T15:00:54.848888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-10T15:00:54.848888Z digest=sha256:e2e8aad26c3153450436d3dd9251dcce8ba49f0e4859f2a90e90959de5d3b999

Observation 5d575011-cc15-4985-98ca-80e31aef8769 · outbound

This paper cites Cryptominisat 5.6.8.

Extracting Problem Structure with LLMs for Optimized SAT Local Search Cryptominisat 5.6.8

Reference 39

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T15:00:55.782431Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-10T15:00:54.853812Z digest=sha256:59936e57d047726cd508a58f337b439bbc6ae7a9535c508b9aac80cbedb62e13

Observation 6bb66234-fc2d-4e57-bb0f-57b470b45597 · outbound

This paper cites A solution-driven multilevel approach for graph coloring.

Extracting Problem Structure with LLMs for Optimized SAT Local Search A solution-driven multilevel approach for graph coloring

Reference 40

Resolution
unresolved
no resolver link, observed 2026-08-10T15:00:54.858596Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-10T15:00:54.858596Z digest=sha256:e5af6fb2bc6817eb9e266c731ae2303be073ad691442445fe49ba86d58a9f340

Observation 94c721e5-c877-4918-bf96-a1c20b1a36fa · outbound

This paper cites MCP-Solver: Integrating Language Models with Constraint Programming Systems.

Extracting Problem Structure with LLMs for Optimized SAT Local Search MCP-Solver: Integrating Language Models with Constraint Programming Systems

Reference 41

Resolution
unresolved
no resolver link, observed 2026-08-10T15:00:54.863646Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-10T15:00:54.863646Z digest=sha256:d750e6f57ba6e237b49acc824145bc9b14347025cdfb5e6d4c4d6bb41bab1a02

Observation 8cfd84c4-0ec0-429b-ab35-c76e929800ec · outbound

This paper cites Learning optimal classification trees using a binary linear program formulation.

Extracting Problem Structure with LLMs for Optimized SAT Local Search Learning optimal classification trees using a binary linear program formulation

Reference 42

Resolution
verified exact
doi, observed 2026-08-10T15:00:55.082715Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-10T15:00:54.869463Z digest=sha256:b47e3e29c2ac165a887670e9c3002b146f5514c09a01d5154fb96317794c7305

Observation d96e0730-a2d4-4aa3-9d21-ebdc2e520ab6 · outbound

This paper cites Generating streamlining constraints with large language models.

Extracting Problem Structure with LLMs for Optimized SAT Local Search Generating streamlining constraints with large language models

Reference 43

Resolution
verified exact
doi, observed 2026-08-10T15:00:55.066220Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-10T15:00:54.876099Z digest=sha256:0f5097b0a352b6f33015b06440ff8df46be63b765e1780fa797286fa6842e689

Observation f082920b-4d75-49aa-9682-0f7a84f8bf10 · outbound

This paper cites Realtime generation of streamliners with large language models.

Extracting Problem Structure with LLMs for Optimized SAT Local Search Realtime generation of streamliners with large language models

Reference 44

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T15:00:55.764957Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-10T15:00:54.881710Z digest=sha256:09693770315e663cc2acca5005ec6c81c623b5052a64c182aad4ea01ccfddcda

Observation 91749e61-b329-4273-96ef-a106cf1f547f · outbound

This paper cites Learning local search heuristics for boolean satisfiability.

Extracting Problem Structure with LLMs for Optimized SAT Local Search Learning local search heuristics for boolean satisfiability

Reference 45

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T15:00:55.745681Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-10T15:00:54.886864Z digest=sha256:f887645c1050c55dbc4897a334c71a0016abaa208f34823e9b62f9e9625f821a

Observation eb054d60-2d73-4f37-a6ad-67f27ee9efbc · outbound

This paper cites A spin glass approach to the directed feedback vertex set problem.

Extracting Problem Structure with LLMs for Optimized SAT Local Search A spin glass approach to the directed feedback vertex set problem

Reference 46

Resolution
verified exact
doi, observed 2026-08-10T15:00:54.942077Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-10T15:00:54.892345Z digest=sha256:bb677709780dd6875150a881108cb0c3802fb6e5f2a5652802d744c7bf157879

Observation fb32665a-fb4f-49c1-bc9b-46e4e5e8afd0 · outbound

This paper cites write newline.

Extracting Problem Structure with LLMs for Optimized SAT Local Search write newline

Reference 47

Resolution
verified fuzzy
raw_fallback, observed 2026-08-10T15:00:55.730016Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-08-10T15:00:54.897618Z digest=sha256:c3d56d75d9500445edfa2a8cd849e310a90e499cb0a6e21f851c4c81407d59fd

Pith citing papers

No inbound Pith citation observations are available.