{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:F6V6IBU4QGVTY6G6F5ROQLB3IJ","short_pith_number":"pith:F6V6IBU4","schema_version":"1.0","canonical_sha256":"2fabe4069c81ab3c78de2f62e82c3b427d66dfa3ee559f671f22dcff6fca43cf","source":{"kind":"arxiv","id":"1105.4593","version":5},"attestation_state":"computed","paper":{"title":"Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Chandra Chekuri, Jan Vondr\\'ak, Rico Zenklusen","submitted_at":"2011-05-23T19:38:56Z","abstract_excerpt":"We consider the problem of maximizing a non-negative submodular set function $f:2^N \\rightarrow \\mathbb{R}_+$ over a ground set $N$ subject to a variety of packing type constraints including (multiple) matroid constraints, knapsack constraints, and their intersections. In this paper we develop a general framework that allows us to derive a number of new results, in particular when $f$ may be a non-monotone function. Our algorithms are based on (approximately) maximizing the multilinear extension $F$ of $f$ over a polytope $P$ that represents the constraints, and then effectively rounding the f"},"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":"1105.4593","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-05-23T19:38:56Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"250041b4a7359bfc1986d7c188617cf3654809b189a697ee5a4deba6dbe5f47e","abstract_canon_sha256":"046d3e418bd8b80415dfedd76734011efe23c8d753d78881d0a0ffb914d062f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:21.748731Z","signature_b64":"y8p8nJM+uBBSbAinaUNlC+0ia0KqC3X1ZgyYIU+mNSYcJryPsL5gPD/avhDQpbIGnDKtaBeeRdhs+h5YSw2BAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fabe4069c81ab3c78de2f62e82c3b427d66dfa3ee559f671f22dcff6fca43cf","last_reissued_at":"2026-05-18T02:45:21.748090Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:21.748090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Chandra Chekuri, Jan Vondr\\'ak, Rico Zenklusen","submitted_at":"2011-05-23T19:38:56Z","abstract_excerpt":"We consider the problem of maximizing a non-negative submodular set function $f:2^N \\rightarrow \\mathbb{R}_+$ over a ground set $N$ subject to a variety of packing type constraints including (multiple) matroid constraints, knapsack constraints, and their intersections. In this paper we develop a general framework that allows us to derive a number of new results, in particular when $f$ may be a non-monotone function. Our algorithms are based on (approximately) maximizing the multilinear extension $F$ of $f$ over a polytope $P$ that represents the constraints, and then effectively rounding the f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.4593","kind":"arxiv","version":5},"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":"1105.4593","created_at":"2026-05-18T02:45:21.748174+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.4593v5","created_at":"2026-05-18T02:45:21.748174+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.4593","created_at":"2026-05-18T02:45:21.748174+00:00"},{"alias_kind":"pith_short_12","alias_value":"F6V6IBU4QGVT","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"F6V6IBU4QGVTY6G6","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"F6V6IBU4","created_at":"2026-05-18T12:26:28.662955+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/F6V6IBU4QGVTY6G6F5ROQLB3IJ","json":"https://pith.science/pith/F6V6IBU4QGVTY6G6F5ROQLB3IJ.json","graph_json":"https://pith.science/api/pith-number/F6V6IBU4QGVTY6G6F5ROQLB3IJ/graph.json","events_json":"https://pith.science/api/pith-number/F6V6IBU4QGVTY6G6F5ROQLB3IJ/events.json","paper":"https://pith.science/paper/F6V6IBU4"},"agent_actions":{"view_html":"https://pith.science/pith/F6V6IBU4QGVTY6G6F5ROQLB3IJ","download_json":"https://pith.science/pith/F6V6IBU4QGVTY6G6F5ROQLB3IJ.json","view_paper":"https://pith.science/paper/F6V6IBU4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.4593&json=true","fetch_graph":"https://pith.science/api/pith-number/F6V6IBU4QGVTY6G6F5ROQLB3IJ/graph.json","fetch_events":"https://pith.science/api/pith-number/F6V6IBU4QGVTY6G6F5ROQLB3IJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F6V6IBU4QGVTY6G6F5ROQLB3IJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F6V6IBU4QGVTY6G6F5ROQLB3IJ/action/storage_attestation","attest_author":"https://pith.science/pith/F6V6IBU4QGVTY6G6F5ROQLB3IJ/action/author_attestation","sign_citation":"https://pith.science/pith/F6V6IBU4QGVTY6G6F5ROQLB3IJ/action/citation_signature","submit_replication":"https://pith.science/pith/F6V6IBU4QGVTY6G6F5ROQLB3IJ/action/replication_record"}},"created_at":"2026-05-18T02:45:21.748174+00:00","updated_at":"2026-05-18T02:45:21.748174+00:00"}