{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2QRL7SF2YP7PJ7HADATJMGZBTA","short_pith_number":"pith:2QRL7SF2","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"},"canonical_sha256":"d422bfc8bac3fef4fce01826961b219820bd2b349fb810d4004bcb19166dc291","source":{"kind":"arxiv","id":"1510.02694","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.02694","created_at":"2026-05-18T01:30:00Z"},{"alias_kind":"arxiv_version","alias_value":"1510.02694v2","created_at":"2026-05-18T01:30:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02694","created_at":"2026-05-18T01:30:00Z"},{"alias_kind":"pith_short_12","alias_value":"2QRL7SF2YP7P","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2QRL7SF2YP7PJ7HA","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2QRL7SF2","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2QRL7SF2YP7PJ7HADATJMGZBTA","target":"record","payload":{"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"},"canonical_sha256":"d422bfc8bac3fef4fce01826961b219820bd2b349fb810d4004bcb19166dc291","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"},"source_kind":"arxiv","source_id":"1510.02694","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:30:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fc+v6E/NedAeqgDtrFcDMbZR0OeAp6eLIZLRyRXzASwfuxQ+ig+WNYVlM2zkuITTGzOhkRJb95KL3ajFy0tZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T07:32:29.846154Z"},"content_sha256":"dca092605be54eba1aa72eb6d36d6658303f94d888842195dc152548329a40f9","schema_version":"1.0","event_id":"sha256:dca092605be54eba1aa72eb6d36d6658303f94d888842195dc152548329a40f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2QRL7SF2YP7PJ7HADATJMGZBTA","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:30:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W+76hNoC5sjvYQfRfF6zAw/+rpM69bNS83tQ3N9RdvucbRwlB29QEThdyalI1rkXXuZZiZqfx0fmUC6WMAGbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T07:32:29.846800Z"},"content_sha256":"094e3c2969dc0e86fefa3065b5e4dc5e906b02f68716135f0f4174ad692f7d92","schema_version":"1.0","event_id":"sha256:094e3c2969dc0e86fefa3065b5e4dc5e906b02f68716135f0f4174ad692f7d92"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2QRL7SF2YP7PJ7HADATJMGZBTA/bundle.json","state_url":"https://pith.science/pith/2QRL7SF2YP7PJ7HADATJMGZBTA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2QRL7SF2YP7PJ7HADATJMGZBTA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-07T07:32:29Z","links":{"resolver":"https://pith.science/pith/2QRL7SF2YP7PJ7HADATJMGZBTA","bundle":"https://pith.science/pith/2QRL7SF2YP7PJ7HADATJMGZBTA/bundle.json","state":"https://pith.science/pith/2QRL7SF2YP7PJ7HADATJMGZBTA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2QRL7SF2YP7PJ7HADATJMGZBTA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2QRL7SF2YP7PJ7HADATJMGZBTA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5b6b1ab0ebecb0479d4ad0d893df1ca7a8f512175653053b540d2e10836876da","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-09T15:05:08Z","title_canon_sha256":"1c79959e7cd875d1ba618e5e04ebe900e0c996b7792cd5902229fe1803aaa767"},"schema_version":"1.0","source":{"id":"1510.02694","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.02694","created_at":"2026-05-18T01:30:00Z"},{"alias_kind":"arxiv_version","alias_value":"1510.02694v2","created_at":"2026-05-18T01:30:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02694","created_at":"2026-05-18T01:30:00Z"},{"alias_kind":"pith_short_12","alias_value":"2QRL7SF2YP7P","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2QRL7SF2YP7PJ7HA","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2QRL7SF2","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:094e3c2969dc0e86fefa3065b5e4dc5e906b02f68716135f0f4174ad692f7d92","target":"graph","created_at":"2026-05-18T01:30:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Jugal Garg, Kurt Mehlhorn, Rann Duan","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-09T15:05:08Z","title":"An Improved Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02694","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:dca092605be54eba1aa72eb6d36d6658303f94d888842195dc152548329a40f9","target":"record","created_at":"2026-05-18T01:30:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5b6b1ab0ebecb0479d4ad0d893df1ca7a8f512175653053b540d2e10836876da","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-09T15:05:08Z","title_canon_sha256":"1c79959e7cd875d1ba618e5e04ebe900e0c996b7792cd5902229fe1803aaa767"},"schema_version":"1.0","source":{"id":"1510.02694","kind":"arxiv","version":2}},"canonical_sha256":"d422bfc8bac3fef4fce01826961b219820bd2b349fb810d4004bcb19166dc291","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d422bfc8bac3fef4fce01826961b219820bd2b349fb810d4004bcb19166dc291","first_computed_at":"2026-05-18T01:30:00.730937Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:00.730937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XblSW6sF/kyUFrBgNA87UXpIVxwXC5GXl2ZKk+iWmQDRYmFzyCBxiX1hUlqAuF+CEmh61cky9eG4surDXZVvCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:00.731668Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.02694","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dca092605be54eba1aa72eb6d36d6658303f94d888842195dc152548329a40f9","sha256:094e3c2969dc0e86fefa3065b5e4dc5e906b02f68716135f0f4174ad692f7d92"],"state_sha256":"2adc4fdac01a16350427fac62ee4c673c74db241e26cd11289048febbbb3934e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"70D0V0EM0hfjrB9bn+NFy1TNOCcsdCO/rICh7MpRLtzjVjQujOsVYwlP7gFWpH42zdaePnjCXYkJcuLBMmn2CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T07:32:29.849704Z","bundle_sha256":"209c5ef32ce40ca21e79482a7f91aba0b2aaf73cf75d35481007e0ce4d20ea15"}}