{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VEO7UL6QSCBT3E4LZ5JO3BPLRF","short_pith_number":"pith:VEO7UL6Q","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"},"canonical_sha256":"a91dfa2fd090833d938bcf52ed85eb894a488f4348f520c28bf25cf2aa4e7bf7","source":{"kind":"arxiv","id":"1704.08522","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08522","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08522v1","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08522","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"pith_short_12","alias_value":"VEO7UL6QSCBT","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VEO7UL6QSCBT3E4L","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VEO7UL6Q","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VEO7UL6QSCBT3E4LZ5JO3BPLRF","target":"record","payload":{"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"},"canonical_sha256":"a91dfa2fd090833d938bcf52ed85eb894a488f4348f520c28bf25cf2aa4e7bf7","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"},"source_kind":"arxiv","source_id":"1704.08522","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-18T00:45:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gc1zQVPlvFHNMICnmCv/2y2I4J+Ms3K/rIQt7+IqvQR+Dgk3/qgCQqfU6fv/rX8y+u6JgiSwFDPfnYDorRYyAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T11:24:10.981046Z"},"content_sha256":"7d5ef74dc44ddec8b9b76af882d6eda93b3669f3691e4214635c94d67d89a5c8","schema_version":"1.0","event_id":"sha256:7d5ef74dc44ddec8b9b76af882d6eda93b3669f3691e4214635c94d67d89a5c8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VEO7UL6QSCBT3E4LZ5JO3BPLRF","target":"graph","payload":{"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"},"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-18T00:45:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/57DWTnGxksdJc1OLLG4s7JxA8gasDAZYIsymUJ0B3ofg3uD7pGqgse5TmcM0YOZbYZFuPYgxXS5mMYcvfRkCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T11:24:10.981415Z"},"content_sha256":"0b07c6c72678eea9c193f3bcd41e23d0273df110ca3bf86ff093f2ac9f3bb13f","schema_version":"1.0","event_id":"sha256:0b07c6c72678eea9c193f3bcd41e23d0273df110ca3bf86ff093f2ac9f3bb13f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VEO7UL6QSCBT3E4LZ5JO3BPLRF/bundle.json","state_url":"https://pith.science/pith/VEO7UL6QSCBT3E4LZ5JO3BPLRF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VEO7UL6QSCBT3E4LZ5JO3BPLRF/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-03T11:24:10Z","links":{"resolver":"https://pith.science/pith/VEO7UL6QSCBT3E4LZ5JO3BPLRF","bundle":"https://pith.science/pith/VEO7UL6QSCBT3E4LZ5JO3BPLRF/bundle.json","state":"https://pith.science/pith/VEO7UL6QSCBT3E4LZ5JO3BPLRF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VEO7UL6QSCBT3E4LZ5JO3BPLRF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VEO7UL6QSCBT3E4LZ5JO3BPLRF","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":"cae11180b0ad3a5d6a2fa8f1fe481f283f7b029069c29d85d7557cb2f6de25a8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-04-27T12:03:54Z","title_canon_sha256":"6faf7e863197ab459d77c4598ba7d7d4c918c4673245c3eface538cdaf99dc88"},"schema_version":"1.0","source":{"id":"1704.08522","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08522","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08522v1","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08522","created_at":"2026-05-18T00:45:27Z"},{"alias_kind":"pith_short_12","alias_value":"VEO7UL6QSCBT","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VEO7UL6QSCBT3E4L","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VEO7UL6Q","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:0b07c6c72678eea9c193f3bcd41e23d0273df110ca3bf86ff093f2ac9f3bb13f","target":"graph","created_at":"2026-05-18T00:45:27Z","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":"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","authors_text":"Andreas Wierz, Britta Peis, Jos\\'e Verschae","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-04-27T12:03:54Z","title":"The Primal-Dual Greedy Algorithm for Weighted Covering Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08522","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:7d5ef74dc44ddec8b9b76af882d6eda93b3669f3691e4214635c94d67d89a5c8","target":"record","created_at":"2026-05-18T00:45:27Z","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":"cae11180b0ad3a5d6a2fa8f1fe481f283f7b029069c29d85d7557cb2f6de25a8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-04-27T12:03:54Z","title_canon_sha256":"6faf7e863197ab459d77c4598ba7d7d4c918c4673245c3eface538cdaf99dc88"},"schema_version":"1.0","source":{"id":"1704.08522","kind":"arxiv","version":1}},"canonical_sha256":"a91dfa2fd090833d938bcf52ed85eb894a488f4348f520c28bf25cf2aa4e7bf7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a91dfa2fd090833d938bcf52ed85eb894a488f4348f520c28bf25cf2aa4e7bf7","first_computed_at":"2026-05-18T00:45:27.481692Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:27.481692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c3Mn5M997oA2SBqOKh6mIlSbX0fVQdsMpmEDQRoh77HQOziJX83gSRvnz7KSUPQYxbI0eZA+zrFlYE3uq2aLAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:27.482295Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.08522","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d5ef74dc44ddec8b9b76af882d6eda93b3669f3691e4214635c94d67d89a5c8","sha256:0b07c6c72678eea9c193f3bcd41e23d0273df110ca3bf86ff093f2ac9f3bb13f"],"state_sha256":"8e03728f51d762f7067b5c1186f72e102a9665c8654129620c75df8b3fd8d0b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GYV4ZA/v37bNUECn2QfCKLk4VXL8ojGayuu85LzBtVX1Kn1jNSdqI3weeR5mQqTgjFHKaRhCqAD5ncJnv7jqCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T11:24:10.983411Z","bundle_sha256":"3034a549d50fc5e2bbd8289dba35bf8f3c3a2a6b681ca17491ba49c8e3994eaf"}}