{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:2YXFEOZKFQABCLG6AEOBGRRUD5","short_pith_number":"pith:2YXFEOZK","schema_version":"1.0","canonical_sha256":"d62e523b2a2c00112cde011c1346341f5c3cc30da631abbb7934ca2d48253f25","source":{"kind":"arxiv","id":"0908.2256","version":3},"attestation_state":"computed","paper":{"title":"On k-Column Sparse Packing Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aravind Srinivasan, Nikhil Bansal, Nitish Korula, Viswanath Nagarajan","submitted_at":"2009-08-16T17:55:03Z","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"},"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":"0908.2256","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-08-16T17:55:03Z","cross_cats_sorted":[],"title_canon_sha256":"49f3d7baa27f34adba501665bee4e9e583ad9a3290d6a6dcd9ee3d42ff14fc5d","abstract_canon_sha256":"a2d287453c7ecb636a6e196cc1e23e536bd11438e089b5f4c748552aed462ddc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:12:33.712813Z","signature_b64":"qf78gcw1LNBcX8NrG/Nf2We2xba9lhE4qr8hLNkNSkGXZ3uBJyF8BadHI20GMXJnow58UGVH9PiFJjgiGgY6Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d62e523b2a2c00112cde011c1346341f5c3cc30da631abbb7934ca2d48253f25","last_reissued_at":"2026-05-18T02:12:33.711941Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:12:33.711941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On k-Column Sparse Packing Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aravind Srinivasan, Nikhil Bansal, Nitish Korula, Viswanath Nagarajan","submitted_at":"2009-08-16T17:55:03Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.2256","kind":"arxiv","version":3},"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":"0908.2256","created_at":"2026-05-18T02:12:33.712087+00:00"},{"alias_kind":"arxiv_version","alias_value":"0908.2256v3","created_at":"2026-05-18T02:12:33.712087+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.2256","created_at":"2026-05-18T02:12:33.712087+00:00"},{"alias_kind":"pith_short_12","alias_value":"2YXFEOZKFQAB","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"2YXFEOZKFQABCLG6","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"2YXFEOZK","created_at":"2026-05-18T12:25:58.018023+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/2YXFEOZKFQABCLG6AEOBGRRUD5","json":"https://pith.science/pith/2YXFEOZKFQABCLG6AEOBGRRUD5.json","graph_json":"https://pith.science/api/pith-number/2YXFEOZKFQABCLG6AEOBGRRUD5/graph.json","events_json":"https://pith.science/api/pith-number/2YXFEOZKFQABCLG6AEOBGRRUD5/events.json","paper":"https://pith.science/paper/2YXFEOZK"},"agent_actions":{"view_html":"https://pith.science/pith/2YXFEOZKFQABCLG6AEOBGRRUD5","download_json":"https://pith.science/pith/2YXFEOZKFQABCLG6AEOBGRRUD5.json","view_paper":"https://pith.science/paper/2YXFEOZK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0908.2256&json=true","fetch_graph":"https://pith.science/api/pith-number/2YXFEOZKFQABCLG6AEOBGRRUD5/graph.json","fetch_events":"https://pith.science/api/pith-number/2YXFEOZKFQABCLG6AEOBGRRUD5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2YXFEOZKFQABCLG6AEOBGRRUD5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2YXFEOZKFQABCLG6AEOBGRRUD5/action/storage_attestation","attest_author":"https://pith.science/pith/2YXFEOZKFQABCLG6AEOBGRRUD5/action/author_attestation","sign_citation":"https://pith.science/pith/2YXFEOZKFQABCLG6AEOBGRRUD5/action/citation_signature","submit_replication":"https://pith.science/pith/2YXFEOZKFQABCLG6AEOBGRRUD5/action/replication_record"}},"created_at":"2026-05-18T02:12:33.712087+00:00","updated_at":"2026-05-18T02:12:33.712087+00:00"}