{"entities":{"Q7159696":{"pageid":22094922,"ns":120,"title":"Item:Q7159696","lastrevid":107206907,"modified":"2026-10-23T12:11:05Z","type":"item","id":"Q7159696","labels":{"en":{"language":"en","value":"Modular links: Bunch algorithm and upper volume bounds"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"aliases":{},"claims":{"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"5033ef0e1ff62dab56ffd3fa9eadcc40a2185ecb","datavalue":{"value":"math.GT","type":"string"},"datatype":"string"},"type":"statement","id":"Q7159696$5F222F18-ACA1-4807-9653-1C7ED2410662","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"8974c75d59235be06449aa5885d63ed16e7ba241","datavalue":{"value":{"time":"+2023-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":"Q7159696$B3CCF440-C8C5-4D11-ADA7-D8F1C04CB24A","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"ff1602ac50270d2cc3561c7ac6817c7c1045f6eb","datavalue":{"value":"2308.12847","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7159696$AD8007DD-1516-4964-BB4D-3EEA23776002","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"dbb2bcbd8ab3bc38894213c4c36c7e555212dae4","datavalue":{"value":{"entity-type":"item","numeric-id":6654050,"id":"Q6654050"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7159696$B91DF687-D00B-4389-A065-E3A05C2D4756","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"d1cc2447675cfc38414407f4efcfc7a2563bb334","datavalue":{"value":{"entity-type":"item","numeric-id":2664140,"id":"Q2664140"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7159696$D971477C-B45D-40CC-B206-CFAA27E8D4F2","rank":"normal"}],"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":"Q7159696$58CD1F9D-75B6-4386-954F-D327BAB63D60","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":"Q7159696$4F51FC69-9B07-481D-AD22-21BA16AEF7F8","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Modular links: Bunch algorithm and upper volume bounds (scientific article from arXiv)","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Modular_links:_Bunch_algorithm_and_upper_volume_bounds_(scientific_article_from_arXiv)"}}}}}