{"id":"https://openalex.org/W7207571283","doi":"https://doi.org/10.48550/arxiv.2609.02851","title":"Almost Linear 3-Spanners of Temporal Cliques","display_name":"Almost Linear 3-Spanners of Temporal Cliques","publication_year":2026,"publication_date":"2026-09-02","ids":{"openalex":"https://openalex.org/W7207571283","doi":"https://doi.org/10.48550/arxiv.2609.02851"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2609.02851","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.02851","pdf_url":"https://arxiv.org/pdf/2609.02851","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2609.02851","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018668283","display_name":"J\u00falia Balig\u00e1cs","orcid":"https://orcid.org/0000-0003-2654-149X","observed_orcids":["https://orcid.org/0000-0003-2654-149X"]},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Baligacs, Julia","raw_affiliation_strings":["University of Oxford"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oxford","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042522865","display_name":"Davide Bil\u00f2","orcid":"https://orcid.org/0000-0003-3169-4300","observed_orcids":["https://orcid.org/0000-0003-3169-4300"]},"institutions":[{"id":"https://openalex.org/I26415053","display_name":"University of L'Aquila","ror":"https://ror.org/01j9p1r26","country_code":"IT","type":"education","lineage":["https://openalex.org/I26415053"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Bil\u00f2, Davide","raw_affiliation_strings":["University of L'Aquila"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of L'Aquila","institution_ids":["https://openalex.org/I26415053"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040350131","display_name":"V\u00e1clav Bla\u017eej","orcid":"https://orcid.org/0000-0001-9165-6280","observed_orcids":["https://orcid.org/0000-0001-9165-6280"]},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Bla\u017eej, V\u00e1clav","raw_affiliation_strings":["University of Warsaw"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Warsaw","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011202184","display_name":"Ma\u00ebl Dumas","orcid":"https://orcid.org/0009-0004-8906-9801","observed_orcids":["https://orcid.org/0009-0004-8906-9801"]},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Dumas, Ma\u00ebl","raw_affiliation_strings":["University of Warsaw"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Warsaw","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078055627","display_name":"Anna Zych-Pawlewicz","orcid":"https://orcid.org/0000-0002-5361-8969","observed_orcids":["https://orcid.org/0000-0002-5361-8969"]},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Zych-Pawlewicz, Anna","raw_affiliation_strings":["University of Warsaw"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Warsaw","institution_ids":["https://openalex.org/I4654613"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.986299991607666,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.986299991607666,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.011599999852478504,"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"}},{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.00019999999494757503,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dynamic-graphs","display_name":"dynamic graphs","score":0.8539999723434448},{"id":"https://openalex.org/keywords/temporal-distance","display_name":"temporal distance","score":0.6499999761581421},{"id":"https://openalex.org/keywords/temporal-connectivity","display_name":"temporal connectivity","score":0.574999988079071},{"id":"https://openalex.org/keywords/recursive-decomposition","display_name":"recursive decomposition","score":0.7509999871253967},{"id":"https://openalex.org/keywords/temporal-paths","display_name":"temporal paths","score":0.42800000309944153},{"id":"https://openalex.org/keywords/information-dissemination","display_name":"information dissemination","score":0.503000020980835}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6377000212669373},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.616100013256073},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5687000155448914},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5631999969482422},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5117999911308289},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.49149999022483826},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4616999924182892},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45239999890327454},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.4442000091075897},{"id":"https://openalex.org/C77277458","wikidata":"https://www.wikidata.org/wiki/Q1969246","display_name":"Temporal database","level":2,"score":0.39259999990463257},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37790000438690186},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3564999997615814},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.32330000400543213},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.2978000044822693},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.2881999909877777},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2854999899864197},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.27390000224113464},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2655999958515167},{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.2572000026702881}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2609.02851","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.02851","pdf_url":"https://arxiv.org/pdf/2609.02851","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2609.02851","doi":"https://doi.org/10.48550/arxiv.2609.02851","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2609.02851","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2609.02851","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.02851","pdf_url":"https://arxiv.org/pdf/2609.02851","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320323718","display_name":"Universit\u00e0 degli Studi dell'Aquila","ror":"https://ror.org/01j9p1r26"},{"id":"https://openalex.org/F4320323873","display_name":"Uniwersytet Warszawski","ror":"https://ror.org/039bjqg32"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7207571283.pdf","grobid_xml":"https://content.openalex.org/works/W7207571283.grobid-xml"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W1746637951","https://openalex.org/W2286516511","https://openalex.org/W2893179710","https://openalex.org/W2950969150","https://openalex.org/W3098783518","https://openalex.org/W3199947862","https://openalex.org/W4283379466","https://openalex.org/W4392089953","https://openalex.org/W6891669102","https://openalex.org/W7163519057"],"related_works":["https://openalex.org/W7163519057","https://openalex.org/W4392089953","https://openalex.org/W4283379466","https://openalex.org/W2893179710","https://openalex.org/W6891669102","https://openalex.org/W7157238717","https://openalex.org/W4389295062","https://openalex.org/W4214882826","https://openalex.org/W2610338003","https://openalex.org/W2369012075"],"abstract_inverted_index":{"Temporal":[0],"graphs":[1,61],"model":[2],"dynamic":[3],"networks":[4],"by":[5,141],"assigning":[6],"positive":[7,86],"integer":[8,87],"time":[9,145],"labels":[10,22,146],"to":[11,77],"the":[12,44,113,137,152,166,173,218],"edges,":[13],"while":[14],"information":[15],"propagates":[16],"along":[17],"temporal":[18,29,33,40,46,60,66,73,79,99,105,131,176,182,199],"paths,":[19],"whose":[20],"edge":[21],"are":[23,75,147,160],"traversed":[24],"in":[25,148,163],"nondecreasing":[26],"order.":[27],"A":[28],"$\u03b1$-spanner":[30],"of":[31,51,56,71,81,107,118,127,133,155,165,170,175,184,205],"a":[32,39,54,91,104,124,192,202],"graph":[34],"with":[35],"$n$":[36,102],"vertices":[37,52],"is":[38,139,229],"subgraph":[41],"that":[42,95,123,197],"approximates":[43],"minimum-hop":[45],"distance":[47],"between":[48],"every":[49,85,98],"pair":[50],"within":[53],"factor":[55],"$\u03b1$.":[57],"While":[58],"general":[59],"may":[62],"not":[63],"admit":[64,78],"sparse":[65],"$\u03b1$-spanners":[67],"for":[68,84,97,181,201],"any":[69],"value":[70],"$\u03b1$,":[72],"cliques":[74,183],"known":[76,167],"$(2k-1)$-spanners":[80],"size":[82,108,134,174],"$\\widetilde{\\mathcal{O}}(kn^{1+1/k})$":[83],"$k$.":[88],"We":[89,120],"present":[90],"simple":[92,194],"recursive":[93,195],"algorithm":[94,129],"computes,":[96],"clique":[100],"on":[101,172,191],"vertices,":[103],"$3$-spanner":[106],"$n^{1+2/\\sqrt{\\ln":[109],"n}}=n^{1+o(1)}$,":[110],"thereby":[111],"improving":[112,151],"previous":[114,153,233],"best":[115],"upper":[116,225],"bound":[117,154,169],"$\\widetilde{\\mathcal{O}}(n^{3/2})$.":[119],"also":[121],"show":[122],"modified":[125],"version":[126],"our":[128],"computes":[130],"$3$-spanners":[132],"$\\mathcal{O}(nL)$":[135],"when":[136],"lifetime":[138,185],"bounded":[140],"$L$,":[142],"i.e.,":[143],"all":[144],"$\\{1,\\ldots,L\\}$,":[149],"thus":[150],"$\\mathcal{O}(2^Ln\\log":[156],"n)$.":[157],"Both":[158,188],"results":[159],"particularly":[161],"striking":[162],"light":[164],"lower":[168],"$\u03a9(n^2)$":[171],"$2$-spanners,":[177],"which":[178],"already":[179],"holds":[180],"$L\\geq":[186],"3$.":[187],"algorithms":[189],"rely":[190],"new":[193],"decomposition":[196],"certifies":[198],"connectivity":[200],"large":[203],"collection":[204],"source-target":[206],"pairs":[207],"using":[208],"only":[209,217],"$\\mathcal{O}(n)$":[210],"carefully":[211],"selected":[212],"edges":[213],"and":[214],"recursively":[215],"processes":[216],"remaining":[219],"pairs.":[220],"Besides":[221],"yielding":[222],"substantially":[223],"improved":[224],"bounds,":[226],"this":[227],"approach":[228],"significantly":[230],"simpler":[231],"than":[232],"constructions.":[234]},"counts_by_year":[],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2026-09-04T00:00:00"}