{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2002:WVK3YWBWKDE4UX5OOYRXMJTVYO","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":"8ba1b55fa91a1c8d3375ac222fdc827e168c4e9193c2fcd95ee0954b0de0cffb","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2002-05-19T14:43:19Z","title_canon_sha256":"81c933bd7db42ec5edb22e6dd895bd229cfd96c8b84f2316ca07d5a85f808f09"},"schema_version":"1.0","source":{"id":"cs/0205046","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0205046","created_at":"2026-05-18T01:26:23Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0205046v2","created_at":"2026-05-18T01:26:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0205046","created_at":"2026-05-18T01:26:23Z"},{"alias_kind":"pith_short_12","alias_value":"WVK3YWBWKDE4","created_at":"2026-05-18T12:25:51Z"},{"alias_kind":"pith_short_16","alias_value":"WVK3YWBWKDE4UX5O","created_at":"2026-05-18T12:25:51Z"},{"alias_kind":"pith_short_8","alias_value":"WVK3YWBW","created_at":"2026-05-18T12:25:51Z"}],"graph_snapshots":[{"event_id":"sha256:43c0621c949b2e7fd0bf4db8de385140bd715ae4e806ebe06b1ffd837d5541f5","target":"graph","created_at":"2026-05-18T01:26:23Z","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 give a lower bound on the iteration complexity of a natural class of Lagrangean-relaxation algorithms for approximately solving packing/covering linear programs. We show that, given an input with $m$ random 0/1-constraints on $n$ variables, with high probability, any such algorithm requires $\\Omega(\\rho \\log(m)/\\epsilon^2)$ iterations to compute a $(1+\\epsilon)$-approximate solution, where $\\rho$ is the width of the input. The bound is tight for a range of the parameters $(m,n,\\rho,\\epsilon)$.\n  The algorithms in the class include Dantzig-Wolfe decomposition, Benders' decomposition, Lagrang","authors_text":"Neal E. Young, Phil Klein","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2002-05-19T14:43:19Z","title":"On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0205046","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:5b9009bfa8d2cbd6b4d87b8429c35c25d0a3f61d47ecd7496670a0545aa09cf1","target":"record","created_at":"2026-05-18T01:26:23Z","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":"8ba1b55fa91a1c8d3375ac222fdc827e168c4e9193c2fcd95ee0954b0de0cffb","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2002-05-19T14:43:19Z","title_canon_sha256":"81c933bd7db42ec5edb22e6dd895bd229cfd96c8b84f2316ca07d5a85f808f09"},"schema_version":"1.0","source":{"id":"cs/0205046","kind":"arxiv","version":2}},"canonical_sha256":"b555bc583650c9ca5fae7623762675c39de3037656dfe7fa8ef8b81d809cb0d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b555bc583650c9ca5fae7623762675c39de3037656dfe7fa8ef8b81d809cb0d9","first_computed_at":"2026-05-18T01:26:23.904710Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:23.904710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lReFMJvUu9oPfKxkaWtwm2x7YMn7KQG0AA6pG0X1S6WZLSFluNpOmDs8UR2D8EXti9y2aJ3qbTz9ZzGqOHyHDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:23.905128Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0205046","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b9009bfa8d2cbd6b4d87b8429c35c25d0a3f61d47ecd7496670a0545aa09cf1","sha256:43c0621c949b2e7fd0bf4db8de385140bd715ae4e806ebe06b1ffd837d5541f5"],"state_sha256":"16c2d909df0f4db7ee3db4d9975c216bb0576fcaa2df3800db2d0274173fc258"}