{"entities":{"Q4098493":{"pageid":6128093,"ns":120,"title":"Item:Q4098493","lastrevid":81441416,"modified":"2026-05-06T18:31:43Z","type":"item","id":"Q4098493","labels":{"en":{"language":"en","value":"Optimal finite memory learning algorithms for the finite sample problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3519719"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4098493$82816A85-BDB1-4CE4-B5BC-7F6BB895B724","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"a5ebaa9161d8c6f2c524f149ba691f13b351845b","datavalue":{"value":{"text":"Optimal finite memory learning algorithms for the finite sample problem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q4098493$8646012A-DD66-4237-9842-068995DAC6F3","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"1b700e322bc4c4671956e5f5ee95337a404260f9","datavalue":{"value":"0332.62017","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4098493$6E6039F5-E75D-4E22-AFD8-A3579402A024","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"7b65ee3a6336c47459a0debbad797eaa7cd8da27","datavalue":{"value":"10.1016/S0019-9958(76)90456-3","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4098493$F1F561ED-C0A6-410E-88A1-28F3A6F6AD26","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"a1892d6b35ef3eea99b299cb6478eb575b18bb3b","datavalue":{"value":{"entity-type":"item","numeric-id":582858,"id":"Q582858"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4098493$E5CEF129-5494-479B-A112-B22F9DA798B1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"27eb211768af5952d1aeb696b3f55bf3dd0ecef6","datavalue":{"value":{"entity-type":"item","numeric-id":792526,"id":"Q792526"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4098493$784F2D9C-9C8D-4D3E-9AF3-2B98CD0BF962","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"8f076d34d03009989e73100d9050ad7d78a6d0d7","datavalue":{"value":{"entity-type":"item","numeric-id":3661463,"id":"Q3661463"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4098493$E94826E0-92E7-4639-9B64-829CBFFFFF97","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"4434820098e3b6c980c31814818af7c68f56bd22","datavalue":{"value":{"entity-type":"item","numeric-id":2832035,"id":"Q2832035"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4098493$8FC983E1-1F61-416F-9491-EF542BFB08D8","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"974fa8a46aa40326fb3113b279589eb02559bb73","datavalue":{"value":{"time":"+1976-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q4098493$7739A3BC-9B66-461D-A53C-A724CCA75136","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"3d678e3814c9d242125a70d49a616f736949e344","datavalue":{"value":"62F03","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4098493$C6893E4B-8CE8-4151-955D-E2170DB7E8C5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"8a784276b4e09d379c8147965411b455c3d79751","datavalue":{"value":"68T10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4098493$93ED216C-1D0C-46DB-855E-140456FD802C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"e6e7c2e9d67f9590a26e18c734f34db53ce5ec87","datavalue":{"value":"68T15","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4098493$D4E90F06-5056-4E49-85F8-ABAAB7396A8B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"9b78776a56fc28cdd893baa47605a105412b838a","datavalue":{"value":"68Q45","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4098493$CB05DD28-3DEF-4221-B575-2BBE03297E6E","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"2f6fa95fac1513519a45d46545bfd977ccc2286c","datavalue":{"value":"3519719","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4098493$1E813F37-48AB-4C4D-8A59-5CB6BAE91A5C","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4098493$EAB714EF-DE66-4A25-8E9E-4B62816428D9","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"a06217e60923e1154c7b94f89f5a5bed88a7c531","datavalue":{"value":"https://doi.org/10.1016/s0019-9958(76)90456-3","type":"string"},"datatype":"url"},"type":"statement","id":"Q4098493$98C7F81E-C9F5-43C5-8A70-F99A507EDC84","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"3f6ae786e68843dbc8df4db55ce93efe322cf479","datavalue":{"value":"W2000114801","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4098493$08FF3ABB-3096-4008-AAEC-9FD37C032440","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Optimal finite memory learning algorithms for the finite sample problem","badges":[]}}}}}