{"as_of":"2026-08-13T11:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:752d336131acaa127686c9c9f17a9da6f1ccab911e7f6a836637d911f5601a55","coverage":[{"denominator":40,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":40,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T00:15:44.366497Z","state":"measured"},{"denominator":40,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":40,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2511.02644/citation-record","integrity":"/paper/2511.02644/integrity","json":"/paper/2511.02644/citation-record.json","paper":"/paper/2511.02644"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T00:15:41.811705Z","title":"Agarwal, A","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:41.811705Z"},"links":{"citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:b90d27937359cf8bb703aac936bf6f40c2eecd657596fe73e1cb9a8abd60e9e5","observation_id":"2f009efb-c9a3-45e1-b177-0f305e780f76","resolution":{"observed_at":"2026-08-04T00:15:41.811705Z","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-08-04T00:15:41.872968Z","title":"Agarwal, A","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:41.872968Z"},"links":{"citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:45579845d20799393b15b1dfb6e084c5810f6eb0202414ed3551c875a8c76efa","observation_id":"138a0cc6-0809-4297-a5a6-f94cbef7a26c","resolution":{"observed_at":"2026-08-04T00:15:41.872968Z","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-08-04T00:15:41.927675Z","title":"Ackerman, J","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:41.927675Z"},"links":{"citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:8471123edfed1d29a635a015ea867118ed57d38d945404952056d9b58719fe5f","observation_id":"a33c2102-9de5-47a6-adde-051c3fa74f92","resolution":{"observed_at":"2026-08-04T00:15:41.927675Z","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-08-04T00:15:41.988360Z","title":"Ackermann: Zum Hilbertschen Aufbau der reellen Zahlen","venue":null,"work_id":null,"year":1928},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:41.988360Z"},"links":{"citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:255f5c0f9e95cc6c4043919b23daeed098433f0a14a1a81c31b860854800a20b","observation_id":"f3081e83-8ebf-4966-9d9c-13c7c78381bb","resolution":{"observed_at":"2026-08-04T00:15:41.988360Z","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-08-04T00:15:42.075980Z","title":"Akbari, M","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:42.075980Z"},"links":{"citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:f7b76265a3a363f7ea52e20e7549c47976735146df14e28b84cbad8f43b0771d","observation_id":"1994af1b-53e5-4dc6-9b9b-2d428d6ccad0","resolution":{"observed_at":"2026-08-04T00:15:42.075980Z","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-08-04T00:15:42.144023Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:42.144023Z"},"links":{"citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:dd96b1e589ecf810371c9967c98b9388d4fab46156356bcceb1d43b7a588d482","observation_id":"c2b79880-a5c4-41a0-a9af-5691e83d3a0e","resolution":{"observed_at":"2026-08-04T00:15:42.144023Z","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-08-04T00:15:42.213307Z","title":"Blumer, A","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:42.213307Z"},"links":{"citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:688f9edd39226a9e6eda5164474588ff7e1cd76ebb64dfa2dee01ff616b08987","observation_id":"61c7f4e5-540b-4765-a54b-fae04ab54e4e","resolution":{"observed_at":"2026-08-04T00:15:42.213307Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.06212","last_updated":"2024-08-12T15:02:26Z","snapshot_observed_at":"2026-08-13T08:06:14.951198Z","submitted_at":"2024-08-12T15:02:26Z","title":"Computability of Classification and Deep Learning: From Theoretical Limits to Practical Feasibility through Quantization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.06212","snapshot_observed_at":"2026-08-04T00:15:42.293716Z","title":"Boche, V","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:42.293716Z"},"links":{"cited_paper":"/paper/2408.06212","citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:f591f9677121366f00e9f6baac0e7f73c7c456d283a86b3b73d1e71a3f674bd8","observation_id":"d6881d90-be47-406c-8764-1c8a166c2f1a","resolution":{"observed_at":"2026-08-04T00:15:42.293716Z","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-08-04T00:15:42.350723Z","title":"Ben-David, N","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:42.350723Z"},"links":{"citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:fa3d3e5c630e46dd605908c407f4b3d71e99fb057748ca34b4c7e1066dca4b63","observation_id":"700f74f9-7892-4321-a6a0-551360643ddd","resolution":{"observed_at":"2026-08-04T00:15:42.350723Z","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":"10.1038/s42256-018-0002-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Ben-David, P","venue":"Nature Machine Intelligence","work_id":"16533a28-a1cc-456b-9e52-cbd8853fdb72","year":2019},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:42.412054Z"},"links":{"citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:2ae8c0ab3416b7cbf2820c423d3c9b2d614b26922b51e9149e62b0b29989b47d","observation_id":"6ac7580d-ec91-4d4c-9e39-e953336eeff0","resolution":{"observed_at":"2026-08-04T00:18:18.000566Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[{"edge_observation":{"observed_at":"2026-08-04T00:19:39.311957+00:00","source":"paper_reference_links","state":"open"},"event_date":"2019-01-23","event_type":"correction","notice_doi":"10.1038/s42256-019-0023-6","provenance":{"observed_at":"2026-07-11T03:02:10.04662+00:00","source":"crossref","source_record_id":"10.1038/s42256-019-0023-6->10.1038/s42256-018-0002-3:correction"}}],"reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2011.04483","last_updated":"2020-11-09T15:10:32Z","snapshot_observed_at":"2026-07-06T10:12:54.188337Z","submitted_at":"2020-11-09T15:10:32Z","title":"A Theory of Universal Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.04483","snapshot_observed_at":"2026-08-04T00:15:42.492830Z","title":"Bousquet, S","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:42.492830Z"},"links":{"cited_paper":"/paper/2011.04483","citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:50b08b03d5bbbd3abae524013b646609e9882a088dc0094304b0335537b2f9a8","observation_id":"45f75353-f3f3-46b4-a80e-5f2193dc4094","resolution":{"observed_at":"2026-08-04T00:15:42.492830Z","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-08-04T00:15:42.551724Z","title":"Brattka, P","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:42.551724Z"},"links":{"citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:645163594d7c07987c8db8d27a92fda97d21aa51b61e75676a57d75b1e755836","observation_id":"64bdd7bb-ee53-4803-af2e-66407fcfc387","resolution":{"observed_at":"2026-08-04T00:15:42.551724Z","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":"10.1016/s0022-0000(05)80005-4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Benedek, A","venue":"Journal of Computer and System Sciences","work_id":"4e1f7bec-fdf6-436d-9bc3-17115a5c0672","year":1994},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:42.637668Z"},"links":{"citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:16d16f28faeff8e1d705869c6b5468fc300f631041d59a871afc4e23f995ca54","observation_id":"02f8473b-109c-48ec-839f-89330e8d7579","resolution":{"observed_at":"2026-08-04T00:18:17.889437Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-04T00:15:42.687349Z","title":"Ben-David, S","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:42.687349Z"},"links":{"citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:c91221f68a56d5199f822c8b268aa1e07b05e7449e7fac757ff2991de51bd1b3","observation_id":"85b87c26-cd14-44e0-802e-a4f3f7bb9e20","resolution":{"observed_at":"2026-08-04T00:15:42.687349Z","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-08-04T00:15:42.754696Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:42.754696Z"},"links":{"citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:0e453ae418851b1298cd5bbe7cc2bc57d67bc71e3261f2742d55335cc037a9e4","observation_id":"ae2be870-396a-4059-aee3-0c57a373d6cd","resolution":{"observed_at":"2026-08-04T00:15:42.754696Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.06585","last_updated":"2021-02-12T15:47:41Z","snapshot_observed_at":"2026-08-05T08:25:14.000230Z","submitted_at":"2021-02-12T15:47:41Z","title":"A Computability Perspective on (Verified) Machine Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.06585","snapshot_observed_at":"2026-08-04T00:15:42.828524Z","title":"Crook, J","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:42.828524Z"},"links":{"cited_paper":"/paper/2102.06585","citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:20bccf51db171decdec2d9ee0c9d838908dfbd620804ec42de8928bf9d095888","observation_id":"074888ca-efb4-476a-95a5-4c099455dc6b","resolution":{"observed_at":"2026-08-04T00:15:42.828524Z","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-08-04T00:15:42.914493Z","title":"Delle Rose, A","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:42.914493Z"},"links":{"citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:4253fa59fc3eb469b87c8d6b151cc38d52b3cdc7cc744b58b450c28747c7f53e","observation_id":"3c0a80ee-bfd4-4690-a42c-7f74d9625c9a","resolution":{"observed_at":"2026-08-04T00:15:42.914493Z","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-08-04T00:15:43.000395Z","title":"Delle Rose, A","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:43.000395Z"},"links":{"citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:5eb4579c6f8242897c2f445c750787453e1125e16d3f66832a3a92070813e609","observation_id":"8de0bec9-2e51-409b-b683-e46e3e9b779e","resolution":{"observed_at":"2026-08-04T00:15:43.000395Z","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-08-04T00:15:43.063584Z","title":"Downey, A","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:43.063584Z"},"links":{"citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:e2d603a68b035183676aa0604b0281d384027673b72dd105d34cfd414a6c324a","observation_id":"ce3079a4-3b93-4f02-a78f-1c25e522ae4c","resolution":{"observed_at":"2026-08-04T00:15:43.063584Z","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-08-04T00:15:43.121641Z","title":"Downey, A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:43.121641Z"},"links":{"citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:a5fd044d86f505f07a1ea5d24b4edadd430a77fb00516f1448d41fcde8b62448","observation_id":"ba3d6bfa-2b04-4739-93ef-8db2851fe483","resolution":{"observed_at":"2026-08-04T00:15:43.121641Z","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-08-04T00:15:43.176772Z","title":"Goldman, M.J","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:43.176772Z"},"links":{"citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:74815c35b886629b443caba877428abc5a0ed7c1d4ec91879008437148562fb9","observation_id":"2d5896bb-35ea-4566-8663-b76ef84e279f","resolution":{"observed_at":"2026-08-04T00:15:43.176772Z","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-08-04T00:15:43.263364Z","title":"Gourdeau, T","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:43.263364Z"},"links":{"citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:71c0a4d99f771333a631710afca875a1df0a46bcd85553b41934b0f398887ba4","observation_id":"d548da93-df18-4e9d-9ab7-46a3c7b2f4d9","resolution":{"observed_at":"2026-08-04T00:15:43.263364Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06089","last_updated":"2025-02-10T01:07:23Z","snapshot_observed_at":"2026-08-08T16:46:11.503951Z","submitted_at":"2025-02-10T01:07:23Z","title":"On the Computability of Multiclass PAC Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06089","snapshot_observed_at":"2026-08-04T00:15:43.321148Z","title":"Gourdeau, T","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:43.321148Z"},"links":{"cited_paper":"/paper/2502.06089","citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:7854bf87aeecf31ca055a3d411c4a917d09c40589e3da43acc67f483e2427754","observation_id":"7cffc344-17d4-4907-8a6b-b51bfb1c60f9","resolution":{"observed_at":"2026-08-04T00:15:43.321148Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0709.0907","last_updated":"2008-07-23T15:19:47Z","snapshot_observed_at":"2026-07-06T01:29:39.615945Z","submitted_at":"2007-09-06T16:16:23Z","title":"Computability of probability measures and Martin-Lof randomness over metric spaces","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0709.0907","snapshot_observed_at":"2026-08-04T00:15:43.409661Z","title":"Hoyrup, C","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:43.409661Z"},"links":{"cited_paper":"/paper/0709.0907","citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:eeb31fffea68755599a6446c4db4d6481d9d1bd1109bfc541304b2aa96db9c91","observation_id":"796aa954-ed49-416a-b2d0-eebe6e0ce4cc","resolution":{"observed_at":"2026-08-04T00:15:43.409661Z","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-08-04T00:15:43.475771Z","title":"Springer-Vieweg (2014)","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:43.475771Z"},"links":{"citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:05acf4b2cb3a9e6b2018d6b39273cc1083808591f16ae51c2ffb1ea10cb5d50b","observation_id":"4250e825-71fc-467f-b2cb-a63ed980f09a","resolution":{"observed_at":"2026-08-04T00:15:43.475771Z","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-08-04T00:15:43.526236Z","title":"Kearns, U","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:43.526236Z"},"links":{"citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:6fc397e2d476f385b928f8ac991de0c8381e2e57d4f1c8d5c1068297c87bc533","observation_id":"152e8343-f39b-40be-a945-b88a8511bb30","resolution":{"observed_at":"2026-08-04T00:15:43.526236Z","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-08-04T00:15:43.616887Z","title":"Kattermann: Computability aspects in statistical learning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:43.616887Z"},"links":{"citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:56b4080ebf876c5df7e02d520e2f3a891c63bc252d44207a48002420e513a97e","observation_id":"b81d899b-ac97-4b64-8e01-5a188a290d0e","resolution":{"observed_at":"2026-08-04T00:15:43.616887Z","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-08-04T00:15:43.675049Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:43.675049Z"},"links":{"citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:e5346996b72044ee42c56bc4f417d77baf08c7b4359235ae211d8f6e2082c7fc","observation_id":"5bcc55fb-5ca3-4c7f-9c26-216eb7830a85","resolution":{"observed_at":"2026-08-04T00:15:43.675049Z","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-08-04T00:15:43.742669Z","title":null,"venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:43.742669Z"},"links":{"citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:6f827a842a4dadbf0066dba731dfac9ddde18956efecb9990d45447fcc130325","observation_id":"fea3da12-4099-4406-bbfc-bed079d9ef44","resolution":{"observed_at":"2026-08-04T00:15:43.742669Z","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-08-04T00:15:43.789718Z","title":"Schaefer: Deciding the Vapnik–Cervonenkis dimension is _3^p -complete","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:43.789718Z"},"links":{"citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:26c7d51d88ca993f1d3b89610961c4e7464d4a899dad24d557ba377053f9e416","observation_id":"b76c9c7f-1b8f-4f37-9399-36967db87c3e","resolution":{"observed_at":"2026-08-04T00:15:43.789718Z","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-08-04T00:15:43.845485Z","title":"Schoening: Theoretische Informatik - kurz gefasst","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:43.845485Z"},"links":{"citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:2a8388e0be5b360f376324092cdf979c448ed05c4df78acaaae41bae7694eed1","observation_id":"60df71d3-3274-4b09-84ef-6d056b047961","resolution":{"observed_at":"2026-08-04T00:15:43.845485Z","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-08-04T00:15:43.891371Z","title":"Smullyan: Recursion Theory for Metamathematics","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:43.891371Z"},"links":{"citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:fe6a53d64b4aecf3ff6eb49aa228a0a63237ee3cd876b6edb8651fe647ab38a0","observation_id":"8263246e-7a94-4532-b004-b0463d1046a0","resolution":{"observed_at":"2026-08-04T00:15:43.891371Z","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-08-04T00:15:43.954290Z","title":"Soare: Turing Computability: Theory and Applications","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:43.954290Z"},"links":{"citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:db19cf65c19d5c70634cbf3797ec19c42c5c210850171a5a48e91c31e854f3c1","observation_id":"ea0d01c0-9688-41c9-b3fc-b12768d8fd9c","resolution":{"observed_at":"2026-08-04T00:15:43.954290Z","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-08-04T00:15:44.021916Z","title":"Spelda, V","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:44.021916Z"},"links":{"citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:eec2ab0f7c46e70fba26c0b873f9f509ffff4cbea20071a72d8ca58d5aaf9223","observation_id":"b5ed39b3-1b49-4415-b57d-8cc456eedefc","resolution":{"observed_at":"2026-08-04T00:15:44.021916Z","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-08-04T00:15:44.062288Z","title":"Sterkenburg: On characterizations of learnability with computable learners","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:44.062288Z"},"links":{"citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:d3aee7a56d1246e3536a1d5ef8c095f60330133e6139b342fd1496179a67d135","observation_id":"17d32d0c-656c-49ee-b8c4-eb827bf73f0d","resolution":{"observed_at":"2026-08-04T00:15:44.062288Z","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-08-04T00:15:44.125983Z","title":"Thewmorakot: Computability Theory on Polish Metric Spaces","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:44.125983Z"},"links":{"citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:51475973b35d6125275d4abe096adf7bcc857fe009e2b0d3bc8e25698d948681","observation_id":"56671724-c6fe-4311-b504-788a9fc0626d","resolution":{"observed_at":"2026-08-04T00:15:44.125983Z","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-08-04T00:15:44.180050Z","title":"Turing: On computable numbers with an application to the Entscheidungsproblem","venue":null,"work_id":null,"year":1936},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:44.180050Z"},"links":{"citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:fa0756575902bb6975678a2feabdd6a9693b83b133166552c0059b78a1f780b4","observation_id":"ba894fb4-28ec-4531-a32b-5c140ddf5bd3","resolution":{"observed_at":"2026-08-04T00:15:44.180050Z","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-08-04T00:15:44.236065Z","title":null,"venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:44.236065Z"},"links":{"citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:c240f89a3ffab5abbba66d1c1716146e4886c235d8c4b4aa647fbbe3e89681d5","observation_id":"a4f8121b-217e-4e2d-b772-a85f8844a3e6","resolution":{"observed_at":"2026-08-04T00:15:44.236065Z","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-08-04T00:15:44.293020Z","title":null,"venue":null,"work_id":null,"year":1968},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:44.293020Z"},"links":{"citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:0d0a74d65076410abe10c9d61bd1440050ee1da4cce9c696210af218dda49458","observation_id":"3b186954-d6c6-42cf-84ed-1ebdafd72e37","resolution":{"observed_at":"2026-08-04T00:15:44.293020Z","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-08-04T00:15:44.366497Z","title":"Weihrauch: Computability","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-04T00:15:44.366497Z"},"links":{"citing_paper":"/paper/2511.02644"},"observation_digest":"sha256:ed337a8201b001b1da36e45d4430856d47ca40ade4b7537781a0e521eef52f33","observation_id":"e080118c-4551-4be3-a9dd-03015a7e97d1","resolution":{"observed_at":"2026-08-04T00:15:44.366497Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2511.02644","last_updated":"2026-06-30T23:09:26Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T00:48:50.995252Z","submitted_at":"2025-11-04T15:12:38Z","title":"Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning"},"reference_resolution":{"displayed":40,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":38,"verified_exact":2,"verified_fuzzy":0},"total_outbound_references":40},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"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."}