{"doi":"10.1016/j.tcs.2003.12.009","title":"Continuous-time computation with restricted integration capabilities","abstract":null,"journal":"Theoretical Computer Science","year":2004,"id":26814,"datarank":0.6622848468654887,"base_score":2.302585092994046,"endowment":2.302585092994046,"self_citation_contribution":0.3453877639491069,"citation_network_contribution":0.3168970829163818,"self_endowment_contribution":0.3453877639491069,"citer_contribution":0.3168970829163818,"corpus_percentile":null,"corpus_rank":null,"citation_count":9,"citer_count":8,"citers_with_citation_signal":8,"citers_with_endowment":8,"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":153603,"name":"Manuel Lameiras Campagnolo","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":2.302585092994046,"endowment":2.302585092994046,"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/W2158775560","authors":[],"funders":[],"total_grants":0,"fwci":1.8184,"citation_percentile":0.86167147,"influential_citations":0,"citation_trend":[{"year":2021,"count":1}],"oa_status":"closed","license":"https://www.elsevier.com/open-access/userlicense/1.0/","oa_locations":[{"url":"https://doi.org/10.1016/j.tcs.2003.12.009","host_type":"BRONZE"},{"url":"https://api.elsevier.com/content/article/PII:S0304397503006364?httpAccept=text/xml","host_type":"publisher"},{"url":"https://api.elsevier.com/content/article/PII:S0304397503006364?httpAccept=text/plain","host_type":"publisher"},{"url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.5082","host_type":""}],"fields_of_study":["Computability, Logic, AI Algorithms","Logic, programming, and type systems","semigroups and automata theory","Mathematics","Computer Science"],"mesh_terms":[],"keywords":["Recursion (computer science)","Primitive recursive function","Mathematics","μ operator","Complexity class","Mutual recursion","Computation","Double recursion","Algebra over a field","Elementary function","Hierarchy","Function (biology)","Connection (principal bundle)","Discrete mathematics","Pure mathematics","Recursive functions","Time complexity","Algorithm","Mathematical analysis"],"sdg_mappings":[],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-08T15:45:01.079196Z","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":[]}