{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2QRL7SF2YP7PJ7HADATJMGZBTA","short_pith_number":"pith:2QRL7SF2","schema_version":"1.0","canonical_sha256":"d422bfc8bac3fef4fce01826961b219820bd2b349fb810d4004bcb19166dc291","source":{"kind":"arxiv","id":"1510.02694","version":2},"attestation_state":"computed","paper":{"title":"An Improved Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Jugal Garg, Kurt Mehlhorn, Rann Duan","submitted_at":"2015-10-09T15:05:08Z","abstract_excerpt":"We present an improved combinatorial algorithm for the computation of equilibrium prices in the linear Arrow-Debreu model. For a market with $n$ agents and integral utilities bounded by $U$, the algorithm runs in $O(n^7 \\log^3 (nU))$ time. This improves upon the previously best algorithm of Ye by a factor of $\\tOmega(n)$. The algorithm refines the algorithm described by Duan and Mehlhorn and improves it by a factor of $\\tOmega(n^3)$. The improvement comes from a better understanding of the iterative price adjustment process, the improved balanced flow computation for nondegenerate instances, 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":"1510.02694","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-09T15:05:08Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"1c79959e7cd875d1ba618e5e04ebe900e0c996b7792cd5902229fe1803aaa767","abstract_canon_sha256":"5b6b1ab0ebecb0479d4ad0d893df1ca7a8f512175653053b540d2e10836876da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:00.731668Z","signature_b64":"XblSW6sF/kyUFrBgNA87UXpIVxwXC5GXl2ZKk+iWmQDRYmFzyCBxiX1hUlqAuF+CEmh61cky9eG4surDXZVvCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d422bfc8bac3fef4fce01826961b219820bd2b349fb810d4004bcb19166dc291","last_reissued_at":"2026-05-18T01:30:00.730937Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:00.730937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Improved Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Jugal Garg, Kurt Mehlhorn, Rann Duan","submitted_at":"2015-10-09T15:05:08Z","abstract_excerpt":"We present an improved combinatorial algorithm for the computation of equilibrium prices in the linear Arrow-Debreu model. For a market with $n$ agents and integral utilities bounded by $U$, the algorithm runs in $O(n^7 \\log^3 (nU))$ time. This improves upon the previously best algorithm of Ye by a factor of $\\tOmega(n)$. The algorithm refines the algorithm described by Duan and Mehlhorn and improves it by a factor of $\\tOmega(n^3)$. The improvement comes from a better understanding of the iterative price adjustment process, the improved balanced flow computation for nondegenerate instances, a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02694","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":""},"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":"1510.02694","created_at":"2026-05-18T01:30:00.731057+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.02694v2","created_at":"2026-05-18T01:30:00.731057+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02694","created_at":"2026-05-18T01:30:00.731057+00:00"},{"alias_kind":"pith_short_12","alias_value":"2QRL7SF2YP7P","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"2QRL7SF2YP7PJ7HA","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"2QRL7SF2","created_at":"2026-05-18T12:29:02.477457+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/2QRL7SF2YP7PJ7HADATJMGZBTA","json":"https://pith.science/pith/2QRL7SF2YP7PJ7HADATJMGZBTA.json","graph_json":"https://pith.science/api/pith-number/2QRL7SF2YP7PJ7HADATJMGZBTA/graph.json","events_json":"https://pith.science/api/pith-number/2QRL7SF2YP7PJ7HADATJMGZBTA/events.json","paper":"https://pith.science/paper/2QRL7SF2"},"agent_actions":{"view_html":"https://pith.science/pith/2QRL7SF2YP7PJ7HADATJMGZBTA","download_json":"https://pith.science/pith/2QRL7SF2YP7PJ7HADATJMGZBTA.json","view_paper":"https://pith.science/paper/2QRL7SF2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.02694&json=true","fetch_graph":"https://pith.science/api/pith-number/2QRL7SF2YP7PJ7HADATJMGZBTA/graph.json","fetch_events":"https://pith.science/api/pith-number/2QRL7SF2YP7PJ7HADATJMGZBTA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2QRL7SF2YP7PJ7HADATJMGZBTA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2QRL7SF2YP7PJ7HADATJMGZBTA/action/storage_attestation","attest_author":"https://pith.science/pith/2QRL7SF2YP7PJ7HADATJMGZBTA/action/author_attestation","sign_citation":"https://pith.science/pith/2QRL7SF2YP7PJ7HADATJMGZBTA/action/citation_signature","submit_replication":"https://pith.science/pith/2QRL7SF2YP7PJ7HADATJMGZBTA/action/replication_record"}},"created_at":"2026-05-18T01:30:00.731057+00:00","updated_at":"2026-05-18T01:30:00.731057+00:00"}