{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JD4QHS3LI2YUCA6UQI6BGCHQ6Y","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":"8342fce06ead0df6a04d655a87a8c6a2b98c2b149fc8534c2a7b37867a7c1cfa","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-06T12:23:42Z","title_canon_sha256":"91dc3837f08a507fb0dc67e9ec3b82e7d24d52cc8ad9fbf80a2ea9f8bce040e0"},"schema_version":"1.0","source":{"id":"1808.01842","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.01842","created_at":"2026-05-18T00:05:45Z"},{"alias_kind":"arxiv_version","alias_value":"1808.01842v1","created_at":"2026-05-18T00:05:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.01842","created_at":"2026-05-18T00:05:45Z"},{"alias_kind":"pith_short_12","alias_value":"JD4QHS3LI2YU","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JD4QHS3LI2YUCA6U","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JD4QHS3L","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:a2b9d92bda27fbdfc2066ed889c354dca6dbc67b71f8943741e8185c5d558550","target":"graph","created_at":"2026-05-18T00:05:45Z","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":"Many tasks in machine learning and data mining, such as data diversification, non-parametric learning, kernel machines, clustering etc., require extracting a small but representative summary from a massive dataset. Often, such problems can be posed as maximizing a submodular set function subject to a cardinality constraint. We consider this question in the streaming setting, where elements arrive over time at a fast pace and thus we need to design an efficient, low-memory algorithm. One such method, proposed by Badanidiyuru et al. (2014), always finds a $0.5$-approximate solution. Can this app","authors_text":"Aida Mousavifar, Amir Zandieh, Ashkan Norouzi-Fard, Jakub Tarnawski, Ola Svensson, Slobodan Mitrovi\\'c","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-06T12:23:42Z","title":"Beyond $1/2$-Approximation for Submodular Maximization on Massive Data Streams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.01842","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:2ab5a503b7a81a506dcda8e47bd9f2b224e8c0e5eae6b3125dfbb53a39df141d","target":"record","created_at":"2026-05-18T00:05:45Z","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":"8342fce06ead0df6a04d655a87a8c6a2b98c2b149fc8534c2a7b37867a7c1cfa","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-06T12:23:42Z","title_canon_sha256":"91dc3837f08a507fb0dc67e9ec3b82e7d24d52cc8ad9fbf80a2ea9f8bce040e0"},"schema_version":"1.0","source":{"id":"1808.01842","kind":"arxiv","version":1}},"canonical_sha256":"48f903cb6b46b14103d4823c1308f0f60f30b07e3bd075e65b8ede9ab079b998","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48f903cb6b46b14103d4823c1308f0f60f30b07e3bd075e65b8ede9ab079b998","first_computed_at":"2026-05-18T00:05:45.131340Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:45.131340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TWNS7i2asuFO8T96F7QEY9v7MIoeroIwYRyEXwOPBk7+api4UysBD7cFPLfpZx9N/ZVvFl2nvoVgrte58cB5CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:45.131915Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.01842","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ab5a503b7a81a506dcda8e47bd9f2b224e8c0e5eae6b3125dfbb53a39df141d","sha256:a2b9d92bda27fbdfc2066ed889c354dca6dbc67b71f8943741e8185c5d558550"],"state_sha256":"5c2c3de6029423ba942ac706ddfdf43cfe44fc81c3c4bae4a5acee3b4ef98745"}