Paper Citation Record · LEDGER

Implementation of Polynomial NP-Complete Algorithms Based on the NP Verifier Simulation Framework

As of 12 August 2026, this Paper Citation Record lists 5 of 5 outbound references and 0 inbound Pith citation observations for arXiv:2602.10991.

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

pith.paper-citation-record.v1
2602.10991 v4

Coverage vector

measured 5 of 5 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-03T01:00:32.191754Z

measured 5 of 5 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-12T06:34:41.77262+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

5 of 5 outbound references displayed

verified exact0
verified fuzzy0
unresolved5
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation d1a2f4cf-596e-43f6-bd20-5d762ff258ae · outbound

This paper cites Time-bounded random access machines.

Implementation of Polynomial NP-Complete Algorithms Based on the NP Verifier Simulation Framework Time-bounded random access machines

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-03T01:00:31.831748Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 30b380a8-22bd-4f91-8d0d-c726c4a47115 · outbound

This paper cites A machine program for theorem-proving.Commu- nications of the ACM, 5(7):394–397, 1962.

Implementation of Polynomial NP-Complete Algorithms Based on the NP Verifier Simulation Framework A machine program for theorem-proving.Commu- nications of the ACM, 5(7):394–397, 1962

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-03T01:00:31.898336Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e6ad1e96-d977-4843-a6dc-a0a6a3b24c97 · outbound

This paper cites an unresolved cited work.

Implementation of Polynomial NP-Complete Algorithms Based on the NP Verifier Simulation Framework Unresolved cited work

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-03T01:00:31.986500Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8357beba-ba1f-4cd3-b7ca-42d346929179 · outbound

This paper cites Graph-Based Deterministic Polynomial Framwork for NP Problems.

Implementation of Polynomial NP-Complete Algorithms Based on the NP Verifier Simulation Framework Graph-Based Deterministic Polynomial Framwork for NP Problems

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-03T01:00:32.076669Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f8067717-17fb-45f0-b402-b3e45b09f5c0 · outbound

This paper cites On computable numbers, with an application to the entscheidungsproblem.J.

Implementation of Polynomial NP-Complete Algorithms Based on the NP Verifier Simulation Framework On computable numbers, with an application to the entscheidungsproblem.J

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-03T01:00:32.191754Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.