{"id":"https://openalex.org/W7212144100","doi":"https://doi.org/10.48550/arxiv.2609.09397","title":"Degree Sequence Reconstruction from Subgraph Traces","display_name":"Degree Sequence Reconstruction from Subgraph Traces","publication_year":2026,"publication_date":"2026-09-08","ids":{"openalex":"https://openalex.org/W7212144100","doi":"https://doi.org/10.48550/arxiv.2609.09397"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2609.09397","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.09397","pdf_url":"https://arxiv.org/pdf/2609.09397","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.09397","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089321118","display_name":"Venkata Gandikota","orcid":"https://orcid.org/0000-0003-2381-7788","observed_orcids":["https://orcid.org/0000-0003-2381-7788"]},"institutions":[{"id":"https://openalex.org/I70983195","display_name":"Syracuse University","ror":"https://ror.org/025r5qe02","country_code":"US","type":"education","lineage":["https://openalex.org/I70983195"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gandikota, Venkata","raw_affiliation_strings":["Syracuse University ,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Syracuse University ,","institution_ids":["https://openalex.org/I70983195"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073378497","display_name":"Arick Grootveld","orcid":"https://orcid.org/0000-0001-8336-4093","observed_orcids":["https://orcid.org/0000-0001-8336-4093"]},"institutions":[{"id":"https://openalex.org/I70983195","display_name":"Syracuse University","ror":"https://ror.org/025r5qe02","country_code":"US","type":"education","lineage":["https://openalex.org/I70983195"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Grootveld, Arick","raw_affiliation_strings":["Syracuse University ,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Syracuse University ,","institution_ids":["https://openalex.org/I70983195"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5151154027","display_name":"Haodong Yang","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I70983195","display_name":"Syracuse University","ror":"https://ror.org/025r5qe02","country_code":"US","type":"education","lineage":["https://openalex.org/I70983195"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yang, Haodong","raw_affiliation_strings":["Syracuse University ,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Syracuse University ,","institution_ids":["https://openalex.org/I70983195"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I70983195"],"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.4542999863624573,"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.4542999863624573,"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.1509000062942505,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.09939999878406525,"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/vertex-deletion","display_name":"vertex deletion","score":0.6790000200271606},{"id":"https://openalex.org/keywords/trace-reconstruction","display_name":"trace reconstruction","score":0.6629999876022339},{"id":"https://openalex.org/keywords/rejection-sampling","display_name":"rejection sampling","score":0.7699999809265137},{"id":"https://openalex.org/keywords/graph-reconstruction","display_name":"graph reconstruction","score":0.46399998664855957}],"concepts":[{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.7675999999046326},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.683899998664856},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.656000018119812},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5307000279426575},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5284000039100647},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5102999806404114},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4787999987602234},{"id":"https://openalex.org/C75291252","wikidata":"https://www.wikidata.org/wiki/Q1315756","display_name":"TRACE (psycholinguistics)","level":2,"score":0.44940000772476196},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43479999899864197},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41839998960494995},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.39750000834465027},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.38339999318122864},{"id":"https://openalex.org/C162199024","wikidata":"https://www.wikidata.org/wiki/Q3085391","display_name":"Degree matrix","level":5,"score":0.3375999927520752},{"id":"https://openalex.org/C25878781","wikidata":"https://www.wikidata.org/wiki/Q1473607","display_name":"Degree of a polynomial","level":3,"score":0.3328000009059906},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.30300000309944153},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.3019999861717224},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2816999852657318},{"id":"https://openalex.org/C178744013","wikidata":"https://www.wikidata.org/wiki/Q5502876","display_name":"Frequency partition of a graph","level":5,"score":0.2750999927520752},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.25529998540878296}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2609.09397","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.09397","pdf_url":"https://arxiv.org/pdf/2609.09397","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.09397","doi":"https://doi.org/10.48550/arxiv.2609.09397","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2609.09397","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.09397","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.09397","pdf_url":"https://arxiv.org/pdf/2609.09397","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":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7212144100.pdf","grobid_xml":"https://content.openalex.org/works/W7212144100.grobid-xml"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W256857973","https://openalex.org/W1977661148","https://openalex.org/W2024661933","https://openalex.org/W2031833194","https://openalex.org/W2060586081","https://openalex.org/W2075084424","https://openalex.org/W2123690669","https://openalex.org/W2564763601","https://openalex.org/W2755285488","https://openalex.org/W2766755532","https://openalex.org/W2887679804","https://openalex.org/W2922965174","https://openalex.org/W2940220397","https://openalex.org/W2968461396","https://openalex.org/W3081669206","https://openalex.org/W3126256773","https://openalex.org/W3128312766","https://openalex.org/W3131982569","https://openalex.org/W3159986226","https://openalex.org/W3161798670","https://openalex.org/W4288055577","https://openalex.org/W4289655386","https://openalex.org/W4296556002","https://openalex.org/W4316652363","https://openalex.org/W4366668348","https://openalex.org/W4396814731","https://openalex.org/W4401693017","https://openalex.org/W4406132037","https://openalex.org/W4406168614","https://openalex.org/W4407462795","https://openalex.org/W4417005324","https://openalex.org/W7092570435","https://openalex.org/W7167583759","https://openalex.org/W7202386699"],"related_works":["https://openalex.org/W7097066495","https://openalex.org/W7096467868","https://openalex.org/W4396814731","https://openalex.org/W4311616219","https://openalex.org/W2088388700","https://openalex.org/W6950506012","https://openalex.org/W2621032635","https://openalex.org/W2041396751","https://openalex.org/W7010056904","https://openalex.org/W3131982569"],"abstract_inverted_index":{"The":[0,122],"goal":[1],"of":[2,12,14,154,158],"degree":[3,85,92,101,110,133],"sequence":[4,134],"reconstruction":[5,58,63],"is":[6,25,75],"to":[7,42,46,107,114],"recover":[8],"the":[9,37,44,109,132,136,151,156],"ordered":[10],"vector":[11],"degrees":[13],"an":[15,47,115,141],"unknown":[16],"graph":[17,83],"from":[18,135],"vertex":[19,24],"deleted":[20,26],"traces,":[21,69],"where":[22],"each":[23],"independently":[27],"with":[28,55,117],"probability":[29],"$p$.":[30],"We":[31],"provide":[32],"two":[33],"algorithms":[34],"for":[35,50,131,150],"reconstruction;":[36],"first":[38],"uses":[39],"rejection":[40],"sampling":[41],"reduce":[43],"problem":[45,49],"estimation":[48],"a":[51,62,90,127,146],"mixture":[52],"distribution.":[53],"Combined":[54],"prior":[56],"trace":[57,120,152],"results,":[59],"this":[60],"gives":[61],"algorithm":[64,116],"using":[65],"$\\Exp{\\tilde":[66,118],"O":[67],"(n^{1/3})}$":[68],"although":[70],"no":[71],"sub-exponential":[72,128],"time":[73,129],"decoder":[74,130],"known.":[76],"Our":[77],"other":[78],"approach":[79],"involves":[80],"recovering":[81,155],"certain":[82],"invariants,":[84],"moments,":[86],"that":[87,98],"can":[88],"identify":[89],"graphs":[91],"sequence.":[93],"Extremal":[94],"polynomial":[95,124],"bounds":[96],"show":[97],"$\\tilde":[99],"\u0398(n^{1/2})$":[100],"moments":[102],"are":[103],"necessary":[104],"and":[105,145],"sufficient":[106],"reconstruct":[108],"sequence,":[111],"which":[112],"leads":[113],"O(n^{1/2})}$":[119],"complexity.":[121],"same":[123],"machinery":[125],"yields":[126],"moments.":[137],"Additionally,":[138],"we":[139],"give":[140],"$O(n^{3})$":[142],"upper":[143],"bound":[144,149],"$\u03a9(n^2)$":[147],"lower":[148],"complexity":[153],"number":[157],"edges.":[159]},"counts_by_year":[],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2026-09-11T00:00:00"}