{"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"}