{"as_of":"2026-08-23T16:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3ac77582359b305d1757cd3d227d81eb3d106bde0a8d10d5c310a5f636f9c961","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-23T06:30:58.430688+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-13T12:08:07.334880Z","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:e3dd5b3a1ef6d9eee2fd1f701f01fe31291f0894564f70d3cec27f19aa5c574d","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-13T12:08:07.334880Z","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:fad774d8339693a7befe5a03929e7b07b358ecf4af1b82518f06806298541a22","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-13T12:08:07.334880Z","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:ae2f6fd037bc6d965f2642db81bdee78a5dc639c3ba9bca284ed85ad40de2d28","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-13T12:08:07.334880Z","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:eca1f2c592e126d1308c2298d6bac574f0a4a8619de6ddc79774b7aab1839885","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-13T12:08:07.334880Z","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:4916ebc7e53145519fdfb22c211cc03fd5620b4a7bc82f5351fcecb38df0dfe3","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-13T12:08:07.334880Z","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:e49f9b1fe7a4e199381a7d19c841c5ac23a4a701bd30dbaf3a9ccaf3a730bd7b","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-13T12:08:07.334880Z","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:1c75b5627d12b5254781ac701eaf643d13fb24f1c2f3ef5c0e9344fb9d49da81","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-13T12:08:07.334880Z","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:442350387d4ecc917aa9aae8b8cf585ee69140a7f8bf4c0cfe111f810f745296","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-13T12:08:07.334880Z","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:d23b7699fe3ab41ff73c5eaa7c2e4e194b7fd5d85d45d3492762a880f47ca4cc","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-13T12:08:07.334880Z","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:e125f3cc567ab1f9a2f3fbcaf6cba5941040de47386c0e6f4a0c968a5ddc203a","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-13T12:08:07.334880Z","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:ee0d60e274169a5e3e0e9e4e9f17fba6a01805a6adb56ebe89421c7019f4d3b3","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-13T12:08:07.334880Z","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:91afdf144a9a7b60390d7afaff52ed1eb7802a34f9ddf8ebc2b40dde1e5b51d9","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-13T12:08:07.334880Z","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:7cef57dd1ee970ddf2f0d86ba523b462a976d3713a2409f11dab9f449d486928","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-13T12:08:07.334880Z","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:aa6b98db3d650326e5fdd3675ba770731a8e1fb1572fef944dda5842c8b5a2c0","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-13T12:08:07.334880Z","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:ba24eb724790ff53b1e182b27a24c9425e6a9eb9761f1fa6c1d998b1b774d7db","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-13T12:08:07.334880Z","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:c997d43518816551de51c815247372210902e8a0946b79becc4971563d7f1e03","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-13T12:08:07.334880Z","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:780df4f8a896de4f3d0f6c61adcbcadb8d5542bc99c0461732e7389c4f8ce05d","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-13T12:08:07.334880Z","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:2a3af271ba5a161bc3b9de207f8bbe90fbe06330533aa22440047a4822ef14f4","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-13T12:08:07.334880Z","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:a7708e50236c87b2a0ee14fb4647bbc979beab4a72c35434a182716c7b52cc99","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-13T12:08:07.334880Z","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:7d2039635d16b5e7e0be91e3f0fd74e7db0b6954cc271e92cf20704f88d3b20e","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-13T12:08:07.334880Z","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:60d09db782c8c6fc95a56e18d4b076a465f73865f09fd2f5c8c7b8ec70fa9a59","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-13T12:08:07.334880Z","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:ff0d9790ec7e6706d8d031c9fe28d3b44eb86b518d432c0716f27f20458bdb82","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-13T12:08:07.334880Z","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:e69822613dd9f31f8bf3a8ca0a000da1d373be858f5c814b113e3d81118c62ae","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-13T12:08:07.334880Z","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:e0b6775cef5b61322745c7b5507e3fbbb87ada25470d9da30cab80b4b7fee271","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-13T12:08:07.334880Z","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:b035d53c33ec3c190f3e6ce6805f81d58eb2abf91b585bf2a01fdf8c7fe635df","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-13T12:08:07.334880Z","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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2607.07723."}