{"entities":{"Q6747443":{"pageid":14466219,"ns":120,"title":"Item:Q6747443","lastrevid":105962306,"modified":"2026-10-21T13:26:37Z","type":"item","id":"Q6747443","labels":{"en":{"language":"en","value":"Computing Competitive Equilibrium for Chores: Linear Convergence and Lightweight Iteration"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"aliases":{},"claims":{"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"5a067f3cc35200b51bab0398d603e2eb9779a610","datavalue":{"value":"math.OC","type":"string"},"datatype":"string"},"type":"statement","id":"Q6747443$016E199A-D4A3-421A-9C17-650ECF77598F","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"fecb2f2a7c1f813db3a025a7dd8b5d82439618b9","datavalue":{"value":{"time":"+2024-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":"Q6747443$694BDF86-2D31-490B-82AF-3AE6ADD45354","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"dc1c6add2fa5d4b361130eae778baf94c65233cd","datavalue":{"value":"2410.04036","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6747443$378C3F8E-26D8-4282-8CDD-A3E86B8625EB","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"142cce64d0d1b2b55d8a1208b9a3c56a6dfbfc54","datavalue":{"value":{"entity-type":"item","numeric-id":251370,"id":"Q251370"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6747443$7D814CDA-97E9-43B1-B0B1-7F373BADAE8D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"e5028b255e0b6055bbb201621929a2021e03c415","datavalue":{"value":{"entity-type":"item","numeric-id":6747442,"id":"Q6747442"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6747443$1B4FB8CE-0EFC-42DC-B19D-7AA5F8F4C660","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"a79b9e8e4a86b3b6272a2d543345119dee06bf37","datavalue":{"value":{"entity-type":"item","numeric-id":644907,"id":"Q644907"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6747443$048A41A9-58D0-4AFC-B69F-C637FF14BB2B","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":"Q6747443$300A5F8C-9809-470D-A612-9DBF0151C0E8","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":"Q6747443$E72A5332-A120-4ECC-BC56-82984BF0CF0C","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Computing Competitive Equilibrium for Chores: Linear Convergence and Lightweight Iteration","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Computing_Competitive_Equilibrium_for_Chores:_Linear_Convergence_and_Lightweight_Iteration"}}}}}