{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T16:20:42Z","timestamp":1781108442595,"version":"3.54.1"},"reference-count":0,"publisher":"IGI Global Scientific Publishing","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,7,1]]},"abstract":"<p>Computer self-efficacy is known to operate at multiple levels, from application-specific subdomains like spreadsheets to a judgment of ability for the entire computing domain (general computer self-efficacy, GCSE). Conventional wisdom and many recent studies contend that the level of self-efficacy (specific to general) should match the level of its related constructs to maximize predictive power (Bandura, 1997; Chen, Gully, &amp; Eden, 2001; Pajares, 1996). This thinking claims, for example, that GCSE should be used with a general attitude like computer anxiety (and vice versa). This study examines whether such a limitation is theoretically and empirically sound given that SE judgments generalize across domains.<\/p>","DOI":"10.4018\/joeuc.2008070102","type":"journal-article","created":{"date-parts":[[2011,2,15]],"date-time":"2011-02-15T14:28:45Z","timestamp":1297780125000},"page":"22-40","source":"Crossref","is-referenced-by-count":10,"title":["Explicating Computer Self-Efficacy Relationships"],"prefix":"10.4018","volume":"20","author":[{"given":"James P.","family":"Downey Jr.","sequence":"first","affiliation":[{"name":"University of Central Arkansas, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"R. Kelly","family":"Rainer","sequence":"additional","affiliation":[{"name":"Auburn University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Summer E.","family":"Bartczak","sequence":"additional","affiliation":[{"name":"Air Force Institute of Technology, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","container-title":["Journal of Organizational and End User Computing"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=3843","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T00:34:56Z","timestamp":1654130096000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/joeuc.2008070102"}},"subtitle":["Generality and the Overstated Case of Specificity Matching"],"short-title":[],"issued":{"date-parts":[[2008,7,1]]},"references-count":0,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,7]]}},"URL":"https:\/\/doi.org\/10.4018\/joeuc.2008070102","relation":{},"ISSN":["1546-2234","1546-5012"],"issn-type":[{"value":"1546-2234","type":"print"},{"value":"1546-5012","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7,1]]}}}