Paper Citation Record · LEDGER

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning

As of 13 August 2026, this Paper Citation Record lists 40 of 40 outbound references and 0 inbound Pith citation observations for arXiv:2511.02644.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2511.02644 v2

Coverage vector

measured 40 of 40 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-04T00:15:44.366497Z

measured 40 of 40 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-13T06:32:02.005865+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

40 of 40 outbound references displayed

verified exact2
verified fuzzy0
unresolved38
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 2f009efb-c9a3-45e1-b177-0f305e780f76 · outbound

This paper cites Agarwal, A.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning Agarwal, A

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-04T00:15:41.811705Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 138a0cc6-0809-4297-a5a6-f94cbef7a26c · outbound

This paper cites Agarwal, A.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning Agarwal, A

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-04T00:15:41.872968Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a33c2102-9de5-47a6-adde-051c3fa74f92 · outbound

This paper cites Ackerman, J.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning Ackerman, J

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-04T00:15:41.927675Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f3081e83-8ebf-4966-9d9c-13c7c78381bb · outbound

This paper cites Ackermann: Zum Hilbertschen Aufbau der reellen Zahlen.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning Ackermann: Zum Hilbertschen Aufbau der reellen Zahlen

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-04T00:15:41.988360Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1994af1b-53e5-4dc6-9b9b-2d428d6ccad0 · outbound

This paper cites Akbari, M.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning Akbari, M

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-04T00:15:42.075980Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c2b79880-a5c4-41a0-a9af-5691e83d3a0e · outbound

This paper cites an unresolved cited work.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning Unresolved cited work

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-04T00:15:42.144023Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 61c7f4e5-540b-4765-a54b-fae04ab54e4e · outbound

This paper cites Blumer, A.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning Blumer, A

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-04T00:15:42.213307Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d6881d90-be47-406c-8764-1c8a166c2f1a · outbound

This paper cites Computability of Classification and Deep Learning: From Theoretical Limits to Practical Feasibility through Quantization.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning Computability of Classification and Deep Learning: From Theoretical Limits to Practical Feasibility through Quantization

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-04T00:15:42.293716Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 700f74f9-7892-4321-a6a0-551360643ddd · outbound

This paper cites Ben-David, N.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning Ben-David, N

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-04T00:15:42.350723Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6ac7580d-ec91-4d4c-9e39-e953336eeff0 · outbound

This paper cites Ben-David, P.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning Ben-David, P

Reference 10

Resolution: verified exact; doi, observed 2026-08-04T00:18:18.000566Z

Source-reported events for the cited work

correction dated 2019-01-23. Source: crossref record 10.1038/s42256-019-0023-6->10.1038/s42256-018-0002-3:correction, observed 2026-07-11T03:02:10.04662+00:00. This notice travels one citation hop only.

Observation 45f75353-f3f3-46b4-a80e-5f2193dc4094 · outbound

This paper cites A Theory of Universal Learning.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning A Theory of Universal Learning

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-04T00:15:42.492830Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 64bdd7bb-ee53-4803-af2e-66407fcfc387 · outbound

This paper cites Brattka, P.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning Brattka, P

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-04T00:15:42.551724Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 02f8473b-109c-48ec-839f-89330e8d7579 · outbound

This paper cites Benedek, A.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning Benedek, A

Reference 13

Resolution: verified exact; doi, observed 2026-08-04T00:18:17.889437Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 85b87c26-cd14-44e0-802e-a4f3f7bb9e20 · outbound

This paper cites Ben-David, S.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning Ben-David, S

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-04T00:15:42.687349Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ae2be870-396a-4059-aee3-0c57a373d6cd · outbound

This paper cites an unresolved cited work.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning Unresolved cited work

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-04T00:15:42.754696Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 074888ca-efb4-476a-95a5-4c099455dc6b · outbound

This paper cites A Computability Perspective on (Verified) Machine Learning.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning A Computability Perspective on (Verified) Machine Learning

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-04T00:15:42.828524Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3c0a80ee-bfd4-4690-a42c-7f74d9625c9a · outbound

This paper cites Delle Rose, A.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning Delle Rose, A

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-04T00:15:42.914493Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8de0bec9-2e51-409b-b683-e46e3e9b779e · outbound

This paper cites Delle Rose, A.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning Delle Rose, A

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-04T00:15:43.000395Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ce3079a4-3b93-4f02-a78f-1c25e522ae4c · outbound

This paper cites Downey, A.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning Downey, A

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-04T00:15:43.063584Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ba3d6bfa-2b04-4739-93ef-8db2851fe483 · outbound

