{"doi":"10.1080/03081079.2012.757604","title":"Some decidable results on reachability of solvable systems","abstract":null,"journal":"International Journal of General Systems","year":2013,"id":29624,"datarank":0.4056983902189918,"base_score":1.9459101490553132,"endowment":1.9459101490553132,"self_citation_contribution":0.29188652235829704,"citation_network_contribution":0.11381186786069472,"self_endowment_contribution":0.29188652235829704,"citer_contribution":0.11381186786069472,"corpus_percentile":null,"corpus_rank":null,"citation_count":6,"citer_count":2,"citers_with_citation_signal":2,"citers_with_endowment":2,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":162945,"name":"Jiaqi Zhu","orcid":null,"position":1,"is_corresponding":false},{"id":162946,"name":"Zhi-Bin Li","orcid":null,"position":2,"is_corresponding":false},{"id":123129,"name":"Ming Xu","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":1.791759469228055,"endowment":1.791759469228055,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"18998881","pmcid":null,"openalex_id":"https://openalex.org/W2032269072","authors":[],"funders":[],"total_grants":0,"fwci":0.7251,"citation_percentile":0.72424503,"influential_citations":0,"citation_trend":[{"year":2015,"count":2},{"year":2017,"count":2},{"year":2019,"count":1}],"oa_status":"closed","license":null,"oa_locations":[{"url":"http://www.tandfonline.com/doi/pdf/10.1080/03081079.2012.757604","host_type":"publisher"},{"url":"https://doi.org/10.1080/03081079.2012.757604","host_type":"journal"}],"fields_of_study":["Formal Methods in Verification","Security and Verification in Computing","Software Reliability and Analysis Research","Computer Science","Mathematics"],"mesh_terms":[],"keywords":["Reachability","Decidability","Class (philosophy)","Reachability problem","Computer science","Mathematics","Linear system","Quantifier elimination","Discrete mathematics","Nonlinear system","Theoretical computer science","Artificial intelligence"],"sdg_mappings":[{"sdg_number":0,"sdg_label":"Peace, Justice and strong institutions"}],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-09T00:19:37.285471Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}