{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:2YXFEOZKFQABCLG6AEOBGRRUD5","short_pith_number":"pith:2YXFEOZK","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"},"canonical_sha256":"d62e523b2a2c00112cde011c1346341f5c3cc30da631abbb7934ca2d48253f25","source":{"kind":"arxiv","id":"0908.2256","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:2YXFEOZKFQABCLG6AEOBGRRUD5","target":"record","payload":{"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"},"canonical_sha256":"d62e523b2a2c00112cde011c1346341f5c3cc30da631abbb7934ca2d48253f25","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"},"source_kind":"arxiv","source_id":"0908.2256","source_version":3,"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-18T02:12:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GvjZxE87kydJtPKSf9Q0YgMMwPyXYw8Rhl8qHDVHwoP2f5sKSy/ajZTVKPFRVV6E0QgRDj2STYyJCDtee3j2Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T03:30:11.244838Z"},"content_sha256":"770184b7251e39900cd0cde1b26ab2927e700d80ed09df6c6431a5c2764d07a2","schema_version":"1.0","event_id":"sha256:770184b7251e39900cd0cde1b26ab2927e700d80ed09df6c6431a5c2764d07a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:2YXFEOZKFQABCLG6AEOBGRRUD5","target":"graph","payload":{"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"},"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-18T02:12:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KOg6euKrjACsu4tA9cfGmNO3FzJqW+Y56+ZimOIm1vi/185Dp6Lm6/lf75n4s0Z9sYJoTXB5zMozdr+hJNH8CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T03:30:11.245448Z"},"content_sha256":"c319bd7eb0828cde1d39b5f5a341d8df068b7612322484f86b31f8300a86dc95","schema_version":"1.0","event_id":"sha256:c319bd7eb0828cde1d39b5f5a341d8df068b7612322484f86b31f8300a86dc95"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2YXFEOZKFQABCLG6AEOBGRRUD5/bundle.json","state_url":"https://pith.science/pith/2YXFEOZKFQABCLG6AEOBGRRUD5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2YXFEOZKFQABCLG6AEOBGRRUD5/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-05-21T03:30:11Z","links":{"resolver":"https://pith.science/pith/2YXFEOZKFQABCLG6AEOBGRRUD5","bundle":"https://pith.science/pith/2YXFEOZKFQABCLG6AEOBGRRUD5/bundle.json","state":"https://pith.science/pith/2YXFEOZKFQABCLG6AEOBGRRUD5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2YXFEOZKFQABCLG6AEOBGRRUD5/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RDAdNC1IRFSmave10CBZtFTzAGoRllpG84+6LweVosZ9fDEd4Dr7pPQUaQcb3oL9Z1dUirmHoIvdCBv6/4UJAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T03:30:11.248524Z","bundle_sha256":"34ffcb2eb4618d39f570002bcb97e9424b84919022e82a63d075e1f6a23f9b94"}}