{"as_of":"2026-08-12T08:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:eebe6acc80d0a1ce33bb0f8b1afaaeb8d7f9ac2e23e19d7d5bf49d78d02c43c0","coverage":[{"denominator":11,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":11,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T05:53:59.117073Z","state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T01:00:32.076669Z","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":[{"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"}}],"links":{"evidence":"/evidence","html":"/paper/2508.13166/citation-record","integrity":"/paper/2508.13166/integrity","json":"/paper/2508.13166/citation-record.json","paper":"/paper/2508.13166"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:53:59.300288Z","title":"Aaronson and A","venue":null,"work_id":"890f4be3-0903-4b2a-834a-f272bcd172a9","year":2008},"citing_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},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T05:53:59.072107Z"},"links":{"citing_paper":"/paper/2508.13166"},"observation_digest":"sha256:ab7127a36f76ff45e98cd0ff3ec7eb76a0627347d1484884c178640988dbd4bb","observation_id":"0f6d8e4d-0f4f-4106-a2e3-388868a3f07b","resolution":{"observed_at":"2026-08-06T05:53:59.304486Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:53:59.285939Z","title":"Baker, J","venue":null,"work_id":"dabc92b5-e2ac-4393-be7a-abc20772ff9f","year":1975},"citing_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},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T05:53:59.077222Z"},"links":{"citing_paper":"/paper/2508.13166"},"observation_digest":"sha256:f02128e3f323fe4307514468f4c719659a3870159ea505222a9c571e15596e3d","observation_id":"70ca4a4c-7dd1-443f-9176-722ff8669bec","resolution":{"observed_at":"2026-08-06T05:53:59.290220Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:53:59.271644Z","title":null,"venue":null,"work_id":"e4f0380d-5cf5-4fee-ba5f-7abf49d435e8","year":1971},"citing_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},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T05:53:59.081623Z"},"links":{"citing_paper":"/paper/2508.13166"},"observation_digest":"sha256:9ea1b8ebb8bec7c547ebd605d305572446109935965ec7f464838981e0b02681","observation_id":"8b863865-cb5e-4454-a0e0-b86563ed0c08","resolution":{"observed_at":"2026-08-06T05:53:59.275964Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:53:59.257590Z","title":"Time-bounded random access machines","venue":null,"work_id":"96d2b4bb-17b5-4b96-b38a-d3b20871b80b","year":1972},"citing_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},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T05:53:59.086069Z"},"links":{"citing_paper":"/paper/2508.13166"},"observation_digest":"sha256:807eba84da2f46a68c725a74e935c75b6a0d06c3e62ad62e5636fd01e90e96ef","observation_id":"cb689588-a643-422b-9a3f-73f07622bec8","resolution":{"observed_at":"2026-08-06T05:53:59.261879Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:53:59.243244Z","title":"Graduate texts in mathematics: Graph theory","venue":null,"work_id":"156817e4-f310-42e4-9da9-238809d955cc","year":2005},"citing_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},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T05:53:59.090213Z"},"links":{"citing_paper":"/paper/2508.13166"},"observation_digest":"sha256:4685f56e9c7f4bb09ff727ad40a1d0d59f94be3fb8fb0dd71aa8a7f02fc61fdc","observation_id":"a4654747-447d-4788-a4c8-9407168a7117","resolution":{"observed_at":"2026-08-06T05:53:59.247707Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:53:59.226701Z","title":"Jones and Bartlett Publishers, Inc., 1996","venue":null,"work_id":"1c7e4929-65d5-406b-841a-dbd423f3c8e6","year":1996},"citing_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},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T05:53:59.094505Z"},"links":{"citing_paper":"/paper/2508.13166"},"observation_digest":"sha256:a55e9af98a138142fea703af648a9f9ac4a6157c5ae6c84a7fca99ac265ec177","observation_id":"15535784-3840-4219-ba22-a763aa806ea5","resolution":{"observed_at":"2026-08-06T05:53:59.231827Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:53:59.211331Z","title":"Introduction to automata theory, languages, and computation","venue":null,"work_id":"cb27ccfd-2f8f-49d9-a1c2-cc929ed84e9b","year":2001},"citing_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},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T05:53:59.100861Z"},"links":{"citing_paper":"/paper/2508.13166"},"observation_digest":"sha256:d8ac79e436e2cbb197a027e7718ded7c2ec03fcf233bd57eabb76b4be9aa88dc","observation_id":"b75d4fd9-ad56-4a78-b30e-88e74d7e3266","resolution":{"observed_at":"2026-08-06T05:53:59.215719Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:53:59.196465Z","title":null,"venue":null,"work_id":"838e6d90-23b2-4760-94fd-0c8c9ee95416","year":1972},"citing_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},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T05:53:59.104883Z"},"links":{"citing_paper":"/paper/2508.13166"},"observation_digest":"sha256:3001b262a0a41c914b59c3a8654e3142573ea9d4307add1c20711dda13ee2964","observation_id":"5b8b0a61-7095-4dfa-8c8d-38864d81a57c","resolution":{"observed_at":"2026-08-06T05:53:59.200918Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:53:59.181321Z","title":"Pearson, Upper Saddle River, NJ, June 2005","venue":null,"work_id":"e8a52f4a-d3d8-4d82-9dfa-da6703b1a639","year":2005},"citing_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},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T05:53:59.108977Z"},"links":{"citing_paper":"/paper/2508.13166"},"observation_digest":"sha256:e285eddd7960cbce74a8bc472c875e8af785dfdc52c14610e4ab2fd64a62a0d7","observation_id":"fad5a94d-f245-40ec-acf1-8f9f0b86dd73","resolution":{"observed_at":"2026-08-06T05:53:59.185811Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:53:59.166507Z","title":"Razborov and S","venue":null,"work_id":"29061603-062e-4c17-b0b5-64dd6db08e81","year":1993},"citing_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},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T05:53:59.112963Z"},"links":{"citing_paper":"/paper/2508.13166"},"observation_digest":"sha256:8c8a51103b79e422e938aaa5ebaed698df5b0dbcfa920d57ad06222796477b77","observation_id":"f2bbee17-b682-44d8-8552-e206ecbb947d","resolution":{"observed_at":"2026-08-06T05:53:59.170989Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:53:59.148488Z","title":"Introduction to graph theory.Tata McGraw-Hill, pages 2–10, 2005","venue":null,"work_id":"6e5f9455-219e-4179-9333-d70e8be6bf69","year":2005},"citing_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},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T05:53:59.117073Z"},"links":{"citing_paper":"/paper/2508.13166"},"observation_digest":"sha256:c1a467c56a2f98aa7d2c9e6cb5d604b61a1c04ace56cc93a4ea9cae2d7a655f0","observation_id":"6b724fa3-6d2f-4f08-9c54-6fdf59d8fa1a","resolution":{"observed_at":"2026-08-06T05:53:59.155037Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.13166","last_updated":"2026-07-10T11:24:16Z","latest_version":8,"primary_category":"cs.CC","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"},"reference_resolution":{"displayed":11,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":9},"total_outbound_references":11},"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 11 of 11 outbound references and 1 inbound Pith citation observation for arXiv:2508.13166."}