{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:2YXFEOZKFQABCLG6AEOBGRRUD5","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":"a2d287453c7ecb636a6e196cc1e23e536bd11438e089b5f4c748552aed462ddc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-08-16T17:55:03Z","title_canon_sha256":"49f3d7baa27f34adba501665bee4e9e583ad9a3290d6a6dcd9ee3d42ff14fc5d"},"schema_version":"1.0","source":{"id":"0908.2256","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0908.2256","created_at":"2026-05-18T02:12:33Z"},{"alias_kind":"arxiv_version","alias_value":"0908.2256v3","created_at":"2026-05-18T02:12:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.2256","created_at":"2026-05-18T02:12:33Z"},{"alias_kind":"pith_short_12","alias_value":"2YXFEOZKFQAB","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"2YXFEOZKFQABCLG6","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"2YXFEOZK","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:c319bd7eb0828cde1d39b5f5a341d8df068b7612322484f86b31f8300a86dc95","target":"graph","created_at":"2026-05-18T02:12:33Z","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 consider the class of packing integer programs (PIPs) that are column sparse, i.e. there is a specified upper bound k on the number of constraints that each variable appears in. We give an (ek+o(k))-approximation algorithm for k-column sparse PIPs, improving on recent results of $k^2\\cdot 2^k$ and $O(k^2)$. We also show that the integrality gap of our linear programming relaxation is at least 2k-1; it is known that k-column sparse PIPs are $\\Omega(k/ \\log k)$-hard to approximate. We also extend our result (at the loss of a small constant factor) to the more general case of maximizing a subm","authors_text":"Aravind Srinivasan, Nikhil Bansal, Nitish Korula, Viswanath Nagarajan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-08-16T17:55:03Z","title":"On k-Column Sparse Packing Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.2256","kind":"arxiv","version":3},"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:770184b7251e39900cd0cde1b26ab2927e700d80ed09df6c6431a5c2764d07a2","target":"record","created_at":"2026-05-18T02:12:33Z","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":"a2d287453c7ecb636a6e196cc1e23e536bd11438e089b5f4c748552aed462ddc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-08-16T17:55:03Z","title_canon_sha256":"49f3d7baa27f34adba501665bee4e9e583ad9a3290d6a6dcd9ee3d42ff14fc5d"},"schema_version":"1.0","source":{"id":"0908.2256","kind":"arxiv","version":3}},"canonical_sha256":"d62e523b2a2c00112cde011c1346341f5c3cc30da631abbb7934ca2d48253f25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d62e523b2a2c00112cde011c1346341f5c3cc30da631abbb7934ca2d48253f25","first_computed_at":"2026-05-18T02:12:33.711941Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:12:33.711941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qf78gcw1LNBcX8NrG/Nf2We2xba9lhE4qr8hLNkNSkGXZ3uBJyF8BadHI20GMXJnow58UGVH9PiFJjgiGgY6Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:12:33.712813Z","signed_message":"canonical_sha256_bytes"},"source_id":"0908.2256","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:770184b7251e39900cd0cde1b26ab2927e700d80ed09df6c6431a5c2764d07a2","sha256:c319bd7eb0828cde1d39b5f5a341d8df068b7612322484f86b31f8300a86dc95"],"state_sha256":"473e132e7a77d070ddf278e6ef841b9bfb8570ee9f9c162e5cf7443527930ee7"}