{"entities":{"Q4106229":{"pageid":6135829,"ns":120,"title":"Item:Q4106229","lastrevid":81531413,"modified":"2026-05-06T18:44:09Z","type":"item","id":"Q4106229","labels":{"en":{"language":"en","value":"An Algorithm forr-Bases of a Directed Graph"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3529888"}},"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":"Q4106229$EB90F7FB-F8CE-41B5-8DAA-F02B7ABC90C8","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"d8b643de39611cc92e7be9586d1c2a1c9b609e64","datavalue":{"value":{"text":"An Algorithm forr-Bases of a Directed Graph","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q4106229$0ED58359-8CF2-4055-A3BA-8FA1E0248C45","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"28aac94fa13d86a67736beac585ef6c90e75081c","datavalue":{"value":"0339.05112","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4106229$5112A0CE-8A92-4249-ADBE-73D14EB39851","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"bf7366d439122f1d1988e67edb10a716f4695ab6","datavalue":{"value":{"entity-type":"item","numeric-id":2719842,"id":"Q2719842"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4106229$DB5266F9-19A1-43FC-BA92-642EB9FF902B","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":"Q4106229$931C2FBE-C851-42FF-B7D4-6311C45424C1","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"83bbf0b299346afb89579c3d6a26f4aedc76938a","datavalue":{"value":"05C20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4106229$F8862BF7-FFFF-4856-8998-F0CF7706F852","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"9ed1e3c6cced595a05b8ae19055521b22405b78a","datavalue":{"value":"68W99","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4106229$BEAB93B1-040B-4D14-B2C5-C981CFF7CAB1","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"7a5a0a2c97ec9352aa14847d9290cf7cbc606a26","datavalue":{"value":"3529888","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4106229$B0D56A74-9124-4049-B22A-D5D64DCC2BEC","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":"Q4106229$47470753-00E6-4555-BEC8-3D7F97600327","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"671994739150e1ee99973db8244da0561286eb5f","datavalue":{"value":"https://doi.org/10.1002/net.3230060209","type":"string"},"datatype":"url"},"type":"statement","id":"Q4106229$C3A01662-8192-49CF-B3E0-A4CD48866A7F","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"8c146f87750e4267868d5e1f030a0ee84d68143d","datavalue":{"value":"W2116776217","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4106229$D860A944-034D-41DB-8A6F-28EF5C9365A4","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"8e3613324ce99c69c98a8d4db750319d38fcf1e7","datavalue":{"value":"10.1002/NET.3230060209","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4106229$C6CF1795-0EAC-4DE7-A224-6CBA71641D7F","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An Algorithm forr-Bases of a Directed Graph","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_Algorithm_forr-Bases_of_a_Directed_Graph"}}}}}