{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:EQBJXINDEPMQMBQ3P4ZH7Z2PUO","short_pith_number":"pith:EQBJXIND","schema_version":"1.0","canonical_sha256":"24029ba1a323d906061b7f327fe74fa3b9b331a347e4dbce95ad25474277b2e4","source":{"kind":"arxiv","id":"0807.0644","version":4},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0807.0644","created_at":"2026-05-18T01:59:59.435133+00:00"},{"alias_kind":"arxiv_version","alias_value":"0807.0644v4","created_at":"2026-05-18T01:59:59.435133+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0807.0644","created_at":"2026-05-18T01:59:59.435133+00:00"},{"alias_kind":"pith_short_12","alias_value":"EQBJXINDEPMQ","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"EQBJXINDEPMQMBQ3","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"EQBJXIND","created_at":"2026-05-18T12:25:57.157939+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EQBJXINDEPMQMBQ3P4ZH7Z2PUO","json":"https://pith.science/pith/EQBJXINDEPMQMBQ3P4ZH7Z2PUO.json","graph_json":"https://pith.science/api/pith-number/EQBJXINDEPMQMBQ3P4ZH7Z2PUO/graph.json","events_json":"https://pith.science/api/pith-number/EQBJXINDEPMQMBQ3P4ZH7Z2PUO/events.json","paper":"https://pith.science/paper/EQBJXIND"},"agent_actions":{"view_html":"https://pith.science/pith/EQBJXINDEPMQMBQ3P4ZH7Z2PUO","download_json":"https://pith.science/pith/EQBJXINDEPMQMBQ3P4ZH7Z2PUO.json","view_paper":"https://pith.science/paper/EQBJXIND","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0807.0644&json=true","fetch_graph":"https://pith.science/api/pith-number/EQBJXINDEPMQMBQ3P4ZH7Z2PUO/graph.json","fetch_events":"https://pith.science/api/pith-number/EQBJXINDEPMQMBQ3P4ZH7Z2PUO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EQBJXINDEPMQMBQ3P4ZH7Z2PUO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EQBJXINDEPMQMBQ3P4ZH7Z2PUO/action/storage_attestation","attest_author":"https://pith.science/pith/EQBJXINDEPMQMBQ3P4ZH7Z2PUO/action/author_attestation","sign_citation":"https://pith.science/pith/EQBJXINDEPMQMBQ3P4ZH7Z2PUO/action/citation_signature","submit_replication":"https://pith.science/pith/EQBJXINDEPMQMBQ3P4ZH7Z2PUO/action/replication_record"}},"created_at":"2026-05-18T01:59:59.435133+00:00","updated_at":"2026-05-18T01:59:59.435133+00:00"}