{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:V6RKW4CR3XYB7I7SIZO626QCPB","short_pith_number":"pith:V6RKW4CR","canonical_record":{"source":{"id":"1507.03719","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-14T04:46:01Z","cross_cats_sorted":["cs.AI","cs.DC","cs.LG"],"title_canon_sha256":"808d8d411160ada5db6058c731a424b4e86b0414f44d90d79433854ba0374442","abstract_canon_sha256":"1b94ecacceae571cf33441b443ad54398c2fff3d6d51dc79a5f350b6f80bb4f2"},"schema_version":"1.0"},"canonical_sha256":"afa2ab7051ddf01fa3f2465ded7a0278574f3370b15c10713d236ea22d0768b1","source":{"kind":"arxiv","id":"1507.03719","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.03719","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"arxiv_version","alias_value":"1507.03719v2","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03719","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"pith_short_12","alias_value":"V6RKW4CR3XYB","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"V6RKW4CR3XYB7I7S","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"V6RKW4CR","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:V6RKW4CR3XYB7I7SIZO626QCPB","target":"record","payload":{"canonical_record":{"source":{"id":"1507.03719","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-14T04:46:01Z","cross_cats_sorted":["cs.AI","cs.DC","cs.LG"],"title_canon_sha256":"808d8d411160ada5db6058c731a424b4e86b0414f44d90d79433854ba0374442","abstract_canon_sha256":"1b94ecacceae571cf33441b443ad54398c2fff3d6d51dc79a5f350b6f80bb4f2"},"schema_version":"1.0"},"canonical_sha256":"afa2ab7051ddf01fa3f2465ded7a0278574f3370b15c10713d236ea22d0768b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:12.701644Z","signature_b64":"7YerDkQErav2qkVLijgOKL0iMNEtDvFSWcwA3d0ZPFu7m7gLJmapox8LeClecJC2cxsduDhqStrXZAA5jp+1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afa2ab7051ddf01fa3f2465ded7a0278574f3370b15c10713d236ea22d0768b1","last_reissued_at":"2026-05-18T01:09:12.701090Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:12.701090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.03719","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-18T01:09:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x8RUh94qpcPLyrx+hUpzTnZ3LiXd1+K1RjMqXtINnI8siMmQG4zxqxBjQeGTA80nb1j4dyD6SOdUxVkQLJkYBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:46:40.588656Z"},"content_sha256":"1b57b1dfcf3f9c7b77dccc3a52307c15d917068e2cfb0dce80df215ad5b0f6f3","schema_version":"1.0","event_id":"sha256:1b57b1dfcf3f9c7b77dccc3a52307c15d917068e2cfb0dce80df215ad5b0f6f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:V6RKW4CR3XYB7I7SIZO626QCPB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Framework for Distributed Submodular Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DC","cs.LG"],"primary_cat":"cs.DS","authors_text":"Alina Ene, Huy L. Nguyen, Justin Ward, Rafael da Ponte Barbosa","submitted_at":"2015-07-14T04:46:01Z","abstract_excerpt":"A wide variety of problems in machine learning, including exemplar clustering, document summarization, and sensor placement, can be cast as constrained submodular maximization problems. A lot of recent effort has been devoted to developing distributed algorithms for these problems. However, these results suffer from high number of rounds, suboptimal approximation ratios, or both. We develop a framework for bringing existing algorithms in the sequential setting to the distributed setting, achieving near optimal approximation ratios for many settings in only a constant number of MapReduce rounds"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03719","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-18T01:09:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jWRv1LNzGKoUmh8E6e8z6o8RIC1UdTV0bGEJmkWZ9fhmdvZXctYEoHCDvxrrzverYfjcKjluWNKAWgQKCqCfDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:46:40.589290Z"},"content_sha256":"a82718f5cb4a09f4d1516371c1e606bf9ba8384273ba531ba64e1266e0523e81","schema_version":"1.0","event_id":"sha256:a82718f5cb4a09f4d1516371c1e606bf9ba8384273ba531ba64e1266e0523e81"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V6RKW4CR3XYB7I7SIZO626QCPB/bundle.json","state_url":"https://pith.science/pith/V6RKW4CR3XYB7I7SIZO626QCPB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V6RKW4CR3XYB7I7SIZO626QCPB/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-09T05:46:40Z","links":{"resolver":"https://pith.science/pith/V6RKW4CR3XYB7I7SIZO626QCPB","bundle":"https://pith.science/pith/V6RKW4CR3XYB7I7SIZO626QCPB/bundle.json","state":"https://pith.science/pith/V6RKW4CR3XYB7I7SIZO626QCPB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V6RKW4CR3XYB7I7SIZO626QCPB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:V6RKW4CR3XYB7I7SIZO626QCPB","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":"1b94ecacceae571cf33441b443ad54398c2fff3d6d51dc79a5f350b6f80bb4f2","cross_cats_sorted":["cs.AI","cs.DC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-14T04:46:01Z","title_canon_sha256":"808d8d411160ada5db6058c731a424b4e86b0414f44d90d79433854ba0374442"},"schema_version":"1.0","source":{"id":"1507.03719","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.03719","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"arxiv_version","alias_value":"1507.03719v2","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03719","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"pith_short_12","alias_value":"V6RKW4CR3XYB","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"V6RKW4CR3XYB7I7S","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"V6RKW4CR","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:a82718f5cb4a09f4d1516371c1e606bf9ba8384273ba531ba64e1266e0523e81","target":"graph","created_at":"2026-05-18T01:09: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":"A wide variety of problems in machine learning, including exemplar clustering, document summarization, and sensor placement, can be cast as constrained submodular maximization problems. A lot of recent effort has been devoted to developing distributed algorithms for these problems. However, these results suffer from high number of rounds, suboptimal approximation ratios, or both. We develop a framework for bringing existing algorithms in the sequential setting to the distributed setting, achieving near optimal approximation ratios for many settings in only a constant number of MapReduce rounds","authors_text":"Alina Ene, Huy L. Nguyen, Justin Ward, Rafael da Ponte Barbosa","cross_cats":["cs.AI","cs.DC","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-14T04:46:01Z","title":"A New Framework for Distributed Submodular Maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03719","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:1b57b1dfcf3f9c7b77dccc3a52307c15d917068e2cfb0dce80df215ad5b0f6f3","target":"record","created_at":"2026-05-18T01:09: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":"1b94ecacceae571cf33441b443ad54398c2fff3d6d51dc79a5f350b6f80bb4f2","cross_cats_sorted":["cs.AI","cs.DC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-14T04:46:01Z","title_canon_sha256":"808d8d411160ada5db6058c731a424b4e86b0414f44d90d79433854ba0374442"},"schema_version":"1.0","source":{"id":"1507.03719","kind":"arxiv","version":2}},"canonical_sha256":"afa2ab7051ddf01fa3f2465ded7a0278574f3370b15c10713d236ea22d0768b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"afa2ab7051ddf01fa3f2465ded7a0278574f3370b15c10713d236ea22d0768b1","first_computed_at":"2026-05-18T01:09:12.701090Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:12.701090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7YerDkQErav2qkVLijgOKL0iMNEtDvFSWcwA3d0ZPFu7m7gLJmapox8LeClecJC2cxsduDhqStrXZAA5jp+1AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:12.701644Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.03719","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b57b1dfcf3f9c7b77dccc3a52307c15d917068e2cfb0dce80df215ad5b0f6f3","sha256:a82718f5cb4a09f4d1516371c1e606bf9ba8384273ba531ba64e1266e0523e81"],"state_sha256":"894443db3ad0e16b52f2bdb0a110e37341627491753bd1e6c5207e1f602529c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7WPvJMXcaxve9UToX05SIIzaf93CeopYNxtp2QRt6ipj/2tsS/aJ91vJICObFJUBrcEV5mMhZozEI8VpsqPcDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T05:46:40.593175Z","bundle_sha256":"c341dda2f52482203a3e021f942dde738d4238013a0dde798fd7ec1e8d13ab6b"}}