{"format":2,"method":"deterministic","version":"7cb87e5a20ad","generated_at":"2026-10-27T13:55:50.526641Z","reason":null,"reason_detail":null,"provenance":"verificada_contra_la_fuente","claims":[{"id":"D1","fact_id":"A10","value":20.0,"said_as":"veinte","text":"Cita textual de Edsger Dijkstra en entrevista con Philip L. Frana, Communications of the ACM, 2001: «What is the shortest way to travel from Rotterdam to Groningen, in general: from given city to given city. It is the algorithm for the shortest path, which I designed in about twenty minutes. One morning I was shopping in Amsterdam with my young fiancée, and tired, we sat down on the café terrace to drink a cup of coffee and I was just thinking about whether I could do this, and I then designed the algorithm for the shortest path. As I said, it was a twenty-minute invention. In fact, it was published in '59, three years later. The publication is still readable, it is, in fact, quite nice. One of the reasons that it is so nice was that I designed it without pencil and paper. I learned later that one of the advantages of designing without pencil and paper is that you are almost forced to avoid all avoidable complexities. Eventually, that algorithm became to my great amazement, one of the cornerstones of my fame.»","period":"2001","said_in":[{"scene":1,"second":null}],"owner_scene":1,"backing":"respaldada_en_su_escena","on_screen":"drawn","citation":{"title":"Dijkstra's algorithm","url":"https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm","doi":null,"as_of":"2001"}},{"id":"D2","fact_id":"A9","value":64.0,"said_as":"64","text":"Dijkstra diseñó e implementó el algoritmo para la computadora ARMAC sobre un mapa de transporte simplificado de 64 ciudades de los Países Bajos. Limitó el número a 64 para que 6 bits fueran suficientes para codificar el número de ciudad.","period":"1956","said_in":[{"scene":11,"second":null}],"owner_scene":11,"backing":"respaldada_en_su_escena","on_screen":"drawn","citation":{"title":"Dijkstra's algorithm","url":"https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm","doi":null,"as_of":"1956"}}],"sources":[{"title":"Dijkstra's algorithm","url":"https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm","doi":null,"authors":[],"role":"principal","read":true,"claims":["D1","D2"]},{"title":"Algoritmo de Dijkstra - Wikipedia, la enciclopedia libre","url":"https://es.wikipedia.org/wiki/Algoritmo_de_Dijkstra","doi":null,"authors":[],"role":"declarada","read":true,"claims":[]}],"summary":{"codex":"present","figures_total":2,"backed_in_scene":2,"derived":0,"unbacked":0,"context_only":0,"figures_on_screen":{"drawn":2,"approx":0,"withheld":0,"notShown":0},"plotted_values_approx":0,"plotted_values_withheld":0,"figures_outside_the_cut":0},"doi":null,"certifications":[],"claimsDigest":"dc18233b9246319b54d20eef99a6520387cf01456a128610c14cc822ee7f6751"}