{"as_of":"2026-08-12T08:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b564f17e823fac3bae9f184304de8c9cad55e7b2fea13b3a7bb82968f33ef959","coverage":[{"denominator":5,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T01:00:32.191754Z","state":"measured"},{"denominator":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2602.10991/citation-record","integrity":"/paper/2602.10991/integrity","json":"/paper/2602.10991/citation-record.json","paper":"/paper/2602.10991"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T01:00:31.831748Z","title":"Time-bounded random access machines","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2602.10991","last_updated":"2026-07-12T07:09:16Z","snapshot_observed_at":"2026-08-03T01:42:18.222581Z","submitted_at":"2026-02-11T16:17:36Z","title":"Implementation of Polynomial NP-Complete Algorithms Based on the NP Verifier Simulation Framework","version":4},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T01:00:31.831748Z"},"links":{"citing_paper":"/paper/2602.10991"},"observation_digest":"sha256:60f073c2ce793420c69ad63b7c9a8c83f069a5c71f781e040c4329c3ec0e0559","observation_id":"d1a2f4cf-596e-43f6-bd20-5d762ff258ae","resolution":{"observed_at":"2026-08-03T01:00:31.831748Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T01:00:31.898336Z","title":"A machine program for theorem-proving.Commu- nications of the ACM, 5(7):394–397, 1962","venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2602.10991","last_updated":"2026-07-12T07:09:16Z","snapshot_observed_at":"2026-08-03T01:42:18.222581Z","submitted_at":"2026-02-11T16:17:36Z","title":"Implementation of Polynomial NP-Complete Algorithms Based on the NP Verifier Simulation Framework","version":4},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T01:00:31.898336Z"},"links":{"citing_paper":"/paper/2602.10991"},"observation_digest":"sha256:9afb249afaaffdd86811d440ca3f3fe470c89539e74ec98e07d8a639e4668e31","observation_id":"30b380a8-22bd-4f91-8d0d-c726c4a47115","resolution":{"observed_at":"2026-08-03T01:00:31.898336Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T01:00:31.986500Z","title":null,"venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2602.10991","last_updated":"2026-07-12T07:09:16Z","snapshot_observed_at":"2026-08-03T01:42:18.222581Z","submitted_at":"2026-02-11T16:17:36Z","title":"Implementation of Polynomial NP-Complete Algorithms Based on the NP Verifier Simulation Framework","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T01:00:31.986500Z"},"links":{"citing_paper":"/paper/2602.10991"},"observation_digest":"sha256:a372c97e4c4f78a33b7911c80f5eca8faaee068063fa8acc05c5f442e4e12290","observation_id":"e6ad1e96-d977-4843-a6dc-a0a6a3b24c97","resolution":{"observed_at":"2026-08-03T01:00:31.986500Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.13166","last_updated":"2026-07-10T11:24:16Z","snapshot_observed_at":"2026-08-07T09:59:01.681258Z","submitted_at":"2025-08-02T09:04:47Z","title":"Graph-Based Deterministic Polynomial Framwork for NP Problems","version":8},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.13166","snapshot_observed_at":"2026-08-03T01:00:32.076669Z","title":"Graph-based deterministic polynomial algorithm for np problems.arXiv preprint arXiv:2508.13166, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.10991","last_updated":"2026-07-12T07:09:16Z","snapshot_observed_at":"2026-08-03T01:42:18.222581Z","submitted_at":"2026-02-11T16:17:36Z","title":"Implementation of Polynomial NP-Complete Algorithms Based on the NP Verifier Simulation Framework","version":4},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T01:00:32.076669Z"},"links":{"cited_paper":"/paper/2508.13166","citing_paper":"/paper/2602.10991"},"observation_digest":"sha256:846a952221afbd39b9ff0b7789ec4acf83e1b0a17269535b190d6945409641f2","observation_id":"8357beba-ba1f-4cd3-b7ca-42d346929179","resolution":{"observed_at":"2026-08-03T01:00:32.076669Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T01:00:32.191754Z","title":"On computable numbers, with an application to the entscheidungsproblem.J","venue":null,"work_id":null,"year":1936},"citing_paper":{"arxiv_id":"2602.10991","last_updated":"2026-07-12T07:09:16Z","snapshot_observed_at":"2026-08-03T01:42:18.222581Z","submitted_at":"2026-02-11T16:17:36Z","title":"Implementation of Polynomial NP-Complete Algorithms Based on the NP Verifier Simulation Framework","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T01:00:32.191754Z"},"links":{"citing_paper":"/paper/2602.10991"},"observation_digest":"sha256:def4127a14ef065ba54b1122a2a9bda24ed7c5a96afcf835ae55d25b9818e077","observation_id":"f8067717-17fb-45f0-b402-b3e45b09f5c0","resolution":{"observed_at":"2026-08-03T01:00:32.191754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.10991","last_updated":"2026-07-12T07:09:16Z","latest_version":4,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-03T01:42:18.222581Z","submitted_at":"2026-02-11T16:17:36Z","title":"Implementation of Polynomial NP-Complete Algorithms Based on the NP Verifier Simulation Framework"},"reference_resolution":{"displayed":5,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":5},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"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."}