{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:Q6JQFZWW7YPHTQGOFTXW3QXLHP","short_pith_number":"pith:Q6JQFZWW","schema_version":"1.0","canonical_sha256":"879302e6d6fe1e79c0ce2cef6dc2eb3bf06e6c854343fdc2446b4ab2d9119985","source":{"kind":"arxiv","id":"2204.03412","version":1},"attestation_state":"computed","paper":{"title":"Maximizing Sums of Non-monotone Submodular and Linear Functions: Understanding the Unconstrained Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Kobi Bodek, Moran Feldman","submitted_at":"2022-04-07T12:52:30Z","abstract_excerpt":"Motivated by practical applications, recent works have considered maximization of sums of a submodular function $g$ and a linear function $\\ell$. Almost all such works, to date, studied only the special case of this problem in which $g$ is also guaranteed to be monotone. Therefore, in this paper we systematically study the simplest version of this problem in which $g$ is allowed to be non-monotone, namely the unconstrained variant, which we term Regularized Unconstrained Submodular Maximization (RegularizedUSM).\n  Our main algorithmic result is the first non-trivial guarantee for general Regul"},"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":"2204.03412","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-04-07T12:52:30Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"386addfb255e79f3a0612248659cc038b5d1f0348ebc3d814d3468cbe157aa72","abstract_canon_sha256":"9b3ec6eea8832914edc6928452ce40c8d275250d7a8af00d8c323f5aac419e97"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:12:29.750840Z","signature_b64":"XzEipVdVd4VNflQ6jmMWJ1oioq/DwoF9Z2HCDZwEDXQAjROy73RoJkVIf8ISI6xJi8TaXOOYbce/7coypz2CDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"879302e6d6fe1e79c0ce2cef6dc2eb3bf06e6c854343fdc2446b4ab2d9119985","last_reissued_at":"2026-07-05T04:12:29.750363Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:12:29.750363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximizing Sums of Non-monotone Submodular and Linear Functions: Understanding the Unconstrained Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Kobi Bodek, Moran Feldman","submitted_at":"2022-04-07T12:52:30Z","abstract_excerpt":"Motivated by practical applications, recent works have considered maximization of sums of a submodular function $g$ and a linear function $\\ell$. Almost all such works, to date, studied only the special case of this problem in which $g$ is also guaranteed to be monotone. Therefore, in this paper we systematically study the simplest version of this problem in which $g$ is allowed to be non-monotone, namely the unconstrained variant, which we term Regularized Unconstrained Submodular Maximization (RegularizedUSM).\n  Our main algorithmic result is the first non-trivial guarantee for general Regul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.03412","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2204.03412/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2204.03412","created_at":"2026-07-05T04:12:29.750418+00:00"},{"alias_kind":"arxiv_version","alias_value":"2204.03412v1","created_at":"2026-07-05T04:12:29.750418+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.03412","created_at":"2026-07-05T04:12:29.750418+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q6JQFZWW7YPH","created_at":"2026-07-05T04:12:29.750418+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q6JQFZWW7YPHTQGO","created_at":"2026-07-05T04:12:29.750418+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q6JQFZWW","created_at":"2026-07-05T04:12:29.750418+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.10248","citing_title":"Bicriteria Submodular Maximization","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q6JQFZWW7YPHTQGOFTXW3QXLHP","json":"https://pith.science/pith/Q6JQFZWW7YPHTQGOFTXW3QXLHP.json","graph_json":"https://pith.science/api/pith-number/Q6JQFZWW7YPHTQGOFTXW3QXLHP/graph.json","events_json":"https://pith.science/api/pith-number/Q6JQFZWW7YPHTQGOFTXW3QXLHP/events.json","paper":"https://pith.science/paper/Q6JQFZWW"},"agent_actions":{"view_html":"https://pith.science/pith/Q6JQFZWW7YPHTQGOFTXW3QXLHP","download_json":"https://pith.science/pith/Q6JQFZWW7YPHTQGOFTXW3QXLHP.json","view_paper":"https://pith.science/paper/Q6JQFZWW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2204.03412&json=true","fetch_graph":"https://pith.science/api/pith-number/Q6JQFZWW7YPHTQGOFTXW3QXLHP/graph.json","fetch_events":"https://pith.science/api/pith-number/Q6JQFZWW7YPHTQGOFTXW3QXLHP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q6JQFZWW7YPHTQGOFTXW3QXLHP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q6JQFZWW7YPHTQGOFTXW3QXLHP/action/storage_attestation","attest_author":"https://pith.science/pith/Q6JQFZWW7YPHTQGOFTXW3QXLHP/action/author_attestation","sign_citation":"https://pith.science/pith/Q6JQFZWW7YPHTQGOFTXW3QXLHP/action/citation_signature","submit_replication":"https://pith.science/pith/Q6JQFZWW7YPHTQGOFTXW3QXLHP/action/replication_record"}},"created_at":"2026-07-05T04:12:29.750418+00:00","updated_at":"2026-07-05T04:12:29.750418+00:00"}