{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VEO7UL6QSCBT3E4LZ5JO3BPLRF","short_pith_number":"pith:VEO7UL6Q","schema_version":"1.0","canonical_sha256":"a91dfa2fd090833d938bcf52ed85eb894a488f4348f520c28bf25cf2aa4e7bf7","source":{"kind":"arxiv","id":"1704.08522","version":1},"attestation_state":"computed","paper":{"title":"The Primal-Dual Greedy Algorithm for Weighted Covering Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Andreas Wierz, Britta Peis, Jos\\'e Verschae","submitted_at":"2017-04-27T12:03:54Z","abstract_excerpt":"We present a general approximation framework for weighted integer covering problems. In a weighted integer covering problem, the goal is to determine a non-negative integer solution $x$ to system $\\{ Ax \\geq r \\}$ minimizing a non-negative cost function $c^T x$ (of appropriate dimensions). All coefficients in matrix $A$ are assumed to be non-negative. We analyze the performance of a very simple primal-dual greedy algorithm and discuss conditions of system $(A,r)$ that guarantee feasibility of the constructed solutions, and a bounded approximation factor. We call system $(A,r)$ a \\emph{greedy s"},"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":"1704.08522","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-04-27T12:03:54Z","cross_cats_sorted":[],"title_canon_sha256":"6faf7e863197ab459d77c4598ba7d7d4c918c4673245c3eface538cdaf99dc88","abstract_canon_sha256":"cae11180b0ad3a5d6a2fa8f1fe481f283f7b029069c29d85d7557cb2f6de25a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:27.482295Z","signature_b64":"c3Mn5M997oA2SBqOKh6mIlSbX0fVQdsMpmEDQRoh77HQOziJX83gSRvnz7KSUPQYxbI0eZA+zrFlYE3uq2aLAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a91dfa2fd090833d938bcf52ed85eb894a488f4348f520c28bf25cf2aa4e7bf7","last_reissued_at":"2026-05-18T00:45:27.481692Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:27.481692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Primal-Dual Greedy Algorithm for Weighted Covering Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Andreas Wierz, Britta Peis, Jos\\'e Verschae","submitted_at":"2017-04-27T12:03:54Z","abstract_excerpt":"We present a general approximation framework for weighted integer covering problems. In a weighted integer covering problem, the goal is to determine a non-negative integer solution $x$ to system $\\{ Ax \\geq r \\}$ minimizing a non-negative cost function $c^T x$ (of appropriate dimensions). All coefficients in matrix $A$ are assumed to be non-negative. We analyze the performance of a very simple primal-dual greedy algorithm and discuss conditions of system $(A,r)$ that guarantee feasibility of the constructed solutions, and a bounded approximation factor. We call system $(A,r)$ a \\emph{greedy s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08522","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1704.08522","created_at":"2026-05-18T00:45:27.481794+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.08522v1","created_at":"2026-05-18T00:45:27.481794+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08522","created_at":"2026-05-18T00:45:27.481794+00:00"},{"alias_kind":"pith_short_12","alias_value":"VEO7UL6QSCBT","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VEO7UL6QSCBT3E4L","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VEO7UL6Q","created_at":"2026-05-18T12:31:49.984773+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/VEO7UL6QSCBT3E4LZ5JO3BPLRF","json":"https://pith.science/pith/VEO7UL6QSCBT3E4LZ5JO3BPLRF.json","graph_json":"https://pith.science/api/pith-number/VEO7UL6QSCBT3E4LZ5JO3BPLRF/graph.json","events_json":"https://pith.science/api/pith-number/VEO7UL6QSCBT3E4LZ5JO3BPLRF/events.json","paper":"https://pith.science/paper/VEO7UL6Q"},"agent_actions":{"view_html":"https://pith.science/pith/VEO7UL6QSCBT3E4LZ5JO3BPLRF","download_json":"https://pith.science/pith/VEO7UL6QSCBT3E4LZ5JO3BPLRF.json","view_paper":"https://pith.science/paper/VEO7UL6Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.08522&json=true","fetch_graph":"https://pith.science/api/pith-number/VEO7UL6QSCBT3E4LZ5JO3BPLRF/graph.json","fetch_events":"https://pith.science/api/pith-number/VEO7UL6QSCBT3E4LZ5JO3BPLRF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VEO7UL6QSCBT3E4LZ5JO3BPLRF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VEO7UL6QSCBT3E4LZ5JO3BPLRF/action/storage_attestation","attest_author":"https://pith.science/pith/VEO7UL6QSCBT3E4LZ5JO3BPLRF/action/author_attestation","sign_citation":"https://pith.science/pith/VEO7UL6QSCBT3E4LZ5JO3BPLRF/action/citation_signature","submit_replication":"https://pith.science/pith/VEO7UL6QSCBT3E4LZ5JO3BPLRF/action/replication_record"}},"created_at":"2026-05-18T00:45:27.481794+00:00","updated_at":"2026-05-18T00:45:27.481794+00:00"}