{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:6NU5IM3TWKPOA6KMZSE7KXJLBF","short_pith_number":"pith:6NU5IM3T","schema_version":"1.0","canonical_sha256":"f369d43373b29ee0794ccc89f55d2b0966fdd9f0a65cf93707460457681de494","source":{"kind":"arxiv","id":"1605.09619","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1605.09619","created_at":"2026-05-18T01:13:10.455915+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.09619v1","created_at":"2026-05-18T01:13:10.455915+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.09619","created_at":"2026-05-18T01:13:10.455915+00:00"},{"alias_kind":"pith_short_12","alias_value":"6NU5IM3TWKPO","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"6NU5IM3TWKPOA6KM","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"6NU5IM3T","created_at":"2026-05-18T12:30:01.593930+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6NU5IM3TWKPOA6KMZSE7KXJLBF","json":"https://pith.science/pith/6NU5IM3TWKPOA6KMZSE7KXJLBF.json","graph_json":"https://pith.science/api/pith-number/6NU5IM3TWKPOA6KMZSE7KXJLBF/graph.json","events_json":"https://pith.science/api/pith-number/6NU5IM3TWKPOA6KMZSE7KXJLBF/events.json","paper":"https://pith.science/paper/6NU5IM3T"},"agent_actions":{"view_html":"https://pith.science/pith/6NU5IM3TWKPOA6KMZSE7KXJLBF","download_json":"https://pith.science/pith/6NU5IM3TWKPOA6KMZSE7KXJLBF.json","view_paper":"https://pith.science/paper/6NU5IM3T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.09619&json=true","fetch_graph":"https://pith.science/api/pith-number/6NU5IM3TWKPOA6KMZSE7KXJLBF/graph.json","fetch_events":"https://pith.science/api/pith-number/6NU5IM3TWKPOA6KMZSE7KXJLBF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6NU5IM3TWKPOA6KMZSE7KXJLBF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6NU5IM3TWKPOA6KMZSE7KXJLBF/action/storage_attestation","attest_author":"https://pith.science/pith/6NU5IM3TWKPOA6KMZSE7KXJLBF/action/author_attestation","sign_citation":"https://pith.science/pith/6NU5IM3TWKPOA6KMZSE7KXJLBF/action/citation_signature","submit_replication":"https://pith.science/pith/6NU5IM3TWKPOA6KMZSE7KXJLBF/action/replication_record"}},"created_at":"2026-05-18T01:13:10.455915+00:00","updated_at":"2026-05-18T01:13:10.455915+00:00"}