This paper cites Downey, A.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning Downey, A

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-04T00:15:43.121641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2d5896bb-35ea-4566-8663-b76ef84e279f · outbound

This paper cites Goldman, M.J.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning Goldman, M.J

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-04T00:15:43.176772Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d548da93-df18-4e9d-9ab7-46a3c7b2f4d9 · outbound

This paper cites Gourdeau, T.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning Gourdeau, T

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-04T00:15:43.263364Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7cffc344-17d4-4907-8a6b-b51bfb1c60f9 · outbound

This paper cites On the Computability of Multiclass PAC Learning.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning On the Computability of Multiclass PAC Learning

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-04T00:15:43.321148Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 796aa954-ed49-416a-b2d0-eebe6e0ce4cc · outbound

This paper cites Computability of probability measures and Martin-Lof randomness over metric spaces.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning Computability of probability measures and Martin-Lof randomness over metric spaces

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-04T00:15:43.409661Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4250e825-71fc-467f-b2cb-a63ed980f09a · outbound

This paper cites Springer-Vieweg (2014).

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning Springer-Vieweg (2014)

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-04T00:15:43.475771Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 152e8343-f39b-40be-a945-b88a8511bb30 · outbound

This paper cites Kearns, U.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning Kearns, U

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-04T00:15:43.526236Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b81d899b-ac97-4b64-8e01-5a188a290d0e · outbound

This paper cites Kattermann: Computability aspects in statistical learning.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning Kattermann: Computability aspects in statistical learning

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-04T00:15:43.616887Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5bcc55fb-5ca3-4c7f-9c26-216eb7830a85 · outbound

This paper cites an unresolved cited work.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning Unresolved cited work

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-04T00:15:43.675049Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fea3da12-4099-4406-bbfc-bed079d9ef44 · outbound

This paper cites an unresolved cited work.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning Unresolved cited work

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-04T00:15:43.742669Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b76c9c7f-1b8f-4f37-9399-36967db87c3e · outbound

This paper cites Schaefer: Deciding the Vapnik–Cervonenkis dimension is _3^p -complete.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning Schaefer: Deciding the Vapnik–Cervonenkis dimension is _3^p -complete

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-04T00:15:43.789718Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 60df71d3-3274-4b09-84ef-6d056b047961 · outbound

This paper cites Schoening: Theoretische Informatik - kurz gefasst.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning Schoening: Theoretische Informatik - kurz gefasst

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-04T00:15:43.845485Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8263246e-7a94-4532-b004-b0463d1046a0 · outbound

This paper cites Smullyan: Recursion Theory for Metamathematics.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning Smullyan: Recursion Theory for Metamathematics

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-04T00:15:43.891371Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ea0d01c0-9688-41c9-b3fc-b12768d8fd9c · outbound

This paper cites Soare: Turing Computability: Theory and Applications.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning Soare: Turing Computability: Theory and Applications

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-04T00:15:43.954290Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b5ed39b3-1b49-4415-b57d-8cc456eedefc · outbound

This paper cites Spelda, V.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning Spelda, V

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-04T00:15:44.021916Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 17d32d0c-656c-49ee-b8c4-eb827bf73f0d · outbound

This paper cites Sterkenburg: On characterizations of learnability with computable learners.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning Sterkenburg: On characterizations of learnability with computable learners

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-04T00:15:44.062288Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 56671724-c6fe-4311-b504-788a9fc0626d · outbound

This paper cites Thewmorakot: Computability Theory on Polish Metric Spaces.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning Thewmorakot: Computability Theory on Polish Metric Spaces

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-04T00:15:44.125983Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ba894fb4-28ec-4531-a32b-5c140ddf5bd3 · outbound

This paper cites Turing: On computable numbers with an application to the Entscheidungsproblem.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning Turing: On computable numbers with an application to the Entscheidungsproblem

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-04T00:15:44.180050Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a4f8121b-217e-4e2d-b772-a85f8844a3e6 · outbound

This paper cites an unresolved cited work.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning Unresolved cited work

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-04T00:15:44.236065Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3b186954-d6c6-42cf-84ed-1ebdafd72e37 · outbound

This paper cites an unresolved cited work.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning Unresolved cited work

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-04T00:15:44.293020Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e080118c-4551-4be3-a9dd-03015a7e97d1 · outbound

This paper cites Weihrauch: Computability.

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning Weihrauch: Computability

Reference 40

Resolution: unresolved; no resolver link, observed 2026-08-04T00:15:44.366497Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.