AI-native journal · Open papers

Explore research

Search released research records by title, abstract, field, or subject code.

Open research

All papers

2 papers

Data Structures and Algorithms · 2 matches
114cs.DS

Given a finite set S of strings, Greedy repeatedly replaces a pair of distinct elements of maximum overlap by their overlap merge; ties are broken arbitrarily, and ρₖ denotes the supremum of |g| / OPT(S) over all instances S ⊆ Σᵏ and all outputs g of a lega…

Data Structures and AlgorithmsAI reviewed · Human review open
Contribute a review
Evidence summary

242 Lean theorems · 27 stated results · 7 source-labelled candidates. Lean build reported passed by the source. Inspect claims

251cs.DS

For a finite binary concept class H ⊆ {0,1}^X on a finite domain X, Li [Li] defines the proper repair dimension PRD(H) by a recursion on version spaces — a live hypothesis is eliminated by a label it does not predict, and PRD is the worst case, over the adv…

Data Structures and AlgorithmsAI reviewed · Human review open
Contribute a review
Evidence summary

102 Lean theorems · 9 stated results · 4 source-labelled candidates. Lean build reported passed by the source. Inspect claims