{"entities":{"Q6575096":{"pageid":14186251,"ns":120,"title":"Item:Q6575096","lastrevid":95575580,"modified":"2026-06-05T09:19:17Z","type":"item","id":"Q6575096","labels":{"en":{"language":"en","value":"Approximately counting independent sets in bipartite graphs via graph containers"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7883605"}},"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":"Q6575096$6EAF730D-296C-4449-9787-FAAAE3F069B2","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"17f1f255e1fbf7f3cbd031cfd1cbbc721bb33b1a","datavalue":{"value":{"text":"Approximately counting independent sets in bipartite graphs via graph containers","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6575096$E64F2183-8790-4DAB-8B13-4B48FAAB77DB","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"3ab6067086a0986dac588666e2fc050164518b55","datavalue":{"value":"10.1137/1.9781611977073.24","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6575096$899BA498-1867-4F62-B425-6A4BB438EBC4","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"57caa8e7003677d4bbb7d229417b3cd41c1cd560","datavalue":{"value":{"entity-type":"item","numeric-id":322270,"id":"Q322270"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6575096$41159E8D-E3EA-4D20-971D-BCA548DB0EF2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"f6ad8cfe3282858a8ccfb3ffcc229b5c1509709d","datavalue":{"value":{"entity-type":"item","numeric-id":510533,"id":"Q510533"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6575096$A5E307B5-096A-4266-818D-A8156450CD97","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"f42c9e5affb45cfc62e4ebaac726414fee007815","datavalue":{"value":{"entity-type":"item","numeric-id":518177,"id":"Q518177"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6575096$6013C7A9-B82D-4BD9-AE8C-ECE8EEEBECED","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"20bb98d83d204109387fd4af6383bb63aeda87a0","datavalue":{"value":{"time":"+2024-07-19T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6575096$02E23A85-FD5D-4A36-BC0F-FEA196CD6FA2","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"fa684c8d52e9da1094b0c2d762898ace723c7ee3","datavalue":{"value":"68Wxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6575096$FF1AFC43-3A53-44CB-85D7-489E2A320384","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"f5db1657677d95a56f54150e2422e4509226179a","datavalue":{"value":"7883605","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6575096$29C1D244-5AA5-4279-B921-12ACB05B139E","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":"Q6575096$BD567C8A-46DA-4B40-8E13-46C78F33C8B4","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Approximately counting independent sets in bipartite graphs via graph containers","badges":[]}}}}}