frontpage.
newsnewestaskshowjobs

Open Source @Github

fp.

Sebastian Raschka's from-scratch video course on building reasoning models

https://magazine.sebastianraschka.com/p/building-reasoning-models
250•sgiannopoulos•2h ago•28 comments

CSS-Tricks has a new owner

https://css-tricks.com/css-tricks-has-a-new-owner/
144•edent•1h ago•30 comments

Anthropic S-1

https://www.sec.gov/Archives/edgar/data/2130357/000162828026067168/anthropicpbc-sx1.htm
1042•SiNTEx•4h ago•951 comments

The Git Forge for Agent-Human Collaboration

https://entire.com/blog/the-git-forge-for-agent-human-collaboration
23•lizziepika•23m ago•2 comments

SIMD-accelerated computer vision on a $2 microcontroller

https://shraiwi.com/blog/simd-fast-esp32s3/
73•zdw•19h ago•19 comments

Diamond Transistor

https://www.df.com/diamond-transistor
36•Gravityloss•3d ago•21 comments

Pharo 14

https://pharo.org/news/2026-10-26-Pharo14Release.html
155•xkriva11•6h ago•36 comments

Blaise Pascal invented fixed route public transport (2024)

https://humantransit.org/2024/12/one-of-the-greatest-inventions-in-the-history-of-human-transport...
193•skadamat•3d ago•90 comments

Fixing Tool-Call Accuracy in vLLM

https://www.ubicloud.com/blog/fixing-tool-call-accuracy-in-vllm
116•coffeemug•4h ago•61 comments

Birdwatching rewires the brain and slows cognitive decline

https://www.bbc.com/future/article/20261019-birdwatching-rewires-the-brain-and-slows-cognitive-de...
384•cisc•2d ago•159 comments

Switzerland. Block by block. At 1:1 scale

https://blocks.manifold3d.ch/
393•theanonymousone•9h ago•185 comments

Colorfigures

https://april-zhu.com/colorfigures
92•the-mitr•3d ago•13 comments

Partyline: A group voice application for Reticulum, built on LXST

https://github.com/RFnexus/partyline
30•iamnothere•3h ago•6 comments

Concerning behavior from a popular open-weight AI model

https://cohere.com/blog/concerning-behaviour-popular-open-weight-ai-model
42•matthieu_bl•1h ago•4 comments

Microsoft offers mass buyouts for roughly a quarter of its workforce

https://www.seattletimes.com/business/microsoft/microsoft-offers-mass-buyouts-for-roughly-a-quart...
314•doctorzook•2h ago•258 comments

Stalwart v1.0: The Fastest Mail Server on the Planet

https://stalw.art/blog/stalwart-1-0/
30•StalwartLabs•1h ago•10 comments

Websites Should Be Printable

https://brennenputh.me/blog/printable-websites/
202•bagatelle•7h ago•143 comments

Show HN: TitleArt – Make text like it's 1997

https://titleart.dvy.io/
360•davidbarker•14h ago•68 comments

An incremental approach to JIT construction

https://dl.acm.org/doi/10.1145/3830440.3832304
3•andsoitis•2d ago•0 comments

Dolly Parton's Imagination Library

https://imaginationlibrary.com/
654•jumploops•23h ago•106 comments

Brown student maps the hidden global labor powering AI

https://www.brown.edu/news/2026-10-26/ai-data-workers
118•cdrnsf•4h ago•99 comments

Behind the scenes at the NeXT Computer office

https://exhibits.stanford.edu/menuez/browse/next-computer-inc?per_page=96&sort=pub_year_isi+asc%2...
228•Austin_Conlon•14h ago•134 comments

Reinventing the Pencil Sharpener [video]

https://www.youtube.com/watch?v=0Gi5Z51KdUE
26•surprisetalk•3d ago•1 comments

PaperPilot – Zero-Cloud, Pure-Rust PDF Engine with WASM and MCP

https://github.com/KrushnaVardhanReddy/PaperPilot
216•vardhan1237•14h ago•77 comments

Show HN: A Truly Modular Keyboard

https://github.com/notaroomba/keybytes
253•NotARoomba•1d ago•89 comments

