{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:SP2P7ZXVC4FMO46EVDJLEDUVNQ","short_pith_number":"pith:SP2P7ZXV","schema_version":"1.0","canonical_sha256":"93f4ffe6f5170ac773c4a8d2b20e956c02e92a0537893e69aad6ba975df29e12","source":{"kind":"arxiv","id":"1003.1517","version":2},"attestation_state":"computed","paper":{"title":"Constrained Non-Monotone Submodular Maximization: Offline and Secretary Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Aaron Roth, Anupam Gupta, Grant Schoenebeck, Kunal Talwar","submitted_at":"2010-03-07T19:27:48Z","abstract_excerpt":"Constrained submodular maximization problems have long been studied, with near-optimal results known under a variety of constraints when the submodular function is monotone. The case of non-monotone submodular maximization is less understood: the first approximation algorithms even for the unconstrainted setting were given by Feige et al. (FOCS '07). More recently, Lee et al. (STOC '09, APPROX '09) show how to approximately maximize non-monotone submodular functions when the constraints are given by the intersection of p matroid constraints; their algorithm is based on local-search procedures "},"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":"1003.1517","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-03-07T19:27:48Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"b1d544b7835ec65e56c4ec4dc697c6654cfae9d4a451678be6927d7627ee53dd","abstract_canon_sha256":"f49b1e50692c205b7bb2ca5fad7fb99353b6daee7801a196eb3d7ae23883b38e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:50.266994Z","signature_b64":"FU0ZqkMPsYFYTqYCylCxUEpToA1tinyPknpXK1yBHCJJz6dghdOpIfwBdy22be57x/RdkvYJlad49xN7NM33Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93f4ffe6f5170ac773c4a8d2b20e956c02e92a0537893e69aad6ba975df29e12","last_reissued_at":"2026-05-18T04:39:50.266363Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:50.266363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constrained Non-Monotone Submodular Maximization: Offline and Secretary Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Aaron Roth, Anupam Gupta, Grant Schoenebeck, Kunal Talwar","submitted_at":"2010-03-07T19:27:48Z","abstract_excerpt":"Constrained submodular maximization problems have long been studied, with near-optimal results known under a variety of constraints when the submodular function is monotone. The case of non-monotone submodular maximization is less understood: the first approximation algorithms even for the unconstrainted setting were given by Feige et al. (FOCS '07). More recently, Lee et al. (STOC '09, APPROX '09) show how to approximately maximize non-monotone submodular functions when the constraints are given by the intersection of p matroid constraints; their algorithm is based on local-search procedures "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.1517","kind":"arxiv","version":2},"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":"1003.1517","created_at":"2026-05-18T04:39:50.266465+00:00"},{"alias_kind":"arxiv_version","alias_value":"1003.1517v2","created_at":"2026-05-18T04:39:50.266465+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.1517","created_at":"2026-05-18T04:39:50.266465+00:00"},{"alias_kind":"pith_short_12","alias_value":"SP2P7ZXVC4FM","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"SP2P7ZXVC4FMO46E","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"SP2P7ZXV","created_at":"2026-05-18T12:26:13.927090+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/SP2P7ZXVC4FMO46EVDJLEDUVNQ","json":"https://pith.science/pith/SP2P7ZXVC4FMO46EVDJLEDUVNQ.json","graph_json":"https://pith.science/api/pith-number/SP2P7ZXVC4FMO46EVDJLEDUVNQ/graph.json","events_json":"https://pith.science/api/pith-number/SP2P7ZXVC4FMO46EVDJLEDUVNQ/events.json","paper":"https://pith.science/paper/SP2P7ZXV"},"agent_actions":{"view_html":"https://pith.science/pith/SP2P7ZXVC4FMO46EVDJLEDUVNQ","download_json":"https://pith.science/pith/SP2P7ZXVC4FMO46EVDJLEDUVNQ.json","view_paper":"https://pith.science/paper/SP2P7ZXV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1003.1517&json=true","fetch_graph":"https://pith.science/api/pith-number/SP2P7ZXVC4FMO46EVDJLEDUVNQ/graph.json","fetch_events":"https://pith.science/api/pith-number/SP2P7ZXVC4FMO46EVDJLEDUVNQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SP2P7ZXVC4FMO46EVDJLEDUVNQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SP2P7ZXVC4FMO46EVDJLEDUVNQ/action/storage_attestation","attest_author":"https://pith.science/pith/SP2P7ZXVC4FMO46EVDJLEDUVNQ/action/author_attestation","sign_citation":"https://pith.science/pith/SP2P7ZXVC4FMO46EVDJLEDUVNQ/action/citation_signature","submit_replication":"https://pith.science/pith/SP2P7ZXVC4FMO46EVDJLEDUVNQ/action/replication_record"}},"created_at":"2026-05-18T04:39:50.266465+00:00","updated_at":"2026-05-18T04:39:50.266465+00:00"}