{"as_of":"2026-08-12T13:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:68c7eb1775c71ec142bccca755bd54e037447eb34710da2084d05d0678295ff9","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-11T22:36:35.074344Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"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/2607.07723/citation-record","integrity":"/paper/2607.07723/integrity","json":"/paper/2607.07723/citation-record.json","paper":"/paper/2607.07723"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:36:35.074344Z","title":"Algebrization: A new barrier in com- plexity theory.ACM Transactions on Computation Theory, 1(1):2:1–2:54, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.07723","last_updated":"2026-07-04T18:17:36Z","snapshot_observed_at":"2026-08-01T18:34:19.136482Z","submitted_at":"2026-07-04T18:17:36Z","title":"Limits of Uniform Certification in the Standard Turing Model -- Semantic Invariants and Admissible Methods","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-11T22:36:35.074344Z"},"links":{"citing_paper":"/paper/2607.07723"},"observation_digest":"sha256:5e4a19d5db46f316ce8bd7beaaaa39c29d843540c57ae762a519c4184a9b7948","observation_id":"0909728a-8159-4265-8fd3-4f5f3f39fb89","resolution":{"observed_at":"2026-07-11T22:36:35.074344Z","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-07-11T22:36:35.074344Z","title":"Cambridge University Press, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.07723","last_updated":"2026-07-04T18:17:36Z","snapshot_observed_at":"2026-08-01T18:34:19.136482Z","submitted_at":"2026-07-04T18:17:36Z","title":"Limits of Uniform Certification in the Standard Turing Model -- Semantic Invariants and Admissible Methods","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-11T22:36:35.074344Z"},"links":{"citing_paper":"/paper/2607.07723"},"observation_digest":"sha256:22c91b40c28196a3d49aaf13982b3f027f3b4aee1ff84c371fa355f561992f8d","observation_id":"5525dc70-819c-42fa-a360-6b8533a49f5d","resolution":{"observed_at":"2026-07-11T22:36:35.074344Z","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-07-11T22:36:35.074344Z","title":"Relativizations of the p = ? np question.SIAM Journal on Computing, 4(4):431–442, 1975","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2607.07723","last_updated":"2026-07-04T18:17:36Z","snapshot_observed_at":"2026-08-01T18:34:19.136482Z","submitted_at":"2026-07-04T18:17:36Z","title":"Limits of Uniform Certification in the Standard Turing Model -- Semantic Invariants and Admissible Methods","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-11T22:36:35.074344Z"},"links":{"citing_paper":"/paper/2607.07723"},"observation_digest":"sha256:d71ed0d5cd69f627418dc3f81a230b4092da83e5c4ced70d2572de34858ed568","observation_id":"2d963cc4-064c-4ede-8d5f-0f4180c9e2db","resolution":{"observed_at":"2026-07-11T22:36:35.074344Z","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-07-11T22:36:35.074344Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.07723","last_updated":"2026-07-04T18:17:36Z","snapshot_observed_at":"2026-08-01T18:34:19.136482Z","submitted_at":"2026-07-04T18:17:36Z","title":"Limits of Uniform Certification in the Standard Turing Model -- Semantic Invariants and Admissible Methods","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-11T22:36:35.074344Z"},"links":{"citing_paper":"/paper/2607.07723"},"observation_digest":"sha256:5e66ee99c1ced615b6c9c90d873a37ab89c174955749a4c0ed5da13bd6a66f7a","observation_id":"9c8401fe-f624-49fe-b7f1-4b2870cb4ae6","resolution":{"observed_at":"2026-07-11T22:36:35.074344Z","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-07-11T22:36:35.074344Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.07723","last_updated":"2026-07-04T18:17:36Z","snapshot_observed_at":"2026-08-01T18:34:19.136482Z","submitted_at":"2026-07-04T18:17:36Z","title":"Limits of Uniform Certification in the Standard Turing Model -- Semantic Invariants and Admissible Methods","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-11T22:36:35.074344Z"},"links":{"citing_paper":"/paper/2607.07723"},"observation_digest":"sha256:53e9e43aa980174af642ec9dcf6c35d4d1d8935708ff5b0f4290224f11f246bd","observation_id":"4803f53e-cb85-4eef-93d2-71520d0d1f3a","resolution":{"observed_at":"2026-07-11T22:36:35.074344Z","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-07-11T22:36:35.074344Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.07723","last_updated":"2026-07-04T18:17:36Z","snapshot_observed_at":"2026-08-01T18:34:19.136482Z","submitted_at":"2026-07-04T18:17:36Z","title":"Limits of Uniform Certification in the Standard Turing Model -- Semantic Invariants and Admissible Methods","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-11T22:36:35.074344Z"},"links":{"citing_paper":"/paper/2607.07723"},"observation_digest":"sha256:9e3b11515e1baae781ce9a3667145a1573fd67af48dedf33c97df12972d95c1a","observation_id":"a7d1d299-b0b2-46a4-8334-52ae3b0519ae","resolution":{"observed_at":"2026-07-11T22:36:35.074344Z","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-07-11T22:36:35.074344Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.07723","last_updated":"2026-07-04T18:17:36Z","snapshot_observed_at":"2026-08-01T18:34:19.136482Z","submitted_at":"2026-07-04T18:17:36Z","title":"Limits of Uniform Certification in the Standard Turing Model -- Semantic Invariants and Admissible Methods","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-11T22:36:35.074344Z"},"links":{"citing_paper":"/paper/2607.07723"},"observation_digest":"sha256:693767038da9cc495ccffba151e4644c3ef529e1e933c6f70cb7341792152ff5","observation_id":"7450ce1b-300b-4943-9b29-a66fa112c21c","resolution":{"observed_at":"2026-07-11T22:36:35.074344Z","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-07-11T22:36:35.074344Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.07723","last_updated":"2026-07-04T18:17:36Z","snapshot_observed_at":"2026-08-01T18:34:19.136482Z","submitted_at":"2026-07-04T18:17:36Z","title":"Limits of Uniform Certification in the Standard Turing Model -- Semantic Invariants and Admissible Methods","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-11T22:36:35.074344Z"},"links":{"citing_paper":"/paper/2607.07723"},"observation_digest":"sha256:487da9472b403dc605b32e24f949f6ec957483f5d994be021ebdedb543bda2ab","observation_id":"222c1990-fcad-4eca-90c2-0663793d8b3b","resolution":{"observed_at":"2026-07-11T22:36:35.074344Z","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-07-11T22:36:35.074344Z","title":null,"venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2607.07723","last_updated":"2026-07-04T18:17:36Z","snapshot_observed_at":"2026-08-01T18:34:19.136482Z","submitted_at":"2026-07-04T18:17:36Z","title":"Limits of Uniform Certification in the Standard Turing Model -- Semantic Invariants and Admissible Methods","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-11T22:36:35.074344Z"},"links":{"citing_paper":"/paper/2607.07723"},"observation_digest":"sha256:06b9da4bbb0918057699b5a82feb7306e66cbac6eee2d6b6f30021cf1d9930e4","observation_id":"da948800-0ef1-4c3f-b434-55ccdc6b86de","resolution":{"observed_at":"2026-07-11T22:36:35.074344Z","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-07-11T22:36:35.074344Z","title":"The status of the p versus np problem.Communications of the ACM, 52(9):78–86, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.07723","last_updated":"2026-07-04T18:17:36Z","snapshot_observed_at":"2026-08-01T18:34:19.136482Z","submitted_at":"2026-07-04T18:17:36Z","title":"Limits of Uniform Certification in the Standard Turing Model -- Semantic Invariants and Admissible Methods","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-11T22:36:35.074344Z"},"links":{"citing_paper":"/paper/2607.07723"},"observation_digest":"sha256:1fb26c8e0fa3c7a8341d1eec5ceb040c3edcae3c7380f6201a9a8e4402c7b2af","observation_id":"7f323529-d9f3-4648-ab13-a81286c67c08","resolution":{"observed_at":"2026-07-11T22:36:35.074344Z","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-07-11T22:36:35.074344Z","title":"Cambridge University Press, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.07723","last_updated":"2026-07-04T18:17:36Z","snapshot_observed_at":"2026-08-01T18:34:19.136482Z","submitted_at":"2026-07-04T18:17:36Z","title":"Limits of Uniform Certification in the Standard Turing Model -- Semantic Invariants and Admissible Methods","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-11T22:36:35.074344Z"},"links":{"citing_paper":"/paper/2607.07723"},"observation_digest":"sha256:2b9663a17c0be862fc38226343cc8a5bd9eb321138890f842e7dbf47f9c7b795","observation_id":"faff940e-d94f-43c8-80cb-06add80fe2c9","resolution":{"observed_at":"2026-07-11T22:36:35.074344Z","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-07-11T22:36:35.074344Z","title":"Hopcroft, Rajeev Motwani, and Jeffrey D","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.07723","last_updated":"2026-07-04T18:17:36Z","snapshot_observed_at":"2026-08-01T18:34:19.136482Z","submitted_at":"2026-07-04T18:17:36Z","title":"Limits of Uniform Certification in the Standard Turing Model -- Semantic Invariants and Admissible Methods","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-11T22:36:35.074344Z"},"links":{"citing_paper":"/paper/2607.07723"},"observation_digest":"sha256:13a8b2d1f489a8415a574d261837779090c39dcf5491356d48007d83f76619f7","observation_id":"dfa88d1b-1a58-4574-a423-c2eabe32151d","resolution":{"observed_at":"2026-07-11T22:36:35.074344Z","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-07-11T22:36:35.074344Z","title":"A personal view of average-case complexity","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.07723","last_updated":"2026-07-04T18:17:36Z","snapshot_observed_at":"2026-08-01T18:34:19.136482Z","submitted_at":"2026-07-04T18:17:36Z","title":"Limits of Uniform Certification in the Standard Turing Model -- Semantic Invariants and Admissible Methods","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-11T22:36:35.074344Z"},"links":{"citing_paper":"/paper/2607.07723"},"observation_digest":"sha256:dfb894b0dba9ad034bbee71fef9eecc190942bee25c0f19d65789a672074fe59","observation_id":"434bc4af-bf35-45b6-a1d1-a39971a3df7c","resolution":{"observed_at":"2026-07-11T22:36:35.074344Z","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-07-11T22:36:35.074344Z","title":null,"venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2607.07723","last_updated":"2026-07-04T18:17:36Z","snapshot_observed_at":"2026-08-01T18:34:19.136482Z","submitted_at":"2026-07-04T18:17:36Z","title":"Limits of Uniform Certification in the Standard Turing Model -- Semantic Invariants and Admissible Methods","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-11T22:36:35.074344Z"},"links":{"citing_paper":"/paper/2607.07723"},"observation_digest":"sha256:aadfb3e0c1910587277aeae15f7d10428d9d51ed45d0ba52a04cd378acf67399","observation_id":"f9e4aacb-7dd7-41fd-bfdd-fd1954743f35","resolution":{"observed_at":"2026-07-11T22:36:35.074344Z","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-07-11T22:36:35.074344Z","title":"Papadimitriou.Computational Complexity","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2607.07723","last_updated":"2026-07-04T18:17:36Z","snapshot_observed_at":"2026-08-01T18:34:19.136482Z","submitted_at":"2026-07-04T18:17:36Z","title":"Limits of Uniform Certification in the Standard Turing Model -- Semantic Invariants and Admissible Methods","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-11T22:36:35.074344Z"},"links":{"citing_paper":"/paper/2607.07723"},"observation_digest":"sha256:3ed5b3d29f1197a0c0315ae07856e617f6297cda4005b8703e5a08ccd8e2db72","observation_id":"a07dc8dd-e10a-4c29-9784-38f79dc5afcc","resolution":{"observed_at":"2026-07-11T22:36:35.074344Z","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-07-11T22:36:35.074344Z","title":"Razborov and Steven Rudich","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.07723","last_updated":"2026-07-04T18:17:36Z","snapshot_observed_at":"2026-08-01T18:34:19.136482Z","submitted_at":"2026-07-04T18:17:36Z","title":"Limits of Uniform Certification in the Standard Turing Model -- Semantic Invariants and Admissible Methods","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-11T22:36:35.074344Z"},"links":{"citing_paper":"/paper/2607.07723"},"observation_digest":"sha256:0e7d7da1a5ace72c9ebe4b02acaf622e32c3eef098da7b15ad153ff66462e11e","observation_id":"3c01137a-909c-476b-bf3b-20149af59421","resolution":{"observed_at":"2026-07-11T22:36:35.074344Z","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-07-11T22:36:35.074344Z","title":null,"venue":null,"work_id":null,"year":1953},"citing_paper":{"arxiv_id":"2607.07723","last_updated":"2026-07-04T18:17:36Z","snapshot_observed_at":"2026-08-01T18:34:19.136482Z","submitted_at":"2026-07-04T18:17:36Z","title":"Limits of Uniform Certification in the Standard Turing Model -- Semantic Invariants and Admissible Methods","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-11T22:36:35.074344Z"},"links":{"citing_paper":"/paper/2607.07723"},"observation_digest":"sha256:55f98b8360782c8f3237559df6dbbc380d05a1a1dcc6aed337bcffc8f8dc5734","observation_id":"6f16402e-988d-4d2f-85a5-1616493e6725","resolution":{"observed_at":"2026-07-11T22:36:35.074344Z","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-07-11T22:36:35.074344Z","title":"MIT Press, 1987","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2607.07723","last_updated":"2026-07-04T18:17:36Z","snapshot_observed_at":"2026-08-01T18:34:19.136482Z","submitted_at":"2026-07-04T18:17:36Z","title":"Limits of Uniform Certification in the Standard Turing Model -- Semantic Invariants and Admissible Methods","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-11T22:36:35.074344Z"},"links":{"citing_paper":"/paper/2607.07723"},"observation_digest":"sha256:e0a95bb0e280dc950062a70f23cd07b70964ba32cb4ee74c599561b430245c36","observation_id":"6fb6411e-a141-4479-93ba-38ee5e65338b","resolution":{"observed_at":"2026-07-11T22:36:35.074344Z","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-07-11T22:36:35.074344Z","title":"Cengage Learn- ing, 3rd edition, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.07723","last_updated":"2026-07-04T18:17:36Z","snapshot_observed_at":"2026-08-01T18:34:19.136482Z","submitted_at":"2026-07-04T18:17:36Z","title":"Limits of Uniform Certification in the Standard Turing Model -- Semantic Invariants and Admissible Methods","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-11T22:36:35.074344Z"},"links":{"citing_paper":"/paper/2607.07723"},"observation_digest":"sha256:cc1d2a02058a8ab35f8cc6fb5f1004a3e10bd45f024b9a118de45af766d83b00","observation_id":"c5c63f09-4b70-481d-b520-9c8cbff8db99","resolution":{"observed_at":"2026-07-11T22:36:35.074344Z","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-07-11T22:36:35.074344Z","title":"Rice applies to arbitrary programs given as input, but a proof about a single fixed programx 0 does not analyse arbitrary programs","venue":null,"work_id":null,"year":1936},"citing_paper":{"arxiv_id":"2607.07723","last_updated":"2026-07-04T18:17:36Z","snapshot_observed_at":"2026-08-01T18:34:19.136482Z","submitted_at":"2026-07-04T18:17:36Z","title":"Limits of Uniform Certification in the Standard Turing Model -- Semantic Invariants and Admissible Methods","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-11T22:36:35.074344Z"},"links":{"citing_paper":"/paper/2607.07723"},"observation_digest":"sha256:915f0be7b16d467915bd5dd9d413e2280a432eb852ae68008e6bf5ac127fb90c","observation_id":"147aabc3-ec9b-461d-8985-000eb3050d17","resolution":{"observed_at":"2026-07-11T22:36:35.074344Z","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-07-11T22:36:35.074344Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.07723","last_updated":"2026-07-04T18:17:36Z","snapshot_observed_at":"2026-08-01T18:34:19.136482Z","submitted_at":"2026-07-04T18:17:36Z","title":"Limits of Uniform Certification in the Standard Turing Model -- Semantic Invariants and Admissible Methods","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-11T22:36:35.074344Z"},"links":{"citing_paper":"/paper/2607.07723"},"observation_digest":"sha256:7ad58e25165eda0eb2c6c23181ae3c8cf30ae60b3c98dca8df760613ea50dec8","observation_id":"1da3fe66-7615-4a29-8037-78beafb37405","resolution":{"observed_at":"2026-07-11T22:36:35.074344Z","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-07-11T22:36:35.074344Z","title":"The barrier identifies the same structural condition as for relativisa- tion, applied to a richer class of non-simulable resources","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.07723","last_updated":"2026-07-04T18:17:36Z","snapshot_observed_at":"2026-08-01T18:34:19.136482Z","submitted_at":"2026-07-04T18:17:36Z","title":"Limits of Uniform Certification in the Standard Turing Model -- Semantic Invariants and Admissible Methods","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-11T22:36:35.074344Z"},"links":{"citing_paper":"/paper/2607.07723"},"observation_digest":"sha256:19ef710175ad3ff0008d00d8e18185b06e4dc697e8a3457b6f3afd3af1aca31f","observation_id":"7fec17ba-e281-46c9-bb5e-529987c3eba5","resolution":{"observed_at":"2026-07-11T22:36:35.074344Z","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-07-11T22:36:35.074344Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.07723","last_updated":"2026-07-04T18:17:36Z","snapshot_observed_at":"2026-08-01T18:34:19.136482Z","submitted_at":"2026-07-04T18:17:36Z","title":"Limits of Uniform Certification in the Standard Turing Model -- Semantic Invariants and Admissible Methods","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-11T22:36:35.074344Z"},"links":{"citing_paper":"/paper/2607.07723"},"observation_digest":"sha256:bf0177efbca2463b9af62fd6327520f5626874f1c2d02988d9a8550829e90457","observation_id":"36e5d53c-465e-44f6-85f4-17f351aa0a23","resolution":{"observed_at":"2026-07-11T22:36:35.074344Z","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-07-11T22:36:35.074344Z","title":"The barrier identifies this directly","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.07723","last_updated":"2026-07-04T18:17:36Z","snapshot_observed_at":"2026-08-01T18:34:19.136482Z","submitted_at":"2026-07-04T18:17:36Z","title":"Limits of Uniform Certification in the Standard Turing Model -- Semantic Invariants and Admissible Methods","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-11T22:36:35.074344Z"},"links":{"citing_paper":"/paper/2607.07723"},"observation_digest":"sha256:5e958797e155b274f970ed570a012c7ffb7cd438dcb6094de12fd69e22c174bc","observation_id":"693777ee-9203-413f-8d32-2018168eb885","resolution":{"observed_at":"2026-07-11T22:36:35.074344Z","resolver_source":null,"status":"malformed_identifier"},"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-07-11T22:36:35.074344Z","title":"A 31 perfect observer would need to refine each indistinguishability class into indi- vidually discriminable behaviours","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.07723","last_updated":"2026-07-04T18:17:36Z","snapshot_observed_at":"2026-08-01T18:34:19.136482Z","submitted_at":"2026-07-04T18:17:36Z","title":"Limits of Uniform Certification in the Standard Turing Model -- Semantic Invariants and Admissible Methods","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-11T22:36:35.074344Z"},"links":{"citing_paper":"/paper/2607.07723"},"observation_digest":"sha256:9313bc1775cb458643f8ab69a20d38387521eaee92c8106a3965b965eeda9610","observation_id":"993a2e35-6d03-4c57-b057-cd63b7712cb5","resolution":{"observed_at":"2026-07-11T22:36:35.074344Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.07723","last_updated":"2026-07-04T18:17:36Z","latest_version":1,"primary_category":"cs.LO","snapshot_observed_at":"2026-08-01T18:34:19.136482Z","submitted_at":"2026-07-04T18:17:36Z","title":"Limits of Uniform Certification in the Standard Turing Model -- Semantic Invariants and Admissible Methods"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":24,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":25},"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 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2607.07723."}