{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:PFGCDVEYUECLI7T5EUWX5FYNT2","short_pith_number":"pith:PFGCDVEY","canonical_record":{"source":{"id":"1003.1507","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-03-07T18:08:12Z","cross_cats_sorted":[],"title_canon_sha256":"3573804dd95dff59614d8c5ddcc016535aa6d810f24ebfe488d1d5611b3465c5","abstract_canon_sha256":"1d4e0e7c12d16ccb7e17f441687356dd5600202bf58585df2916a6b23d43c2a0"},"schema_version":"1.0"},"canonical_sha256":"794c21d498a104b47e7d252d7e970d9e925018c12d402770fe0886a83faafece","source":{"kind":"arxiv","id":"1003.1507","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.1507","created_at":"2026-05-18T02:08:45Z"},{"alias_kind":"arxiv_version","alias_value":"1003.1507v1","created_at":"2026-05-18T02:08:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.1507","created_at":"2026-05-18T02:08:45Z"},{"alias_kind":"pith_short_12","alias_value":"PFGCDVEYUECL","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"PFGCDVEYUECLI7T5","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"PFGCDVEY","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:PFGCDVEYUECLI7T5EUWX5FYNT2","target":"record","payload":{"canonical_record":{"source":{"id":"1003.1507","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-03-07T18:08:12Z","cross_cats_sorted":[],"title_canon_sha256":"3573804dd95dff59614d8c5ddcc016535aa6d810f24ebfe488d1d5611b3465c5","abstract_canon_sha256":"1d4e0e7c12d16ccb7e17f441687356dd5600202bf58585df2916a6b23d43c2a0"},"schema_version":"1.0"},"canonical_sha256":"794c21d498a104b47e7d252d7e970d9e925018c12d402770fe0886a83faafece","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:08:45.205256Z","signature_b64":"bXaEx/hOKfwz6CO39NH6/abzXmJDC6MMOyUuNWT++UkO+yJ10fBAJPubHoyMLHnS+WOxmfJ3CHxhIJmvnZ2XCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"794c21d498a104b47e7d252d7e970d9e925018c12d402770fe0886a83faafece","last_reissued_at":"2026-05-18T02:08:45.204513Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:08:45.204513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1003.1507","source_version":1,"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:08:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jXT5PnFtwrHPLwiE6Jg9Kq1tQ8mFuOsBV6zRc59gOqsOpJf1C1A3a0wSKwRoGVcJGIAUprBdLOTyIj6i5rDjAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:34:15.001336Z"},"content_sha256":"5267cfe17acd177f664d6d2e0756c2eee08c2b07e06f5769f52b40d752f8ac46","schema_version":"1.0","event_id":"sha256:5267cfe17acd177f664d6d2e0756c2eee08c2b07e06f5769f52b40d752f8ac46"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:PFGCDVEYUECLI7T5EUWX5FYNT2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Column-restricted and Priority Covering Integer Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Deeparnab Chakrabarty, Elyot Grant, Jochen Koenemann","submitted_at":"2010-03-07T18:08:12Z","abstract_excerpt":"In a column-restricted covering integer program (CCIP), all the non-zero entries of any column of the constraint matrix are equal. Such programs capture capacitated versions of covering problems. In this paper, we study the approximability of CCIPs, in particular, their relation to the integrality gaps of the underlying 0,1-CIP.\n If the underlying 0,1-CIP has an integrality gap O(gamma), and assuming that the integrality gap of the priority version of the 0,1-CIP is O(omega), we give a factor O(gamma + omega) approximation algorithm for the CCIP. Priority versions of 0,1-CIPs (PCIPs) naturally"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.1507","kind":"arxiv","version":1},"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:08:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4bdHCga0obXlY17ZSXys/5L6h3K7vbWFjutyCpLhLcbqmam0JMmiYTO+LevbAfIt1r1sqbTnDOmOeAatBYmrBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:34:15.001689Z"},"content_sha256":"fe196037819ff44c567b42db18710550d871e4347d44dc3c8d5d60670465b8e4","schema_version":"1.0","event_id":"sha256:fe196037819ff44c567b42db18710550d871e4347d44dc3c8d5d60670465b8e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PFGCDVEYUECLI7T5EUWX5FYNT2/bundle.json","state_url":"https://pith.science/pith/PFGCDVEYUECLI7T5EUWX5FYNT2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PFGCDVEYUECLI7T5EUWX5FYNT2/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-06-01T22:34:15Z","links":{"resolver":"https://pith.science/pith/PFGCDVEYUECLI7T5EUWX5FYNT2","bundle":"https://pith.science/pith/PFGCDVEYUECLI7T5EUWX5FYNT2/bundle.json","state":"https://pith.science/pith/PFGCDVEYUECLI7T5EUWX5FYNT2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PFGCDVEYUECLI7T5EUWX5FYNT2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:PFGCDVEYUECLI7T5EUWX5FYNT2","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":"1d4e0e7c12d16ccb7e17f441687356dd5600202bf58585df2916a6b23d43c2a0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-03-07T18:08:12Z","title_canon_sha256":"3573804dd95dff59614d8c5ddcc016535aa6d810f24ebfe488d1d5611b3465c5"},"schema_version":"1.0","source":{"id":"1003.1507","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.1507","created_at":"2026-05-18T02:08:45Z"},{"alias_kind":"arxiv_version","alias_value":"1003.1507v1","created_at":"2026-05-18T02:08:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.1507","created_at":"2026-05-18T02:08:45Z"},{"alias_kind":"pith_short_12","alias_value":"PFGCDVEYUECL","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"PFGCDVEYUECLI7T5","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"PFGCDVEY","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:fe196037819ff44c567b42db18710550d871e4347d44dc3c8d5d60670465b8e4","target":"graph","created_at":"2026-05-18T02:08:45Z","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":"In a column-restricted covering integer program (CCIP), all the non-zero entries of any column of the constraint matrix are equal. Such programs capture capacitated versions of covering problems. In this paper, we study the approximability of CCIPs, in particular, their relation to the integrality gaps of the underlying 0,1-CIP.\n If the underlying 0,1-CIP has an integrality gap O(gamma), and assuming that the integrality gap of the priority version of the 0,1-CIP is O(omega), we give a factor O(gamma + omega) approximation algorithm for the CCIP. Priority versions of 0,1-CIPs (PCIPs) naturally","authors_text":"Deeparnab Chakrabarty, Elyot Grant, Jochen Koenemann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-03-07T18:08:12Z","title":"On Column-restricted and Priority Covering Integer Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.1507","kind":"arxiv","version":1},"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:5267cfe17acd177f664d6d2e0756c2eee08c2b07e06f5769f52b40d752f8ac46","target":"record","created_at":"2026-05-18T02:08:45Z","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":"1d4e0e7c12d16ccb7e17f441687356dd5600202bf58585df2916a6b23d43c2a0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-03-07T18:08:12Z","title_canon_sha256":"3573804dd95dff59614d8c5ddcc016535aa6d810f24ebfe488d1d5611b3465c5"},"schema_version":"1.0","source":{"id":"1003.1507","kind":"arxiv","version":1}},"canonical_sha256":"794c21d498a104b47e7d252d7e970d9e925018c12d402770fe0886a83faafece","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"794c21d498a104b47e7d252d7e970d9e925018c12d402770fe0886a83faafece","first_computed_at":"2026-05-18T02:08:45.204513Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:08:45.204513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bXaEx/hOKfwz6CO39NH6/abzXmJDC6MMOyUuNWT++UkO+yJ10fBAJPubHoyMLHnS+WOxmfJ3CHxhIJmvnZ2XCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:08:45.205256Z","signed_message":"canonical_sha256_bytes"},"source_id":"1003.1507","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5267cfe17acd177f664d6d2e0756c2eee08c2b07e06f5769f52b40d752f8ac46","sha256:fe196037819ff44c567b42db18710550d871e4347d44dc3c8d5d60670465b8e4"],"state_sha256":"0fdc7c33a9aecc00de3f4bb3b0e42e8b5408218bffe1c25206cc2f1fe96a857e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q+7zQnxrG+1/PHISEpmkMR3+VDBzNUju8w1GTnXlOvED4/aOU93fJcovSkj9guEW03WnAZrwbDjaZKXvzGKUDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T22:34:15.003678Z","bundle_sha256":"168701302f09615df849b2ebdc658213f7b3dc6b2ea2dfbc29d90e9dca9b4166"}}