{"entities":{"Q6829577":{"pageid":15117391,"ns":120,"title":"Item:Q6829577","lastrevid":56019349,"modified":"2026-02-24T14:52:19Z","type":"item","id":"Q6829577","labels":{"en":{"language":"en","value":"Upper bounds on the quantifier depth for graph differentiation in first-order logic"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7080195"}},"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":"Q6829577$E2C4AA19-DB00-47C3-9411-83E7CD43C7FC","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"8ffaba2f1281f905c3878fd66ad39090ddb2715a","datavalue":{"value":{"text":"Upper bounds on the quantifier depth for graph differentiation in first-order logic","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6829577$001F8459-CC04-4DD9-87B0-C80654998BAA","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"7b08a9d6174e248cd01a25247312a5cf429d6388","datavalue":{"value":"1440.6811","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6829577$2013A913-AA6D-486F-9095-03F5C3F2387D","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"153df631289d0b23eb92c215532a92376b6cddaf","datavalue":{"value":{"entity-type":"item","numeric-id":2946346,"id":"Q2946346"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6829577$5803BDA6-EEE8-4E23-9B16-C4C58DCE83D3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"d8b52841988544f65003154e5cc7288ffdbd3b6c","datavalue":{"value":{"entity-type":"item","numeric-id":344863,"id":"Q344863"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6829577$E738F730-F10D-49BB-96F4-29EFB4957E18","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"da58c52dc46c86e7440f2499c9e1bef3537c5562","datavalue":{"value":{"entity-type":"item","numeric-id":2786118,"id":"Q2786118"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6829577$D8F45889-9B7E-4A5C-BF94-D76E3ED7EFAD","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"0eaf95e77ca1b4130000107923cf17e957ee1827","datavalue":{"value":{"time":"+2019-07-12T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6829577$096B515D-0DAC-4590-B0BB-7CBCBFC32422","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"8b0f166240d9dc937c89dbc2241079deae14191f","datavalue":{"value":"68Q19","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6829577$BCF3FC57-69CD-47C6-A602-688E561C33F0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"b58df756e27df0e7b4d6d54dbbfd9015b563e63d","datavalue":{"value":"03C13","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6829577$08A343D2-72FA-4BA2-869D-4DB8DBD92341","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"25e5a5f23d3e2e2c05864da16eda493011c33276","datavalue":{"value":"03C80","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6829577$109E223E-8A2E-495C-B158-5E7B10E7DDF2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"749b7137f279a66a306e75e15f613231b281c1c5","datavalue":{"value":"05C85","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6829577$74104D6C-4586-4E9E-A867-972706129742","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"86fb23b7c2b7581862d0411119929cac480b6cd8","datavalue":{"value":"7080195","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6829577$8370A89D-796C-4423-BE19-5EB65AD56E90","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e2e80a7123e4ea6d0418cb24d37b1837f13e3514","datavalue":{"value":"first-order logic","type":"string"},"datatype":"string"},"type":"statement","id":"Q6829577$77653843-675A-4DFE-9D19-85BDBFB931A3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"2224861cbed8f8c5633e3aa539007f103afd6c15","datavalue":{"value":"counting quantifiers","type":"string"},"datatype":"string"},"type":"statement","id":"Q6829577$9DECEF28-CFC6-46D9-8608-E2D6B3B84778","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0f47459b713b570927f968bef778415cd8638c65","datavalue":{"value":"Weisfeiler-Leman algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q6829577$0C90EB1A-BC62-4E22-8014-02CD37107FA1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c52606074134fac2c794ae69235ae2bfb02e9ede","datavalue":{"value":"color refinement","type":"string"},"datatype":"string"},"type":"statement","id":"Q6829577$02D0EB67-FAD5-426A-A10E-CB122AF053C9","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":"Q6829577$A3D00859-9974-45B0-BBA1-E1C57636C0D5","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Upper bounds on the quantifier depth for graph differentiation in first-order logic","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Upper_bounds_on_the_quantifier_depth_for_graph_differentiation_in_first-order_logic"}}}}}