{"id":"https://openalex.org/W7213237682","doi":"https://doi.org/10.48550/arxiv.2609.13693","title":"Polynomial-time Tensor Decomposition under the Kruskal Condition and the Lovitz--Petrov Generalization","display_name":"Polynomial-time Tensor Decomposition under the Kruskal Condition and the Lovitz--Petrov Generalization","publication_year":2026,"publication_date":"2026-09-12","ids":{"openalex":"https://openalex.org/W7213237682","doi":"https://doi.org/10.48550/arxiv.2609.13693"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2609.13693","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.13693","pdf_url":"https://arxiv.org/pdf/2609.13693","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":null,"license_id":null,"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.13693","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109739421","display_name":"Shiri Sivan","orcid":"https://orcid.org/0009-0004-3707-4844","observed_orcids":["https://orcid.org/0009-0004-3707-4844"]},"institutions":[{"id":"https://openalex.org/I122411786","display_name":"California Institute of Technology","ror":"https://ror.org/05dxps055","country_code":"US","type":"education","lineage":["https://openalex.org/I122411786"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sivan, Shiri","raw_affiliation_strings":["Department of Computing and Mathematical Sciences , Caltech , USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing and Mathematical Sciences , Caltech , USA","institution_ids":["https://openalex.org/I122411786"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5109739421"],"corresponding_institution_ids":["https://openalex.org/I122411786"],"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/T12303","display_name":"Tensor decomposition and applications","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/2605","display_name":"Computational Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12303","display_name":"Tensor decomposition and applications","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/2605","display_name":"Computational Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0005000000237487257,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.0003000000142492354,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/tensor-decomposition","display_name":"tensor decomposition","score":0.9929999709129333},{"id":"https://openalex.org/keywords/identifiability","display_name":"identifiability","score":0.9769999980926514},{"id":"https://openalex.org/keywords/uniqueness-of-decomposition","display_name":"uniqueness of decomposition","score":0.718999981880188},{"id":"https://openalex.org/keywords/polynomial-time-algorithms","display_name":"polynomial-time algorithms","score":0.7170000076293945},{"id":"https://openalex.org/keywords/randomized-algorithms","display_name":"randomized algorithms","score":0.984000027179718},{"id":"https://openalex.org/keywords/minimum-rank","display_name":"minimum rank","score":0.6370000243186951},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.6800000071525574}],"concepts":[{"id":"https://openalex.org/C122770356","wikidata":"https://www.wikidata.org/wiki/Q1656753","display_name":"Identifiability","level":2,"score":0.7738000154495239},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7178000211715698},{"id":"https://openalex.org/C155281189","wikidata":"https://www.wikidata.org/wiki/Q3518150","display_name":"Tensor (intrinsic definition)","level":2,"score":0.6787999868392944},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.6216999888420105},{"id":"https://openalex.org/C64835786","wikidata":"https://www.wikidata.org/wiki/Q17004583","display_name":"Cartesian tensor","level":5,"score":0.5586000084877014},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5358999967575073},{"id":"https://openalex.org/C2986737658","wikidata":"https://www.wikidata.org/wiki/Q30103009","display_name":"Tensor decomposition","level":3,"score":0.44449999928474426},{"id":"https://openalex.org/C20178491","wikidata":"https://www.wikidata.org/wiki/Q2204117","display_name":"Symmetric tensor","level":3,"score":0.4408999979496002},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4212000072002411},{"id":"https://openalex.org/C51255310","wikidata":"https://www.wikidata.org/wiki/Q1163016","display_name":"Tensor product","level":2,"score":0.39640000462532043},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38420000672340393},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.365200012922287},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.36500000953674316},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3391999900341034},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.33079999685287476},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3221000134944916},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.314300000667572},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30649998784065247},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2939000129699707},{"id":"https://openalex.org/C166077713","wikidata":"https://www.wikidata.org/wiki/Q1758924","display_name":"Tensor field","level":3,"score":0.26739999651908875},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2639999985694885},{"id":"https://openalex.org/C124007464","wikidata":"https://www.wikidata.org/wiki/Q428091","display_name":"Tensor contraction","level":3,"score":0.26249998807907104}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2609.13693","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.13693","pdf_url":"https://arxiv.org/pdf/2609.13693","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2609.13693","doi":"https://doi.org/10.48550/arxiv.2609.13693","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2609.13693","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2609.13693","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.13693","pdf_url":"https://arxiv.org/pdf/2609.13693","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G5959949423","display_name":"NSF-BSF: AF: Small: Algorithmic and Information-Theoretic Challenges in Causal Inference","funder_award_id":"2321079","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7213237682.pdf","grobid_xml":"https://content.openalex.org/works/W7213237682.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W1970195563","https://openalex.org/W1970935148","https://openalex.org/W2024165284","https://openalex.org/W2033637560","https://openalex.org/W2044901395","https://openalex.org/W2057503509","https://openalex.org/W2079705627","https://openalex.org/W2102950139","https://openalex.org/W2106221905","https://openalex.org/W2119741678","https://openalex.org/W2122340891","https://openalex.org/W2469230926","https://openalex.org/W2517205873","https://openalex.org/W3145796852"],"related_works":["https://openalex.org/W7098289825","https://openalex.org/W1782132064","https://openalex.org/W2773126525","https://openalex.org/W7212271629","https://openalex.org/W7128612510","https://openalex.org/W2517205873","https://openalex.org/W2044901395","https://openalex.org/W2522300772","https://openalex.org/W2950358734","https://openalex.org/W4376272203"],"abstract_inverted_index":{"An":[0],"identifiability":[1,54],"criterion":[2],"is":[3,20,34,44,59,134],"a":[4,7,50,78,123],"condition":[5,15,19,42,55,71,114],"on":[6],"tensor":[8,90],"decomposition":[9,32,65,91],"that":[10,132],"certifies":[11],"uniqueness":[12],"when":[13],"the":[14,23,37,41,83,93,100,112],"holds.":[16],"Kruskal's":[17],"classical":[18],"one":[21,125],"of":[22,111,138],"best-known":[24],"deterministic":[25],"criteria":[26],"for":[27,89],"identifiability.":[28],"However,":[29],"no":[30,63],"polynomial-time":[31,60,64,80,109],"algorithm":[33,66,107],"known":[35,68],"under":[36,69,92,99],"Kruskal":[38,102],"condition;":[39],"verifying":[40],"itself":[43],"NP-hard.":[45],"Lovitz":[46],"and":[47,96,136],"Petrov":[48],"introduced":[49],"strictly":[51],"more":[52],"general":[53],"which,":[56],"in":[57,82,129],"contrast,":[58],"verifiable,":[61],"but":[62],"was":[67],"this":[70,74],"either.":[72],"In":[73],"paper":[75],"we":[76],"give":[77],"randomized":[79],"algorithm,":[81],"algebraic":[84],"model":[85],"over":[86],"$\\mathbb":[87],"R$,":[88],"Lovitz--Petrov":[94,113],"condition,":[95],"therefore":[97,137],"also":[98],"stricter":[101],"condition.":[103],"Moreover,":[104],"combining":[105],"our":[106],"with":[108],"verification":[110],"yields":[115],"an":[116],"efficient":[117],"end-to-end":[118],"certification":[119],"procedure:":[120],"after":[121],"computing":[122],"decomposition,":[124],"can":[126],"deterministically":[127],"certify":[128],"polynomial":[130],"time":[131],"it":[133],"unique":[135],"minimum":[139],"rank.":[140]},"counts_by_year":[],"updated_date":"2026-11-08T12:12:28.789561","created_date":"2026-09-16T00:00:00"}