{"id":"https://openalex.org/keywords/hyperpaths","display_name":"hyperpaths","description":"Paths in a hypergraph, defined by sequences of hyperedges connecting vertices, and studied in graph theory and combinatorics.","display_name_alternatives":["hyperpath","hypergraph paths","paths in hypergraphs"],"ids":{"openalex":"https://openalex.org/keywords/hyperpaths","wikidata":null},"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.4493,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.4493,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.092,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"works_count":158,"cited_by_count":2453,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/hyperpaths","updated_date":"2026-11-18T04:07:20","created_date":"2026-09-30T00:00:00"}
