2026-10-13T20:38:36.740993Z https://api.crossref.org/works/10.1137/0222034 ERR URLError
2026-10-13T20:38:38.123607Z https://api.crossref.org/works/10.1145/129712.129736 ERR URLError
2026-10-13T20:38:39.543541Z https://api.crossref.org/works/10.1137/S0097539792225297 ERR URLError
2026-10-13T20:38:40.933889Z https://api.crossref.org/works/10.4171/owr/2005/50 ERR URLError
2026-10-13T20:38:42.298139Z https://api.crossref.org/works/10.1016/j.dam.2016.12.002 ERR URLError
2026-10-13T20:38:44.082222Z https://doi.org/10.24355/dbbs.084-200605170200-19 ERR URLError
2026-10-13T20:38:44.453130Z https://api.crossref.org/works/10.24355/dbbs.084-200605170200-19 ERR URLError
2026-10-13T20:38:45.837781Z https://api.openalex.org/works/https://doi.org/10.24355/dbbs.084-200605170200-19 ERR URLError
2026-10-13T20:38:46.008776Z https://api.openalex.org/works?search=%22blocking%20shortest%20paths%22&per-page=15&select=id,title,publication_year,doi,cited_by_count ERR URLError
2026-10-13T20:38:47.226436Z https://api.openalex.org/works?search=%22increasing%20distances%20in%20graphs%22&per-page=15&select=id,title,publication_year,doi,cited_by_count ERR URLError
2026-10-13T20:38:48.439661Z https://api.openalex.org/works?search=%22shortest%20path%22%20interdiction%20%22three%20terminals%22&per-page=15&select=id,title,publication_year,doi,cited_by_count ERR URLError
2026-10-13T20:38:49.649430Z https://api.openalex.org/works?search=%22length-bounded%22%20multicut&per-page=15&select=id,title,publication_year,doi,cited_by_count ERR URLError
2026-10-13T20:38:50.893327Z https://api.openalex.org/works?search=blocking%20shortest%20paths%20multiway%20cut%20three%20terminals%20NP-hard&per-page=15&select=id,title,publication_year,doi,cited_by_count ERR URLError
2026-10-13T20:38:52.099379Z https://api.openalex.org/works?filter=author.display_name.search:Stefan%20Krause,publication_year:2004-2012&per-page=50&select=id,title,publication_year,doi ERR URLError
2026-10-13T20:38:53.299223Z https://api.semanticscholar.org/graph/v1/paper/search?query=blocking%20shortest%20paths&limit=12&fields=title,year,externalIds,citationCount,venue ERR URLError
2026-10-13T20:38:56.425695Z https://api.semanticscholar.org/graph/v1/paper/search?query=increasing%20distances%20in%20graphs%20Krause&limit=12&fields=title,year,externalIds,citationCount,venue ERR URLError
2026-10-13T20:38:59.542839Z https://api.semanticscholar.org/graph/v1/paper/search?query=shortest%20path%20interdiction%20multiple%20pairs%20unit%20increase&limit=12&fields=title,year,externalIds,citationCount,venue ERR URLError
2026-10-13T20:39:02.647680Z https://api.semanticscholar.org/graph/v1/paper/search?query=length-bounded%20multicut&limit=12&fields=title,year,externalIds,citationCount,venue ERR URLError
2026-10-13T20:39:05.787859Z https://api.semanticscholar.org/graph/v1/paper/search?query=multiway%20cut%20geodesic%20shortest%20paths%20three%20terminals&limit=12&fields=title,year,externalIds,citationCount,venue ERR URLError
2026-10-13T20:39:09.010396Z https://api.semanticscholar.org/graph/v1/paper/DOI:10.24355/dbbs.084-200605170200-19?fields=title,citationCount,citations.title,citations.year ERR URLError
2026-10-13T20:39:12.555474Z http://export.arxiv.org/api/query?search_query=all%3A%22blocking%20shortest%20paths%22&max_results=15 ERR URLError
2026-10-13T20:39:15.891443Z http://export.arxiv.org/api/query?search_query=all%3A%22shortest%20path%20interdiction%22%20AND%20all%3Apairs&max_results=15 ERR URLError
2026-10-13T20:39:19.477048Z http://export.arxiv.org/api/query?search_query=all%3A%22length-bounded%22%20AND%20all%3Amulticut&max_results=15 ERR URLError
2026-10-13T20:39:22.874904Z http://export.arxiv.org/api/query?search_query=all%3A%22length-bounded%20cut%22&max_results=15 ERR URLError
2026-10-13T20:39:26.318135Z http://export.arxiv.org/api/query?search_query=all%3A%22shortest%20path%22%20AND%20all%3A%22multiway%20cut%22&max_results=15 ERR URLError
2026-10-13T20:39:29.689416Z http://export.arxiv.org/api/query?search_query=all%3A%22increasing%20distances%22%20AND%20all%3Agraph&max_results=15 ERR URLError
2026-10-13T20:39:33.122184Z http://export.arxiv.org/api/query?search_query=all%3A%22most%20vital%20edges%22%20AND%20all%3A%22shortest%20path%22%20AND%20all%3Apairs&max_results=15 ERR URLError
2026-10-13T20:39:36.607764Z http://export.arxiv.org/api/query?search_query=all%3A%22geodesic%22%20AND%20all%3A%22multiway%20cut%22&max_results=15 ERR URLError
2026-10-13T20:39:39.933672Z https://api.zbmath.org/v1/document/_search?search_string=ti%3A%22blocking%20shortest%20paths%22&results_per_page=20 ERR URLError
2026-10-13T20:39:41.225544Z https://api.zbmath.org/v1/document/_search?search_string=an%3A1238.05002&results_per_page=20 ERR URLError
2026-10-13T20:39:42.666956Z https://api.zbmath.org/v1/document/_search?search_string=au%3AKrause%2C%20Stefan%20%26%20py%3A2004-2012&results_per_page=20 ERR URLError
2026-10-13T20:39:43.948696Z https://api.zbmath.org/v1/document/_search?search_string=ti%3A%22length-bounded%22%20%26%20ti%3Acut&results_per_page=20 ERR URLError
2026-10-13T20:39:45.140036Z https://api.zbmath.org/v1/document/_search?search_string=ti%3A%22shortest%20path%22%20%26%20ti%3Ainterdiction%20%26%20py%3A2006-2026&results_per_page=20 ERR URLError
2026-10-13T20:39:46.325571Z https://api.zbmath.org/v1/document/_search?search_string=rf%3AKrause%20%26%20ti%3Adistances%20%26%20py%3A2006-2026&results_per_page=20 ERR URLError
# retry with curl after urllib failures 2026-10-13T20:40:20Z
2026-10-13T20:40:21.272990Z https://api.crossref.org/works/10.1137/0222034 200
2026-10-13T20:40:23.030102Z https://api.crossref.org/works/10.1145/129712.129736 200
2026-10-13T20:40:24.620939Z https://api.crossref.org/works/10.1137/S0097539792225297 200
2026-10-13T20:40:26.410502Z https://api.crossref.org/works/10.4171/owr/2005/50 200
2026-10-13T20:40:28.211681Z https://api.crossref.org/works/10.1016/j.dam.2016.12.002 200
2026-10-13T20:40:29.599564Z https://doi.org/10.24355/dbbs.084-200605170200-19 302
2026-10-13T20:40:30.228372Z https://api.crossref.org/works/10.24355/dbbs.084-200605170200-19 404
2026-10-13T20:40:32.405424Z https://api.openalex.org/works/https://doi.org/10.24355/dbbs.084-200605170200-19 200
2026-10-13T20:40:32.902293Z https://api.openalex.org/works?filter=cites:W2147325817&per-page=50 200
2026-10-13T20:40:34.968643Z https://api.openalex.org/works?search=%22blocking%20shortest%20paths%22&per-page=15&select=id,title,publication_year,doi,cited_by_count 200
2026-10-13T20:40:36.639895Z https://api.openalex.org/works?search=%22increasing%20distances%20in%20graphs%22&per-page=15&select=id,title,publication_year,doi,cited_by_count 200
2026-10-13T20:40:38.377093Z https://api.openalex.org/works?search=%22shortest%20path%22%20interdiction%20%22three%20terminals%22&per-page=15&select=id,title,publication_year,doi,cited_by_count 200
2026-10-13T20:40:40.031017Z https://api.openalex.org/works?search=%22length-bounded%22%20multicut&per-page=15&select=id,title,publication_year,doi,cited_by_count 200
2026-10-13T20:40:41.769765Z https://api.openalex.org/works?search=blocking%20shortest%20paths%20multiway%20cut%20three%20terminals%20NP-hard&per-page=15&select=id,title,publication_year,doi,cited_by_count 200
2026-10-13T20:40:43.613695Z https://api.openalex.org/works?filter=author.display_name.search:Stefan%20Krause,publication_year:2004-2012&per-page=50&select=id,title,publication_year,doi 400
2026-10-13T20:40:45.605474Z https://api.semanticscholar.org/graph/v1/paper/search?query=blocking%20shortest%20paths&limit=12&fields=title,year,externalIds,citationCount,venue 429
2026-10-13T20:40:48.763337Z https://api.semanticscholar.org/graph/v1/paper/search?query=increasing%20distances%20in%20graphs%20Krause&limit=12&fields=title,year,externalIds,citationCount,venue None
2026-10-13T20:40:52.158701Z https://api.semanticscholar.org/graph/v1/paper/search?query=shortest%20path%20interdiction%20multiple%20pairs%20unit%20increase&limit=12&fields=title,year,externalIds,citationCount,venue 429
2026-10-13T20:40:55.519057Z https://api.semanticscholar.org/graph/v1/paper/search?query=length-bounded%20multicut&limit=12&fields=title,year,externalIds,citationCount,venue 429
2026-10-13T20:40:59.341135Z https://api.semanticscholar.org/graph/v1/paper/search?query=multiway%20cut%20geodesic%20shortest%20paths%20three%20terminals&limit=12&fields=title,year,externalIds,citationCount,venue 429
2026-10-13T20:41:02.835552Z https://api.semanticscholar.org/graph/v1/paper/DOI:10.24355/dbbs.084-200605170200-19?fields=title,citationCount,citations.title,citations.year 404
2026-10-13T20:41:06.809661Z http://export.arxiv.org/api/query?search_query=all%3A%22blocking%20shortest%20paths%22&max_results=15 200
2026-10-13T20:41:10.569349Z http://export.arxiv.org/api/query?search_query=all%3A%22shortest%20path%20interdiction%22%20AND%20all%3Apairs&max_results=15 200
2026-10-13T20:41:14.401492Z http://export.arxiv.org/api/query?search_query=all%3A%22length-bounded%22%20AND%20all%3Amulticut&max_results=15 200
2026-10-13T20:41:18.634356Z http://export.arxiv.org/api/query?search_query=all%3A%22length-bounded%20cut%22&max_results=15 200
2026-10-13T20:41:22.573039Z http://export.arxiv.org/api/query?search_query=all%3A%22shortest%20path%22%20AND%20all%3A%22multiway%20cut%22&max_results=15 200
2026-10-13T20:41:29.419588Z http://export.arxiv.org/api/query?search_query=all%3A%22increasing%20distances%22%20AND%20all%3Agraph&max_results=15 200
2026-10-13T20:41:33.291775Z http://export.arxiv.org/api/query?search_query=all%3A%22most%20vital%20edges%22%20AND%20all%3A%22shortest%20path%22%20AND%20all%3Apairs&max_results=15 200
2026-10-13T20:41:37.612999Z http://export.arxiv.org/api/query?search_query=all%3A%22geodesic%22%20AND%20all%3A%22multiway%20cut%22&max_results=15 200
2026-10-13T20:41:47.047768Z https://api.zbmath.org/v1/document/_search?search_string=ti%3A%22blocking%20shortest%20paths%22&results_per_page=20 404
2026-10-13T20:41:49.427458Z https://api.zbmath.org/v1/document/_search?search_string=an%3A1238.05002&results_per_page=20 200
2026-10-13T20:41:51.976564Z https://api.zbmath.org/v1/document/_search?search_string=au%3AKrause%2C%20Stefan%20%26%20py%3A2004-2012&results_per_page=20 200
2026-10-13T20:41:54.447248Z https://api.zbmath.org/v1/document/_search?search_string=ti%3A%22length-bounded%22%20%26%20ti%3Acut&results_per_page=20 200
2026-10-13T20:41:57.535879Z https://api.zbmath.org/v1/document/_search?search_string=ti%3A%22shortest%20path%22%20%26%20ti%3Ainterdiction%20%26%20py%3A2006-2026&results_per_page=20 200
2026-10-13T20:41:59.901708Z https://api.zbmath.org/v1/document/_search?search_string=rf%3AKrause%20%26%20ti%3Adistances%20%26%20py%3A2006-2026&results_per_page=20 404
2026-10-13T20:43:21.413485Z http://export.arxiv.org/api/query?id_list=2509.01413,1511.02801,1910.03409,1607.05133,1512.00333,2607.29649,1807.09389&max_results=20 200
2026-10-13T20:43:25.793213Z http://export.arxiv.org/api/query?search_query=all%3A%22shortest%20paths%22%20AND%20all%3A%22hitting%20set%22%20AND%20all%3Apairs&max_results=20 200
2026-10-13T20:43:29.655521Z http://export.arxiv.org/api/query?search_query=all%3A%22shortest%20path%22%20AND%20all%3Ablocking%20AND%20all%3Apairs%20AND%20all%3Aedges&max_results=20 200
2026-10-13T20:43:33.358295Z http://export.arxiv.org/api/query?search_query=abs%3A%22L-bounded%20cut%22&max_results=20 200
2026-10-13T20:43:38.450708Z http://export.arxiv.org/api/query?search_query=abs%3A%22length-bounded%22%20AND%20abs%3Acut&max_results=20 200
2026-10-13T20:43:42.936826Z http://export.arxiv.org/api/query?search_query=abs%3A%22shortest%20path%22%20AND%20abs%3Ainterdiction%20AND%20abs%3A%22multiple%20pairs%22&max_results=20 200
2026-10-13T20:43:46.804251Z http://export.arxiv.org/api/query?search_query=abs%3A%22shortest%20paths%22%20AND%20abs%3A%22multiway%20cut%22&max_results=20 200
2026-10-13T20:43:50.542440Z http://export.arxiv.org/api/query?search_query=abs%3A%22geodetic%22%20AND%20abs%3Ahitting&max_results=20 200
2026-10-13T20:43:54.202976Z http://export.arxiv.org/api/query?search_query=abs%3A%22distance%22%20AND%20abs%3A%22edge%20deletion%22%20AND%20abs%3A%22NP-hard%22%20AND%20abs%3Aterminals&max_results=20 200
2026-10-13T20:43:57.877638Z https://api.openalex.org/works/https://doi.org/10.1145/3622941?select=title,publication_year,abstract_inverted_index,authorships 200
2026-10-13T20:43:59.289817Z https://api.openalex.org/works/https://doi.org/10.1145/3179407?select=title,publication_year,abstract_inverted_index,authorships 200
2026-10-13T20:44:00.735684Z https://api.openalex.org/works/https://doi.org/10.1145/1868237.1868241?select=title,publication_year,abstract_inverted_index,authorships 200
2026-10-13T20:44:02.834070Z https://api.openalex.org/works/https://doi.org/10.1007/s00453-018-0408-7?select=title,publication_year,abstract_inverted_index,authorships 200
2026-10-13T20:44:04.288932Z https://api.openalex.org/works/https://doi.org/10.1016/j.jcss.2021.12.002?select=title,publication_year,abstract_inverted_index,authorships 200
2026-10-13T20:44:06.227278Z https://api.openalex.org/works/https://doi.org/10.1137/0222034?select=title,publication_year,abstract_inverted_index,authorships 200
2026-10-13T20:44:08.300457Z https://api.openalex.org/works/https://doi.org/10.1007/978-3-540-35751-6_23?select=title,publication_year,abstract_inverted_index,authorships 404
2026-10-13T20:44:10.558879Z https://api.openalex.org/works?search=%22shortest%20paths%22%20%22hitting%20set%22%20pairs%20NP-hard&per-page=10&select=id,title,publication_year,doi 200
2026-10-13T20:44:12.378843Z https://api.openalex.org/works?search=%22most%20vital%20edges%22%20%22shortest%20path%22%20%22several%20pairs%22&per-page=10&select=id,title,publication_year,doi 200
2026-10-13T20:44:14.046039Z https://api.openalex.org/works?search=%22Krause%22%20%22increasing%20distances%20in%20graphs%22&per-page=10&select=id,title,publication_year,doi 200
2026-10-13T20:44:15.675084Z https://api.openalex.org/works?search=%22blocking%20shortest%20paths%22%20Bienstock&per-page=10&select=id,title,publication_year,doi 200
2026-10-13T20:44:17.328881Z https://api.openalex.org/works?search=shortest%20path%20%22three%20pairs%22%20NP-hard%20edges%20deletion%20distance&per-page=10&select=id,title,publication_year,doi 200
2026-10-13T20:44:27.582316Z https://api.semanticscholar.org/graph/v1/paper/search?query=blocking%20shortest%20paths%20Krause&limit=10&fields=title,year,externalIds,citationCount 200
2026-10-13T20:44:35.968634Z https://api.semanticscholar.org/graph/v1/paper/search?query=shortest%20path%20blocking%20three%20terminals%20NP-hard&limit=10&fields=title,year,externalIds,citationCount 429
2026-10-13T20:51:38Z https://doi.org/10.1137/S0097539792225297 403 https://epubs.siam.org/doi/10.1137/S0097539792225297
