{"doi":"10.1109/tit.2008.928988","title":"On the Complexity of Hardness Amplification","abstract":null,"journal":"IEEE Transactions on Information Theory","year":2008,"id":29153,"datarank":0.5534470561928965,"base_score":2.3978952727983707,"endowment":2.3978952727983707,"self_citation_contribution":0.3596842909197557,"citation_network_contribution":0.19376276527314076,"self_endowment_contribution":0.3596842909197557,"citer_contribution":0.19376276527314076,"corpus_percentile":null,"corpus_rank":null,"citation_count":10,"citer_count":9,"citers_with_citation_signal":6,"citers_with_endowment":6,"datacite_reuse_total":1,"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":161421,"name":"Shi-Chun Tsai","orcid":null,"position":1,"is_corresponding":false},{"id":161422,"name":"Hsin-Lung Wu","orcid":null,"position":2,"is_corresponding":false},{"id":161420,"name":"Chi-Jen Lu","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":2.3978952727983707,"endowment":2.3978952727983707,"datacite_reuse_total":1,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"24523987","pmcid":null,"openalex_id":"https://openalex.org/W2072124641","authors":[],"funders":[],"total_grants":0,"fwci":1.2348,"citation_percentile":0.80725004,"influential_citations":0,"citation_trend":[{"year":2013,"count":1},{"year":2015,"count":2},{"year":2016,"count":1},{"year":2020,"count":1},{"year":2023,"count":1}],"oa_status":"closed","license":"https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html","oa_locations":[{"url":"http://xplorestaging.ieee.org/ielx5/18/4626047/04626070.pdf?arnumber=4626070","host_type":"publisher"},{"url":"https://doi.org/10.1109/tit.2008.928988","host_type":"journal"},{"url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.95.9681","host_type":""},{"url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.973.8112","host_type":""}],"fields_of_study":["Complexity and Algorithms in Graphs","Ferroelectric and Negative Capacitance Devices","Machine Learning and Algorithms","Computer Science","Mathematics"],"mesh_terms":[],"keywords":["Emphasis (telecommunications)","Mathematics","Computer science","Telecommunications"],"sdg_mappings":[],"linked_datasets":[{"doi":"10.4230/lipics.approx/random.2020.10","title":"Is It Possible to Improve Yao’s XOR Lemma Using Reductions That Exploit the Efficiency of Their Oracle?","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","resource_type":"ConferencePaper"}],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-08T22:45:16.549530Z","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":[]}