{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NEP7U6W5HGT4BYMRAGXTC44D5X","short_pith_number":"pith:NEP7U6W5","schema_version":"1.0","canonical_sha256":"691ffa7add39a7c0e19101af317383edc6b7225d26062804382389d17d27ce98","source":{"kind":"arxiv","id":"1801.07413","version":1},"attestation_state":"computed","paper":{"title":"Greed is Still Good: Maximizing Monotone Submodular+Supermodular Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Jeffrey A. Bilmes, Wenruo Bai","submitted_at":"2018-01-23T07:15:15Z","abstract_excerpt":"We analyze the performance of the greedy algorithm, and also a discrete semi-gradient based algorithm, for maximizing the sum of a suBmodular and suPermodular (BP) function (both of which are non-negative monotone non-decreasing) under two types of constraints, either a cardinality constraint or $p\\geq 1$ matroid independence constraints. These problems occur naturally in several real-world applications in data science, machine learning, and artificial intelligence. The problems are ordinarily inapproximable to any factor (as we show). Using the curvature $\\kappa_f$ of the submodular term, 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":"1801.07413","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-01-23T07:15:15Z","cross_cats_sorted":[],"title_canon_sha256":"c66e16656cf62921244280c5fa6283cfe9299091163fc2dce21b5c0d9e99fabb","abstract_canon_sha256":"552c3b31bd276fe1709149c5881025ae427f24288a2b003dd49394d22729de3b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:12.888741Z","signature_b64":"OyM/CwxRlYu/gwwnb4xtVD23SPfELpmH/laGh4clR1Sm3906I5gWYEPyUTeXHe2cLFiWgazNwVUk8gzPefNXBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"691ffa7add39a7c0e19101af317383edc6b7225d26062804382389d17d27ce98","last_reissued_at":"2026-05-18T00:25:12.888063Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:12.888063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Greed is Still Good: Maximizing Monotone Submodular+Supermodular Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Jeffrey A. Bilmes, Wenruo Bai","submitted_at":"2018-01-23T07:15:15Z","abstract_excerpt":"We analyze the performance of the greedy algorithm, and also a discrete semi-gradient based algorithm, for maximizing the sum of a suBmodular and suPermodular (BP) function (both of which are non-negative monotone non-decreasing) under two types of constraints, either a cardinality constraint or $p\\geq 1$ matroid independence constraints. These problems occur naturally in several real-world applications in data science, machine learning, and artificial intelligence. The problems are ordinarily inapproximable to any factor (as we show). Using the curvature $\\kappa_f$ of the submodular term, and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07413","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":"1801.07413","created_at":"2026-05-18T00:25:12.888163+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.07413v1","created_at":"2026-05-18T00:25:12.888163+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07413","created_at":"2026-05-18T00:25:12.888163+00:00"},{"alias_kind":"pith_short_12","alias_value":"NEP7U6W5HGT4","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NEP7U6W5HGT4BYMR","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NEP7U6W5","created_at":"2026-05-18T12:32:40.477152+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/NEP7U6W5HGT4BYMRAGXTC44D5X","json":"https://pith.science/pith/NEP7U6W5HGT4BYMRAGXTC44D5X.json","graph_json":"https://pith.science/api/pith-number/NEP7U6W5HGT4BYMRAGXTC44D5X/graph.json","events_json":"https://pith.science/api/pith-number/NEP7U6W5HGT4BYMRAGXTC44D5X/events.json","paper":"https://pith.science/paper/NEP7U6W5"},"agent_actions":{"view_html":"https://pith.science/pith/NEP7U6W5HGT4BYMRAGXTC44D5X","download_json":"https://pith.science/pith/NEP7U6W5HGT4BYMRAGXTC44D5X.json","view_paper":"https://pith.science/paper/NEP7U6W5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.07413&json=true","fetch_graph":"https://pith.science/api/pith-number/NEP7U6W5HGT4BYMRAGXTC44D5X/graph.json","fetch_events":"https://pith.science/api/pith-number/NEP7U6W5HGT4BYMRAGXTC44D5X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NEP7U6W5HGT4BYMRAGXTC44D5X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NEP7U6W5HGT4BYMRAGXTC44D5X/action/storage_attestation","attest_author":"https://pith.science/pith/NEP7U6W5HGT4BYMRAGXTC44D5X/action/author_attestation","sign_citation":"https://pith.science/pith/NEP7U6W5HGT4BYMRAGXTC44D5X/action/citation_signature","submit_replication":"https://pith.science/pith/NEP7U6W5HGT4BYMRAGXTC44D5X/action/replication_record"}},"created_at":"2026-05-18T00:25:12.888163+00:00","updated_at":"2026-05-18T00:25:12.888163+00:00"}