{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TLBEQ74OWEINTFKNSNHQLJVMP3","short_pith_number":"pith:TLBEQ74O","schema_version":"1.0","canonical_sha256":"9ac2487f8eb110d9954d934f05a6ac7ed16409574adf059179b617f28e832337","source":{"kind":"arxiv","id":"1611.03253","version":1},"attestation_state":"computed","paper":{"title":"Constrained Submodular Maximization via a Non-symmetric Technique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Moran Feldman, Niv Buchbinder","submitted_at":"2016-11-10T10:54:20Z","abstract_excerpt":"The study of combinatorial optimization problems with a submodular objective has attracted much attention in recent years. Such problems are important in both theory and practice because their objective functions are very general. Obtaining further improvements for many submodular maximization problems boils down to finding better algorithms for optimizing a relaxation of them known as the multilinear extension.\n  In this work we present an algorithm for optimizing the multilinear relaxation whose guarantee improves over the guarantee of the best previous algorithm (which was given by Ene and "},"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":"1611.03253","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-10T10:54:20Z","cross_cats_sorted":[],"title_canon_sha256":"33348d99e2f5b1120aed745f1b8a3047fcb48ddaa548175362b1f4845067440d","abstract_canon_sha256":"cefa3e2d483e9c863ed22f10d0dec12001d371a186b66f222e6645a23114652e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:40.833208Z","signature_b64":"G1zg1ci6IcEUdyGIRu/+79Z8J8JlkjRs3GjpKBa3WzoByWWZ80vfLCiabOJFEr6L9Ag1AdBXKMUu06LmOgwLAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ac2487f8eb110d9954d934f05a6ac7ed16409574adf059179b617f28e832337","last_reissued_at":"2026-05-18T00:59:40.832556Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:40.832556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constrained Submodular Maximization via a Non-symmetric Technique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Moran Feldman, Niv Buchbinder","submitted_at":"2016-11-10T10:54:20Z","abstract_excerpt":"The study of combinatorial optimization problems with a submodular objective has attracted much attention in recent years. Such problems are important in both theory and practice because their objective functions are very general. Obtaining further improvements for many submodular maximization problems boils down to finding better algorithms for optimizing a relaxation of them known as the multilinear extension.\n  In this work we present an algorithm for optimizing the multilinear relaxation whose guarantee improves over the guarantee of the best previous algorithm (which was given by Ene and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03253","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":"1611.03253","created_at":"2026-05-18T00:59:40.832673+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.03253v1","created_at":"2026-05-18T00:59:40.832673+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03253","created_at":"2026-05-18T00:59:40.832673+00:00"},{"alias_kind":"pith_short_12","alias_value":"TLBEQ74OWEIN","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"TLBEQ74OWEINTFKN","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"TLBEQ74O","created_at":"2026-05-18T12:30:44.179134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.00312","citing_title":"Competitive Algorithms for Online Budget-Constrained Continuous DR-Submodular Problems","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TLBEQ74OWEINTFKNSNHQLJVMP3","json":"https://pith.science/pith/TLBEQ74OWEINTFKNSNHQLJVMP3.json","graph_json":"https://pith.science/api/pith-number/TLBEQ74OWEINTFKNSNHQLJVMP3/graph.json","events_json":"https://pith.science/api/pith-number/TLBEQ74OWEINTFKNSNHQLJVMP3/events.json","paper":"https://pith.science/paper/TLBEQ74O"},"agent_actions":{"view_html":"https://pith.science/pith/TLBEQ74OWEINTFKNSNHQLJVMP3","download_json":"https://pith.science/pith/TLBEQ74OWEINTFKNSNHQLJVMP3.json","view_paper":"https://pith.science/paper/TLBEQ74O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.03253&json=true","fetch_graph":"https://pith.science/api/pith-number/TLBEQ74OWEINTFKNSNHQLJVMP3/graph.json","fetch_events":"https://pith.science/api/pith-number/TLBEQ74OWEINTFKNSNHQLJVMP3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TLBEQ74OWEINTFKNSNHQLJVMP3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TLBEQ74OWEINTFKNSNHQLJVMP3/action/storage_attestation","attest_author":"https://pith.science/pith/TLBEQ74OWEINTFKNSNHQLJVMP3/action/author_attestation","sign_citation":"https://pith.science/pith/TLBEQ74OWEINTFKNSNHQLJVMP3/action/citation_signature","submit_replication":"https://pith.science/pith/TLBEQ74OWEINTFKNSNHQLJVMP3/action/replication_record"}},"created_at":"2026-05-18T00:59:40.832673+00:00","updated_at":"2026-05-18T00:59:40.832673+00:00"}