{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VUHBH2VM2IPMM6FIXB7RKZUMXJ","short_pith_number":"pith:VUHBH2VM","schema_version":"1.0","canonical_sha256":"ad0e13eaacd21ec678a8b87f15668cba4e6e139539e1535dfddb125d49197059","source":{"kind":"arxiv","id":"1709.09767","version":3},"attestation_state":"computed","paper":{"title":"A Nearly-linear Time Algorithm for Submodular Maximization with a Knapsack Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alina Ene, Huy L. Nguyen","submitted_at":"2017-09-28T00:26:16Z","abstract_excerpt":"We consider the problem of maximizing a monotone submodular function subject to a knapsack constraint. Our main contribution is an algorithm that achieves a nearly-optimal, $1 - 1/e - \\epsilon$ approximation, using $(1/\\epsilon)^{O(1/\\epsilon^4)} n \\log^2{n}$ function evaluations and arithmetic operations. Our algorithm is impractical but theoretically interesting, since it overcomes a fundamental running time bottleneck of the multilinear extension relaxation framework. This is the main approach for obtaining nearly-optimal approximation guarantees for important classes of constraints but it "},"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":"1709.09767","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-28T00:26:16Z","cross_cats_sorted":[],"title_canon_sha256":"fe6a0efb6490a5820b96807738e915068f24f1401069ffd99a8a86f3716afc76","abstract_canon_sha256":"978aca65bd627cc30aa7e0eaded520604e518a96f75d45aa5c1a01e1a3dcacec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:30.935772Z","signature_b64":"0CPfKN+422BgDWYB+ewhRSWsm4+uBhUJuWKlIVlC5J1EWghtnT4E5U7QkLH0DUQ44EzedYgy4v647QlSHlZsBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad0e13eaacd21ec678a8b87f15668cba4e6e139539e1535dfddb125d49197059","last_reissued_at":"2026-05-18T00:00:30.935226Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:30.935226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Nearly-linear Time Algorithm for Submodular Maximization with a Knapsack Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alina Ene, Huy L. Nguyen","submitted_at":"2017-09-28T00:26:16Z","abstract_excerpt":"We consider the problem of maximizing a monotone submodular function subject to a knapsack constraint. Our main contribution is an algorithm that achieves a nearly-optimal, $1 - 1/e - \\epsilon$ approximation, using $(1/\\epsilon)^{O(1/\\epsilon^4)} n \\log^2{n}$ function evaluations and arithmetic operations. Our algorithm is impractical but theoretically interesting, since it overcomes a fundamental running time bottleneck of the multilinear extension relaxation framework. This is the main approach for obtaining nearly-optimal approximation guarantees for important classes of constraints but it "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09767","kind":"arxiv","version":3},"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":"1709.09767","created_at":"2026-05-18T00:00:30.935298+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.09767v3","created_at":"2026-05-18T00:00:30.935298+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09767","created_at":"2026-05-18T00:00:30.935298+00:00"},{"alias_kind":"pith_short_12","alias_value":"VUHBH2VM2IPM","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VUHBH2VM2IPMM6FI","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VUHBH2VM","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/VUHBH2VM2IPMM6FIXB7RKZUMXJ","json":"https://pith.science/pith/VUHBH2VM2IPMM6FIXB7RKZUMXJ.json","graph_json":"https://pith.science/api/pith-number/VUHBH2VM2IPMM6FIXB7RKZUMXJ/graph.json","events_json":"https://pith.science/api/pith-number/VUHBH2VM2IPMM6FIXB7RKZUMXJ/events.json","paper":"https://pith.science/paper/VUHBH2VM"},"agent_actions":{"view_html":"https://pith.science/pith/VUHBH2VM2IPMM6FIXB7RKZUMXJ","download_json":"https://pith.science/pith/VUHBH2VM2IPMM6FIXB7RKZUMXJ.json","view_paper":"https://pith.science/paper/VUHBH2VM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.09767&json=true","fetch_graph":"https://pith.science/api/pith-number/VUHBH2VM2IPMM6FIXB7RKZUMXJ/graph.json","fetch_events":"https://pith.science/api/pith-number/VUHBH2VM2IPMM6FIXB7RKZUMXJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VUHBH2VM2IPMM6FIXB7RKZUMXJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VUHBH2VM2IPMM6FIXB7RKZUMXJ/action/storage_attestation","attest_author":"https://pith.science/pith/VUHBH2VM2IPMM6FIXB7RKZUMXJ/action/author_attestation","sign_citation":"https://pith.science/pith/VUHBH2VM2IPMM6FIXB7RKZUMXJ/action/citation_signature","submit_replication":"https://pith.science/pith/VUHBH2VM2IPMM6FIXB7RKZUMXJ/action/replication_record"}},"created_at":"2026-05-18T00:00:30.935298+00:00","updated_at":"2026-05-18T00:00:30.935298+00:00"}