Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-03T20:50:32.954025Z
Paper Citation Record · LEDGER
A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems
As of 11 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:2511.18639.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-11T06:34:44.6726+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
17 of 17 outbound references displayed
- verified exact5
- verified fuzzy0
- unresolved9
- parse uncertain0
- malformed identifier3
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 7ae3aa63-0404-4441-bb84-0d3741c68a25 · outbound
This paper cites [Jan10] Predrag Janicic.
A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems [Jan10] Predrag Janicic
Reference 8
- Resolution
- verified exact
- doi, observed 2026-08-03T20:53:26.204740Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation f1732a15-3faa-4c59-a5ab-dc9cd33be35f · outbound
This paper cites [KT07] Jon Kleinberg and Eva Tardos.Algorithm Design.
A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems [KT07] Jon Kleinberg and Eva Tardos.Algorithm Design
Reference 13
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T20:50:32.669557Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation f5971bed-dd30-4ad0-b8c1-e42716647caf · outbound
This paper cites Gesellschaft f¨ ur Informatik e.V.,.
A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems Gesellschaft f¨ ur Informatik e.V.,
Reference 23
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T20:50:32.206839Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 3c66419f-efc8-46b1-9f69-b0054cdc3ea2 · outbound
This paper cites an unresolved cited work.
A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems Unresolved cited work
Reference 1962
- Resolution
- verified exact
- doi, observed 2026-08-03T20:53:26.384764Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation f31f9de2-2602-4616-ab13-b728211c4714 · outbound
This paper cites [DLL62] Martin Davis, George Logemann, and Donald Loveland.
A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems [DLL62] Martin Davis, George Logemann, and Donald Loveland
Reference 1971
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T20:50:31.722266Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 1dbb91b3-f5cc-40d1-9716-f0517ae39323 · outbound
This paper cites Analysis of boomerang differential trails via a sat-based constraint solver URSA.
A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems Analysis of boomerang differential trails via a sat-based constraint solver URSA
Reference 1976
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T20:50:32.525269Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation be21cba9-e88e-41d8-b47c-0c3b568b6136 · outbound
This paper cites Specification and automatic verification of computational reductions.
A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems Specification and automatic verification of computational reductions
Reference 1979
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T20:50:32.025710Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 4541a024-370f-4662-8132-18da3cff9fce · outbound
This paper cites Automatic polytime reductions of NP problems into a fragment of STRIPS.
A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems Automatic polytime reductions of NP problems into a fragment of STRIPS
Reference 1995
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T20:50:32.893618Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation d5355cae-7f79-421c-b8e7-bdd2304c5d4b · outbound
This paper cites [Pap95] Christos Papadimitriou.Computational Complexity.
A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems [Pap95] Christos Papadimitriou.Computational Complexity
Reference 2001
- Resolution
- malformed identifier
- no resolver link, observed 2026-08-03T20:50:32.811612Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 38419ede-26bf-473f-b1fd-4d0f61a045a0 · outbound
This paper cites Automatic evaluation of reductions between np-complete problems.
A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems Automatic evaluation of reductions between np-complete problems
Reference 2009
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T20:50:31.716448Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation ae5d7ced-1e00-494b-b001-e59b37868a0b · outbound
This paper cites [JK13] Charles Jordan and Lukasz Kaiser.
A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems [JK13] Charles Jordan and Lukasz Kaiser
Reference 2010
- Resolution
- verified exact
- doi, observed 2026-08-03T20:53:26.092518Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 33ca02ac-3196-4f2d-9e1a-35209f2101b9 · outbound
This paper cites [MMZ+01] Matthew W.
A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems [MMZ+01] Matthew W
Reference 2013
- Resolution
- malformed identifier
- no resolver link, observed 2026-08-03T20:50:32.724427Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 0b42470e-b2c3-41cc-8536-8e9eeb47c1e2 · outbound
This paper cites [KRS+25] Tristan Kneisel, Elias Radtke, Marko Schmellenkamp, Fabian Vehlken, and Thomas Zeume.
A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems [KRS+25] Tristan Kneisel, Elias Radtke, Marko Schmellenkamp, Fabian Vehlken, and Thomas Zeume
Reference 2015
- Resolution
- verified exact
- doi, observed 2026-08-03T20:53:25.684741Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 859389e0-8457-4f3b-b5b8-41d4ec808027 · outbound
This paper cites [ZHD22] Chenhao Zhang, Jason D.
A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems [ZHD22] Chenhao Zhang, Jason D
Reference 2016
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T20:50:32.954025Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation e374fa3e-6c2a-4dff-8c40-53a4b9e61035 · outbound
This paper cites 26 A SAT-BASED APPROACH FOR REDUCTIONS BETWEEN NP-COMPLETE PROBLEMS [Kar72] Richard M.
A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems 26 A SAT-BASED APPROACH FOR REDUCTIONS BETWEEN NP-COMPLETE PROBLEMS [Kar72] Richard M
Reference 2022
- Resolution
- verified exact
- doi, observed 2026-08-03T20:53:25.891060Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 93799006-6a78-4d3f-aca6-4a49131385a7 · outbound
This paper cites MFCS.2024.56,doi:10.4230/LIPICS.MFCS.2024.56.
A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems MFCS.2024.56,doi:10.4230/LIPICS.MFCS.2024.56
Reference 2024
- Resolution
- malformed identifier
- no resolver link, observed 2026-08-03T20:50:32.122841Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 505d3e93-9dc2-4f1a-9488-404454c91119 · outbound
This paper cites The Karp Dataset.
A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems The Karp Dataset
Reference 2025
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T20:50:31.901768Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Pith citing papers
No inbound Pith citation observations are available.