{"id":"https://openalex.org/W4389544582","doi":"https://doi.org/10.1109/tit.2023.3339808","title":"Eigenvalue Bounds for Sum-Rank-Metric Codes","display_name":"Eigenvalue Bounds for Sum-Rank-Metric Codes","publication_year":2023,"publication_date":"2023-12-11","ids":{"openalex":"https://openalex.org/W4389544582","doi":"https://doi.org/10.1109/tit.2023.3339808"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2023.3339808","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2023.3339808","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pure.tue.nl/ws/files/332533781/Eigenvalue_Bounds_for_Sum-Rank-Metric_Codes.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078358817","display_name":"Aida Abiad","orcid":"https://orcid.org/0000-0003-4003-4291"},"institutions":[{"id":"https://openalex.org/I13469542","display_name":"Vrije Universiteit Brussel","ror":"https://ror.org/006e5kg04","country_code":"BE","type":"education","lineage":["https://openalex.org/I13469542"]},{"id":"https://openalex.org/I32597200","display_name":"Ghent University","ror":"https://ror.org/00cv9y106","country_code":"BE","type":"education","lineage":["https://openalex.org/I32597200"]},{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["BE","NL"],"is_corresponding":false,"raw_author_name":"Aida Abiad","raw_affiliation_strings":["Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands","Department of Mathematics and Data Science, Vrije Universiteit Brussel, Belgium","Department of Mathematics: Analysis, Logic and Discrete Mathematics, Ghent University, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Department of Mathematics and Data Science, Vrije Universiteit Brussel, Belgium","institution_ids":["https://openalex.org/I13469542"]},{"raw_affiliation_string":"Department of Mathematics: Analysis, Logic and Discrete Mathematics, Ghent University, Belgium","institution_ids":["https://openalex.org/I32597200"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059933031","display_name":"Antonina P. Khramova","orcid":"https://orcid.org/0000-0002-9989-8986"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Antonina P. Khramova","raw_affiliation_strings":["Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0002-9989-8986","affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025356502","display_name":"Alberto Ravagnani","orcid":"https://orcid.org/0000-0001-5901-9484"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Alberto Ravagnani","raw_affiliation_strings":["Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0001-5901-9484","affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1915,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.78957828,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":"70","issue":"7","first_page":"4843","last_page":"4855"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.7437242269515991},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7293014526367188},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.7014676928520203},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5843923091888428},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.5563249588012695},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5293125510215759},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49327152967453003},{"id":"https://openalex.org/keywords/tuple","display_name":"Tuple","score":0.4877217710018158},{"id":"https://openalex.org/keywords/metric-dimension","display_name":"Metric dimension","score":0.46724867820739746},{"id":"https://openalex.org/keywords/eigenvalues-and-eigenvectors","display_name":"Eigenvalues and eigenvectors","score":0.45020735263824463},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.150267094373703},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1492525339126587},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.08730730414390564}],"concepts":[{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.7437242269515991},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7293014526367188},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.7014676928520203},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5843923091888428},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5563249588012695},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5293125510215759},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49327152967453003},{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.4877217710018158},{"id":"https://openalex.org/C60933471","wikidata":"https://www.wikidata.org/wiki/Q17152964","display_name":"Metric dimension","level":5,"score":0.46724867820739746},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.45020735263824463},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.150267094373703},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1492525339126587},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.08730730414390564},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/tit.2023.3339808","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2023.3339808","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/81345d9c-1a97-4544-9e79-cf4ca4d25f49","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/81345d9c-1a97-4544-9e79-cf4ca4d25f49","pdf_url":"https://pure.tue.nl/ws/files/332533781/Eigenvalue_Bounds_for_Sum-Rank-Metric_Codes.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Abiad Monge, A, Khramova, A & Ravagnani, A 2024, 'Eigenvalue bounds for sum-rank-metric codes', IEEE Transactions on Information Theory, vol. 70, no. 7, 10353025, pp. 4843-4855. https://doi.org/10.1109/TIT.2023.3339808","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.tue.nl:openaire/81345d9c-1a97-4544-9e79-cf4ca4d25f49","is_oa":true,"landing_page_url":"https://research.tue.nl/files/332533781/Eigenvalue_Bounds_for_Sum-Rank-Metric_Codes.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Abiad Monge, A, Khramova, A & Ravagnani, A 2024, 'Eigenvalue bounds for sum-rank-metric codes', IEEE Transactions on Information Theory, vol. 70, no. 7, 10353025, pp. 4843-4855. https://doi.org/10.1109/TIT.2023.3339808","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.tue.nl:publications/81345d9c-1a97-4544-9e79-cf4ca4d25f49","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85179800160&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Abiad Monge, A, Khramova, A & Ravagnani, A 2024, 'Eigenvalue bounds for sum-rank-metric codes', IEEE Transactions on Information Theory, vol. 70, no. 7, 10353025, pp. 4843-4855. https://doi.org/10.1109/TIT.2023.3339808","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:vubissmart:VUBISSMART:2000:266390","is_oa":false,"landing_page_url":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10353025","pdf_url":null,"source":{"id":"https://openalex.org/S4306402573","display_name":"VUBIR (Vrije Universiteit Brussel)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I13469542","host_organization_name":"Vrije Universiteit Brussel","host_organization_lineage":["https://openalex.org/I13469542"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/81345d9c-1a97-4544-9e79-cf4ca4d25f49","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/81345d9c-1a97-4544-9e79-cf4ca4d25f49","pdf_url":"https://pure.tue.nl/ws/files/332533781/Eigenvalue_Bounds_for_Sum-Rank-Metric_Codes.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Abiad Monge, A, Khramova, A & Ravagnani, A 2024, 'Eigenvalue bounds for sum-rank-metric codes', IEEE Transactions on Information Theory, vol. 70, no. 7, 10353025, pp. 4843-4855. https://doi.org/10.1109/TIT.2023.3339808","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1332686257","display_name":"\u201cBeyond the distance matrix\u201d: A new framework to study and extend spectral properties of the distance matrix of a graph","funder_award_id":"1285921N","funder_id":"https://openalex.org/F4320321730","funder_display_name":"Fonds Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G330594877","display_name":"Algebraic Methods in Graph Recognition","funder_award_id":"OCENW.KLEIN.475","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G403886532","display_name":"Finding network structure beyond the spectrum: new frontiers and new methods","funder_award_id":"VI.Vidi.213.085","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G5618363122","display_name":"Invariants of Rank-Metric Codes and Matrix Completions over GF(q) -- A Combinatorial Approach","funder_award_id":"VI.Vidi.203.045","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G660757063","display_name":"Structure and Asymptotic Density of Extremal Codes","funder_award_id":"OCENW.KLEIN.539","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320320934","display_name":"Koninklijke Nederlandse Akademie van Wetenschappen","ror":"https://ror.org/043c0p156"},{"id":"https://openalex.org/F4320321730","display_name":"Fonds Wetenschappelijk Onderzoek","ror":"https://ror.org/03qtxy027"},{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"},{"id":"https://openalex.org/F4320327336","display_name":"Vlaamse regering","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4389544582.pdf","grobid_xml":"https://content.openalex.org/works/W4389544582.grobid-xml"},"referenced_works_count":39,"referenced_works":["https://openalex.org/W960859969","https://openalex.org/W1606480398","https://openalex.org/W2063121374","https://openalex.org/W2078289947","https://openalex.org/W2088389361","https://openalex.org/W2095547380","https://openalex.org/W2114189119","https://openalex.org/W2125823197","https://openalex.org/W2126824576","https://openalex.org/W2323784209","https://openalex.org/W2801400867","https://openalex.org/W2956089011","https://openalex.org/W2963073980","https://openalex.org/W2963682341","https://openalex.org/W3036732123","https://openalex.org/W3040816021","https://openalex.org/W3080126524","https://openalex.org/W3081293222","https://openalex.org/W3101875855","https://openalex.org/W3104978253","https://openalex.org/W3117590150","https://openalex.org/W3133432062","https://openalex.org/W3155530075","https://openalex.org/W3164436005","https://openalex.org/W3184316302","https://openalex.org/W3194622023","https://openalex.org/W3216457453","https://openalex.org/W4283461098","https://openalex.org/W4291999168","https://openalex.org/W4298236575","https://openalex.org/W4308152276","https://openalex.org/W4308216328","https://openalex.org/W4313905169","https://openalex.org/W4367048681","https://openalex.org/W4383113633","https://openalex.org/W4388448419","https://openalex.org/W4391821625","https://openalex.org/W6604469142","https://openalex.org/W6839038515"],"related_works":["https://openalex.org/W4245395944","https://openalex.org/W2143551613","https://openalex.org/W2138823233","https://openalex.org/W1979740464","https://openalex.org/W2143345456","https://openalex.org/W1789991335","https://openalex.org/W2562731034","https://openalex.org/W4315705795","https://openalex.org/W2101053337","https://openalex.org/W2168592511"],"abstract_inverted_index":{"We":[0,93],"consider":[1],"the":[2,9,29,32,38,68,111,122,130,142,155,158,162],"problem":[3],"of":[4,11,28,37,72,98,113,129,141,157],"deriving":[5],"upper":[6],"bounds":[7,109,117,125,134],"on":[8,16,63,110,121],"parameters":[10],"sum-rank-metric":[12,64,99,114,159],"codes,":[13],"with":[14,104],"focus":[15],"their":[17,86],"dimension":[18],"and":[19,31,35,78,101],"block":[20],"length.":[21],"The":[22,116],"sum-rank":[23,87],"metric":[24],"is":[25,89,151],"a":[26,59,75],"combination":[27],"Hamming":[30],"rank":[33],"metric,":[34],"most":[36],"available":[39,164],"techniques":[40,106],"to":[41,45,48,91,107,153,170],"investigate":[42],"it":[43],"seem":[44],"be":[46],"unable":[47],"fully":[49],"capture":[50,154],"its":[51],"hybrid":[52],"nature.":[53],"In":[54],"this":[55],"paper,":[56],"we":[57,118],"introduce":[58],"new":[60,172],"approach":[61],"based":[62],"graphs,":[65],"in":[66],"which":[67],"vertices":[69],"are":[70,83,135],"tuples":[71,82],"matrices":[73],"over":[74],"finite":[76],"field,":[77],"where":[79],"two":[80],"such":[81],"connected":[84],"when":[85],"distance":[88],"equal":[90],"one.":[92],"establish":[94,171],"various":[95],"structural":[96],"properties":[97],"graphs":[100],"combine":[102],"them":[103],"eigenvalue":[105],"obtain":[108],"cardinality":[112],"codes.":[115,179],"derive":[119],"improve":[120],"best":[123],"known":[124],"for":[126,138,175],"several":[127],"choices":[128],"parameters.":[131],"While":[132],"our":[133],"explicit":[136],"only":[137],"small":[139],"values":[140],"minimum":[143],"distance,":[144],"they":[145],"clearly":[146],"indicate":[147],"that":[148],"spectral":[149],"theory":[150],"able":[152],"nature":[156],"better":[160],"than":[161],"currently":[163],"methods.":[165],"They":[166],"also":[167],"allow":[168],"us":[169],"non-existence":[173],"results":[174],"(possibly":[176],"nonlinear)":[177],"MSRD":[178]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":3}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2023-12-12T00:00:00"}