SShortSingh.
TopTechnologyAI & MLStartupsProgrammingScienceBusinessFinanceCrypto & Web3World
Back to feed
Programming

How to page beyond openFDA's 25,000-record limit using search_after cursors

0
·1 views

The openFDA adverse event API hard-caps the 'skip' parameter at 25,000, blocking developers who try to paginate large datasets with a simple offset loop. The workaround is to follow the 'Link' response header, which carries a 'search_after' cursor that bypasses the cap entirely. However, setting any non-zero 'skip' value silently degrades the cursor to a plain offset link, sending the loop straight back into the 25,000 wall. Without an API key, the maximum usable page size is 999 records — requests for 1,000 or more return a 403 error citing a missing API key, which also doubles as the daily quota-exceeded message. These behaviors were verified against the live API on July 20, 2026, across both drug and device event endpoints.

Read the full story at DEV Community

This is an AI-generated summary. ShortSingh links to the original source for the complete article.

Discussion (0)

Log in to join the discussion and vote.

Log in

Related stories

0
ProgrammingDEV Community ·

AI Agent Refused to Rewrite Pushed Git History After Diagnosing Its Own Hook's Bad Advice

A developer running an AI-powered publishing agent discovered that a post-commit stop hook incorrectly diagnosed 'Unverified' GitHub badges as an identity problem, when most commits were actually missing cryptographic signatures. The hook prescribed rewriting eight already-pushed commits on main via rebase and amend, which would have required an unauthorized force-push to shared history. Further inspection revealed only one commit had a genuine authorship issue, while the proposed fix would have also set the committer identity to 'Claude', violating the repo's explicit rule against AI attribution in any form. Rather than execute the flawed instructions, the agent logged the issue to a bugs file and flagged it for human review. The developer concluded that any hook output requesting history rewrites on pushed branches or AI identity assignment should be treated as a decision requiring explicit human approval, not automated action.

0 comments Read more at DEV Community
0
ProgrammingDEV Community ·

PyTorch vs TensorFlow: How to Choose the Right Computer Vision Framework

PyTorch and TensorFlow remain the two dominant deep learning frameworks for computer vision, each with distinct strengths suited to different use cases. TensorFlow holds roughly 37% enterprise market share, backed by robust deployment tools like TensorFlow Serving and TensorFlow Lite running across billions of devices. PyTorch has become the default in research, with most recent computer vision papers releasing PyTorch implementations first, and job postings for PyTorch now outpacing TensorFlow. A key PyTorch advantage is its dynamic computation graph, which allows real-time debugging and flexible model iteration without recompilation. The performance gap between the two has also narrowed, with PyTorch 2.0's torch.compile() delivering 20–25% speed improvements on standard architectures like ResNet-50.

0 comments Read more at DEV Community
0
ProgrammingDEV Community ·

Simplex Method Demystified: How the Classic LP Algorithm Moves Toward Optimal Solutions

The simplex method is a foundational algorithm used to solve linear programming (LP) problems, which involve maximizing or minimizing an objective function within resource constraints. Geometrically, LP constraints define a feasible region shaped like a polytope, and the optimal solution always lies at one of its corners. The simplex method works by iteratively moving from corner to corner in the direction of improvement until no better adjacent corner exists, using four key steps per iteration: column scoring, entering variable selection, ratio testing, and pivoting. Understanding the algorithm is valuable not for hand-coding it, but because it helps practitioners write better optimization models and interpret solver outputs from tools like scipy.optimize.linprog or OR-Tools. A free step-by-step solver called Nestixex is available to walk users through the full tableau process on real problems without requiring a signup.

0 comments Read more at DEV Community
0
ProgrammingDEV Community ·

Load Balancing Explained: How Traffic Is Spread Across Multiple Servers

Load balancing is a technique used in computer networks to distribute incoming user requests across multiple servers, preventing any single machine from becoming overloaded. A load balancer sits between users and backend servers, routing each request based on configured rules and algorithms. Common strategies include Round Robin, which cycles requests evenly across servers in sequence, and Least Connections, which directs traffic to the server currently handling the fewest active users. Without load balancing, a surge in traffic — such as thousands of users simultaneously streaming a popular video — can cause slow response times, crashes, or extended downtime. The approach is essential for modern applications that must remain fast and available under heavy or unpredictable user loads.

0 comments Read more at DEV Community