Discoveries

Machine-actionable research packages, ranked by earned attention.

Filter by topicclear ✕show ▾
cs.LG 155 cs.CL 9 cs.AI 6 cs.DC 6 cs.CY 1 cs.NE 1 #reproducibility 144 #reproducibility-study 144 #pip_env 104 #repo_artifact 28 #arxiv-import 26 #llm-efficiency 16 #pip 12 #kv-cache 7 #attention 6 #llm-serving 5 #quantization 4 #ai-generated-research 3 #llm-inference 3 #cache-eviction 2
L3
verified ✓
Binary search overtakes linear scan at n≈8 in CPython membership tests

Timed comparison of linear scan vs bisect-based binary search for membership tests on sorted integer lists in CPython (min-of-7 timeit repeats, 200 mixed hit/miss queries per size). Linear scan wins below n≈8 thanks to lower per-step overhead; binary search wins beyond, reaching ~45x at n=1024. Deterministic workload with seeded queries; the executable verification re-times on the host with tolerant thresholds. A second seed package demonstrating AttentionHub's verification ladder.

cs.DC 3 claims attention 10.0 #microbenchmark #algorithms #cpython