{"work":{"id":"0f70e541-c167-448f-b79e-ae499cdfe918","openalex_id":"https://openalex.org/W2169528473","doi":"10.1007/bf01386390","arxiv_id":null,"raw_key":null,"title":"APACrefauthors \\ 1959","authors":[{"given":"E. W.","family":"Dijkstra","sequence":"first","affiliation":[]}],"authors_text":"Dijkstra1959 APACrefauthors Dijkstra, E W","year":1959,"venue":"Numerische Mathematik","abstract":null,"external_url":"https://doi.org/10.1007/bf01386390","cited_by_count":18164,"metadata_source":"doi_reference","metadata_fetched_at":"2026-05-23T22:33:32.011706+00:00","pith_arxiv_id":null,"created_at":"2026-05-08T23:34:24.622640+00:00","updated_at":"2026-06-05T21:23:00.469572+00:00","title_quality_ok":false,"display_title":"APACrefauthors \\ 1959","render_title":"APACrefauthors \\ 1959"},"hub":{"state":{"work_id":"0f70e541-c167-448f-b79e-ae499cdfe918","tier":"super_hub","tier_reason":"100+ Pith inbound or 10,000+ external citations","pith_inbound_count":13,"external_cited_by_count":18164,"distinct_field_count":10,"first_pith_cited_at":"2024-08-01T19:31:04+00:00","last_pith_cited_at":"2026-05-20T03:48:31+00:00","author_build_status":"needed","summary_status":"needed","contexts_status":"needed","graph_status":"needed","ask_index_status":"needed","reader_status":"not_needed","recognition_status":"not_needed","updated_at":"2026-06-06T11:30:46.494714+00:00","tier_text":"super_hub"},"tier":"super_hub","role_counts":[{"context_role":"background","n":2},{"context_role":"method","n":2}],"polarity_counts":[{"context_polarity":"background","n":2},{"context_polarity":"use_method","n":2}],"runs":{"ask_index":{"job_type":"ask_index","status":"succeeded","result":{"title":"APACrefauthors \\ 1959","claims":[{"claim_text":"in Section IV, we follow the former approach to ensure that the BSA tables can be computed via cooperation between nodes. The communication complexity of the distributed discovery process isO(|V|.|E|), due to the flooding of connectivity information across the network. After topology discovery, each node computes shortest paths to all BSA resources using Dijkstra's algorithm [26] with a binary heap, resulting in a computational complexity ofO((|V|+|E|) log|V|)per node. However, regardless of the","claim_type":"method","confidence":0.9,"evidence_strength":"citation_context"},{"claim_text":"BOUNDARY CONTAMINATION AND CHOICE OFL sub The choice of the boundary box for the calculation of pressure gradient,L sub, is data-driven. Fig. S4(b) shows that the recovered Darcy slope (fit over the linear-regime cases) rises monotonically asL sub/Ldomain shrinks, while the intermittent slope (fit over the sub-linear-regime cases) is approximately flat acrossL sub/Ldomain ∈ [0.30,0.60]. The two slopes simultaneously match the Gaoet al.reference values atL sub/Ldomain = 0.50. We therefore adoptL ","claim_type":"method","confidence":0.85,"evidence_strength":"citation_context"},{"claim_text":"nρ(ˆµn, µn,h)21{nρ(ˆµn, µn,h)2 > A} \u0003 = 0. Theorem 6.5(Local asymptotic minimaxity of the profiled location estimator).Assume that X1, X2, . . .are i.i.d. from the local anisotropic HWN experiments defined above and that Assump- 13 tion 4.3 holds. LetZ∼N(0,I −1 αα·β). Then, for every fixedA <∞andc <∞, lim n→∞ sup ∥h∥≤c En,h h A∧nρ ˆµn, µn,h \u00012i −E[A∧ ∥Z∥ 2] = 0.(27) Consequently, the profile MLE attains the local asymptotic minimax bound for every truncated squared geodesic loss. Additionally, i","claim_type":"background","confidence":0.8,"evidence_strength":"citation_context"},{"claim_text":"staying on the water surface and we use Dijkstra's algorithm [72] to find the shortest path. Firefighting and rescue boats in Germany must comply with German standard DIN 14961 [ 75], defining its technical requirements. Of the various boat models, we selected the highest maximum speed we could find, 70 kilometers per hour for an upgraded high-tech boat [ 76], as a reference speed to finally compute boat travel times ¯δw,τ . Note that this is a very optimistic estimate, as most lifeboats with eq","claim_type":"background","confidence":0.7,"evidence_strength":"citation_context"}],"why_cited":"Pith tracks APACrefauthors \\ 1959 because it crossed a citation-hub threshold. Current citing contexts most often use it as background evidence (2 contexts).","role_counts":[{"n":2,"context_role":"background"},{"n":2,"context_role":"method"}]},"error":null,"updated_at":"2026-06-05T22:40:26.481929+00:00"},"author_expand":{"job_type":"author_expand","status":"succeeded","result":{"authors_linked":[{"id":"8fe854e6-1202-41a8-928e-07c620b56edb","orcid":null,"display_name":"E. W. Dijkstra"}]},"error":null,"updated_at":"2026-06-05T22:30:33.484292+00:00"},"context_extract":{"job_type":"context_extract","status":"succeeded","result":{"enqueued_papers":25},"error":null,"updated_at":"2026-06-05T22:30:24.482748+00:00"},"graph_features":{"job_type":"graph_features","status":"succeeded","result":{"co_cited":[{"title":"2003 , keywords =","work_id":"090d8dc7-3c58-4328-9417-e7d640a049d5","shared_citers":4},{"title":"2010 , note =","work_id":"aa219abe-2334-40b0-94c0-c7b070cfc332","shared_citers":4},{"title":"2012 , note =","work_id":"d396eca2-e55f-48f8-bec3-e086f85eed7a","shared_citers":4},{"title":"2022 , note =","work_id":"801a2b39-ffba-4cf3-916d-aae2847dab53","shared_citers":4},{"title":"2024 , note =","work_id":"6d65f903-5906-49dd-8bf5-ad25e6def601","shared_citers":4},{"title":"ACM Computing Surveys , author =","work_id":"ef20f685-67d1-44d0-a87f-eaa087cfd63d","shared_citers":4},{"title":"ACM Transactions on Graphics , author =","work_id":"055301d6-5966-48c7-b3d7-390a9f3cf3d2","shared_citers":4},{"title":"A Gentle Introduction to Conformal Prediction and Distribution-Free Uncertainty Quantification","work_id":"7721c193-e1ff-4cac-a0b6-ced585d69d3d","shared_citers":4},{"title":"A kernel method for the two-sample-problem , volume =","work_id":"3283db88-5ae0-44f6-9919-ad352ea36cb1","shared_citers":4},{"title":"Alimentary Pharmacology & Therapeutics , author =","work_id":"6f9c4d6b-d533-4cb2-a8d5-c8c3cb46283d","shared_citers":4},{"title":"American Economic Review , author =","work_id":"71ac31be-a75a-4259-82b0-a44054ecff86","shared_citers":4},{"title":"American Political Science Review , author =","work_id":"f8de7511-4535-4f3f-b732-ce6283f992c6","shared_citers":4},{"title":"and Falorsi, Luca and Cao, Nicola De and Kipf, Thomas and Tomczak, Jakub M","work_id":"7164f439-c1a9-40af-8fd3-1df0d25bd03f","shared_citers":4},{"title":"and Judin, David B","work_id":"3ca94a05-6f7d-4e7e-a8fa-86858f9384bd","shared_citers":4},{"title":"and Mahony, R","work_id":"efd6c42d-11d5-43d9-b19e-80acf30c8223","shared_citers":4},{"title":"and Pedersen, M.S","work_id":"7585bf27-fc3d-4162-8980-bfe8660c3c80","shared_citers":4},{"title":"and Peyré, G","work_id":"c81e09e5-3637-4a6e-809f-7044fd147917","shared_citers":4},{"title":"and Rizzo, Maria L","work_id":"e4e34417-2a97-45f7-9207-e02ff369a924","shared_citers":4},{"title":"and Ye, Yinyu , year =","work_id":"9682b451-196e-4bbb-b503-7740c8863d30","shared_citers":4},{"title":"and Zha, Hongyuan , editor =","work_id":"63d53723-ad38-41d8-8e5d-04c3af2c001f","shared_citers":4},{"title":"An in depth look at the","work_id":"dd72cc9d-9eb5-422a-bf19-93932af5e037","shared_citers":4},{"title":"Annales de l'institut Henri Poincaré , author =","work_id":"c2a2d777-bf84-4329-8c9f-cc54c844625c","shared_citers":4},{"title":"Annals of Operations Research , author =","work_id":"3ff4b138-bec0-478c-b619-39a4719a7cc9","shared_citers":4},{"title":"Annual Review of Statistics and Its Application , author =","work_id":"b7c9cd54-2a1d-4682-bb33-064108e269c7","shared_citers":4}],"time_series":[{"n":1,"year":2024},{"n":12,"year":2026}],"dependency_candidates":[{"n":1,"role":"method","polarity":"use_method","paper_title":"Intermittent two-phase flow in porous media: insights from pore-scale direct numerical simulation","primary_cat":"physics.flu-dyn","context_text":"BOUNDARY CONTAMINATION AND CHOICE OFL sub The choice of the boundary box for the calculation of pressure gradient,L sub, is data-driven. Fig. S4(b) shows that the recovered Darcy slope (fit over the linear-regime cases) rises monotonically asL sub/Ldomain shrinks, while the intermittent slope (fit over the sub-linear-regime cases) is approximately flat acrossL sub/Ldomain ∈ [0.30,0.60]. The two slopes simultaneously match the Gaoet al.reference values atL sub/Ldomain = 0.50. We therefore adoptL sub/Ldomain = 0.50 (that is, 25% ex- cluded from each side) as the analysis window through- out. This choice is large enough to fully exclude the inlet- peak (x/L <0.15) and outlet-relaxation (x/L >0.90) zones, but small enough that the linear regression re-","citing_arxiv_id":"2605.11991"},{"n":1,"role":"method","polarity":"use_method","paper_title":"A Distributed Switching Protocol for Quantum Networks","primary_cat":"quant-ph","context_text":"in Section IV, we follow the former approach to ensure that the BSA tables can be computed via cooperation between nodes. The communication complexity of the distributed discovery process isO(|V|.|E|), due to the flooding of connectivity information across the network. After topology discovery, each node computes shortest paths to all BSA resources using Dijkstra's algorithm [26] with a binary heap, resulting in a computational complexity ofO((|V|+|E|) log|V|)per node. However, regardless of the approach for offline computing the BSA tables, the decisions for reserving paths and BSAs for all requests are made cooperatively between the end nodes and switches in the network, as shown in the next section. ... Switch 2 QC2 QC1 (Lead) Switch 1 .","citing_arxiv_id":"2605.07295"}]},"error":null,"updated_at":"2026-06-05T22:30:16.490333+00:00"},"identity_refresh":{"job_type":"identity_refresh","status":"succeeded","result":{"items":[{"title":"Qwen3 Technical Report","outcome":"unchanged","work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e","resolver":"local_arxiv","confidence":0.98,"old_work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e"}],"counts":{"fixed":0,"merged":0,"unchanged":1,"quarantined":0,"needs_external_resolution":0},"errors":[],"attempted":1},"error":null,"updated_at":"2026-06-05T22:30:16.441439+00:00"},"role_polarity":{"job_type":"role_polarity","status":"succeeded","result":{"title":"APACrefauthors \\ 1959","claims":[{"claim_text":"in Section IV, we follow the former approach to ensure that the BSA tables can be computed via cooperation between nodes. The communication complexity of the distributed discovery process isO(|V|.|E|), due to the flooding of connectivity information across the network. After topology discovery, each node computes shortest paths to all BSA resources using Dijkstra's algorithm [26] with a binary heap, resulting in a computational complexity ofO((|V|+|E|) log|V|)per node. However, regardless of the","claim_type":"method","confidence":0.9,"evidence_strength":"citation_context"},{"claim_text":"BOUNDARY CONTAMINATION AND CHOICE OFL sub The choice of the boundary box for the calculation of pressure gradient,L sub, is data-driven. Fig. S4(b) shows that the recovered Darcy slope (fit over the linear-regime cases) rises monotonically asL sub/Ldomain shrinks, while the intermittent slope (fit over the sub-linear-regime cases) is approximately flat acrossL sub/Ldomain ∈ [0.30,0.60]. The two slopes simultaneously match the Gaoet al.reference values atL sub/Ldomain = 0.50. We therefore adoptL ","claim_type":"method","confidence":0.85,"evidence_strength":"citation_context"},{"claim_text":"nρ(ˆµn, µn,h)21{nρ(ˆµn, µn,h)2 > A} \u0003 = 0. Theorem 6.5(Local asymptotic minimaxity of the profiled location estimator).Assume that X1, X2, . . .are i.i.d. from the local anisotropic HWN experiments defined above and that Assump- 13 tion 4.3 holds. LetZ∼N(0,I −1 αα·β). Then, for every fixedA <∞andc <∞, lim n→∞ sup ∥h∥≤c En,h h A∧nρ ˆµn, µn,h \u00012i −E[A∧ ∥Z∥ 2] = 0.(27) Consequently, the profile MLE attains the local asymptotic minimax bound for every truncated squared geodesic loss. Additionally, i","claim_type":"background","confidence":0.8,"evidence_strength":"citation_context"},{"claim_text":"staying on the water surface and we use Dijkstra's algorithm [72] to find the shortest path. Firefighting and rescue boats in Germany must comply with German standard DIN 14961 [ 75], defining its technical requirements. Of the various boat models, we selected the highest maximum speed we could find, 70 kilometers per hour for an upgraded high-tech boat [ 76], as a reference speed to finally compute boat travel times ¯δw,τ . Note that this is a very optimistic estimate, as most lifeboats with eq","claim_type":"background","confidence":0.7,"evidence_strength":"citation_context"}],"why_cited":"Pith tracks APACrefauthors \\ 1959 because it crossed a citation-hub threshold. Current citing contexts most often use it as background evidence (2 contexts).","role_counts":[{"n":2,"context_role":"background"},{"n":2,"context_role":"method"}]},"error":null,"updated_at":"2026-06-05T22:30:25.142947+00:00"},"summary_claims":{"job_type":"summary_claims","status":"succeeded","result":{"title":"APACrefauthors \\ 1959","claims":[{"claim_text":"in Section IV, we follow the former approach to ensure that the BSA tables can be computed via cooperation between nodes. The communication complexity of the distributed discovery process isO(|V|.|E|), due to the flooding of connectivity information across the network. After topology discovery, each node computes shortest paths to all BSA resources using Dijkstra's algorithm [26] with a binary heap, resulting in a computational complexity ofO((|V|+|E|) log|V|)per node. However, regardless of the","claim_type":"method","confidence":0.9,"evidence_strength":"citation_context"},{"claim_text":"BOUNDARY CONTAMINATION AND CHOICE OFL sub The choice of the boundary box for the calculation of pressure gradient,L sub, is data-driven. Fig. S4(b) shows that the recovered Darcy slope (fit over the linear-regime cases) rises monotonically asL sub/Ldomain shrinks, while the intermittent slope (fit over the sub-linear-regime cases) is approximately flat acrossL sub/Ldomain ∈ [0.30,0.60]. The two slopes simultaneously match the Gaoet al.reference values atL sub/Ldomain = 0.50. We therefore adoptL ","claim_type":"method","confidence":0.85,"evidence_strength":"citation_context"},{"claim_text":"nρ(ˆµn, µn,h)21{nρ(ˆµn, µn,h)2 > A} \u0003 = 0. Theorem 6.5(Local asymptotic minimaxity of the profiled location estimator).Assume that X1, X2, . . .are i.i.d. from the local anisotropic HWN experiments defined above and that Assump- 13 tion 4.3 holds. LetZ∼N(0,I −1 αα·β). Then, for every fixedA <∞andc <∞, lim n→∞ sup ∥h∥≤c En,h h A∧nρ ˆµn, µn,h \u00012i −E[A∧ ∥Z∥ 2] = 0.(27) Consequently, the profile MLE attains the local asymptotic minimax bound for every truncated squared geodesic loss. Additionally, i","claim_type":"background","confidence":0.8,"evidence_strength":"citation_context"},{"claim_text":"staying on the water surface and we use Dijkstra's algorithm [72] to find the shortest path. Firefighting and rescue boats in Germany must comply with German standard DIN 14961 [ 75], defining its technical requirements. Of the various boat models, we selected the highest maximum speed we could find, 70 kilometers per hour for an upgraded high-tech boat [ 76], as a reference speed to finally compute boat travel times ¯δw,τ . Note that this is a very optimistic estimate, as most lifeboats with eq","claim_type":"background","confidence":0.7,"evidence_strength":"citation_context"}],"why_cited":"Pith tracks APACrefauthors \\ 1959 because it crossed a citation-hub threshold. Current citing contexts most often use it as background evidence (2 contexts).","role_counts":[{"n":2,"context_role":"background"},{"n":2,"context_role":"method"}]},"error":null,"updated_at":"2026-06-05T22:30:25.145414+00:00"}},"summary":{"title":"APACrefauthors \\ 1959","claims":[{"claim_text":"in Section IV, we follow the former approach to ensure that the BSA tables can be computed via cooperation between nodes. The communication complexity of the distributed discovery process isO(|V|.|E|), due to the flooding of connectivity information across the network. After topology discovery, each node computes shortest paths to all BSA resources using Dijkstra's algorithm [26] with a binary heap, resulting in a computational complexity ofO((|V|+|E|) log|V|)per node. However, regardless of the","claim_type":"method","confidence":0.9,"evidence_strength":"citation_context"},{"claim_text":"BOUNDARY CONTAMINATION AND CHOICE OFL sub The choice of the boundary box for the calculation of pressure gradient,L sub, is data-driven. Fig. S4(b) shows that the recovered Darcy slope (fit over the linear-regime cases) rises monotonically asL sub/Ldomain shrinks, while the intermittent slope (fit over the sub-linear-regime cases) is approximately flat acrossL sub/Ldomain ∈ [0.30,0.60]. The two slopes simultaneously match the Gaoet al.reference values atL sub/Ldomain = 0.50. We therefore adoptL ","claim_type":"method","confidence":0.85,"evidence_strength":"citation_context"},{"claim_text":"nρ(ˆµn, µn,h)21{nρ(ˆµn, µn,h)2 > A} \u0003 = 0. Theorem 6.5(Local asymptotic minimaxity of the profiled location estimator).Assume that X1, X2, . . .are i.i.d. from the local anisotropic HWN experiments defined above and that Assump- 13 tion 4.3 holds. LetZ∼N(0,I −1 αα·β). Then, for every fixedA <∞andc <∞, lim n→∞ sup ∥h∥≤c En,h h A∧nρ ˆµn, µn,h \u00012i −E[A∧ ∥Z∥ 2] = 0.(27) Consequently, the profile MLE attains the local asymptotic minimax bound for every truncated squared geodesic loss. Additionally, i","claim_type":"background","confidence":0.8,"evidence_strength":"citation_context"},{"claim_text":"staying on the water surface and we use Dijkstra's algorithm [72] to find the shortest path. Firefighting and rescue boats in Germany must comply with German standard DIN 14961 [ 75], defining its technical requirements. Of the various boat models, we selected the highest maximum speed we could find, 70 kilometers per hour for an upgraded high-tech boat [ 76], as a reference speed to finally compute boat travel times ¯δw,τ . Note that this is a very optimistic estimate, as most lifeboats with eq","claim_type":"background","confidence":0.7,"evidence_strength":"citation_context"}],"why_cited":"Pith tracks APACrefauthors \\ 1959 because it crossed a citation-hub threshold. Current citing contexts most often use it as background evidence (2 contexts).","role_counts":[{"n":2,"context_role":"background"},{"n":2,"context_role":"method"}]},"graph":{"co_cited":[{"title":"2003 , keywords =","work_id":"090d8dc7-3c58-4328-9417-e7d640a049d5","shared_citers":4},{"title":"2010 , note =","work_id":"aa219abe-2334-40b0-94c0-c7b070cfc332","shared_citers":4},{"title":"2012 , note =","work_id":"d396eca2-e55f-48f8-bec3-e086f85eed7a","shared_citers":4},{"title":"2022 , note =","work_id":"801a2b39-ffba-4cf3-916d-aae2847dab53","shared_citers":4},{"title":"2024 , note =","work_id":"6d65f903-5906-49dd-8bf5-ad25e6def601","shared_citers":4},{"title":"ACM Computing Surveys , author =","work_id":"ef20f685-67d1-44d0-a87f-eaa087cfd63d","shared_citers":4},{"title":"ACM Transactions on Graphics , author =","work_id":"055301d6-5966-48c7-b3d7-390a9f3cf3d2","shared_citers":4},{"title":"A Gentle Introduction to Conformal Prediction and Distribution-Free Uncertainty Quantification","work_id":"7721c193-e1ff-4cac-a0b6-ced585d69d3d","shared_citers":4},{"title":"A kernel method for the two-sample-problem , volume =","work_id":"3283db88-5ae0-44f6-9919-ad352ea36cb1","shared_citers":4},{"title":"Alimentary Pharmacology & Therapeutics , author =","work_id":"6f9c4d6b-d533-4cb2-a8d5-c8c3cb46283d","shared_citers":4},{"title":"American Economic Review , author =","work_id":"71ac31be-a75a-4259-82b0-a44054ecff86","shared_citers":4},{"title":"American Political Science Review , author =","work_id":"f8de7511-4535-4f3f-b732-ce6283f992c6","shared_citers":4},{"title":"and Falorsi, Luca and Cao, Nicola De and Kipf, Thomas and Tomczak, Jakub M","work_id":"7164f439-c1a9-40af-8fd3-1df0d25bd03f","shared_citers":4},{"title":"and Judin, David B","work_id":"3ca94a05-6f7d-4e7e-a8fa-86858f9384bd","shared_citers":4},{"title":"and Mahony, R","work_id":"efd6c42d-11d5-43d9-b19e-80acf30c8223","shared_citers":4},{"title":"and Pedersen, M.S","work_id":"7585bf27-fc3d-4162-8980-bfe8660c3c80","shared_citers":4},{"title":"and Peyré, G","work_id":"c81e09e5-3637-4a6e-809f-7044fd147917","shared_citers":4},{"title":"and Rizzo, Maria L","work_id":"e4e34417-2a97-45f7-9207-e02ff369a924","shared_citers":4},{"title":"and Ye, Yinyu , year =","work_id":"9682b451-196e-4bbb-b503-7740c8863d30","shared_citers":4},{"title":"and Zha, Hongyuan , editor =","work_id":"63d53723-ad38-41d8-8e5d-04c3af2c001f","shared_citers":4},{"title":"An in depth look at the","work_id":"dd72cc9d-9eb5-422a-bf19-93932af5e037","shared_citers":4},{"title":"Annales de l'institut Henri Poincaré , author =","work_id":"c2a2d777-bf84-4329-8c9f-cc54c844625c","shared_citers":4},{"title":"Annals of Operations Research , author =","work_id":"3ff4b138-bec0-478c-b619-39a4719a7cc9","shared_citers":4},{"title":"Annual Review of Statistics and Its Application , author =","work_id":"b7c9cd54-2a1d-4682-bb33-064108e269c7","shared_citers":4}],"time_series":[{"n":1,"year":2024},{"n":12,"year":2026}],"dependency_candidates":[{"n":1,"role":"method","polarity":"use_method","paper_title":"Intermittent two-phase flow in porous media: insights from pore-scale direct numerical simulation","primary_cat":"physics.flu-dyn","context_text":"BOUNDARY CONTAMINATION AND CHOICE OFL sub The choice of the boundary box for the calculation of pressure gradient,L sub, is data-driven. Fig. S4(b) shows that the recovered Darcy slope (fit over the linear-regime cases) rises monotonically asL sub/Ldomain shrinks, while the intermittent slope (fit over the sub-linear-regime cases) is approximately flat acrossL sub/Ldomain ∈ [0.30,0.60]. The two slopes simultaneously match the Gaoet al.reference values atL sub/Ldomain = 0.50. We therefore adoptL sub/Ldomain = 0.50 (that is, 25% ex- cluded from each side) as the analysis window through- out. This choice is large enough to fully exclude the inlet- peak (x/L <0.15) and outlet-relaxation (x/L >0.90) zones, but small enough that the linear regression re-","citing_arxiv_id":"2605.11991"},{"n":1,"role":"method","polarity":"use_method","paper_title":"A Distributed Switching Protocol for Quantum Networks","primary_cat":"quant-ph","context_text":"in Section IV, we follow the former approach to ensure that the BSA tables can be computed via cooperation between nodes. The communication complexity of the distributed discovery process isO(|V|.|E|), due to the flooding of connectivity information across the network. After topology discovery, each node computes shortest paths to all BSA resources using Dijkstra's algorithm [26] with a binary heap, resulting in a computational complexity ofO((|V|+|E|) log|V|)per node. However, regardless of the approach for offline computing the BSA tables, the decisions for reserving paths and BSAs for all requests are made cooperatively between the end nodes and switches in the network, as shown in the next section. ... Switch 2 QC2 QC1 (Lead) Switch 1 .","citing_arxiv_id":"2605.07295"}]},"authors":[{"id":"8fe854e6-1202-41a8-928e-07c620b56edb","orcid":null,"display_name":"E. W. Dijkstra","source":"manual","import_confidence":0.72}]}}