{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2002:CSGCO2QUVJ4RHOB4ADNGKUPBAC","short_pith_number":"pith:CSGCO2QU","canonical_record":{"source":{"id":"cs/0205030","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T00:23:17Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"34c9f49c92b4c056a6840c88697a37e47e5ae57c31c3ee377a6102531e868367","abstract_canon_sha256":"f2ed5a424b29810d38a746a40fc155ba4060cdd38e778c5fd536a586f1dc63d3"},"schema_version":"1.0"},"canonical_sha256":"148c276a14aa7913b83c00da6551e10082f9f36de1dc7ca3e55b639d88a7b581","source":{"kind":"arxiv","id":"cs/0205030","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0205030","created_at":"2026-05-18T01:59:54Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0205030v2","created_at":"2026-05-18T01:59:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0205030","created_at":"2026-05-18T01:59:54Z"},{"alias_kind":"pith_short_12","alias_value":"CSGCO2QUVJ4R","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_16","alias_value":"CSGCO2QUVJ4RHOB4","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_8","alias_value":"CSGCO2QU","created_at":"2026-05-18T12:25:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2002:CSGCO2QUVJ4RHOB4ADNGKUPBAC","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0205030","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T00:23:17Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"34c9f49c92b4c056a6840c88697a37e47e5ae57c31c3ee377a6102531e868367","abstract_canon_sha256":"f2ed5a424b29810d38a746a40fc155ba4060cdd38e778c5fd536a586f1dc63d3"},"schema_version":"1.0"},"canonical_sha256":"148c276a14aa7913b83c00da6551e10082f9f36de1dc7ca3e55b639d88a7b581","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:54.020035Z","signature_b64":"quKcmRMgkLsOS3KA9rZpW1M/S5uGDBeg12GrZC1N5dstE2jiX7lV0ggYGihDRvOEARsu7qZwutBZd60tkVG6CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"148c276a14aa7913b83c00da6551e10082f9f36de1dc7ca3e55b639d88a7b581","last_reissued_at":"2026-05-18T01:59:54.019556Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:54.019556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0205030","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:59:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QEpJI5gZK3ndKZ+QNZKnBX/jKx1Lm/tM16sAXgJTjFvIcubG/+BgmPdNC05CA02CCxfCE3qfUm2o/GuW1JZuDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:53:10.925535Z"},"content_sha256":"45e79eabc85bdbfbf9ceb51c7be51de70fba549d71573557846e8b7433095222","schema_version":"1.0","event_id":"sha256:45e79eabc85bdbfbf9ceb51c7be51de70fba549d71573557846e8b7433095222"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2002:CSGCO2QUVJ4RHOB4ADNGKUPBAC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation Algorithms for Covering/Packing Integer Programs","license":"","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Neal E. Young, Stavros G. Kolliopoulos","submitted_at":"2002-05-18T00:23:17Z","abstract_excerpt":"Given matrices A and B and vectors a, b, c and d, all with non-negative entries, we consider the problem of computing min {c.x: x in Z^n_+, Ax > a, Bx < b, x < d}. We give a bicriteria-approximation algorithm that, given epsilon in (0, 1], finds a solution of cost O(ln(m)/epsilon^2) times optimal, meeting the covering constraints (Ax > a) and multiplicity constraints (x < d), and satisfying Bx < (1 + epsilon)b + beta, where beta is the vector of row sums beta_i = sum_j B_ij. Here m denotes the number of rows of A.\n  This gives an O(ln m)-approximation algorithm for CIP -- minimum-cost covering"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0205030","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:59:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"39tooMnegPqiETRzkCBbu4S828nmPOOS9QQeSgkfi3lACM3liDYTUZInfa/+tuEvqhwvvLtTmCuj9GrLB8DuDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:53:10.926233Z"},"content_sha256":"1ba2a65191937df5ed76bbb2cb619c49bcb0ee799dc4ff897ac3f8d6eac3c0c7","schema_version":"1.0","event_id":"sha256:1ba2a65191937df5ed76bbb2cb619c49bcb0ee799dc4ff897ac3f8d6eac3c0c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CSGCO2QUVJ4RHOB4ADNGKUPBAC/bundle.json","state_url":"https://pith.science/pith/CSGCO2QUVJ4RHOB4ADNGKUPBAC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CSGCO2QUVJ4RHOB4ADNGKUPBAC/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-27T16:53:10Z","links":{"resolver":"https://pith.science/pith/CSGCO2QUVJ4RHOB4ADNGKUPBAC","bundle":"https://pith.science/pith/CSGCO2QUVJ4RHOB4ADNGKUPBAC/bundle.json","state":"https://pith.science/pith/CSGCO2QUVJ4RHOB4ADNGKUPBAC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CSGCO2QUVJ4RHOB4ADNGKUPBAC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2002:CSGCO2QUVJ4RHOB4ADNGKUPBAC","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":"f2ed5a424b29810d38a746a40fc155ba4060cdd38e778c5fd536a586f1dc63d3","cross_cats_sorted":["cs.DM"],"license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T00:23:17Z","title_canon_sha256":"34c9f49c92b4c056a6840c88697a37e47e5ae57c31c3ee377a6102531e868367"},"schema_version":"1.0","source":{"id":"cs/0205030","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0205030","created_at":"2026-05-18T01:59:54Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0205030v2","created_at":"2026-05-18T01:59:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0205030","created_at":"2026-05-18T01:59:54Z"},{"alias_kind":"pith_short_12","alias_value":"CSGCO2QUVJ4R","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_16","alias_value":"CSGCO2QUVJ4RHOB4","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_8","alias_value":"CSGCO2QU","created_at":"2026-05-18T12:25:50Z"}],"graph_snapshots":[{"event_id":"sha256:1ba2a65191937df5ed76bbb2cb619c49bcb0ee799dc4ff897ac3f8d6eac3c0c7","target":"graph","created_at":"2026-05-18T01:59:54Z","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":"Given matrices A and B and vectors a, b, c and d, all with non-negative entries, we consider the problem of computing min {c.x: x in Z^n_+, Ax > a, Bx < b, x < d}. We give a bicriteria-approximation algorithm that, given epsilon in (0, 1], finds a solution of cost O(ln(m)/epsilon^2) times optimal, meeting the covering constraints (Ax > a) and multiplicity constraints (x < d), and satisfying Bx < (1 + epsilon)b + beta, where beta is the vector of row sums beta_i = sum_j B_ij. Here m denotes the number of rows of A.\n  This gives an O(ln m)-approximation algorithm for CIP -- minimum-cost covering","authors_text":"Neal E. Young, Stavros G. Kolliopoulos","cross_cats":["cs.DM"],"headline":"","license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T00:23:17Z","title":"Approximation Algorithms for Covering/Packing Integer Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0205030","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:45e79eabc85bdbfbf9ceb51c7be51de70fba549d71573557846e8b7433095222","target":"record","created_at":"2026-05-18T01:59:54Z","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":"f2ed5a424b29810d38a746a40fc155ba4060cdd38e778c5fd536a586f1dc63d3","cross_cats_sorted":["cs.DM"],"license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T00:23:17Z","title_canon_sha256":"34c9f49c92b4c056a6840c88697a37e47e5ae57c31c3ee377a6102531e868367"},"schema_version":"1.0","source":{"id":"cs/0205030","kind":"arxiv","version":2}},"canonical_sha256":"148c276a14aa7913b83c00da6551e10082f9f36de1dc7ca3e55b639d88a7b581","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"148c276a14aa7913b83c00da6551e10082f9f36de1dc7ca3e55b639d88a7b581","first_computed_at":"2026-05-18T01:59:54.019556Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:54.019556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"quKcmRMgkLsOS3KA9rZpW1M/S5uGDBeg12GrZC1N5dstE2jiX7lV0ggYGihDRvOEARsu7qZwutBZd60tkVG6CA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:54.020035Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0205030","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45e79eabc85bdbfbf9ceb51c7be51de70fba549d71573557846e8b7433095222","sha256:1ba2a65191937df5ed76bbb2cb619c49bcb0ee799dc4ff897ac3f8d6eac3c0c7"],"state_sha256":"72d866e6c8dcdb06429d2a1a7ca9591bd3c07e5db9740d016c37c9a24d9f0ba8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gn2WL7h/kXtBfX9k6zYOjWIEF6CYvdAZ1L7c0SYwz943WLmzBG75X6egwG5g2QXzUepo/8mnwCRAtJNcuvLsDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:53:10.929989Z","bundle_sha256":"63fb452c02d26ba126d5a0efb5e413da5324251fe76be7870ccb2fb8c6e2c849"}}