{"entities":{"Q6429426":{"pageid":13562448,"ns":120,"title":"Item:Q6429426","lastrevid":99362189,"modified":"2026-06-05T19:47:42Z","type":"item","id":"Q6429426","labels":{"en":{"language":"en","value":"Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 900583662"}},"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":"Q6429426$6AD70DF5-ECAA-43C7-B82A-854386C63B8D","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"89caa31fd22a360d487b4d2ba44c1d87259c2aff","datavalue":{"value":{"time":"+2023-03-13T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6429426$2FB03905-3585-4E9D-88FE-5095BB7A2854","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"1bb5875e7106e9f5c378ef838caa380176618ea6","datavalue":{"value":{"entity-type":"item","numeric-id":827594,"id":"Q827594"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6429426$400F941D-3BEB-49E3-9C42-EA488FE2A872","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"21ce8339ad1f2cb03c3ea4ae83436f78c8338827","datavalue":{"value":{"entity-type":"item","numeric-id":335347,"id":"Q335347"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6429426$3C7A89A4-ED66-4E6C-8801-4D8DEDD439D3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"b017e7375c5b2934753ccfabbece9ba049d7e2d2","datavalue":{"value":{"entity-type":"item","numeric-id":2697440,"id":"Q2697440"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6429426$47353899-0BE9-438B-9DD1-CCD75BADD680","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"4257a96d374999e25a82b1afb325bd015c77e1c0","datavalue":{"value":"900583662","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6429426$1FB7C12B-BEA7-4E65-8719-B3C8753AD316","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":"Q6429426$B94794D4-BF24-41EE-94DD-4F7B72BFB875","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Polynomial-Time_Approximation_Schemes_for_Independent_Packing_Problems_on_Fractionally_Tree-Independence-Number-Fragile_Graphs"}}}}}