{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:Z2GGIB4B4XFIYTQJ2OJFPBZS7H","short_pith_number":"pith:Z2GGIB4B","schema_version":"1.0","canonical_sha256":"ce8c640781e5ca8c4e09d392578732f9e951db1342c5b84ff1533bfaa5d4576d","source":{"kind":"arxiv","id":"2402.10439","version":2},"attestation_state":"computed","paper":{"title":"Competitive Equilibrium for Chores: from Dual Eisenberg-Gale to a Fast, Greedy, LP-based Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.GT","authors_text":"Bhaskar Ray Chaudhury, Christian Kroer, Ruta Mehta, Tianlong Nan","submitted_at":"2024-02-16T04:11:23Z","abstract_excerpt":"We study the computation of competitive equilibrium for Fisher markets with $n$ agents and $m$ divisible chores. Competitive equilibria for chores are known to correspond to the nonzero KKT points of a program that minimizes the product of agent disutilities, which is a non-convex program whose zero points foil iterative optimization methods. We introduce a dual-like analogue of this program, and show that a simple modification to our \"dual\" program avoids such zero points, while retaining the correspondence between KKT points and competitive equilibria. This allows, for the first time ever, a"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2402.10439","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2024-02-16T04:11:23Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"0908d58b35afa354bc60b35ed2b43634a3666352f840a9fa651b1ea1fb97ff44","abstract_canon_sha256":"f3ad50bf8adf642ca26062665ec105a6060ac86ea637e2141ce3957207e61568"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:37:52.023158Z","signature_b64":"lU8b1TLlXnD643ZBq+Ag490son2unaDkSIkDRVWRw45UKPtCf/GJAFiHf8eFhOfB9qOM+uPzh7x91sxl94v1Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce8c640781e5ca8c4e09d392578732f9e951db1342c5b84ff1533bfaa5d4576d","last_reissued_at":"2026-07-05T09:37:52.022681Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:37:52.022681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Competitive Equilibrium for Chores: from Dual Eisenberg-Gale to a Fast, Greedy, LP-based Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.GT","authors_text":"Bhaskar Ray Chaudhury, Christian Kroer, Ruta Mehta, Tianlong Nan","submitted_at":"2024-02-16T04:11:23Z","abstract_excerpt":"We study the computation of competitive equilibrium for Fisher markets with $n$ agents and $m$ divisible chores. Competitive equilibria for chores are known to correspond to the nonzero KKT points of a program that minimizes the product of agent disutilities, which is a non-convex program whose zero points foil iterative optimization methods. We introduce a dual-like analogue of this program, and show that a simple modification to our \"dual\" program avoids such zero points, while retaining the correspondence between KKT points and competitive equilibria. This allows, for the first time ever, a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.10439","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.10439/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2402.10439","created_at":"2026-07-05T09:37:52.022732+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.10439v2","created_at":"2026-07-05T09:37:52.022732+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.10439","created_at":"2026-07-05T09:37:52.022732+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z2GGIB4B4XFI","created_at":"2026-07-05T09:37:52.022732+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z2GGIB4B4XFIYTQJ","created_at":"2026-07-05T09:37:52.022732+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z2GGIB4B","created_at":"2026-07-05T09:37:52.022732+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z2GGIB4B4XFIYTQJ2OJFPBZS7H","json":"https://pith.science/pith/Z2GGIB4B4XFIYTQJ2OJFPBZS7H.json","graph_json":"https://pith.science/api/pith-number/Z2GGIB4B4XFIYTQJ2OJFPBZS7H/graph.json","events_json":"https://pith.science/api/pith-number/Z2GGIB4B4XFIYTQJ2OJFPBZS7H/events.json","paper":"https://pith.science/paper/Z2GGIB4B"},"agent_actions":{"view_html":"https://pith.science/pith/Z2GGIB4B4XFIYTQJ2OJFPBZS7H","download_json":"https://pith.science/pith/Z2GGIB4B4XFIYTQJ2OJFPBZS7H.json","view_paper":"https://pith.science/paper/Z2GGIB4B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.10439&json=true","fetch_graph":"https://pith.science/api/pith-number/Z2GGIB4B4XFIYTQJ2OJFPBZS7H/graph.json","fetch_events":"https://pith.science/api/pith-number/Z2GGIB4B4XFIYTQJ2OJFPBZS7H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z2GGIB4B4XFIYTQJ2OJFPBZS7H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z2GGIB4B4XFIYTQJ2OJFPBZS7H/action/storage_attestation","attest_author":"https://pith.science/pith/Z2GGIB4B4XFIYTQJ2OJFPBZS7H/action/author_attestation","sign_citation":"https://pith.science/pith/Z2GGIB4B4XFIYTQJ2OJFPBZS7H/action/citation_signature","submit_replication":"https://pith.science/pith/Z2GGIB4B4XFIYTQJ2OJFPBZS7H/action/replication_record"}},"created_at":"2026-07-05T09:37:52.022732+00:00","updated_at":"2026-07-05T09:37:52.022732+00:00"}