Paper Citation Record · LEDGER

Graph-Based Deterministic Polynomial Framwork for NP Problems

As of 12 August 2026, this Paper Citation Record lists 11 of 11 outbound references and 1 inbound Pith citation observation for arXiv:2508.13166.

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

pith.paper-citation-record.v1
2508.13166 v8

Coverage vector

measured 11 of 11 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-06T05:53:59.117073Z

measured 12 of 12 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-11T06:34:44.6726+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-08-03T01:00:32.076669Z

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

11 of 11 outbound references displayed

verified exact0
verified fuzzy9
unresolved2
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 0f6d8e4d-0f4f-4106-a2e3-388868a3f07b · outbound

This paper cites Aaronson and A.

Graph-Based Deterministic Polynomial Framwork for NP Problems Aaronson and A

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T05:53:59.304486Z

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 70ca4a4c-7dd1-443f-9176-722ff8669bec · outbound

This paper cites Baker, J.

Graph-Based Deterministic Polynomial Framwork for NP Problems Baker, J

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T05:53:59.290220Z

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 8b863865-cb5e-4454-a0e0-b86563ed0c08 · outbound

This paper cites an unresolved cited work.

Graph-Based Deterministic Polynomial Framwork for NP Problems Unresolved cited work

Reference 3

Resolution: unresolved; raw_fallback, observed 2026-08-06T05:53:59.275964Z

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 cb689588-a643-422b-9a3f-73f07622bec8 · outbound

This paper cites Time-bounded random access machines.

Graph-Based Deterministic Polynomial Framwork for NP Problems Time-bounded random access machines

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T05:53:59.261879Z

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 a4654747-447d-4788-a4c8-9407168a7117 · outbound

This paper cites Graduate texts in mathematics: Graph theory.

Graph-Based Deterministic Polynomial Framwork for NP Problems Graduate texts in mathematics: Graph theory

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T05:53:59.247707Z

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 15535784-3840-4219-ba22-a763aa806ea5 · outbound

This paper cites Jones and Bartlett Publishers, Inc., 1996.

Graph-Based Deterministic Polynomial Framwork for NP Problems Jones and Bartlett Publishers, Inc., 1996

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T05:53:59.231827Z

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 b75d4fd9-ad56-4a78-b30e-88e74d7e3266 · outbound

This paper cites Introduction to automata theory, languages, and computation.

Graph-Based Deterministic Polynomial Framwork for NP Problems Introduction to automata theory, languages, and computation

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T05:53:59.215719Z

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 5b8b0a61-7095-4dfa-8c8d-38864d81a57c · outbound

This paper cites an unresolved cited work.

Graph-Based Deterministic Polynomial Framwork for NP Problems Unresolved cited work

Reference 8

Resolution: unresolved; raw_fallback, observed 2026-08-06T05:53:59.200918Z

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 fad5a94d-f245-40ec-acf1-8f9f0b86dd73 · outbound

This paper cites Pearson, Upper Saddle River, NJ, June 2005.

Graph-Based Deterministic Polynomial Framwork for NP Problems Pearson, Upper Saddle River, NJ, June 2005

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T05:53:59.185811Z

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 f2bbee17-b682-44d8-8552-e206ecbb947d · outbound

This paper cites Razborov and S.

Graph-Based Deterministic Polynomial Framwork for NP Problems Razborov and S

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T05:53:59.170989Z

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 6b724fa3-6d2f-4f08-9c54-6fdf59d8fa1a · outbound

This paper cites Introduction to graph theory.Tata McGraw-Hill, pages 2–10, 2005.

Graph-Based Deterministic Polynomial Framwork for NP Problems Introduction to graph theory.Tata McGraw-Hill, pages 2–10, 2005

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-06T05:53:59.155037Z

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.

Pith citing papers

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

Implementation of Polynomial NP-Complete Algorithms Based on the NP Verifier Simulation Framework cites this paper.

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.