{"format":2,"method":"deterministic","version":"3b7f66f99142","generated_at":"2026-10-27T13:58:25.182922Z","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.»","period":"2001","said_in":[{"scene":0,"second":null},{"scene":10,"second":null}],"owner_scene":0,"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":null,"value":14.0,"said_as":"catorce","text":null,"period":null,"said_in":[{"scene":7,"second":null}],"owner_scene":7,"backing":"sin_respaldo","on_screen":"notShown","citation":null},{"id":"D3","fact_id":null,"value":13.0,"said_as":"trece","text":null,"period":null,"said_in":[{"scene":7,"second":null}],"owner_scene":7,"backing":"sin_respaldo","on_screen":"notShown","citation":null},{"id":"D4","fact_id":"A9","value":64.0,"said_as":"sesenta y cuatro","text":"Dijkstra 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":null,"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":null}}],"sources":[{"title":"Dijkstra's algorithm","url":"https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm","doi":null,"authors":[],"role":"principal","read":true,"claims":["D1","D4"]},{"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":4,"backed_in_scene":2,"derived":0,"unbacked":2,"context_only":0,"figures_on_screen":{"drawn":2,"approx":0,"withheld":0,"notShown":2},"plotted_values_approx":0,"plotted_values_withheld":2,"figures_outside_the_cut":0},"doi":null,"certifications":[],"claimsDigest":"e9ce73e1032213dfea6f65fa9f49e267defc9de0966aaba119d2fa512f46ba24"}