{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CYTCAZPXJLKTFSJQQL3QJV4WYI","short_pith_number":"pith:CYTCAZPX","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"},"canonical_sha256":"16262065f74ad532c93082f704d796c218993d31d87fdf4f9d57bf87e5b38b2c","source":{"kind":"arxiv","id":"1808.09987","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09987","created_at":"2026-05-18T00:01:14Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09987v2","created_at":"2026-05-18T00:01:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09987","created_at":"2026-05-18T00:01:14Z"},{"alias_kind":"pith_short_12","alias_value":"CYTCAZPXJLKT","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"CYTCAZPXJLKTFSJQ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"CYTCAZPX","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CYTCAZPXJLKTFSJQQL3QJV4WYI","target":"record","payload":{"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"},"canonical_sha256":"16262065f74ad532c93082f704d796c218993d31d87fdf4f9d57bf87e5b38b2c","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"},"source_kind":"arxiv","source_id":"1808.09987","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:01:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tvmp9Ew5nEiPJrO/owXECUWbc5UiOplRxOsd5NMddGKzG5zAxmpXNNQlgaJI2a21a3LWcX2oee55olvGATraDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:56:32.538922Z"},"content_sha256":"61750dd332be5a98f69e7282714165c11335570d136ecc0250ff90b42f33ca3a","schema_version":"1.0","event_id":"sha256:61750dd332be5a98f69e7282714165c11335570d136ecc0250ff90b42f33ca3a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CYTCAZPXJLKTFSJQQL3QJV4WYI","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:01:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n/yLXYpqwH4Mp/Ab6hWmCB6MQKEUm3BfXbsFhD5xwUXvne99Z1ti9x5YfZQHVli79lfi7iNHHVHOmdGpS6TOAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:56:32.539266Z"},"content_sha256":"f8717ae4fa2126c2eeaac5dc87207a73db529b9b8de06d835fe277d2a6c0c1c6","schema_version":"1.0","event_id":"sha256:f8717ae4fa2126c2eeaac5dc87207a73db529b9b8de06d835fe277d2a6c0c1c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CYTCAZPXJLKTFSJQQL3QJV4WYI/bundle.json","state_url":"https://pith.science/pith/CYTCAZPXJLKTFSJQQL3QJV4WYI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CYTCAZPXJLKTFSJQQL3QJV4WYI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T05:56:32Z","links":{"resolver":"https://pith.science/pith/CYTCAZPXJLKTFSJQQL3QJV4WYI","bundle":"https://pith.science/pith/CYTCAZPXJLKTFSJQQL3QJV4WYI/bundle.json","state":"https://pith.science/pith/CYTCAZPXJLKTFSJQQL3QJV4WYI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CYTCAZPXJLKTFSJQQL3QJV4WYI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CYTCAZPXJLKTFSJQQL3QJV4WYI","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":"6e38289cc794e72c863f04794ed05f63da101cdbde9e0305845d6a9fb6f03a4e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-29T18:04:37Z","title_canon_sha256":"10935d6d991e1a866574c8195a3162cd75979787b8fe9d39132cd9e6df6cc960"},"schema_version":"1.0","source":{"id":"1808.09987","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09987","created_at":"2026-05-18T00:01:14Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09987v2","created_at":"2026-05-18T00:01:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09987","created_at":"2026-05-18T00:01:14Z"},{"alias_kind":"pith_short_12","alias_value":"CYTCAZPXJLKT","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"CYTCAZPXJLKTFSJQ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"CYTCAZPX","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:f8717ae4fa2126c2eeaac5dc87207a73db529b9b8de06d835fe277d2a6c0c1c6","target":"graph","created_at":"2026-05-18T00:01:14Z","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":"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","authors_text":"Adrian Vladu, Alina Ene, Huy L. Nguyen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-29T18:04:37Z","title":"Submodular Maximization with Matroid and Packing Constraints in Parallel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09987","kind":"arxiv","version":2},"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:61750dd332be5a98f69e7282714165c11335570d136ecc0250ff90b42f33ca3a","target":"record","created_at":"2026-05-18T00:01:14Z","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":"6e38289cc794e72c863f04794ed05f63da101cdbde9e0305845d6a9fb6f03a4e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-29T18:04:37Z","title_canon_sha256":"10935d6d991e1a866574c8195a3162cd75979787b8fe9d39132cd9e6df6cc960"},"schema_version":"1.0","source":{"id":"1808.09987","kind":"arxiv","version":2}},"canonical_sha256":"16262065f74ad532c93082f704d796c218993d31d87fdf4f9d57bf87e5b38b2c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"16262065f74ad532c93082f704d796c218993d31d87fdf4f9d57bf87e5b38b2c","first_computed_at":"2026-05-18T00:01:14.687705Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:14.687705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2anXNCWEJtZ8FaSuBAnCsNGEl0H2NvCCOHCp4z18kEu8zj1owXdqQ8fZP+N7yU18NCAsETdf5rcfGMJ57W4LAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:14.688347Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.09987","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61750dd332be5a98f69e7282714165c11335570d136ecc0250ff90b42f33ca3a","sha256:f8717ae4fa2126c2eeaac5dc87207a73db529b9b8de06d835fe277d2a6c0c1c6"],"state_sha256":"eaf36dc495121636869f828f72943057aafb0d255811882dc3ea12ac941a4b9b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mPmUUqaLBQ58d6+XmQNDHEQWbrRprin7JILL38v54j2rDj1Y1tEdMxu9yqEqpxwCSR/EHlZPgTb4+uAgEprbCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T05:56:32.541143Z","bundle_sha256":"37014aaf17725962f274de5f0d11fd261348221852e50d7dc304ccf276e85850"}}