Paper Citation Record · LEDGER

An Optimal Agnostic PAC Algorithm

As of 18 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 1 inbound Pith citation observation for arXiv:2608.06363.

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

pith.paper-citation-record.v1
2608.06363 v1

Coverage vector

measured 30 of 30 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T04:34:58.550623Z

measured 31 of 31 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-17T06:30:58.91139+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-12T15:33:58.118512Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-12T15:33:58.267055Z

Reference resolution

30 of 30 outbound references displayed

verified exact5
verified fuzzy7
unresolved16
parse uncertain0
malformed identifier2
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 85d11e46-fe6f-4abc-b8cd-690eb0a71086 · outbound

This paper cites The One-Inclusion Graph algorithm is not always optimal.

An Optimal Agnostic PAC Algorithm The One-Inclusion Graph algorithm is not always optimal

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:34:59.984826Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 64ab6e04-df42-4ca1-bebe-4685be33aca1 · outbound

This paper cites Optimal PAC bounds without uniform convergence.

An Optimal Agnostic PAC Algorithm Optimal PAC bounds without uniform convergence

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-07T04:34:58.372420Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 00793e7b-60d7-44e3-8456-c974c55011a9 · outbound

This paper cites Adversarial laws of large numbers and optimal regret in online classification.

An Optimal Agnostic PAC Algorithm Adversarial laws of large numbers and optimal regret in online classification

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-07T04:34:58.378892Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c31aa61d-9381-403c-8817-ca51af4d84f2 · outbound

This paper cites Regularization and optimal multiclass learning.

An Optimal Agnostic PAC Algorithm Regularization and optimal multiclass learning

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:34:59.964061Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation bd8f63e8-e4b2-47ac-9e23-69892ba9800b · outbound

This paper cites OnagnosticPAClearninginthesmallerrorregime.

An Optimal Agnostic PAC Algorithm OnagnosticPAClearninginthesmallerrorregime

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:34:59.938623Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 5ba12a51-c7eb-4ed6-9ade-c9453e49560f · outbound

This paper cites Fast learning rates in statistical inference through aggregation.The Annals of Statistics, 37(4):1591–1646, 2009.doi:10.1214/08-AOS623.

An Optimal Agnostic PAC Algorithm Fast learning rates in statistical inference through aggregation.The Annals of Statistics, 37(4):1591–1646, 2009.doi:10.1214/08-AOS623

Reference 6

Resolution: verified exact; doi, observed 2026-08-07T04:34:58.717524Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 9dfd4279-9ae6-4216-9658-106c04525229 · outbound

This paper cites Bartlett, Olivier Bousquet, and Shahar Mendelson.

An Optimal Agnostic PAC Algorithm Bartlett, Olivier Bousquet, and Shahar Mendelson

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-07T04:34:58.407859Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c1854e6a-9a03-48de-a7dd-708d8fe5ccab · outbound

This paper cites an unresolved cited work.

An Optimal Agnostic PAC Algorithm Unresolved cited work

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-07T04:34:58.417289Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 64dbe385-8260-4f37-8666-4075a9218f26 · outbound

This paper cites Theory of classification: A survey of some recent advances.

An Optimal Agnostic PAC Algorithm Theory of classification: A survey of some recent advances

Reference 9

Resolution: verified exact; doi, observed 2026-08-07T04:34:58.686571Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation c0eb5b26-945a-4864-a6b5-bfef16bd0ffc · outbound

This paper cites Springer, New York, NY, 1996.doi:10.1007/978-1-4612-0711-5.

An Optimal Agnostic PAC Algorithm Springer, New York, NY, 1996.doi:10.1007/978-1-4612-0711-5

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-07T04:34:58.429352Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 604a1950-7b69-4551-9df1-fc5e992f216a · outbound

This paper cites Lower bounds in pattern recognition and learning.Pattern Recognition, 28(7):1011–1018, 1995.doi:10.1016/0031-3203(94)00141-8.

An Optimal Agnostic PAC Algorithm Lower bounds in pattern recognition and learning.Pattern Recognition, 28(7):1011–1018, 1995.doi:10.1016/0031-3203(94)00141-8

Reference 11

Resolution: verified exact; doi, observed 2026-08-07T04:34:58.651678Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation cc31f9ae-bfdd-413f-95ed-99339961b677 · outbound

This paper cites Springer Series in Statistics.

An Optimal Agnostic PAC Algorithm Springer Series in Statistics

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-07T04:34:58.438973Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 84e3f9ea-f817-42ad-ae05-2062bc30327b · outbound

This paper cites Springer, Berlin, Heidelberg, 5th edition, 2017.doi:10.1007/978-3-662-53622-3.

An Optimal Agnostic PAC Algorithm Springer, Berlin, Heidelberg, 5th edition, 2017.doi:10.1007/978-3-662-53622-3

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-07T04:34:58.444951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 64feb6e3-2f81-42fa-bc84-a8596d35a909 · outbound

This paper cites an unresolved cited work.

