{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:T6VBV6Q4RTUJCN4LQYGXKBYR5F","short_pith_number":"pith:T6VBV6Q4","schema_version":"1.0","canonical_sha256":"9faa1afa1c8ce891378b860d750711e9564094637fc5a2a865f8346ae71d794e","source":{"kind":"arxiv","id":"1811.03093","version":1},"attestation_state":"computed","paper":{"title":"An Optimal Approximation for Submodular Maximization under a Matroid Constraint in the Adaptive Complexity Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aviad Rubinstein, Eric Balkanski, Yaron Singer","submitted_at":"2018-11-07T18:20:03Z","abstract_excerpt":"In this paper we study submodular maximization under a matroid constraint in the adaptive complexity model. This model was recently introduced in the context of submodular optimization in [BS18a] to quantify the information theoretic complexity of black-box optimization in a parallel computation model. Informally, the adaptivity of an algorithm is the number of sequential rounds it makes when each round can execute polynomially-many function evaluations in parallel. Since submodular optimization is regularly applied on large datasets we seek algorithms with low adaptivity to enable speedups vi"},"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":"1811.03093","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-07T18:20:03Z","cross_cats_sorted":[],"title_canon_sha256":"72f2f6e77940a55af161a181c64166ad33ec2bd52d49bc27cd4c64ed8920d853","abstract_canon_sha256":"d989897cf8c5dd75392e1fa623b3943518f2aced0845445fa1d0dd39c061b319"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:19.095619Z","signature_b64":"1O96hrFkVBxFvdRsqkfv/iLxm5llyvfYbJKRIBjmLaNjq0EMra7DpXUW91Hek02ofEa13uIvhrufCBuAy83CCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9faa1afa1c8ce891378b860d750711e9564094637fc5a2a865f8346ae71d794e","last_reissued_at":"2026-05-18T00:01:19.095180Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:19.095180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Optimal Approximation for Submodular Maximization under a Matroid Constraint in the Adaptive Complexity Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aviad Rubinstein, Eric Balkanski, Yaron Singer","submitted_at":"2018-11-07T18:20:03Z","abstract_excerpt":"In this paper we study submodular maximization under a matroid constraint in the adaptive complexity model. This model was recently introduced in the context of submodular optimization in [BS18a] to quantify the information theoretic complexity of black-box optimization in a parallel computation model. Informally, the adaptivity of an algorithm is the number of sequential rounds it makes when each round can execute polynomially-many function evaluations in parallel. Since submodular optimization is regularly applied on large datasets we seek algorithms with low adaptivity to enable speedups vi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03093","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":"1811.03093","created_at":"2026-05-18T00:01:19.095255+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.03093v1","created_at":"2026-05-18T00:01:19.095255+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03093","created_at":"2026-05-18T00:01:19.095255+00:00"},{"alias_kind":"pith_short_12","alias_value":"T6VBV6Q4RTUJ","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"T6VBV6Q4RTUJCN4L","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"T6VBV6Q4","created_at":"2026-05-18T12:32:53.628368+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/T6VBV6Q4RTUJCN4LQYGXKBYR5F","json":"https://pith.science/pith/T6VBV6Q4RTUJCN4LQYGXKBYR5F.json","graph_json":"https://pith.science/api/pith-number/T6VBV6Q4RTUJCN4LQYGXKBYR5F/graph.json","events_json":"https://pith.science/api/pith-number/T6VBV6Q4RTUJCN4LQYGXKBYR5F/events.json","paper":"https://pith.science/paper/T6VBV6Q4"},"agent_actions":{"view_html":"https://pith.science/pith/T6VBV6Q4RTUJCN4LQYGXKBYR5F","download_json":"https://pith.science/pith/T6VBV6Q4RTUJCN4LQYGXKBYR5F.json","view_paper":"https://pith.science/paper/T6VBV6Q4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.03093&json=true","fetch_graph":"https://pith.science/api/pith-number/T6VBV6Q4RTUJCN4LQYGXKBYR5F/graph.json","fetch_events":"https://pith.science/api/pith-number/T6VBV6Q4RTUJCN4LQYGXKBYR5F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T6VBV6Q4RTUJCN4LQYGXKBYR5F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T6VBV6Q4RTUJCN4LQYGXKBYR5F/action/storage_attestation","attest_author":"https://pith.science/pith/T6VBV6Q4RTUJCN4LQYGXKBYR5F/action/author_attestation","sign_citation":"https://pith.science/pith/T6VBV6Q4RTUJCN4LQYGXKBYR5F/action/citation_signature","submit_replication":"https://pith.science/pith/T6VBV6Q4RTUJCN4LQYGXKBYR5F/action/replication_record"}},"created_at":"2026-05-18T00:01:19.095255+00:00","updated_at":"2026-05-18T00:01:19.095255+00:00"}