{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:6ZOONEQFROLLBEQFBKFYIUEMTW","short_pith_number":"pith:6ZOONEQF","canonical_record":{"source":{"id":"2008.05391","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-08-12T15:40:21Z","cross_cats_sorted":["cs.AI","cs.DM"],"title_canon_sha256":"91318fb7b07e396ba97872e55d2ccffefd51e191bd8d3543b3c88b54c373f8fb","abstract_canon_sha256":"518c8cf7c8c15efb9e5a1bceeb43e42873620ce36f57c72355c0cfedc86453b2"},"schema_version":"1.0"},"canonical_sha256":"f65ce692058b96b092050a8b84508c9d81c10d74531ad824e77bd855faf6cf6c","source":{"kind":"arxiv","id":"2008.05391","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.05391","created_at":"2026-07-05T02:06:32Z"},{"alias_kind":"arxiv_version","alias_value":"2008.05391v2","created_at":"2026-07-05T02:06:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.05391","created_at":"2026-07-05T02:06:32Z"},{"alias_kind":"pith_short_12","alias_value":"6ZOONEQFROLL","created_at":"2026-07-05T02:06:32Z"},{"alias_kind":"pith_short_16","alias_value":"6ZOONEQFROLLBEQF","created_at":"2026-07-05T02:06:32Z"},{"alias_kind":"pith_short_8","alias_value":"6ZOONEQF","created_at":"2026-07-05T02:06:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:6ZOONEQFROLLBEQFBKFYIUEMTW","target":"record","payload":{"canonical_record":{"source":{"id":"2008.05391","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-08-12T15:40:21Z","cross_cats_sorted":["cs.AI","cs.DM"],"title_canon_sha256":"91318fb7b07e396ba97872e55d2ccffefd51e191bd8d3543b3c88b54c373f8fb","abstract_canon_sha256":"518c8cf7c8c15efb9e5a1bceeb43e42873620ce36f57c72355c0cfedc86453b2"},"schema_version":"1.0"},"canonical_sha256":"f65ce692058b96b092050a8b84508c9d81c10d74531ad824e77bd855faf6cf6c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:06:32.156622Z","signature_b64":"XRuCjzlrX24G4+yeYHOT9E8L9vjI4TCnDj9f5gwH7X0C8FzOKWfoneWQR4TeInw/MLRrF/BsHj/bqZ4b+oDjCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f65ce692058b96b092050a8b84508c9d81c10d74531ad824e77bd855faf6cf6c","last_reissued_at":"2026-07-05T02:06:32.156173Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:06:32.156173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2008.05391","source_version":2,"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-07-05T02:06:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IDNDrN02CvK+iy1CU8LYup6NjWFqosGoiAhTF26CgP0K7eOV2qYCQ0TnJ4Ntwj1StTiwSDKsqTPgqp6wQHFeDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T13:28:13.203604Z"},"content_sha256":"2db7f9b9769c707b378890797cecf30a3a92ae672f895884df189d171bc726df","schema_version":"1.0","event_id":"sha256:2db7f9b9769c707b378890797cecf30a3a92ae672f895884df189d171bc726df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:6ZOONEQFROLLBEQFBKFYIUEMTW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Revisiting Modified Greedy Algorithm for Monotone Submodular Maximization with a Knapsack Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DM"],"primary_cat":"cs.DS","authors_text":"Andrew Lim, Chongshou Li, Jing Tang, Junsong Yuan, Kai Han, Xueyan Tang","submitted_at":"2020-08-12T15:40:21Z","abstract_excerpt":"Monotone submodular maximization with a knapsack constraint is NP-hard. Various approximation algorithms have been devised to address this optimization problem. In this paper, we revisit the widely known modified greedy algorithm. First, we show that this algorithm can achieve an approximation factor of $0.405$, which significantly improves the known factors of $0.357$ given by Wolsey and $(1-1/\\mathrm{e})/2\\approx 0.316$ given by Khuller et al. More importantly, our analysis closes a gap in Khuller et al.'s proof for the extensively mentioned approximation factor of $(1-1/\\sqrt{\\mathrm{e}})\\a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.05391","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2008.05391/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:06:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZRj5K93vsk+esFGt9K4FpECOV4Cn1Q2O6AjQAno9gW3/DK3bt4oOuaqOu+qoyCD3wXrM8QWj8lyA4ADUu9pQBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T13:28:13.204518Z"},"content_sha256":"4e94d5979429c8a3a2b9fae3e36720466aea5d1d0734e7eb1bb04607b5868697","schema_version":"1.0","event_id":"sha256:4e94d5979429c8a3a2b9fae3e36720466aea5d1d0734e7eb1bb04607b5868697"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6ZOONEQFROLLBEQFBKFYIUEMTW/bundle.json","state_url":"https://pith.science/pith/6ZOONEQFROLLBEQFBKFYIUEMTW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6ZOONEQFROLLBEQFBKFYIUEMTW/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-08-05T13:28:13Z","links":{"resolver":"https://pith.science/pith/6ZOONEQFROLLBEQFBKFYIUEMTW","bundle":"https://pith.science/pith/6ZOONEQFROLLBEQFBKFYIUEMTW/bundle.json","state":"https://pith.science/pith/6ZOONEQFROLLBEQFBKFYIUEMTW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6ZOONEQFROLLBEQFBKFYIUEMTW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:6ZOONEQFROLLBEQFBKFYIUEMTW","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":"518c8cf7c8c15efb9e5a1bceeb43e42873620ce36f57c72355c0cfedc86453b2","cross_cats_sorted":["cs.AI","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-08-12T15:40:21Z","title_canon_sha256":"91318fb7b07e396ba97872e55d2ccffefd51e191bd8d3543b3c88b54c373f8fb"},"schema_version":"1.0","source":{"id":"2008.05391","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.05391","created_at":"2026-07-05T02:06:32Z"},{"alias_kind":"arxiv_version","alias_value":"2008.05391v2","created_at":"2026-07-05T02:06:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.05391","created_at":"2026-07-05T02:06:32Z"},{"alias_kind":"pith_short_12","alias_value":"6ZOONEQFROLL","created_at":"2026-07-05T02:06:32Z"},{"alias_kind":"pith_short_16","alias_value":"6ZOONEQFROLLBEQF","created_at":"2026-07-05T02:06:32Z"},{"alias_kind":"pith_short_8","alias_value":"6ZOONEQF","created_at":"2026-07-05T02:06:32Z"}],"graph_snapshots":[{"event_id":"sha256:4e94d5979429c8a3a2b9fae3e36720466aea5d1d0734e7eb1bb04607b5868697","target":"graph","created_at":"2026-07-05T02:06:32Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2008.05391/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Monotone submodular maximization with a knapsack constraint is NP-hard. Various approximation algorithms have been devised to address this optimization problem. In this paper, we revisit the widely known modified greedy algorithm. First, we show that this algorithm can achieve an approximation factor of $0.405$, which significantly improves the known factors of $0.357$ given by Wolsey and $(1-1/\\mathrm{e})/2\\approx 0.316$ given by Khuller et al. More importantly, our analysis closes a gap in Khuller et al.'s proof for the extensively mentioned approximation factor of $(1-1/\\sqrt{\\mathrm{e}})\\a","authors_text":"Andrew Lim, Chongshou Li, Jing Tang, Junsong Yuan, Kai Han, Xueyan Tang","cross_cats":["cs.AI","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-08-12T15:40:21Z","title":"Revisiting Modified Greedy Algorithm for Monotone Submodular Maximization with a Knapsack Constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.05391","kind":"arxiv","version":2},"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:2db7f9b9769c707b378890797cecf30a3a92ae672f895884df189d171bc726df","target":"record","created_at":"2026-07-05T02:06:32Z","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":"518c8cf7c8c15efb9e5a1bceeb43e42873620ce36f57c72355c0cfedc86453b2","cross_cats_sorted":["cs.AI","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-08-12T15:40:21Z","title_canon_sha256":"91318fb7b07e396ba97872e55d2ccffefd51e191bd8d3543b3c88b54c373f8fb"},"schema_version":"1.0","source":{"id":"2008.05391","kind":"arxiv","version":2}},"canonical_sha256":"f65ce692058b96b092050a8b84508c9d81c10d74531ad824e77bd855faf6cf6c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f65ce692058b96b092050a8b84508c9d81c10d74531ad824e77bd855faf6cf6c","first_computed_at":"2026-07-05T02:06:32.156173Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:06:32.156173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XRuCjzlrX24G4+yeYHOT9E8L9vjI4TCnDj9f5gwH7X0C8FzOKWfoneWQR4TeInw/MLRrF/BsHj/bqZ4b+oDjCA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:06:32.156622Z","signed_message":"canonical_sha256_bytes"},"source_id":"2008.05391","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2db7f9b9769c707b378890797cecf30a3a92ae672f895884df189d171bc726df","sha256:4e94d5979429c8a3a2b9fae3e36720466aea5d1d0734e7eb1bb04607b5868697"],"state_sha256":"9d3a92f1230601c9a9df960fc3aa6868fd161cc4f043dd3ffe09780ad5a34ab6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VIAjAAiy8ZNu7uH0CVpRNwKmqMW6QJCQBiGceGQB2TfKDzTDdCHB6nx6rCbcQqPNy3vcDjIIhYriUwb359IvAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T13:28:13.210121Z","bundle_sha256":"fb57bec1b704ac88f8a820029fcbba2a087a7219b58b5b4a3af12dfc6b931289"}}