{"as_of":"2026-08-16T16:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:394720acaac2280dc873be47a78bf70b73e3dc0c74399249d0944571eda869f4","coverage":[{"denominator":16,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:37:44.848536Z","state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1908.04923/citation-record","integrity":"/paper/1908.04923/integrity","json":"/paper/1908.04923/citation-record.json","paper":"/paper/1908.04923"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:37:44.807367Z","title":"Cook (1992): A New Recursion-Theoretic Characterization of the Polytime Functions","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"1908.04923","last_updated":"2019-08-14T01:58:18Z","snapshot_observed_at":"2026-08-16T02:24:51.186240Z","submitted_at":"2019-08-14T01:58:18Z","title":"Type-two Iteration with Bounded Query Revision","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T13:37:44.807367Z"},"links":{"citing_paper":"/paper/1908.04923"},"observation_digest":"sha256:0b58a5940ee4afc6214158c5454ca351a10af1c5934fc3286d494c3c360aabe4","observation_id":"a422dc76-74c2-453d-b600-6473648700ba","resolution":{"observed_at":"2026-08-14T13:37:44.807367Z","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":"1994.1047","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:37:45.241663Z","title":"Cartwright, P .L","venue":null,"work_id":"e80adb1e-1fe3-4857-9fb9-17923fca46d9","year":1994},"citing_paper":{"arxiv_id":"1908.04923","last_updated":"2019-08-14T01:58:18Z","snapshot_observed_at":"2026-08-16T02:24:51.186240Z","submitted_at":"2019-08-14T01:58:18Z","title":"Type-two Iteration with Bounded Query Revision","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T13:37:44.810538Z"},"links":{"citing_paper":"/paper/1908.04923"},"observation_digest":"sha256:3a4e2fc773e317211022c99c8c6a3530de9a223706a7306f3ef8ba7abc1fab88","observation_id":"38bae729-36ff-43a6-8a23-d20f7b816643","resolution":{"observed_at":"2026-08-14T13:37:45.246293Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:37:45.261359Z","title":"Cobham (1965): The intrinsic computational difficulty of functions","venue":null,"work_id":"a0b39d61-3328-44b2-affb-c2e0d0ee7eca","year":1965},"citing_paper":{"arxiv_id":"1908.04923","last_updated":"2019-08-14T01:58:18Z","snapshot_observed_at":"2026-08-16T02:24:51.186240Z","submitted_at":"2019-08-14T01:58:18Z","title":"Type-two Iteration with Bounded Query Revision","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T13:37:44.813877Z"},"links":{"citing_paper":"/paper/1908.04923"},"observation_digest":"sha256:5559c944e5523fa23100649478b5db0c6c37022f81c6a727d437832d87356083","observation_id":"fc2b8139-a955-444f-9d31-38a07ec36f68","resolution":{"observed_at":"2026-08-14T13:37:45.264347Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-1-4612-2822-6","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:37:44.922958Z","title":"Cook (1992): Computability and complexity of higher type functions","venue":null,"work_id":"992a0746-76f3-4a04-ac2f-d2c264d9e2da","year":1992},"citing_paper":{"arxiv_id":"1908.04923","last_updated":"2019-08-14T01:58:18Z","snapshot_observed_at":"2026-08-16T02:24:51.186240Z","submitted_at":"2019-08-14T01:58:18Z","title":"Type-two Iteration with Bounded Query Revision","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T13:37:44.816688Z"},"links":{"citing_paper":"/paper/1908.04923"},"observation_digest":"sha256:c9e0814e98faefca5c5a15fbd054c0da6b909d0d8e8d57a9c8635ba954cb289c","observation_id":"7947c697-302e-4fea-82ab-e4cfc049de04","resolution":{"observed_at":"2026-08-14T13:37:44.925533Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-1-4612-3466-1","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:37:44.915647Z","title":"Cook & B.M","venue":null,"work_id":"9c8153ae-0877-4982-a7d2-85fd060e93a4","year":1990},"citing_paper":{"arxiv_id":"1908.04923","last_updated":"2019-08-14T01:58:18Z","snapshot_observed_at":"2026-08-16T02:24:51.186240Z","submitted_at":"2019-08-14T01:58:18Z","title":"Type-two Iteration with Bounded Query Revision","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T13:37:44.819598Z"},"links":{"citing_paper":"/paper/1908.04923"},"observation_digest":"sha256:945d0ef4be4ebe4756b20bfce98949018378af98d7fc4cd7be9869b220ce8bfb","observation_id":"ed46df4f-0df8-4e2a-ae2c-edb108eba1d7","resolution":{"observed_at":"2026-08-14T13:37:44.918450Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0168-0072(93)90044-e","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:37:44.907523Z","title":"Cook & A","venue":null,"work_id":"53e1235d-fb64-4644-a580-af2a3ea6e960","year":1993},"citing_paper":{"arxiv_id":"1908.04923","last_updated":"2019-08-14T01:58:18Z","snapshot_observed_at":"2026-08-16T02:24:51.186240Z","submitted_at":"2019-08-14T01:58:18Z","title":"Type-two Iteration with Bounded Query Revision","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T13:37:44.822353Z"},"links":{"citing_paper":"/paper/1908.04923"},"observation_digest":"sha256:38be21b29c9067046007b4ba6df48d23a700e0e65a44e7f1e85b778c512879f4","observation_id":"0e68a128-53bc-47a4-8017-a04a213d5dd0","resolution":{"observed_at":"2026-08-14T13:37:44.910625Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0890-5401(03)00009-9","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:37:44.899441Z","title":null,"venue":null,"work_id":"c1e58e92-9ee1-4d08-b121-22517c463033","year":2003},"citing_paper":{"arxiv_id":"1908.04923","last_updated":"2019-08-14T01:58:18Z","snapshot_observed_at":"2026-08-16T02:24:51.186240Z","submitted_at":"2019-08-14T01:58:18Z","title":"Type-two Iteration with Bounded Query Revision","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T13:37:44.825271Z"},"links":{"citing_paper":"/paper/1908.04923"},"observation_digest":"sha256:213be4c96d35386e6f00d1b08c577b18cc836732c159c22144a93ff69f6d712b","observation_id":"fd2d975a-e257-440b-8c8f-880a35f5de40","resolution":{"observed_at":"2026-08-14T13:37:44.902289Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"6706.97671","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:37:45.189092Z","title":"Ignjatovic & A","venue":null,"work_id":"639fe81f-f644-49a8-9eca-f4a7359296ba","year":2004},"citing_paper":{"arxiv_id":"1908.04923","last_updated":"2019-08-14T01:58:18Z","snapshot_observed_at":"2026-08-16T02:24:51.186240Z","submitted_at":"2019-08-14T01:58:18Z","title":"Type-two Iteration with Bounded Query Revision","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T13:37:44.827869Z"},"links":{"citing_paper":"/paper/1908.04923"},"observation_digest":"sha256:32110bc30ae285e0a934871f7178804d50807765b874358912f84b8c0c1a66f1","observation_id":"70e37cb1-4770-454d-afd1-773fa62fa43d","resolution":{"observed_at":"2026-08-14T13:37:45.192885Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/s0097539794263452","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:37:44.891500Z","title":"Kapron & S.A","venue":null,"work_id":"95824ef6-6c34-4d5f-92c4-62ce71b755f0","year":1996},"citing_paper":{"arxiv_id":"1908.04923","last_updated":"2019-08-14T01:58:18Z","snapshot_observed_at":"2026-08-16T02:24:51.186240Z","submitted_at":"2019-08-14T01:58:18Z","title":"Type-two Iteration with Bounded Query Revision","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T13:37:44.830345Z"},"links":{"citing_paper":"/paper/1908.04923"},"observation_digest":"sha256:34aec7d3eff28ca9422fc8d0f1ccb919053b7dad7f96f436d9ae618ce643f5aa","observation_id":"fab97c5d-f892-4280-ad25-140a588a9b12","resolution":{"observed_at":"2026-08-14T13:37:44.894509Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:37:44.832885Z","title":"Kapron & F","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.04923","last_updated":"2019-08-14T01:58:18Z","snapshot_observed_at":"2026-08-16T02:24:51.186240Z","submitted_at":"2019-08-14T01:58:18Z","title":"Type-two Iteration with Bounded Query Revision","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T13:37:44.832885Z"},"links":{"citing_paper":"/paper/1908.04923"},"observation_digest":"sha256:6bc6f10b92a33290dd092bbfd6c6d8da76a6ae4a7fd675ee45cc69e79a6ec3a2","observation_id":"85060448-1559-4754-b40f-396eee48b7fd","resolution":{"observed_at":"2026-08-14T13:37:44.832885Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:37:45.251474Z","title":"Kapron (1991): Feasible Computation in Higher Types","venue":null,"work_id":"e4e718ec-f574-4a3b-aa36-a1068e2eaeb5","year":1991},"citing_paper":{"arxiv_id":"1908.04923","last_updated":"2019-08-14T01:58:18Z","snapshot_observed_at":"2026-08-16T02:24:51.186240Z","submitted_at":"2019-08-14T01:58:18Z","title":"Type-two Iteration with Bounded Query Revision","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T13:37:44.835537Z"},"links":{"citing_paper":"/paper/1908.04923"},"observation_digest":"sha256:f9a8ad758fbac6e21f61773bc92950ae30f681badea28cd34e18e95b0ebf72f2","observation_id":"a2ee49b3-b6e2-44dc-b0f4-f95ebc44311c","resolution":{"observed_at":"2026-08-14T13:37:45.256429Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.fscd.2017.23","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:37:44.883815Z","title":"In: 2nd International Conference on Formal Structures for Comp utation and Deduction, FSCD 2017, September 3-9, 2017, Oxford, UK , pp","venue":null,"work_id":"0dfda646-c0ea-4c8c-92f2-315fecde5cea","year":2017},"citing_paper":{"arxiv_id":"1908.04923","last_updated":"2019-08-14T01:58:18Z","snapshot_observed_at":"2026-08-16T02:24:51.186240Z","submitted_at":"2019-08-14T01:58:18Z","title":"Type-two Iteration with Bounded Query Revision","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T13:37:44.838124Z"},"links":{"citing_paper":"/paper/1908.04923"},"observation_digest":"sha256:91a06704b69b38035ed1ef5feac7f604aa27375eff37e97b66a13e28ef77d2f8","observation_id":"4ed2c2b8-0059-442e-ac81-7a47279ec71c","resolution":{"observed_at":"2026-08-14T13:37:44.886668Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1991.15162","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:37:45.039052Z","title":"In: Proceedings of the Sixth Annual IEEE Symposium on Logic in Computer Science (Am sterdam, The Netherlands), 1991 , IEEE Computer Society, pp","venue":null,"work_id":"caebd490-c1c0-46a6-b5f5-e88cf450125a","year":1991},"citing_paper":{"arxiv_id":"1908.04923","last_updated":"2019-08-14T01:58:18Z","snapshot_observed_at":"2026-08-16T02:24:51.186240Z","submitted_at":"2019-08-14T01:58:18Z","title":"Type-two Iteration with Bounded Query Revision","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T13:37:44.840701Z"},"links":{"citing_paper":"/paper/1908.04923"},"observation_digest":"sha256:2ed6b764f5290a366b55bdf3924debde011cb3dae8a96c0a4846d8d5fddc9cce","observation_id":"eb4ff702-7668-4153-aaee-3df42d267340","resolution":{"observed_at":"2026-08-14T13:37:45.043234Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0022-0000(76)80035-9","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:37:44.875842Z","title":"Mehlhorn (1976): Polynomial and abstract subrecursive classes","venue":null,"work_id":"f55d0963-eb69-40cc-a9e3-63c774930632","year":1976},"citing_paper":{"arxiv_id":"1908.04923","last_updated":"2019-08-14T01:58:18Z","snapshot_observed_at":"2026-08-16T02:24:51.186240Z","submitted_at":"2019-08-14T01:58:18Z","title":"Type-two Iteration with Bounded Query Revision","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T13:37:44.843220Z"},"links":{"citing_paper":"/paper/1908.04923"},"observation_digest":"sha256:8afe6d1633675bcf6ba981fa6678ab7264e472dad52368b3164a13f3e1f5050a","observation_id":"d96cb348-59d3-43a1-b71f-b34ef564157c","resolution":{"observed_at":"2026-08-14T13:37:44.878887Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1090/s0002-9904-1947-08911-4","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:37:44.865884Z","title":"Robinson (1947): Primitive recursive functions","venue":null,"work_id":"52fb9c48-1bd2-4c59-a63f-c8621a4733c7","year":1947},"citing_paper":{"arxiv_id":"1908.04923","last_updated":"2019-08-14T01:58:18Z","snapshot_observed_at":"2026-08-16T02:24:51.186240Z","submitted_at":"2019-08-14T01:58:18Z","title":"Type-two Iteration with Bounded Query Revision","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T13:37:44.845871Z"},"links":{"citing_paper":"/paper/1908.04923"},"observation_digest":"sha256:7ff85ffc025b7dfd2d9dd6ea8ef03640e66b24354a1b65198dfd22ab0de940ea","observation_id":"f2a11951-0b8b-41d4-881b-5de07c004a53","resolution":{"observed_at":"2026-08-14T13:37:44.870705Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:37:44.848536Z","title":"In: Eighth Annual IEEE Symposium on Logic in Computer Science (Montreal, PQ, 1993) , IEEE Comput","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"1908.04923","last_updated":"2019-08-14T01:58:18Z","snapshot_observed_at":"2026-08-16T02:24:51.186240Z","submitted_at":"2019-08-14T01:58:18Z","title":"Type-two Iteration with Bounded Query Revision","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T13:37:44.848536Z"},"links":{"citing_paper":"/paper/1908.04923"},"observation_digest":"sha256:585827e328de5515f6765663b33d763f6c658a769c5d964619d9282593148dc5","observation_id":"b655e54a-7490-4a33-80f4-125e52d0d6ae","resolution":{"observed_at":"2026-08-14T13:37:44.848536Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"1908.04923","last_updated":"2019-08-14T01:58:18Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-16T02:24:51.186240Z","submitted_at":"2019-08-14T01:58:18Z","title":"Type-two Iteration with Bounded Query Revision"},"reference_resolution":{"displayed":16,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":3,"verified_exact":10,"verified_fuzzy":2},"total_outbound_references":16},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 16 of 16 outbound references and 0 inbound Pith citation observations for arXiv:1908.04923."}