{"entities":{"Q6560800":{"pageid":14171955,"ns":120,"title":"Item:Q6560800","lastrevid":99820361,"modified":"2026-06-05T20:46:42Z","type":"item","id":"Q6560800","labels":{"en":{"language":"en","value":"Counting and enumerating optimum cut sets for hypergraph \\(k\\)-partitioning problems for fixed \\(k\\)"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7870226"}},"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":"Q6560800$8D0D579C-A7F7-4F3B-9365-806B747D201C","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"ad5a26316dcc118fdb7a484e64f8a7924bfb0cc6","datavalue":{"value":{"text":"Counting and enumerating optimum cut sets for hypergraph \\(k\\)-partitioning problems for fixed \\(k\\)","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6560800$AA6EF0EC-040C-4D92-B256-C7B93ECC3B52","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"3f153e496f81f2dda6620ae6b2a759a902ceeb19","datavalue":{"value":{"entity-type":"item","numeric-id":2164678,"id":"Q2164678"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6560800$0225047F-00BD-4B52-81F6-773BE611F823","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"be47dec5208ddb90e159adfa758ed42c589b9bac","datavalue":{"value":{"entity-type":"item","numeric-id":783040,"id":"Q783040"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6560800$E0467C63-BB88-48A9-9A31-C5FF85D2AA10","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"1d8a6556460d3871dc34408bf3441f08f4741a52","datavalue":{"value":{"entity-type":"item","numeric-id":2061896,"id":"Q2061896"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6560800$D5594DD4-3D4F-46E7-8775-00D579B7406F","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"aad9968298383135691f4dcdd005dbce68275c0d","datavalue":{"value":{"time":"+2024-06-24T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6560800$0BD34FFC-CF5C-4883-A25E-5FE7625E12A9","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"1a86519cb3571ebce07f2774b2a00a0f17e12c3e","datavalue":{"value":"68Nxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6560800$DA63409F-E5F3-4754-9D69-F2CD12A13525","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"f969879f531643f058f8dd4c87a7dd4eb7b8c4c8","datavalue":{"value":"68Qxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6560800$5729A39E-3F05-4259-9997-E302C8104DF5","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"bbf536a504fa815b7010a41e133cd2db5bcea3d9","datavalue":{"value":"7870226","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6560800$B220254E-6604-488F-BE50-33DA73A7FBB0","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"370afb08886d454ad02a3e32ab188f88b9fed55c","datavalue":{"value":"hypergraphs","type":"string"},"datatype":"string"},"type":"statement","id":"Q6560800$A058819C-BBA2-47A2-95C6-37942C5489BC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a8c2d890c78873baf30046b6cafe5765c87db896","datavalue":{"value":"\\(k\\)-partitioning","type":"string"},"datatype":"string"},"type":"statement","id":"Q6560800$6EC3AEDE-A27C-46DC-8E0F-8FE3F0C326D5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"aa64eae916ac50f9d0bdde79696d641a11ea4cba","datavalue":{"value":"counting","type":"string"},"datatype":"string"},"type":"statement","id":"Q6560800$8BB37DDE-7A6A-47C1-ABB6-1593F8BD4DDC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"816681eea21269f3ad56375e4f8d7d873b144eb6","datavalue":{"value":"enumeration","type":"string"},"datatype":"string"},"type":"statement","id":"Q6560800$F5AFF5A5-6803-4582-85C8-8F2DBA7D2479","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":"Q6560800$C27D42C5-C149-43FD-A98F-7981C5F057FE","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"165bd12bb8bca5240d3246864b64141ebc182511","datavalue":{"value":"10.4230/LIPICS.ICALP.2022.16","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6560800$9AFB86A2-016D-4CD1-BA97-DAA3F9D5C14F","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Counting and enumerating optimum cut sets for hypergraph \\(k\\)-partitioning problems for fixed \\(k\\) (scientific article; zbMATH DE number 7870226)","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Counting_and_enumerating_optimum_cut_sets_for_hypergraph_%5C(k%5C)-partitioning_problems_for_fixed_%5C(k%5C)_(scientific_article;_zbMATH_DE_number_7870226)"}}}}}