{"entities":{"Q6356697":{"pageid":13491093,"ns":120,"title":"Item:Q6356697","lastrevid":99184268,"modified":"2026-06-05T19:24:22Z","type":"item","id":"Q6356697","labels":{"en":{"language":"en","value":"Constructing minimally 3-connected graphs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 900468190"}},"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":"Q6356697$12567E55-6057-451A-9A40-C8BAEE380216","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"c38aebe3a2f302da91d14107e120fb7157178e5f","datavalue":{"value":{"time":"+2020-12-22T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6356697$DC6EA9D4-D44F-426C-9086-41238C41F7C7","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"6ddcc72e14aa406eceb6ecd2903cbdda5476a865","datavalue":{"value":{"entity-type":"item","numeric-id":649008,"id":"Q649008"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6356697$4185DF03-F34D-484B-A280-2C2FB064B849","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"9775f0d1a70c963405a18a2a67fb2dba8ac038c8","datavalue":{"value":{"entity-type":"item","numeric-id":3556942,"id":"Q3556942"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6356697$614332EE-CD3D-4D9A-89D3-9FBD5AE44838","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"5412cce30ec5601d059fee35938276f6697946e4","datavalue":{"value":{"entity-type":"item","numeric-id":404392,"id":"Q404392"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6356697$58A25972-0D60-4090-9E7C-3450A7FCFC13","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"749b7137f279a66a306e75e15f613231b281c1c5","datavalue":{"value":"05C85","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6356697$AFA25169-6323-43A8-BF09-4ADC9F707EB0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"49261cbbd2f3b64e072aca4630c2592536037a47","datavalue":{"value":"05C83","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6356697$5A6C7F14-EF63-4240-84B7-6DE2A28E0D5F","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"749eda41eba12e646add8779baae9b4b2fb0de48","datavalue":{"value":"900468190","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6356697$A5F99B0D-F3C3-4846-B7A2-243C2CFA5181","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":"Q6356697$91F0F278-4BF9-4AB2-9791-858768279873","rank":"normal"}],"P1687":[{"mainsnak":{"snaktype":"value","property":"P1687","hash":"30e4b017c8e36659b358406d389b64280782b77f","datavalue":{"value":"https://github.com/rkingan/m3c","type":"string"},"datatype":"url"},"type":"statement","id":"Q6356697$5F63D751-E7F0-430B-8B65-78D28BF85F1A","rank":"normal","references":[{"hash":"0db723770fdb01cf583c9b98e8c74ac187066396","snaks":{"P1688":[{"snaktype":"value","property":"P1688","hash":"058a8609afcb6312237f47e86d4a35beccdaed72","datavalue":{"value":"https://paperswithcode.com/paper/constructing-minimally-3-connected-graphs","type":"string"},"datatype":"url"}],"P1689":[{"snaktype":"value","property":"P1689","hash":"24a5bedbb98b468462189ba0d6c16a88a2414cc1","datavalue":{"value":"publication","type":"string"},"datatype":"string"}]},"snaks-order":["P1688","P1689"]}]}]},"sitelinks":{"mardi":{"site":"mardi","title":"Constructing minimally 3-connected graphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Constructing_minimally_3-connected_graphs"}}}}}