{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6NU5IM3TWKPOA6KMZSE7KXJLBF","short_pith_number":"pith:6NU5IM3T","canonical_record":{"source":{"id":"1605.09619","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-05-31T13:18:30Z","cross_cats_sorted":["cs.DC","cs.DM","cs.LG"],"title_canon_sha256":"b33869bad5e16054bad3c5a3c5748d84df9713a1cc006dba5449129d01c6d3cf","abstract_canon_sha256":"71051a478ed1bbec5e7770435a8eed637fdac99a2c75fe02c8c85e1074d8e5d3"},"schema_version":"1.0"},"canonical_sha256":"f369d43373b29ee0794ccc89f55d2b0966fdd9f0a65cf93707460457681de494","source":{"kind":"arxiv","id":"1605.09619","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.09619","created_at":"2026-05-18T01:13:10Z"},{"alias_kind":"arxiv_version","alias_value":"1605.09619v1","created_at":"2026-05-18T01:13:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09619","created_at":"2026-05-18T01:13:10Z"},{"alias_kind":"pith_short_12","alias_value":"6NU5IM3TWKPO","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6NU5IM3TWKPOA6KM","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6NU5IM3T","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6NU5IM3TWKPOA6KMZSE7KXJLBF","target":"record","payload":{"canonical_record":{"source":{"id":"1605.09619","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-05-31T13:18:30Z","cross_cats_sorted":["cs.DC","cs.DM","cs.LG"],"title_canon_sha256":"b33869bad5e16054bad3c5a3c5748d84df9713a1cc006dba5449129d01c6d3cf","abstract_canon_sha256":"71051a478ed1bbec5e7770435a8eed637fdac99a2c75fe02c8c85e1074d8e5d3"},"schema_version":"1.0"},"canonical_sha256":"f369d43373b29ee0794ccc89f55d2b0966fdd9f0a65cf93707460457681de494","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:10.456271Z","signature_b64":"u8zYEnL9ftleABgyu9+5KQEFJcCTIV5QzcZqihRvqJJjlnWsWY0XhRKcmZ+ISkMSH2jt7KB9nMVs8BGI24BACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f369d43373b29ee0794ccc89f55d2b0966fdd9f0a65cf93707460457681de494","last_reissued_at":"2026-05-18T01:13:10.455849Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:10.455849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.09619","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-18T01:13:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"36Oo4c9JK5gbzi77Sl3R2EDoE7CjbbpsDYtwfShx5kLPOAAJOYaMKi/D+uL6qkUHLMRs/xDciOgrHPR+18+TBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:25:37.370798Z"},"content_sha256":"3626cd143152239bd59d800238451771e8a493613e80e530373835218024dfa2","schema_version":"1.0","event_id":"sha256:3626cd143152239bd59d800238451771e8a493613e80e530373835218024dfa2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6NU5IM3TWKPOA6KMZSE7KXJLBF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Horizontally Scalable Submodular Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DM","cs.LG"],"primary_cat":"stat.ML","authors_text":"Andreas Krause, Mario Lucic, Morteza Zadimoghaddam, Olivier Bachem","submitted_at":"2016-05-31T13:18:30Z","abstract_excerpt":"A variety of large-scale machine learning problems can be cast as instances of constrained submodular maximization. Existing approaches for distributed submodular maximization have a critical drawback: The capacity - number of instances that can fit in memory - must grow with the data set size. In practice, while one can provision many machines, the capacity of each machine is limited by physical constraints. We propose a truly scalable approach for distributed submodular maximization under fixed capacity. The proposed framework applies to a broad class of algorithms and constraints and provid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.09619","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-18T01:13:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uIuScfNIbPvNk4zSTZ54t+WmLtmyA3N+I6lHyGwzQ085gRlMdnJxkvSkTBkwUZAmKZzByBOpM8UWON0Xb99SDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:25:37.371191Z"},"content_sha256":"f59968ef9de7f1e7c83c07344f21f53e60b0a0e12788e0d2cddc066509dff428","schema_version":"1.0","event_id":"sha256:f59968ef9de7f1e7c83c07344f21f53e60b0a0e12788e0d2cddc066509dff428"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6NU5IM3TWKPOA6KMZSE7KXJLBF/bundle.json","state_url":"https://pith.science/pith/6NU5IM3TWKPOA6KMZSE7KXJLBF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6NU5IM3TWKPOA6KMZSE7KXJLBF/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-03T09:25:37Z","links":{"resolver":"https://pith.science/pith/6NU5IM3TWKPOA6KMZSE7KXJLBF","bundle":"https://pith.science/pith/6NU5IM3TWKPOA6KMZSE7KXJLBF/bundle.json","state":"https://pith.science/pith/6NU5IM3TWKPOA6KMZSE7KXJLBF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6NU5IM3TWKPOA6KMZSE7KXJLBF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6NU5IM3TWKPOA6KMZSE7KXJLBF","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":"71051a478ed1bbec5e7770435a8eed637fdac99a2c75fe02c8c85e1074d8e5d3","cross_cats_sorted":["cs.DC","cs.DM","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-05-31T13:18:30Z","title_canon_sha256":"b33869bad5e16054bad3c5a3c5748d84df9713a1cc006dba5449129d01c6d3cf"},"schema_version":"1.0","source":{"id":"1605.09619","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.09619","created_at":"2026-05-18T01:13:10Z"},{"alias_kind":"arxiv_version","alias_value":"1605.09619v1","created_at":"2026-05-18T01:13:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09619","created_at":"2026-05-18T01:13:10Z"},{"alias_kind":"pith_short_12","alias_value":"6NU5IM3TWKPO","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6NU5IM3TWKPOA6KM","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6NU5IM3T","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:f59968ef9de7f1e7c83c07344f21f53e60b0a0e12788e0d2cddc066509dff428","target":"graph","created_at":"2026-05-18T01:13:10Z","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 variety of large-scale machine learning problems can be cast as instances of constrained submodular maximization. Existing approaches for distributed submodular maximization have a critical drawback: The capacity - number of instances that can fit in memory - must grow with the data set size. In practice, while one can provision many machines, the capacity of each machine is limited by physical constraints. We propose a truly scalable approach for distributed submodular maximization under fixed capacity. The proposed framework applies to a broad class of algorithms and constraints and provid","authors_text":"Andreas Krause, Mario Lucic, Morteza Zadimoghaddam, Olivier Bachem","cross_cats":["cs.DC","cs.DM","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-05-31T13:18:30Z","title":"Horizontally Scalable Submodular Maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.09619","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:3626cd143152239bd59d800238451771e8a493613e80e530373835218024dfa2","target":"record","created_at":"2026-05-18T01:13:10Z","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":"71051a478ed1bbec5e7770435a8eed637fdac99a2c75fe02c8c85e1074d8e5d3","cross_cats_sorted":["cs.DC","cs.DM","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-05-31T13:18:30Z","title_canon_sha256":"b33869bad5e16054bad3c5a3c5748d84df9713a1cc006dba5449129d01c6d3cf"},"schema_version":"1.0","source":{"id":"1605.09619","kind":"arxiv","version":1}},"canonical_sha256":"f369d43373b29ee0794ccc89f55d2b0966fdd9f0a65cf93707460457681de494","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f369d43373b29ee0794ccc89f55d2b0966fdd9f0a65cf93707460457681de494","first_computed_at":"2026-05-18T01:13:10.455849Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:10.455849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u8zYEnL9ftleABgyu9+5KQEFJcCTIV5QzcZqihRvqJJjlnWsWY0XhRKcmZ+ISkMSH2jt7KB9nMVs8BGI24BACA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:10.456271Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.09619","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3626cd143152239bd59d800238451771e8a493613e80e530373835218024dfa2","sha256:f59968ef9de7f1e7c83c07344f21f53e60b0a0e12788e0d2cddc066509dff428"],"state_sha256":"ca12a65308e9c2e0bff826e3f1fdf4919bda8e97c54dc2730aab0a07b5d845ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eNFJEoYKViq36YNCQAFDLZC76+E/T+xNIAQpa8YyL8hBiG9FBBX6LS0oEmFDSKJuRf8Vy2DH5Hru2FVZvSI/BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T09:25:37.373243Z","bundle_sha256":"b8b3e5388bbd3a4b4004b343ee6e0d58c9e5663adb53012ef73fea601cdc3e7a"}}