{"id":"https://openalex.org/W7223680697","doi":"https://doi.org/10.5281/zenodo.23664579","title":"Generative Structural Theory v1.70 \u2014 Exact Classification of Unit-Budget Reachability through Bidirected Trees for Consecutive Finite Path Branches on the Cofinally Complete Growth Sequence E","display_name":"Generative Structural Theory v1.70 \u2014 Exact Classification of Unit-Budget Reachability through Bidirected Trees for Consecutive Finite Path Branches on the Cofinally Complete Growth Sequence E","publication_year":2026,"publication_date":"2026-10-26","ids":{"openalex":"https://openalex.org/W7223680697","doi":"https://doi.org/10.5281/zenodo.23664579"},"language":"en","primary_location":{"id":"doi:10.5281/zenodo.23664579","doi":"https://doi.org/10.5281/zenodo.23664579","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.23664579","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.23664579","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/T10374","display_name":"Advanced Graph Theory Research","score":0.4844000041484833,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.4844000041484833,"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/T11151","display_name":"Advanced Topology and Set Theory","score":0.31200000643730164,"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.025699999183416367,"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.7310000061988831}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8140000104904175},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7185999751091003},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.7056000232696533},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6236000061035156},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.599399983882904},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5429999828338623},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4722999930381775},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4587000012397766},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4359000027179718},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.37880000472068787},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.37059998512268066},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.3467000126838684},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3346000015735626},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.3312999904155731},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.299699991941452},{"id":"https://openalex.org/C186851281","wikidata":"https://www.wikidata.org/wiki/Q5156512","display_name":"Complete sequence","level":4,"score":0.2856000065803528},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.27889999747276306},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2757999897003174},{"id":"https://openalex.org/C45484198","wikidata":"https://www.wikidata.org/wiki/Q827246","display_name":"Sequence alignment","level":4,"score":0.2635999917984009},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.25760000944137573}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.5281/zenodo.23664579","doi":"https://doi.org/10.5281/zenodo.23664579","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.23664579","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.23664580","doi":"https://doi.org/10.5281/zenodo.23664580","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.23664580","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.23664579","doi":"https://doi.org/10.5281/zenodo.23664579","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.23664579","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/W7223710070","https://openalex.org/W7223661981","https://openalex.org/W7223663610","https://openalex.org/W7223673526","https://openalex.org/W7223462293","https://openalex.org/W7223453082","https://openalex.org/W7223695144","https://openalex.org/W7223324747","https://openalex.org/W7223254619","https://openalex.org/W7223236232"],"abstract_inverted_index":{"A":[0,27],"growth":[1,74,546],"sequence":[2,5,29,75,90,181,232,249,281,483,501,538,547],"is":[3,62,115,161,329,412,436],"a":[4,87,179,213,230,242,247,279,415,462,491,507,520,537],"of":[6,41,49,52,59,91,117,148,371,454,527],"finite":[7,83,133,563,584],"relations":[8],"R_n":[9,19],"on":[10,70,496,590],"non-empty":[11],"node":[12,102,411],"sets":[13],"V_n":[14,16],"with":[15,81,96,182,188,233,250,255,282,305,396,502,516,562],"\u2286":[17,20,239],"V_{n+1},":[18],"R_{n+1},":[21],"and":[22,105,121,194,237,270,286,307,405,465,554,567,583],"every":[23,32,362,439],"stage":[24,33,176,221,268,276,374,387,530],"strongly":[25,36],"connected.":[26],"selection":[28,180,231,248,280,482,500],"chooses":[30],"at":[31,175,220,292,316,384,418,449,477,522,565],"an":[34],"inclusion-minimal":[35],"connected":[37],"spanning":[38],"sub-relation":[39],"x_n":[40,53],"R_n.":[42],"Its":[43,128],"deletion":[44,183,234,251,283,432],"budget":[45,184,235,252,284,433],"bounds":[46],"the":[47,57,71,78,132,154,164,205,223,325,333,336,341,351,369,385,430,544,549,555,579,586,591],"number":[48,58],"ordered":[50,403],"pairs":[51,60,291],"that":[54,186,275,346,357,460,467],"x_{n+1}":[55],"drops;":[56],"added":[61,413],"not":[63,303,514],"bounded.":[64],"Version":[65,200],"v1.69":[66,372],"established":[67],"unit-budget":[68,455,481,499],"reachability":[69,348,541],"cofinally":[72],"complete":[73,386],"E":[76],"for":[77,361,438,506,559,568],"trees":[79,561],"T_c":[80,100,298],"consecutive":[82],"path":[84],"branches.":[85],"For":[86,350],"strictly":[88],"increasing":[89],"integers":[92],"c":[93],"=":[94,98,111,123,168,190,192,257,259,288,339,359,425,427],"(c_j)":[95],"c_0":[97],"0,":[99,222],"has":[101,195,241,261,299],"set":[103],"N_0":[104],"edges":[106,302,394,513],"{u,":[107],"p(u)},":[108],"where":[109],"p(u)":[110,122,358],"0":[112,135,177,360,419,517,566],"if":[113],"u":[114,124,363],"one":[116,402],"c_1,":[118],"c_2,":[119],"...":[120,143],"+":[125,146,366,376,389],"1":[126,185,236,253,285,437],"otherwise.":[127],"rooted":[129,312,445,473],"branches":[130,313,446,474,564],"are":[131,227],"paths":[134],"\u2013":[136,138,142,144],"c_j":[137,150],"(c_j":[139],"\u2212":[140,151],"1)":[141],"(c_{j\u22121}":[145],"1),":[147,170],"length":[149,315,448,476],"c_{j\u22121},":[152],"counting":[153],"edge":[155],"to":[156],"0.":[157,397],"Every":[158],"such":[159,356,536],"tree":[160,198,244,264,464,508],"reached":[162,211],"from":[163,218,266,274,434],"directed":[165,381],"triangle":[166,382,552],"y":[167,219,435],"{(0,":[169],"(1,":[171],"2),":[172],"(2,":[173],"0)}":[174],"by":[178,391],"stabilizes":[187,254],"L":[189,240,256,287,338,424],"U":[191,258,426],"P_{T_c}":[193,238,289,488],"no":[196,272,480],"bidirected":[197,214,243,263,393,416,463,492],"term.":[199],"v1.70":[201],"classifies":[202],"exactly":[203,401],"when":[204],"same":[206],"target":[207,334],"can":[208,489],"also":[209,344],"be":[210],"through":[212,373],"tree.":[215,493],"On":[216],"E,":[217,497,548],"following":[224],"five":[225],"conditions":[226],"equivalent:":[228],"(i)":[229,320],"term;":[245],"(ii)":[246],"P_{T_c},":[260],"only":[262,293,309,322,442],"terms":[265],"some":[267],"onward,":[269],"deletes":[271,290,400],"pair":[273,404,521],"onward;":[277],"(iii)":[278],"finitely":[294,300,310,443],"many":[295,301,311,444,472,512,524],"transitions;":[296],"(iv)":[297],"incident":[304,395,515],"0;":[306],"(v)":[308],"have":[314,447,475],"least":[317,450,478],"2.":[318],"Condition":[319],"requires":[321],"containment":[323],"in":[324,335],"lower":[326,485,503],"limit,":[327],"which":[328],"weaker":[330],"than":[331],"reaching":[332,456],"sense":[337],"P_{T_c};":[340],"equivalence":[342],"therefore":[343],"covers":[345],"exact":[347],"condition.":[349],"constructive":[352],"direction,":[353],"choose":[354],"k":[355,365],"\u2265":[364],"1.":[367],"Follow":[368],"construction":[370],"2k":[375,388],"1,":[377],"then":[378],"replace":[379],"its":[380,528],"core":[383],"2":[390],"two":[392],"This":[398],"transition":[399],"produces":[406],"P_{T_c[V_{2k+2}]}.":[407],"Thereafter,":[408],"each":[409],"new":[410],"as":[414],"leaf":[417],"without":[420],"further":[421],"deletion,":[422],"yielding":[423],"P_{T_c}.":[428],"Thus,":[429],"minimum":[431],"T_c.":[440,557],"If":[441,470],"2,":[451,479],"both":[452],"kinds":[453],"sequences":[457],"exist:":[458],"those":[459,466],"meet":[461,490],"never":[468],"do.":[469],"infinitely":[471,511,523],"whose":[484],"limit":[486,504],"contains":[487,578],"More":[494],"generally,":[495],"any":[498],"P_T":[505],"T":[509],"having":[510],"must":[518],"delete":[519],"transitions,":[525],"regardless":[526],"starting":[529],"or":[531],"initial":[532,551,570],"minimal":[533],"structure,":[534],"whenever":[535],"exists.":[539],"The":[540,576],"classification":[542],"concerns":[543],"specific":[545],"specified":[550],"y,":[553],"family":[556],"Reachability":[558],"other":[560,569],"structures":[571],"remains":[572],"outside":[573],"this":[574],"classification.":[575],"supplement":[577],"supporting":[580],"records,":[581],"scripts,":[582],"checks;":[585],"general":[587],"results":[588],"rest":[589],"proofs.":[592]},"counts_by_year":[],"updated_date":"2026-10-29T09:56:32.521200","created_date":"2026-10-27T00:00:00"}