{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:WWHAFG2FX2ZUFBDZY74SC2UZH4","short_pith_number":"pith:WWHAFG2F","schema_version":"1.0","canonical_sha256":"b58e029b45beb3428479c7f9216a993f2a204bdcb2b49904192bcbbf0cb95cc8","source":{"kind":"arxiv","id":"1101.2940","version":1},"attestation_state":"computed","paper":{"title":"Approximations for Monotone and Non-monotone Submodular Maximization with Knapsack Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Ariel Kulik, Hadas Shachnai, Tami Tamir","submitted_at":"2011-01-15T04:21:35Z","abstract_excerpt":"Submodular maximization generalizes many fundamental problems in discrete optimization, including Max-Cut in directed/undirected graphs, maximum coverage, maximum facility location and marketing over social networks.\n  In this paper we consider the problem of maximizing any submodular function subject to $d$ knapsack constraints, where $d$ is a fixed constant. We establish a strong relation between the discrete problem and its continuous relaxation, obtained through {\\em extension by expectation} of the submodular function. Formally, we show that, for any non-negative submodular function, an $"},"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":"1101.2940","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-15T04:21:35Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0638ebf427acf7612c522f6c0c0938a2596320706d647de0d7a0e512acf47bc2","abstract_canon_sha256":"38cb4d2eadb1736f8471437864084d48ed048e855b365bfa865243a0d29a2ba3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:30.706610Z","signature_b64":"64ip39jrZA1UOLVl67QX9NGzfzFbRnJdhtVm6XL9GXzD8klreiwZHq9BYi3IPfammfiZX342O/AkyZyVCvKZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b58e029b45beb3428479c7f9216a993f2a204bdcb2b49904192bcbbf0cb95cc8","last_reissued_at":"2026-05-18T04:31:30.706245Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:30.706245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximations for Monotone and Non-monotone Submodular Maximization with Knapsack Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Ariel Kulik, Hadas Shachnai, Tami Tamir","submitted_at":"2011-01-15T04:21:35Z","abstract_excerpt":"Submodular maximization generalizes many fundamental problems in discrete optimization, including Max-Cut in directed/undirected graphs, maximum coverage, maximum facility location and marketing over social networks.\n  In this paper we consider the problem of maximizing any submodular function subject to $d$ knapsack constraints, where $d$ is a fixed constant. We establish a strong relation between the discrete problem and its continuous relaxation, obtained through {\\em extension by expectation} of the submodular function. Formally, we show that, for any non-negative submodular function, an $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.2940","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":"1101.2940","created_at":"2026-05-18T04:31:30.706298+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.2940v1","created_at":"2026-05-18T04:31:30.706298+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2940","created_at":"2026-05-18T04:31:30.706298+00:00"},{"alias_kind":"pith_short_12","alias_value":"WWHAFG2FX2ZU","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"WWHAFG2FX2ZUFBDZ","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"WWHAFG2F","created_at":"2026-05-18T12:26:44.992195+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/WWHAFG2FX2ZUFBDZY74SC2UZH4","json":"https://pith.science/pith/WWHAFG2FX2ZUFBDZY74SC2UZH4.json","graph_json":"https://pith.science/api/pith-number/WWHAFG2FX2ZUFBDZY74SC2UZH4/graph.json","events_json":"https://pith.science/api/pith-number/WWHAFG2FX2ZUFBDZY74SC2UZH4/events.json","paper":"https://pith.science/paper/WWHAFG2F"},"agent_actions":{"view_html":"https://pith.science/pith/WWHAFG2FX2ZUFBDZY74SC2UZH4","download_json":"https://pith.science/pith/WWHAFG2FX2ZUFBDZY74SC2UZH4.json","view_paper":"https://pith.science/paper/WWHAFG2F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.2940&json=true","fetch_graph":"https://pith.science/api/pith-number/WWHAFG2FX2ZUFBDZY74SC2UZH4/graph.json","fetch_events":"https://pith.science/api/pith-number/WWHAFG2FX2ZUFBDZY74SC2UZH4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WWHAFG2FX2ZUFBDZY74SC2UZH4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WWHAFG2FX2ZUFBDZY74SC2UZH4/action/storage_attestation","attest_author":"https://pith.science/pith/WWHAFG2FX2ZUFBDZY74SC2UZH4/action/author_attestation","sign_citation":"https://pith.science/pith/WWHAFG2FX2ZUFBDZY74SC2UZH4/action/citation_signature","submit_replication":"https://pith.science/pith/WWHAFG2FX2ZUFBDZY74SC2UZH4/action/replication_record"}},"created_at":"2026-05-18T04:31:30.706298+00:00","updated_at":"2026-05-18T04:31:30.706298+00:00"}