{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CYTCAZPXJLKTFSJQQL3QJV4WYI","short_pith_number":"pith:CYTCAZPX","schema_version":"1.0","canonical_sha256":"16262065f74ad532c93082f704d796c218993d31d87fdf4f9d57bf87e5b38b2c","source":{"kind":"arxiv","id":"1808.09987","version":2},"attestation_state":"computed","paper":{"title":"Submodular Maximization with Matroid and Packing Constraints in Parallel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adrian Vladu, Alina Ene, Huy L. Nguyen","submitted_at":"2018-08-29T18:04:37Z","abstract_excerpt":"We consider the problem of maximizing the multilinear extension of a submodular function subject a single matroid constraint or multiple packing constraints with a small number of adaptive rounds of evaluation queries.\n  We obtain the first algorithms with low adaptivity for submodular maximization with a matroid constraint. Our algorithms achieve a $1-1/e-\\epsilon$ approximation for monotone functions and a $1/e-\\epsilon$ approximation for non-monotone functions, which nearly matches the best guarantees known in the fully adaptive setting. The number of rounds of adaptivity is $O(\\log^2{n}/\\e"},"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":"1808.09987","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-29T18:04:37Z","cross_cats_sorted":[],"title_canon_sha256":"10935d6d991e1a866574c8195a3162cd75979787b8fe9d39132cd9e6df6cc960","abstract_canon_sha256":"6e38289cc794e72c863f04794ed05f63da101cdbde9e0305845d6a9fb6f03a4e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:14.688347Z","signature_b64":"2anXNCWEJtZ8FaSuBAnCsNGEl0H2NvCCOHCp4z18kEu8zj1owXdqQ8fZP+N7yU18NCAsETdf5rcfGMJ57W4LAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16262065f74ad532c93082f704d796c218993d31d87fdf4f9d57bf87e5b38b2c","last_reissued_at":"2026-05-18T00:01:14.687705Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:14.687705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Submodular Maximization with Matroid and Packing Constraints in Parallel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adrian Vladu, Alina Ene, Huy L. Nguyen","submitted_at":"2018-08-29T18:04:37Z","abstract_excerpt":"We consider the problem of maximizing the multilinear extension of a submodular function subject a single matroid constraint or multiple packing constraints with a small number of adaptive rounds of evaluation queries.\n  We obtain the first algorithms with low adaptivity for submodular maximization with a matroid constraint. Our algorithms achieve a $1-1/e-\\epsilon$ approximation for monotone functions and a $1/e-\\epsilon$ approximation for non-monotone functions, which nearly matches the best guarantees known in the fully adaptive setting. The number of rounds of adaptivity is $O(\\log^2{n}/\\e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09987","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":"1808.09987","created_at":"2026-05-18T00:01:14.687819+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.09987v2","created_at":"2026-05-18T00:01:14.687819+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09987","created_at":"2026-05-18T00:01:14.687819+00:00"},{"alias_kind":"pith_short_12","alias_value":"CYTCAZPXJLKT","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"CYTCAZPXJLKTFSJQ","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"CYTCAZPX","created_at":"2026-05-18T12:32:19.392346+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/CYTCAZPXJLKTFSJQQL3QJV4WYI","json":"https://pith.science/pith/CYTCAZPXJLKTFSJQQL3QJV4WYI.json","graph_json":"https://pith.science/api/pith-number/CYTCAZPXJLKTFSJQQL3QJV4WYI/graph.json","events_json":"https://pith.science/api/pith-number/CYTCAZPXJLKTFSJQQL3QJV4WYI/events.json","paper":"https://pith.science/paper/CYTCAZPX"},"agent_actions":{"view_html":"https://pith.science/pith/CYTCAZPXJLKTFSJQQL3QJV4WYI","download_json":"https://pith.science/pith/CYTCAZPXJLKTFSJQQL3QJV4WYI.json","view_paper":"https://pith.science/paper/CYTCAZPX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.09987&json=true","fetch_graph":"https://pith.science/api/pith-number/CYTCAZPXJLKTFSJQQL3QJV4WYI/graph.json","fetch_events":"https://pith.science/api/pith-number/CYTCAZPXJLKTFSJQQL3QJV4WYI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CYTCAZPXJLKTFSJQQL3QJV4WYI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CYTCAZPXJLKTFSJQQL3QJV4WYI/action/storage_attestation","attest_author":"https://pith.science/pith/CYTCAZPXJLKTFSJQQL3QJV4WYI/action/author_attestation","sign_citation":"https://pith.science/pith/CYTCAZPXJLKTFSJQQL3QJV4WYI/action/citation_signature","submit_replication":"https://pith.science/pith/CYTCAZPXJLKTFSJQQL3QJV4WYI/action/replication_record"}},"created_at":"2026-05-18T00:01:14.687819+00:00","updated_at":"2026-05-18T00:01:14.687819+00:00"}