Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-14T13:37:44.848536Z
Paper Citation Record · LEDGER
Type-two Iteration with Bounded Query Revision
As of 18 August 2026, this Paper Citation Record lists 16 of 16 outbound references and 0 inbound Pith citation observations for arXiv:1908.04923.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-18T06:34:40.430872+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
16 of 16 outbound references displayed
- verified exact10
- verified fuzzy2
- unresolved3
- parse uncertain0
- malformed identifier0
- metadata mismatch1
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation a422dc76-74c2-453d-b600-6473648700ba · outbound
This paper cites Cook (1992): A New Recursion-Theoretic Characterization of the Polytime Functions.
Type-two Iteration with Bounded Query Revision Cook (1992): A New Recursion-Theoretic Characterization of the Polytime Functions
Reference 1
- Resolution
- unresolved
- no resolver link, observed 2026-08-14T13:37:44.807367Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 38bae729-36ff-43a6-8a23-d20f7b816643 · outbound
This paper cites Cartwright, P .L.
Type-two Iteration with Bounded Query Revision Cartwright, P .L
Reference 2
- Resolution
- verified exact
- raw_fallback, observed 2026-08-14T13:37:45.246293Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation fc2b8139-a955-444f-9d31-38a07ec36f68 · outbound
This paper cites Cobham (1965): The intrinsic computational difficulty of functions.
Type-two Iteration with Bounded Query Revision Cobham (1965): The intrinsic computational difficulty of functions
Reference 3
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T13:37:45.264347Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 7947c697-302e-4fea-82ab-e4cfc049de04 · outbound
This paper cites Cook (1992): Computability and complexity of higher type functions.
Type-two Iteration with Bounded Query Revision Cook (1992): Computability and complexity of higher type functions
Reference 4
- Resolution
- verified exact
- doi, observed 2026-08-14T13:37:44.925533Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation ed46df4f-0df8-4e2a-ae2c-edb108eba1d7 · outbound
This paper cites Cook & B.M.
Reference 5
- Resolution
- verified exact
- doi, observed 2026-08-14T13:37:44.918450Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 0e68a128-53bc-47a4-8017-a04a213d5dd0 · outbound
This paper cites Cook & A.
Reference 6
- Resolution
- verified exact
- doi, observed 2026-08-14T13:37:44.910625Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation fd2d975a-e257-440b-8c8f-880a35f5de40 · outbound
This paper cites an unresolved cited work.
Type-two Iteration with Bounded Query Revision Unresolved cited work
Reference 7
- Resolution
- verified exact
- doi, observed 2026-08-14T13:37:44.902289Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 70e37cb1-4770-454d-afd1-773fa62fa43d · outbound
This paper cites Ignjatovic & A.
Type-two Iteration with Bounded Query Revision Ignjatovic & A
Reference 8
- Resolution
- metadata mismatch
- raw_fallback, observed 2026-08-14T13:37:45.192885Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation fab97c5d-f892-4280-ad25-140a588a9b12 · outbound
This paper cites Kapron & S.A.
Type-two Iteration with Bounded Query Revision Kapron & S.A
Reference 9
- Resolution
- verified exact
- doi, observed 2026-08-14T13:37:44.894509Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 85060448-1559-4754-b40f-396eee48b7fd · outbound
This paper cites Kapron & F.
Reference 10
- Resolution
- unresolved
- no resolver link, observed 2026-08-14T13:37:44.832885Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation a2ee49b3-b6e2-44dc-b0f4-f95ebc44311c · outbound
This paper cites Kapron (1991): Feasible Computation in Higher Types.
Type-two Iteration with Bounded Query Revision Kapron (1991): Feasible Computation in Higher Types
Reference 11
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T13:37:45.256429Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation 4ed2c2b8-0059-442e-ac81-7a47279ec71c · outbound
This paper cites In: 2nd International Conference on Formal Structures for Comp utation and Deduction, FSCD 2017, September 3-9, 2017, Oxford, UK , pp.
Type-two Iteration with Bounded Query Revision In: 2nd International Conference on Formal Structures for Comp utation and Deduction, FSCD 2017, September 3-9, 2017, Oxford, UK , pp
Reference 12
- Resolution
- verified exact
- doi, observed 2026-08-14T13:37:44.886668Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation eb4ff702-7668-4153-aaee-3df42d267340 · outbound
This paper cites In: Proceedings of the Sixth Annual IEEE Symposium on Logic in Computer Science (Am sterdam, The Netherlands), 1991 , IEEE Computer Society, pp.
Type-two Iteration with Bounded Query Revision In: Proceedings of the Sixth Annual IEEE Symposium on Logic in Computer Science (Am sterdam, The Netherlands), 1991 , IEEE Computer Society, pp
Reference 13
- Resolution
- verified exact
- raw_fallback, observed 2026-08-14T13:37:45.043234Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation d96cb348-59d3-43a1-b71f-b34ef564157c · outbound
This paper cites Mehlhorn (1976): Polynomial and abstract subrecursive classes.
Type-two Iteration with Bounded Query Revision Mehlhorn (1976): Polynomial and abstract subrecursive classes
Reference 14
- Resolution
- verified exact
- doi, observed 2026-08-14T13:37:44.878887Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation f2a11951-0b8b-41d4-881b-5de07c004a53 · outbound
This paper cites Robinson (1947): Primitive recursive functions.
Type-two Iteration with Bounded Query Revision Robinson (1947): Primitive recursive functions
Reference 15
- Resolution
- verified exact
- doi, observed 2026-08-14T13:37:44.870705Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.
Observation b655e54a-7490-4a33-80f4-125e52d0d6ae · outbound
This paper cites In: Eighth Annual IEEE Symposium on Logic in Computer Science (Montreal, PQ, 1993) , IEEE Comput.
Type-two Iteration with Bounded Query Revision In: Eighth Annual IEEE Symposium on Logic in Computer Science (Montreal, PQ, 1993) , IEEE Comput
Reference 16
- Resolution
- unresolved
- no resolver link, observed 2026-08-14T13:37:44.848536Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Pith citing papers
No inbound Pith citation observations are available.