{"entities":{"Q155497":{"pageid":157032,"ns":120,"title":"Item:Q155497","lastrevid":105556412,"modified":"2026-10-10T10:15:09Z","type":"item","id":"Q155497","labels":{"en":{"language":"en","value":"PCSinR"}},"descriptions":{"en":{"language":"en","value":"Parallel Constraint Satisfaction Networks in R"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"438d0eef0223375d3a92def8ffc6a10a8bf1ca95","datavalue":{"value":{"entity-type":"item","numeric-id":57080,"id":"Q57080"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q155497$571AE376-8B43-4DDE-8661-D48CC036C078","rank":"normal"}],"P132":[{"mainsnak":{"snaktype":"value","property":"P132","hash":"10edd141e119b3c38cc2aa087b8fe5922cd0eea3","datavalue":{"value":"0.1.0","type":"string"},"datatype":"string"},"type":"statement","qualifiers":{"P28":[{"snaktype":"value","property":"P28","hash":"c1535619fd8f94633f3128b0ce8819699cf6d5d0","datavalue":{"value":{"time":"+2016-10-19T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"}]},"qualifiers-order":["P28"],"id":"Q155497$62CBFA08-38B4-43B0-9C81-5E81251F5AD7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P132","hash":"b542975f358e64266fc8bf3287bc018a1e05a763","datavalue":{"value":"PACKAGES.rds","type":"string"},"datatype":"string"},"type":"statement","qualifiers":{"P28":[{"snaktype":"value","property":"P28","hash":"bdab782bc09c5c1d8687a0515dd3ffbe9dda94be","datavalue":{"value":{"time":"+2026-07-09T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"}]},"qualifiers-order":["P28"],"id":"Q155497$6E5F60EB-7C10-4C38-9559-247DFC1B3588","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P132","hash":"189c587a08f42dbc3cc769bb9feba00c37905fbc","datavalue":{"value":"0.2.0","type":"string"},"datatype":"string"},"type":"statement","qualifiers":{"P28":[{"snaktype":"value","property":"P28","hash":"08788b2cbf350ad4bc12c8b64351e1e6eefe3b67","datavalue":{"value":{"time":"+2026-03-18T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"}]},"qualifiers-order":["P28"],"id":"Q155497$51905A9B-24E8-4280-91C5-287D555294EC","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"a5647f7931372750bb2d38e7643ace3cf3872bc9","datavalue":{"value":{"entity-type":"item","numeric-id":155496,"id":"Q155496"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q155497$8D6711B9-8527-4AC0-AA90-7CDC45AF7765","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"15d27b51478005e73059b99b792dabef1dc470b6","datavalue":{"value":{"entity-type":"item","numeric-id":87705,"id":"Q87705"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q155497$36EA09D7-1D03-4710-AD62-4F0293777945","rank":"normal"}],"P19":[{"mainsnak":{"snaktype":"value","property":"P19","hash":"df06c98ad860897f2f041dc2a8ccaf01624dc253","datavalue":{"value":{"entity-type":"item","numeric-id":155496,"id":"Q155496"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q155497$E7C9197E-D7D9-450F-A0D9-1FBFAF8A3962","rank":"normal"}],"P163":[{"mainsnak":{"snaktype":"value","property":"P163","hash":"64cd73e553e7920a9cd11e3377fb75fd0effb226","datavalue":{"value":{"entity-type":"item","numeric-id":56634,"id":"Q56634"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P232":[{"snaktype":"value","property":"P232","hash":"08cd46e5d0670b30202d0ab659ba1ea1aef83363","datavalue":{"value":{"text":"\u2265 3","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"}]},"qualifiers-order":["P232"],"id":"Q155497$DAF9878E-81E8-4148-9B44-C170AAF9CB52","rank":"normal"}],"P229":[{"mainsnak":{"snaktype":"value","property":"P229","hash":"222e41337d3df35dce149d1ef3fa81379c5be978","datavalue":{"value":"PCSinR","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q155497$ED19CEC4-4209-4A57-9E3A-B676541826ED","rank":"normal"}],"P114":[{"mainsnak":{"snaktype":"value","property":"P114","hash":"251fd109c2cd8c1ee39b48cd109c9f4b1c9fcf5c","datavalue":{"value":{"entity-type":"item","numeric-id":13519,"id":"Q13519"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q155497$0D83003E-BC87-453E-A436-153C49A94BBE","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"908c3454b3659c4b140ccce33c5aee31081edc8d","datavalue":{"value":{"entity-type":"item","numeric-id":5976450,"id":"Q5976450"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q155497$7C3C8EFA-42CA-4FD1-8960-A54397407584","rank":"normal"}],"P170":[{"mainsnak":{"snaktype":"value","property":"P170","hash":"3b3909ce2af481b754573a06fe539f1878c6944f","datavalue":{"value":{"time":"+2026-03-18T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q155497$469C36D8-F5AB-4B36-AD1E-7DB89A1C2F27","rank":"normal"}],"P342":[{"mainsnak":{"snaktype":"value","property":"P342","hash":"a0beaece152e3d4cfe5f01b8a4c02caff7e1e6cc","datavalue":{"value":{"entity-type":"item","numeric-id":56774,"id":"Q56774"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P132":[{"snaktype":"value","property":"P132","hash":"e0e58ae6b287015d102e739ec6d68dae545ce226","datavalue":{"value":"\u2265 3.3.1","type":"string"},"datatype":"string"}]},"qualifiers-order":["P132"],"id":"Q155497$39898B0C-7440-4DD7-8F69-7507E936F134","rank":"normal"}],"P1459":[{"mainsnak":{"snaktype":"value","property":"P1459","hash":"54f8bcfc4be9e436160dba339fd27bd6c3f1b516","datavalue":{"value":"Parallel Constraint Satisfaction (PCS) models are an increasingly    common class of models in Psychology, with applications to reading and word    recognition (McClelland & Rumelhart, 1981;    \\doi{10.1037/0033-295X.88.5.375}), judgment and decision making (Gl\u00f6ckner &    Betsch, 2008 \\doi{10.1017/S1930297500002424}; Gl\u00f6ckner, Hilbig, &    Jekel, 2014 \\doi{10.1016/j.cognition.2014.08.017}), and several other    fields. In each of these fields, they provide a quantitative model of    psychological phenomena, with precise predictions regarding choice    probabilities, decision times, and often the degree of confidence. This    package provides the necessary functions to create and simulate basic    Parallel Constraint Satisfaction networks within R.","type":"string"},"datatype":"string"},"type":"statement","id":"Q155497$B1AD9B2F-1276-4FA7-A36D-9AFF9EFE1AE7","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"PCSinR","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/PCSinR"}}}}}