{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:J3ILEFMQBL3V5UICHF45RBI7BM","short_pith_number":"pith:J3ILEFMQ","canonical_record":{"source":{"id":"1810.01489","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-10-02T20:08:27Z","cross_cats_sorted":[],"title_canon_sha256":"179fd93eb7751b48442dd8e9d3469d0f365c0c5f1b85fe3e397c7bf1c7dd500c","abstract_canon_sha256":"78b941c4323baa1b42feade8ab626ce8b9d3e788839b0d769ab46a7b2e85da9e"},"schema_version":"1.0"},"canonical_sha256":"4ed0b215900af75ed1023979d8851f0b36257bd75e3d9d9d4413e55210c0a960","source":{"kind":"arxiv","id":"1810.01489","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.01489","created_at":"2026-05-18T00:04:12Z"},{"alias_kind":"arxiv_version","alias_value":"1810.01489v1","created_at":"2026-05-18T00:04:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01489","created_at":"2026-05-18T00:04:12Z"},{"alias_kind":"pith_short_12","alias_value":"J3ILEFMQBL3V","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"J3ILEFMQBL3V5UIC","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"J3ILEFMQ","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:J3ILEFMQBL3V5UICHF45RBI7BM","target":"record","payload":{"canonical_record":{"source":{"id":"1810.01489","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-10-02T20:08:27Z","cross_cats_sorted":[],"title_canon_sha256":"179fd93eb7751b48442dd8e9d3469d0f365c0c5f1b85fe3e397c7bf1c7dd500c","abstract_canon_sha256":"78b941c4323baa1b42feade8ab626ce8b9d3e788839b0d769ab46a7b2e85da9e"},"schema_version":"1.0"},"canonical_sha256":"4ed0b215900af75ed1023979d8851f0b36257bd75e3d9d9d4413e55210c0a960","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:12.009182Z","signature_b64":"u05nsTBsLrK+dU3jV3j+WPu8gsrhXcVEsfSAWUFuhaWqbPhJj1meED06mE3AFSy9675dgyTw6dE+FwTzEuUCBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ed0b215900af75ed1023979d8851f0b36257bd75e3d9d9d4413e55210c0a960","last_reissued_at":"2026-05-18T00:04:12.008460Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:12.008460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.01489","source_version":1,"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:04:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7RhWFGNS5oZX6AEriu6Q76Qqb2U40R6cBRTopwI8EfMKPyQjX6g3CEMz3gIg17SyGgfaZXlbJBtgbhgsBHGyDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:19:28.338961Z"},"content_sha256":"eeee94dfa9c09c21b7822015db9ede52522413da3028c09fb06001714e038ddd","schema_version":"1.0","event_id":"sha256:eeee94dfa9c09c21b7822015db9ede52522413da3028c09fb06001714e038ddd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:J3ILEFMQBL3V5UICHF45RBI7BM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Submodular Optimization in the MapReduce Model","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Jan Vondrak, Paul Liu","submitted_at":"2018-10-02T20:08:27Z","abstract_excerpt":"Submodular optimization has received significant attention in both practice and theory, as a wide array of problems in machine learning, auction theory, and combinatorial optimization have submodular structure. In practice, these problems often involve large amounts of data, and must be solved in a distributed way. One popular framework for running such distributed algorithms is MapReduce. In this paper, we present two simple algorithms for cardinality constrained submodular optimization in the MapReduce model: the first is a $(1/2-o(1))$-approximation in 2 MapReduce rounds, and the second is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01489","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"},"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:04:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aL+5IsWW5aeI0d23FaGkloyXVofPKUZKldJsfmDwmctXPHsr1srQ21aePdL6enOkYh5TTfDuzg8qkokXdqLKBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:19:28.339309Z"},"content_sha256":"48208620009ddf1c1f0ca1932119ceaa998f9e10eca558d6ac932299dc2604e4","schema_version":"1.0","event_id":"sha256:48208620009ddf1c1f0ca1932119ceaa998f9e10eca558d6ac932299dc2604e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J3ILEFMQBL3V5UICHF45RBI7BM/bundle.json","state_url":"https://pith.science/pith/J3ILEFMQBL3V5UICHF45RBI7BM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J3ILEFMQBL3V5UICHF45RBI7BM/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-03T22:19:28Z","links":{"resolver":"https://pith.science/pith/J3ILEFMQBL3V5UICHF45RBI7BM","bundle":"https://pith.science/pith/J3ILEFMQBL3V5UICHF45RBI7BM/bundle.json","state":"https://pith.science/pith/J3ILEFMQBL3V5UICHF45RBI7BM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J3ILEFMQBL3V5UICHF45RBI7BM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:J3ILEFMQBL3V5UICHF45RBI7BM","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":"78b941c4323baa1b42feade8ab626ce8b9d3e788839b0d769ab46a7b2e85da9e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-10-02T20:08:27Z","title_canon_sha256":"179fd93eb7751b48442dd8e9d3469d0f365c0c5f1b85fe3e397c7bf1c7dd500c"},"schema_version":"1.0","source":{"id":"1810.01489","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.01489","created_at":"2026-05-18T00:04:12Z"},{"alias_kind":"arxiv_version","alias_value":"1810.01489v1","created_at":"2026-05-18T00:04:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01489","created_at":"2026-05-18T00:04:12Z"},{"alias_kind":"pith_short_12","alias_value":"J3ILEFMQBL3V","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"J3ILEFMQBL3V5UIC","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"J3ILEFMQ","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:48208620009ddf1c1f0ca1932119ceaa998f9e10eca558d6ac932299dc2604e4","target":"graph","created_at":"2026-05-18T00:04:12Z","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":"Submodular optimization has received significant attention in both practice and theory, as a wide array of problems in machine learning, auction theory, and combinatorial optimization have submodular structure. In practice, these problems often involve large amounts of data, and must be solved in a distributed way. One popular framework for running such distributed algorithms is MapReduce. In this paper, we present two simple algorithms for cardinality constrained submodular optimization in the MapReduce model: the first is a $(1/2-o(1))$-approximation in 2 MapReduce rounds, and the second is ","authors_text":"Jan Vondrak, Paul Liu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-10-02T20:08:27Z","title":"Submodular Optimization in the MapReduce Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01489","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:eeee94dfa9c09c21b7822015db9ede52522413da3028c09fb06001714e038ddd","target":"record","created_at":"2026-05-18T00:04:12Z","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":"78b941c4323baa1b42feade8ab626ce8b9d3e788839b0d769ab46a7b2e85da9e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2018-10-02T20:08:27Z","title_canon_sha256":"179fd93eb7751b48442dd8e9d3469d0f365c0c5f1b85fe3e397c7bf1c7dd500c"},"schema_version":"1.0","source":{"id":"1810.01489","kind":"arxiv","version":1}},"canonical_sha256":"4ed0b215900af75ed1023979d8851f0b36257bd75e3d9d9d4413e55210c0a960","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ed0b215900af75ed1023979d8851f0b36257bd75e3d9d9d4413e55210c0a960","first_computed_at":"2026-05-18T00:04:12.008460Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:12.008460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u05nsTBsLrK+dU3jV3j+WPu8gsrhXcVEsfSAWUFuhaWqbPhJj1meED06mE3AFSy9675dgyTw6dE+FwTzEuUCBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:12.009182Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.01489","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eeee94dfa9c09c21b7822015db9ede52522413da3028c09fb06001714e038ddd","sha256:48208620009ddf1c1f0ca1932119ceaa998f9e10eca558d6ac932299dc2604e4"],"state_sha256":"5c408bb0bf33a1bde46b4d43d3baf9afb6151357e07a7b68b4eb45dde968615d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NZtHsQJFBm60mH9vKcKKhlGszRpwU/ZWoLeabhOaRWJGdzfSnUvB9w6dqCViQ49vqZd1zVzrnnngZMDOPsN7DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:19:28.341331Z","bundle_sha256":"c7c25d54fb849a8c0d83a0cff774589dd1a198bd918fba029e8da3e5f9719c88"}}