{"entities":{"Q1154256":{"pageid":1165005,"ns":120,"title":"Item:Q1154256","lastrevid":69751899,"modified":"2026-04-13T09:08:38Z","type":"item","id":"Q1154256","labels":{"en":{"language":"en","value":"Fast algorithm for decentralized priority access to a common channel"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3727623"}},"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":"Q1154256$2DBA48BA-22C9-43C9-89E1-751F40302012","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"6a3b974fce8d85d3ddf032e0e7703f4aefcd39dd","datavalue":{"value":{"text":"Fast algorithm for decentralized priority access to a common channel","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1154256$1FAD3085-230F-451F-90BE-704B0CE37CB1","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"3b14ae093f6dfb431f7a384f7dd373de9268cde8","datavalue":{"value":"0464.68041","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1154256$BDFB1F9F-59E1-4C56-991F-29038FFD3DC5","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"98473f2c5a011fb7c480eaf09178f0c93188ff4f","datavalue":{"value":{"entity-type":"item","numeric-id":1154255,"id":"Q1154255"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1154256$BF9AF214-8A7E-4973-B6C0-D43C74D9FD69","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"be9c3bfeeeab4cfc3e2b88df772b6f31d2d2dfb3","datavalue":{"value":{"entity-type":"item","numeric-id":544767,"id":"Q544767"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1154256$2500A58D-CCEC-47A6-B672-55C004ABFCC1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"aad5af15173651c09b73f0f543b91e695e32335f","datavalue":{"value":{"entity-type":"item","numeric-id":334229,"id":"Q334229"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1154256$9CC01CEB-0BDC-407B-BC62-659CE0A293D1","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"33359fd8a77e9cce0cfaf7c91dc047e11a0fed75","datavalue":{"value":{"entity-type":"item","numeric-id":109332,"id":"Q109332"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1154256$31A0785E-8C09-4611-A8E6-6AB796D784FC","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"56afe75e154439409929c71e0e459d1542811b6e","datavalue":{"value":{"time":"+1980-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":"Q1154256$C877F589-5283-401D-A1DC-35BDF80F6B83","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"1908801a2431998085c7d582418a428f7e7f6658","datavalue":{"value":"68M20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1154256$FCA02EEC-D0E8-404C-B6CB-4EE2249C2344","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"9698cd8c2ef5954df0ca7b245f8ac8962391d4ea","datavalue":{"value":"90B22","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1154256$FD5C2817-05FB-4AE2-A81B-7750363727B2","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"a7d9dc37bdde9ab918d17b2e193f50efd42f3a2f","datavalue":{"value":"3727623","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1154256$F0C6BBEA-E625-46B4-9A48-9FB936429814","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"62bb8b442f4e7dcc7a731412f4958cf02c1e702a","datavalue":{"value":"priority multiple access","type":"string"},"datatype":"string"},"type":"statement","id":"Q1154256$05BE5B4F-6666-4C45-8BCB-41F7EEBA89B7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"078dc3e0c49060c82d538d1a221124d653a56238","datavalue":{"value":"M/D/1 model","type":"string"},"datatype":"string"},"type":"statement","id":"Q1154256$52D013F9-D511-4B4C-A313-5DDAA868FF3B","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":"Q1154256$8814E927-749A-4314-9CBD-55C8B475BBE0","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Fast algorithm for decentralized priority access to a common channel","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Fast_algorithm_for_decentralized_priority_access_to_a_common_channel"}}}}}