Overgrown, when plants invade your abandoned tabs

https://charliegerard.dev/blog/overgrown-extension/
385•speckx•4d ago•128 comments

PhysicsForums and the Dead Internet Theory (2025)

https://hallofdreams.org/posts/physicsforums/
73•bmacho•2d ago•41 comments

Growing Trees

https://brashandplucky.com/2026/10/15/growing-trees.html
174•ibobev•3d ago•24 comments

ChatGPT Keeps Telling People 404 Media Can Solve Their Tech Support Problems

https://www.404media.co/chatgpt-keeps-telling-people-404-media-can-solve-their-tech-support-probl...
7•cdrnsf•14m ago•0 comments

Attention Is Not What You Need (2025)

https://arxiv.org/abs/2512.19428
180•westurner•17h ago•62 comments
Open in hackernews

Computational Complexity of Air Travel Planning [pdf] (2003)

http://www.demarcken.org/carl/papers/ITA-software-travel-complexity/ITA-software-travel-complexity.pdf
76•rochoa•1y ago

Comments

buildsjets•1y ago
This is well over 20 years old and is based on pre 9/11 flight data. I would suspect that a lot has changed since then. So proceed with no caution at all.
gwern•1y ago
Since these sorts of things usually only get more and more complex over time, I would guess that it's all still true, but much more so.
throw0101b•1y ago
(2003)
throw0101b•1y ago
The PDF was produced by ITA, which famously used Common Lisp:

* https://en.wikipedia.org/wiki/ITA_Software

From 2001, a message from the same author as the linked paper:

> (Here's an email Carl de Marcken of ITA Software sent to a friend, describing their experiences using Lisp in one of the software industry's most demanding applications.)

* https://www.paulgraham.com/carl.html

Qem•1y ago
Are there any public, open, comprehensive datasets on flights?
dieselerator•1y ago
> Are there any public, open, comprehensive datasets on flights?

Airlines and commercial aviation operators schedule their own flights. That is a dynamic schedulle. So, perhaps there is no "comprehensive data set".

However, FlightAware makes publicly available scheduled and completed flight data over many routes in the USA. You can search by route and get a list of flights.

Flight information includes filed departure time, route of flight, and speed. For completed flights actual time, altitude, and route is shown. For example, a search on the route Dallas/Fort Worth to Austin lists 45 flights.

I hope that helps.

foundart•1y ago
A very interesting dive into, as the title says, the computational complexity of air travel planning. Graph algorithms with lots of complexity added due to the wide variety of fare conditions that airlines have dreamt up over the years.

The article may be from 2003 but I would call it an evergreen. While I imagine some of the details have changed since then, I suspect that the complexity has only grown since then.

foundart•1y ago
It makes me wonder: Would an airline that drastically simplified its fares be more likely to appear in flight search results?

Simplifying the fares would make it less computationally expensive and, in theory, could take fewer steps to answer a flight planning query.

Imagine a flight search planner that, say, fanned out N airline-specific workers when handling a planning query and then displayed to the user whatever results it got back within some time limit. If FooAir had simple fares, the FooAir searcher would likely run faster than searchers for other airlines. Thus it would be more likely to return results for more queries, assuming the deadline is fairly tight because of usability metrics. (People don't tend to stick around waiting for slow results.)

sjburt•1y ago
At least a few years ago (~2014), the fare search was actually nearly instant, but all major airfare search sites added a delay because customers had the impression they were getting a better deal when they had to wait. It seems like the delay has been dialed back lately.
teleforce•1y ago
This is a very popular article that get submitted every now and then (nearly every year) [1].

I think this kind of problem would be a very nice for logic, optimization and constraint programming that probably can be solved with modern tools like Google OR-Tool or Monash University MiniZinc [1],[2],[3].

[1] Past:

https://hn.algolia.com/?query=Computational%20Complexity%20o...

[2] Logic, Optimization, and Constraint Programming: A Fruitful Collaboration - John Hooker - CMU (2023) [video]:

https://www.youtube.com/live/TknN8fCQvRk

[3] Google OR-Tools:

https://developers.google.com/optimization

[4] MiniZinc:

https://www.minizinc.org/