{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T05:38:29Z","timestamp":1776749909217,"version":"3.51.2"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,12,27]],"date-time":"2025-12-27T00:00:00Z","timestamp":1766793600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,27]],"date-time":"2025-12-27T00:00:00Z","timestamp":1766793600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100020884","name":"gencia Nacional de Investigaci\u00f3n y Desarrollo","doi-asserted-by":"publisher","award":["11220269"],"award-info":[{"award-number":["11220269"]}],"id":[{"id":"10.13039\/501100020884","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1007\/s10957-025-02894-z","type":"journal-article","created":{"date-parts":[[2025,12,27]],"date-time":"2025-12-27T17:32:19Z","timestamp":1766856739000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Separating path systems in trees"],"prefix":"10.1007","volume":"208","author":[{"given":"Francisco","family":"Arrepol","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patricio","family":"Asenjo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ra\u00fal","family":"Astete","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor","family":"Cartes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anah\u00ed","family":"Gajardo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valeria","family":"Henr\u00edquez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Catalina","family":"Opazo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicol\u00e1s","family":"Sanhueza-Matamala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9909-5315","authenticated-orcid":false,"given":"Christopher","family":"Thraves Caro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,27]]},"reference":[{"key":"2894_CR1","doi-asserted-by":"crossref","unstructured":"Alon, Y., Krivelevich, M.: Random graph\u2019s Hamiltonicity is strongly tied to its minimum degree. Electron. J. Combin. 27(1), Paper No. 1.30, 18 (2020)","DOI":"10.37236\/8339"},{"key":"2894_CR2","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.dam.2016.05.022","volume":"213","author":"J Balogh","year":"2016","unstructured":"Balogh, J., Csaba, B., Martin, R.R., Pluh\u00e1r, A.: On the path separation number of graphs. Discrete Appl. Math. 213, 26\u201333 (2016)","journal-title":"Discrete Appl. Math."},{"key":"2894_CR3","doi-asserted-by":"crossref","unstructured":"Bonamy, M., Botler, F., Dross, F.c., Naia, T., Skokan, J.: Separating the edges of a graph by a linear number of paths. Adv. Comb. pp. Paper No. 6, 7 (2023)","DOI":"10.19086\/aic.2023.6"},{"key":"2894_CR4","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/s10107-003-0414-6","volume":"98","author":"KMJ de Bontridder","year":"2003","unstructured":"de Bontridder, K.M.J., Halld\u00f3rsson, B.V., Halld\u00f3rsson, M.M., Hurkens, C.A.J., Lenstra, J.K., Ravi, R., Stougie, L.: Approximation algorithms for the test cover problem. Math. Program. 98, 477\u2013491 (2003)","journal-title":"Math. Program."},{"issue":"3","key":"2894_CR5","first-page":"335","volume":"5","author":"V Falgas-Ravry","year":"2014","unstructured":"Falgas-Ravry, V., Kittipassorn, T., Kor\u00e1ndi, D., Letzter, S., Narayanan, B.P.: Separating path systems. J. Comb. 5(3), 335\u2013354 (2014)","journal-title":"J. Comb."},{"key":"2894_CR6","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.jda.2013.07.006","volume":"23","author":"F Foucaud","year":"2013","unstructured":"Foucaud, F., Kov\u0161e, M.: Identifying path covers in graphs. J. Discrete Algorithms 23, 21\u201334 (2013)","journal-title":"J. Discrete Algorithms"},{"key":"2894_CR7","unstructured":"Guti\u00e9rrez, M.: Sistemas de caminos separadores de v\u00e9rtices en \u00e1rboles. Master\u2019s thesis, Universidad de Concepci\u00f3n (2025)"},{"issue":"2\u20133","key":"2894_CR8","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/S0166-218X(02)00579-6","volume":"129","author":"I Honkala","year":"2003","unstructured":"Honkala, I., Karpovsky, M.G., Litsyn, S.: Cycles identifying vertices and edges in binary hypercubes and $$2$$-dimensional tori. Discrete Appl. Math. 129(2\u20133), 409\u2013419 (2003)","journal-title":"Discrete Appl. Math."},{"key":"2894_CR9","unstructured":"Janson, S., \u0141\u00a0uczak, T., Rucinski, A.: Random graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience, New York (2000)"},{"issue":"8","key":"2894_CR10","doi-asserted-by":"publisher","first-page":"5583","DOI":"10.1090\/tran\/9187","volume":"377","author":"S Letzter","year":"2024","unstructured":"Letzter, S.: Separating path systems of almost linear size. Trans. Amer. Math. Soc. 377(8), 5583\u20135615 (2024)","journal-title":"Trans. Amer. Math. Soc."},{"key":"2894_CR11","unstructured":"Lichev, L., Sanhueza-Matamala, N.: Vertex-separating path systems in random graphs (2024)"},{"key":"2894_CR12","first-page":"75","volume":"22","author":"A R\u00e9nyi","year":"1961","unstructured":"R\u00e9nyi, A.: On random generating elements of a finite Boolean algebra. Acta Sci. Math. (Szeged) 22, 75\u201381 (1961)","journal-title":"Acta Sci. Math. (Szeged)"},{"key":"2894_CR13","doi-asserted-by":"crossref","unstructured":"Rosendahl, P.: On the identification of vertices using cycles. Electron. J. Combin. 10, Research Paper 7, 11 (2003)","DOI":"10.37236\/1700"},{"issue":"3","key":"2894_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2023.113784","volume":"347","author":"B Wickes","year":"2024","unstructured":"Wickes, B.: Separating path systems for the complete graph. Discrete Math. 347(3), 113784 (2024)","journal-title":"Discrete Math."},{"key":"2894_CR15","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1007\/3-540-64359-1_737","volume-title":"Parallel and Distributed Processing","author":"L Zakrevski","year":"1998","unstructured":"Zakrevski, L., Karpovsky, M.: Fault-tolerant message routing for multiprocessors. In: Rolim, J. (ed.) Parallel and Distributed Processing, vol. 1388, pp. 714\u2013730. Springer, Berlin Heidelberg, Berlin, Heidelberg (1998)"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02894-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-025-02894-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02894-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T04:52:29Z","timestamp":1776747149000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-025-02894-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,27]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["2894"],"URL":"https:\/\/doi.org\/10.1007\/s10957-025-02894-z","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,27]]},"assertion":[{"value":"1 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 December 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"70"}}