{"id":"https://openalex.org/W7223683013","doi":"https://doi.org/10.5281/zenodo.23653469","title":"Generative Structural Theory v1.62 \u2014 Deletion Budgets and Finite-Prefix Reachability on Eventually Complete Growth Sequences","display_name":"Generative Structural Theory v1.62 \u2014 Deletion Budgets and Finite-Prefix Reachability on Eventually Complete Growth Sequences","publication_year":2026,"publication_date":"2026-10-26","ids":{"openalex":"https://openalex.org/W7223683013","doi":"https://doi.org/10.5281/zenodo.23653469"},"language":"en","primary_location":{"id":"doi:10.5281/zenodo.23653469","doi":"https://doi.org/10.5281/zenodo.23653469","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.23653469","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"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"},"volume":null,"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.5281/zenodo.23653469","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5135252223","display_name":"Koji Okino","orcid":"https://orcid.org/0009-0003-9273-9813","observed_orcids":["https://orcid.org/0009-0003-9273-9813"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Okino, Koji","raw_affiliation_strings":["SD Lab LLC"],"raw_orcid":"https://orcid.org/0009-0003-9273-9813","affiliations":[{"raw_affiliation_string":"SD Lab LLC","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5135252223"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"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/T11151","display_name":"Advanced Topology and Set Theory","score":0.3917999863624573,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"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/T11151","display_name":"Advanced Topology and Set Theory","score":0.3917999863624573,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"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/T11567","display_name":"semigroups and automata theory","score":0.2498999983072281,"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.17919999361038208,"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/growth-sequence","display_name":"growth sequence","score":0.8080000281333923},{"id":"https://openalex.org/keywords/trees","display_name":"trees","score":0.5429999828338623},{"id":"https://openalex.org/keywords/directed-graphs","display_name":"directed graphs","score":0.35499998927116394},{"id":"https://openalex.org/keywords/strongly-connected-digraphs","display_name":"strongly connected digraphs","score":0.36000001430511475}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7391999959945679},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6858000159263611},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6237999796867371},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6057000160217285},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.5145999789237976},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49729999899864197},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.48179998993873596},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.47679999470710754},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.4745999872684479},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.45840001106262207},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.42750000953674316},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.40389999747276306},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.39649999141693115},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.3702999949455261},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.29339998960494995},{"id":"https://openalex.org/C180645754","wikidata":"https://www.wikidata.org/wiki/Q474715","display_name":"Partially ordered set","level":2,"score":0.28139999508857727},{"id":"https://openalex.org/C65180967","wikidata":"https://www.wikidata.org/wiki/Q130901","display_name":"Binary relation","level":2,"score":0.27810001373291016},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.2635999917984009},{"id":"https://openalex.org/C18116961","wikidata":"https://www.wikidata.org/wiki/Q734209","display_name":"Generating set of a group","level":2,"score":0.2517000138759613},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.2517000138759613}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.5281/zenodo.23653469","doi":"https://doi.org/10.5281/zenodo.23653469","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.23653469","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"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"},{"id":"doi:10.5281/zenodo.23653470","doi":"https://doi.org/10.5281/zenodo.23653470","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.23653470","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"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":"doi:10.5281/zenodo.23653469","doi":"https://doi.org/10.5281/zenodo.23653469","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.23653469","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"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"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7223695144","https://openalex.org/W7223679591","https://openalex.org/W7223656986","https://openalex.org/W7223655845","https://openalex.org/W7223673526","https://openalex.org/W7223709715","https://openalex.org/W7223710070","https://openalex.org/W7223663610","https://openalex.org/W7223661981","https://openalex.org/W7223324747"],"abstract_inverted_index":{"A":[0,27],"growth":[1,88,121,206,386],"sequence":[2,5,29,207,324,353,387],"is":[3,62,131,173,187,225,256,282,309,344,366,382,393,410,421,434,440,452,465],"a":[4,132,236,259,296,322,352,362,370,375,449],"of":[6,41,49,52,59,77,118,143,146,181,290,311,314,350,448],"finite":[7,133,190,250,376],"relations":[8,157,183],"R_n":[9,19,138],"on":[10,85],"non-empty":[11],"node":[12,82,124,232,389],"sets":[13,125],"V_n":[14,16,147],"with":[15,81,99,231,327,354,369,388],"\u2286":[17,20,414],"V_{n+1},":[18],"R_{n+1},":[21],"and":[22,94,101,129,162,244,270,331,337,412,427],"every":[23,32,78,86,91,95,140,199,228,317,385,402],"stage":[24,33,93,134,238,363,451],"strongly":[25,36],"connected.":[26],"selection":[28,323],"chooses":[30],"at":[31,212,288],"an":[34,204,240],"inclusion-minimal":[35],"connected":[37,411],"spanning":[38],"sub-relation":[39],"x_n":[40,53],"R_n.":[42,415],"Its":[43,263],"deletion":[44,69,191,328],"budget":[45,70,192,221,329,372,420],"bounds":[46],"the":[47,57,73,112,115,123,156,179,182,194,219,249,283,291,312,348,406,418,444],"number":[48,58],"ordered":[50,141],"pairs":[51,60,163,267],"that":[54,68,137,154,178,307],"x_{n+1}":[55],"drops;":[56],"added":[61,169],"not":[63,159],"bounded.":[64],"Version":[65],"v1.61":[66],"established":[67],"1":[71],"reaches":[72],"bidirected":[74,304],"relation":[75],"P_T":[76,224,334],"tree":[79,229,408],"T":[80,230],"set":[83,233],"N_0":[84],"complete":[87,120],"sequence,":[89,218],"from":[90,252,325,460],"starting":[92,237,287],"initial":[96,241],"minimal":[97,297],"structure,":[98],"lower":[100,332],"upper":[102],"limits":[103],"L":[104,355],"=":[105,107,356,358,398],"U":[106,357],"P_T.":[108,359],"This":[109,343],"paper":[110],"extends":[111],"setting":[113],"to":[114,127,254,347,374],"class":[116,196],"\u039b":[117],"eventually":[119],"sequences:":[122],"increase":[126],"N_0,":[128],"there":[130],"N_c":[135],"such":[136,351],"contains":[139],"pair":[142],"distinct":[144],"nodes":[145,166],"for":[148,193,222,227,384,401,456],"all":[149],"n":[150,403],"\u2265":[151,202,246,320,404],"N_c.":[152],"Before":[153],"stage,":[155],"need":[158],"be":[160,168,184],"complete,":[161],"between":[164],"existing":[165],"may":[167],"later.":[170],"Eventual":[171],"completeness":[172,459],"stronger":[174],"than":[175],"requiring":[176],"only":[177,338],"union":[180,390],"complete.":[185],"There":[186],"no":[188,454],"common":[189],"whole":[195],"\u039b.":[197],"For":[198,235,316],"integer":[200,318],"k":[201,210,226],"1,":[203,321],"explicit":[205],"forces":[208],"exactly":[209,395],"deletions":[211],"its":[213],"first":[214],"transition.":[215],"On":[216,416],"this":[217],"least":[220,419],"reaching":[223],"N_0.":[234],"s_0,":[239,405],"structure":[242,298],"y,":[243,289],"N":[245,255],"max{s_0,":[247],"N_c},":[248],"interval":[251],"s_0":[253],"represented":[257],"by":[258,299],"layered":[260],"directed":[261],"graph.":[262],"vertices":[264,302],"are":[265],"stage\u2013structure":[266],"(n,":[268],"x),":[269],"each":[271],"transition":[272,293],"has":[273],"weight":[274],"|x":[275],"\\":[276],"x\u2032|.":[277],"The":[278,379,431,446],"bottleneck":[279],"value":[280],"b_*":[281,308,340],"minimum,":[284],"over":[285],"passages":[286],"largest":[292],"weight.":[294],"Extending":[295],"attaching":[300],"new":[301],"as":[303],"leaves":[305],"shows":[306],"independent":[310],"choice":[313],"N.":[315],"d":[319,330],"y":[326,397],"limit":[333],"exists":[335],"if":[336,339],"\u2264":[341],"d.":[342],"also":[345],"equivalent":[346],"existence":[349,447],"Thus,":[360],"once":[361],"beyond":[364],"completion":[365,450],"fixed,":[367],"reachability":[368],"positive":[371],"reduces":[373],"passage":[377],"problem.":[378],"budget-0":[380],"case":[381],"characterized":[383],"N_0:":[391],"it":[392],"possible":[394],"when":[396],"P_T[V_{s_0}]":[399],"and,":[400],"induced":[407],"T[V_n]":[409],"P_T[V_n]":[413],"\u039b,":[417],"therefore":[422],"0":[423],"under":[424],"these":[425],"conditions":[426],"max{1,":[428],"b_*}":[429],"otherwise.":[430],"containment":[432],"condition":[433],"automatic":[435],"after":[436],"completion,":[437],"but":[438],"connectedness":[439],"still":[441],"required":[442],"throughout":[443],"tail.":[445],"assumed;":[453],"procedure":[455],"detecting":[457],"eventual":[458],"finitely":[461],"many":[462],"observed":[463],"stages":[464],"claimed.":[466]},"counts_by_year":[],"updated_date":"2026-10-29T09:56:32.521200","created_date":"2026-10-27T00:00:00"}