{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:EQBJXINDEPMQMBQ3P4ZH7Z2PUO","short_pith_number":"pith:EQBJXIND","canonical_record":{"source":{"id":"0807.0644","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-07-04T23:31:29Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"b48881faa31d077a506823a645390ab0faddf8fb3de76cc1d6e401cb4910ecc4","abstract_canon_sha256":"e772d2bb8ac8dfa34f70ebf98964e9758256bfea4d308a5159ccbf0d9a69a42a"},"schema_version":"1.0"},"canonical_sha256":"24029ba1a323d906061b7f327fe74fa3b9b331a347e4dbce95ad25474277b2e4","source":{"kind":"arxiv","id":"0807.0644","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0807.0644","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"arxiv_version","alias_value":"0807.0644v4","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0807.0644","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"pith_short_12","alias_value":"EQBJXINDEPMQ","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"EQBJXINDEPMQMBQ3","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"EQBJXIND","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:EQBJXINDEPMQMBQ3P4ZH7Z2PUO","target":"record","payload":{"canonical_record":{"source":{"id":"0807.0644","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-07-04T23:31:29Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"b48881faa31d077a506823a645390ab0faddf8fb3de76cc1d6e401cb4910ecc4","abstract_canon_sha256":"e772d2bb8ac8dfa34f70ebf98964e9758256bfea4d308a5159ccbf0d9a69a42a"},"schema_version":"1.0"},"canonical_sha256":"24029ba1a323d906061b7f327fe74fa3b9b331a347e4dbce95ad25474277b2e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:59.435513Z","signature_b64":"3EkM6BQyPC9MhiEKgNR9JHBOkZCRpCnsQBM+6sfcSNXla9C7VQ4p/cyTofW+XsgkX77fauc2eOnJr+0K9jrtCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24029ba1a323d906061b7f327fe74fa3b9b331a347e4dbce95ad25474277b2e4","last_reissued_at":"2026-05-18T01:59:59.435071Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:59.435071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0807.0644","source_version":4,"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:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uhuVOJs3zTI0W72DvgXfW+KzkSooIv4KWH0lnlxwHfIfxEUCGEz1/GtSzwfyFhWJlhEk7DsasCQhtqSn2WkpDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:33:08.382424Z"},"content_sha256":"84dc8e803b3c887d11a173b25720ce4274d19c043ce5c80b81ad5689545472db","schema_version":"1.0","event_id":"sha256:84dc8e803b3c887d11a173b25720ce4274d19c043ce5c80b81ad5689545472db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:EQBJXINDEPMQMBQ3P4ZH7Z2PUO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Greedy D-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Christos Koufogiannakis, Neal E. Young","submitted_at":"2008-07-04T23:31:29Z","abstract_excerpt":"This paper describes a simple greedy D-approximation algorithm for any covering problem whose objective function is submodular and non-decreasing, and whose feasible region can be expressed as the intersection of arbitrary (closed upwards) covering constraints, each of which constrains at most D variables of the problem. (A simple example is Vertex Cover, with D = 2.) The algorithm generalizes previous approximation algorithms for fundamental covering problems and online paging and caching problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0807.0644","kind":"arxiv","version":4},"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:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MtP0ERdAxS8XRqhk2dfoxrFu3Lio0/snBLYfjCGZ2ZCAhrryAHdeGX6uUO0ED9SvRMOLayGJEvdsnGn7t5FWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:33:08.382776Z"},"content_sha256":"79362a50e9aa1cd066f9b2c632548bca7498880b31c6870588ef479c783d6020","schema_version":"1.0","event_id":"sha256:79362a50e9aa1cd066f9b2c632548bca7498880b31c6870588ef479c783d6020"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EQBJXINDEPMQMBQ3P4ZH7Z2PUO/bundle.json","state_url":"https://pith.science/pith/EQBJXINDEPMQMBQ3P4ZH7Z2PUO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EQBJXINDEPMQMBQ3P4ZH7Z2PUO/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-28T06:33:08Z","links":{"resolver":"https://pith.science/pith/EQBJXINDEPMQMBQ3P4ZH7Z2PUO","bundle":"https://pith.science/pith/EQBJXINDEPMQMBQ3P4ZH7Z2PUO/bundle.json","state":"https://pith.science/pith/EQBJXINDEPMQMBQ3P4ZH7Z2PUO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EQBJXINDEPMQMBQ3P4ZH7Z2PUO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:EQBJXINDEPMQMBQ3P4ZH7Z2PUO","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":"e772d2bb8ac8dfa34f70ebf98964e9758256bfea4d308a5159ccbf0d9a69a42a","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-07-04T23:31:29Z","title_canon_sha256":"b48881faa31d077a506823a645390ab0faddf8fb3de76cc1d6e401cb4910ecc4"},"schema_version":"1.0","source":{"id":"0807.0644","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0807.0644","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"arxiv_version","alias_value":"0807.0644v4","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0807.0644","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"pith_short_12","alias_value":"EQBJXINDEPMQ","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"EQBJXINDEPMQMBQ3","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"EQBJXIND","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:79362a50e9aa1cd066f9b2c632548bca7498880b31c6870588ef479c783d6020","target":"graph","created_at":"2026-05-18T01:59:59Z","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":"This paper describes a simple greedy D-approximation algorithm for any covering problem whose objective function is submodular and non-decreasing, and whose feasible region can be expressed as the intersection of arbitrary (closed upwards) covering constraints, each of which constrains at most D variables of the problem. (A simple example is Vertex Cover, with D = 2.) The algorithm generalizes previous approximation algorithms for fundamental covering problems and online paging and caching problems.","authors_text":"Christos Koufogiannakis, Neal E. Young","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-07-04T23:31:29Z","title":"Greedy D-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0807.0644","kind":"arxiv","version":4},"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:84dc8e803b3c887d11a173b25720ce4274d19c043ce5c80b81ad5689545472db","target":"record","created_at":"2026-05-18T01:59:59Z","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":"e772d2bb8ac8dfa34f70ebf98964e9758256bfea4d308a5159ccbf0d9a69a42a","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-07-04T23:31:29Z","title_canon_sha256":"b48881faa31d077a506823a645390ab0faddf8fb3de76cc1d6e401cb4910ecc4"},"schema_version":"1.0","source":{"id":"0807.0644","kind":"arxiv","version":4}},"canonical_sha256":"24029ba1a323d906061b7f327fe74fa3b9b331a347e4dbce95ad25474277b2e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24029ba1a323d906061b7f327fe74fa3b9b331a347e4dbce95ad25474277b2e4","first_computed_at":"2026-05-18T01:59:59.435071Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:59.435071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3EkM6BQyPC9MhiEKgNR9JHBOkZCRpCnsQBM+6sfcSNXla9C7VQ4p/cyTofW+XsgkX77fauc2eOnJr+0K9jrtCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:59.435513Z","signed_message":"canonical_sha256_bytes"},"source_id":"0807.0644","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84dc8e803b3c887d11a173b25720ce4274d19c043ce5c80b81ad5689545472db","sha256:79362a50e9aa1cd066f9b2c632548bca7498880b31c6870588ef479c783d6020"],"state_sha256":"3ea8806b6bf2bd990eb9bcdbaada046e901b258abd214ce59d0eaa6e22fd226e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fpcZdVOjnRU899mOqHdUxXOym9bNjahGhc/lUQTKFGEKi5HUjtNE8pFnmY/HSDry7xck6qzDqdhiXWc17It2Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:33:08.385069Z","bundle_sha256":"42eb26c679bdb7426849af0b0934aad303fabfa1679bfeb3c90987639f149bd6"}}