{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:6JM5OYXN4RXVOWKUVGKHEEX5FG","short_pith_number":"pith:6JM5OYXN","schema_version":"1.0","canonical_sha256":"f259d762ede46f575954a9947212fd299a17905a2ce42ae3a7de44c7f35f84fc","source":{"kind":"arxiv","id":"1311.2106","version":1},"attestation_state":"computed","paper":{"title":"Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DM"],"primary_cat":"cs.DS","authors_text":"Jeff Bilmes, Rishabh Iyer","submitted_at":"2013-11-08T23:28:02Z","abstract_excerpt":"We investigate two new optimization problems -- minimizing a submodular function subject to a submodular lower bound constraint (submodular cover) and maximizing a submodular function subject to a submodular upper bound constraint (submodular knapsack). We are motivated by a number of real-world applications in machine learning including sensor placement and data subset selection, which require maximizing a certain submodular function (like coverage or diversity) while simultaneously minimizing another (like cooperative cost). These problems are often posed as minimizing the difference between"},"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":"1311.2106","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-08T23:28:02Z","cross_cats_sorted":["cs.AI","cs.DM"],"title_canon_sha256":"168e63ffd887ce1a67f06c66a8057c51fbdd01dcd829adfbbcb8e8d996a45009","abstract_canon_sha256":"d8fa32bdcabdeed787a1197dddbdf87b43f43911853dc19390212cd03a0498fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:33.523245Z","signature_b64":"hSMV4ATdxXl4iK2OziT4dFuukY+ebHUEYZCUp3xebeiGKhHtka/8daKLyODGjfDVmgdoQ+6obhWBxTf+AjfbAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f259d762ede46f575954a9947212fd299a17905a2ce42ae3a7de44c7f35f84fc","last_reissued_at":"2026-05-18T03:07:33.522700Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:33.522700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DM"],"primary_cat":"cs.DS","authors_text":"Jeff Bilmes, Rishabh Iyer","submitted_at":"2013-11-08T23:28:02Z","abstract_excerpt":"We investigate two new optimization problems -- minimizing a submodular function subject to a submodular lower bound constraint (submodular cover) and maximizing a submodular function subject to a submodular upper bound constraint (submodular knapsack). We are motivated by a number of real-world applications in machine learning including sensor placement and data subset selection, which require maximizing a certain submodular function (like coverage or diversity) while simultaneously minimizing another (like cooperative cost). These problems are often posed as minimizing the difference between"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2106","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":"1311.2106","created_at":"2026-05-18T03:07:33.522782+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.2106v1","created_at":"2026-05-18T03:07:33.522782+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2106","created_at":"2026-05-18T03:07:33.522782+00:00"},{"alias_kind":"pith_short_12","alias_value":"6JM5OYXN4RXV","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"6JM5OYXN4RXVOWKU","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"6JM5OYXN","created_at":"2026-05-18T12:27:36.564083+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/6JM5OYXN4RXVOWKUVGKHEEX5FG","json":"https://pith.science/pith/6JM5OYXN4RXVOWKUVGKHEEX5FG.json","graph_json":"https://pith.science/api/pith-number/6JM5OYXN4RXVOWKUVGKHEEX5FG/graph.json","events_json":"https://pith.science/api/pith-number/6JM5OYXN4RXVOWKUVGKHEEX5FG/events.json","paper":"https://pith.science/paper/6JM5OYXN"},"agent_actions":{"view_html":"https://pith.science/pith/6JM5OYXN4RXVOWKUVGKHEEX5FG","download_json":"https://pith.science/pith/6JM5OYXN4RXVOWKUVGKHEEX5FG.json","view_paper":"https://pith.science/paper/6JM5OYXN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.2106&json=true","fetch_graph":"https://pith.science/api/pith-number/6JM5OYXN4RXVOWKUVGKHEEX5FG/graph.json","fetch_events":"https://pith.science/api/pith-number/6JM5OYXN4RXVOWKUVGKHEEX5FG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6JM5OYXN4RXVOWKUVGKHEEX5FG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6JM5OYXN4RXVOWKUVGKHEEX5FG/action/storage_attestation","attest_author":"https://pith.science/pith/6JM5OYXN4RXVOWKUVGKHEEX5FG/action/author_attestation","sign_citation":"https://pith.science/pith/6JM5OYXN4RXVOWKUVGKHEEX5FG/action/citation_signature","submit_replication":"https://pith.science/pith/6JM5OYXN4RXVOWKUVGKHEEX5FG/action/replication_record"}},"created_at":"2026-05-18T03:07:33.522782+00:00","updated_at":"2026-05-18T03:07:33.522782+00:00"}