An Optimal Agnostic PAC Algorithm Unresolved cited work

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-07T04:34:58.456289Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9acf6917-e384-4be2-9f6b-2b32d6014073 · outbound

This paper cites an unresolved cited work.

An Optimal Agnostic PAC Algorithm Unresolved cited work

Reference 15

Resolution: unresolved; raw_fallback, observed 2026-08-07T04:34:59.914884Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 32e9c6d1-cb34-41d9-a61a-0e5002154800 · outbound

This paper cites Optimal prediction using expert advice and randomized Littlestone dimension.

An Optimal Agnostic PAC Algorithm Optimal prediction using expert advice and randomized Littlestone dimension

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:34:59.896194Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 35a04d7e-06ff-4122-99cd-d5f2beb9ec56 · outbound

This paper cites Freedman.

An Optimal Agnostic PAC Algorithm Freedman

Reference 17

Resolution: malformed identifier; no resolver link, observed 2026-08-07T04:34:58.478686Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ca20c06d-fa7a-4d1f-9dea-249db1040d7a · outbound

This paper cites The optimal sample complexity of PAC learning.Journal of Machine Learning Research, 17(38):1–15, 2016.

An Optimal Agnostic PAC Algorithm The optimal sample complexity of PAC learning.Journal of Machine Learning Research, 17(38):1–15, 2016

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:34:59.873211Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation bf3909bc-3f94-435d-a552-1b23ea1a9e7d · outbound

This paper cites Revisiting agnostic PAC learning.

An Optimal Agnostic PAC Algorithm Revisiting agnostic PAC learning

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-07T04:34:58.490566Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7551708e-a9cc-482f-9b39-2e5dad7a2c78 · outbound

This paper cites an unresolved cited work.

An Optimal Agnostic PAC Algorithm Unresolved cited work

Reference 20

Resolution: verified exact; raw_fallback, observed 2026-08-07T04:34:59.154149Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation aa2b3598-a539-46e1-b148-b10b0a4e999e · outbound

This paper cites Bagging is an optimal PAC learner.

An Optimal Agnostic PAC Algorithm Bagging is an optimal PAC learner

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:34:59.852949Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 2437f89f-97cc-46fd-b959-49178a5129ed · outbound

This paper cites an unresolved cited work.

An Optimal Agnostic PAC Algorithm Unresolved cited work

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-07T04:34:58.508735Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cd76d52e-7077-4d45-bb4e-b749f839a60f · outbound

This paper cites Cambridge University Press, New York, NY, 2014.

An Optimal Agnostic PAC Algorithm Cambridge University Press, New York, NY, 2014

Reference 23

Resolution: malformed identifier; raw_fallback, observed 2026-08-07T04:34:59.829034Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation c0e7141e-47ef-423e-91fc-ef1b0758260b · outbound

This paper cites Majority-of-Three is Optimal.

An Optimal Agnostic PAC Algorithm Majority-of-Three is Optimal

Reference 24

Resolution: verified exact; local_arxiv, observed 2026-08-07T04:34:58.919265Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation c73f498b-d135-4986-bc75-c79da371e5ce · outbound

This paper cites an unresolved cited work.

An Optimal Agnostic PAC Algorithm Unresolved cited work

Reference 25

Resolution: unresolved; raw_fallback, observed 2026-08-07T04:34:59.794164Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 59d79c3c-d95b-4ded-a275-e15d13e988a9 · outbound

This paper cites an unresolved cited work.

An Optimal Agnostic PAC Algorithm Unresolved cited work

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-07T04:34:58.529166Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 87b44b8c-6520-45fd-ba01-d8504a4cd102 · outbound

This paper cites Vapnik and Alexey Ya.

An Optimal Agnostic PAC Algorithm Vapnik and Alexey Ya

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-07T04:34:58.533444Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f9fb055d-349a-417c-a526-412462b16124 · outbound

This paper cites an unresolved cited work.

An Optimal Agnostic PAC Algorithm Unresolved cited work

Reference 28

Resolution: unresolved; raw_fallback, observed 2026-08-07T04:34:59.769502Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation df4f6427-b157-4a1e-acf7-313ca1545bb0 · outbound

This paper cites an unresolved cited work.

An Optimal Agnostic PAC Algorithm Unresolved cited work

Reference 29

Resolution: unresolved; raw_fallback, observed 2026-08-07T04:34:59.741284Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 5ede60f3-e284-47c9-8af7-e6573ce60c79 · outbound

This paper cites Fix all tie rules.

An Optimal Agnostic PAC Algorithm Fix all tie rules

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T04:34:59.707016Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Pith citing papers

Observation 79279d07-ff84-4fab-af40-71f94be17b7f · inbound

Optimistic Rates for Multiclass PAC Learning cites this paper.

Optimistic Rates for Multiclass PAC Learning An Optimal Agnostic PAC Algorithm

Reference 27

Resolution: verified exact; local_arxiv, observed 2026-08-12T15:33:58.274777Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.