{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:T6VBV6Q4RTUJCN4LQYGXKBYR5F","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d989897cf8c5dd75392e1fa623b3943518f2aced0845445fa1d0dd39c061b319","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-07T18:20:03Z","title_canon_sha256":"72f2f6e77940a55af161a181c64166ad33ec2bd52d49bc27cd4c64ed8920d853"},"schema_version":"1.0","source":{"id":"1811.03093","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.03093","created_at":"2026-05-18T00:01:19Z"},{"alias_kind":"arxiv_version","alias_value":"1811.03093v1","created_at":"2026-05-18T00:01:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03093","created_at":"2026-05-18T00:01:19Z"},{"alias_kind":"pith_short_12","alias_value":"T6VBV6Q4RTUJ","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"T6VBV6Q4RTUJCN4L","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"T6VBV6Q4","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:42632fd961028c2417b9be0f8a5c001e658d09c743e3526543a9d99d70b154c0","target":"graph","created_at":"2026-05-18T00:01:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Aviad Rubinstein, Eric Balkanski, Yaron Singer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-07T18:20:03Z","title":"An Optimal Approximation for Submodular Maximization under a Matroid Constraint in the Adaptive Complexity Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03093","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:74972511bf3a081257e4ec1e119dc3cacf827517fd2d7f38353d78942bba419c","target":"record","created_at":"2026-05-18T00:01:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d989897cf8c5dd75392e1fa623b3943518f2aced0845445fa1d0dd39c061b319","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-07T18:20:03Z","title_canon_sha256":"72f2f6e77940a55af161a181c64166ad33ec2bd52d49bc27cd4c64ed8920d853"},"schema_version":"1.0","source":{"id":"1811.03093","kind":"arxiv","version":1}},"canonical_sha256":"9faa1afa1c8ce891378b860d750711e9564094637fc5a2a865f8346ae71d794e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9faa1afa1c8ce891378b860d750711e9564094637fc5a2a865f8346ae71d794e","first_computed_at":"2026-05-18T00:01:19.095180Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:19.095180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1O96hrFkVBxFvdRsqkfv/iLxm5llyvfYbJKRIBjmLaNjq0EMra7DpXUW91Hek02ofEa13uIvhrufCBuAy83CCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:19.095619Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.03093","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74972511bf3a081257e4ec1e119dc3cacf827517fd2d7f38353d78942bba419c","sha256:42632fd961028c2417b9be0f8a5c001e658d09c743e3526543a9d99d70b154c0"],"state_sha256":"6cff125f582b274a2ce2bb1d05fbd2d0bced54232107f9f58c9ff2613bc028e4"}