{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CAPUW2LISH7OU5PWGH75JFBPCA","short_pith_number":"pith:CAPUW2LI","schema_version":"1.0","canonical_sha256":"101f4b696891feea75f631ffd4942f100c68991ce6aaaf413cdae325f5190573","source":{"kind":"arxiv","id":"1711.02598","version":1},"attestation_state":"computed","paper":{"title":"Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.DS","authors_text":"Ashkan Norouzi-Fard, Ilija Bogunovic, Jakub Tarnawski, Slobodan Mitrovi\\'c, Volkan Cevher","submitted_at":"2017-11-07T16:37:25Z","abstract_excerpt":"We study the classical problem of maximizing a monotone submodular function subject to a cardinality constraint k, with two additional twists: (i) elements arrive in a streaming fashion, and (ii) m items from the algorithm's memory are removed after the stream is finished. We develop a robust submodular algorithm STAR-T. It is based on a novel partitioning structure and an exponentially decreasing thresholding rule. STAR-T makes one pass over the data and retains a short but robust summary. We show that after the removal of any m elements from the obtained summary, a simple greedy algorithm ST"},"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":"1711.02598","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-07T16:37:25Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c51a44846cc84e71d3da625f88cec004e36908e774d68b8ebec7937dd8ed1794","abstract_canon_sha256":"896db36a93a6eebced45bcb6bfd1cffaec42c8d0b5dad121647e42c17efceff3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:45.268111Z","signature_b64":"5r3zNVn4yV3BP8/vgkbBd7Xa8CiYJPew8sc5r8jFQw7otMoOwwNS+P1xGxcnCxH9HOy+UrGQsfbHANd8N42/DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"101f4b696891feea75f631ffd4942f100c68991ce6aaaf413cdae325f5190573","last_reissued_at":"2026-05-18T00:29:45.267548Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:45.267548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.DS","authors_text":"Ashkan Norouzi-Fard, Ilija Bogunovic, Jakub Tarnawski, Slobodan Mitrovi\\'c, Volkan Cevher","submitted_at":"2017-11-07T16:37:25Z","abstract_excerpt":"We study the classical problem of maximizing a monotone submodular function subject to a cardinality constraint k, with two additional twists: (i) elements arrive in a streaming fashion, and (ii) m items from the algorithm's memory are removed after the stream is finished. We develop a robust submodular algorithm STAR-T. It is based on a novel partitioning structure and an exponentially decreasing thresholding rule. STAR-T makes one pass over the data and retains a short but robust summary. We show that after the removal of any m elements from the obtained summary, a simple greedy algorithm ST"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02598","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":"1711.02598","created_at":"2026-05-18T00:29:45.267626+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.02598v1","created_at":"2026-05-18T00:29:45.267626+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02598","created_at":"2026-05-18T00:29:45.267626+00:00"},{"alias_kind":"pith_short_12","alias_value":"CAPUW2LISH7O","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CAPUW2LISH7OU5PW","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CAPUW2LI","created_at":"2026-05-18T12:31:10.602751+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/CAPUW2LISH7OU5PWGH75JFBPCA","json":"https://pith.science/pith/CAPUW2LISH7OU5PWGH75JFBPCA.json","graph_json":"https://pith.science/api/pith-number/CAPUW2LISH7OU5PWGH75JFBPCA/graph.json","events_json":"https://pith.science/api/pith-number/CAPUW2LISH7OU5PWGH75JFBPCA/events.json","paper":"https://pith.science/paper/CAPUW2LI"},"agent_actions":{"view_html":"https://pith.science/pith/CAPUW2LISH7OU5PWGH75JFBPCA","download_json":"https://pith.science/pith/CAPUW2LISH7OU5PWGH75JFBPCA.json","view_paper":"https://pith.science/paper/CAPUW2LI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.02598&json=true","fetch_graph":"https://pith.science/api/pith-number/CAPUW2LISH7OU5PWGH75JFBPCA/graph.json","fetch_events":"https://pith.science/api/pith-number/CAPUW2LISH7OU5PWGH75JFBPCA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CAPUW2LISH7OU5PWGH75JFBPCA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CAPUW2LISH7OU5PWGH75JFBPCA/action/storage_attestation","attest_author":"https://pith.science/pith/CAPUW2LISH7OU5PWGH75JFBPCA/action/author_attestation","sign_citation":"https://pith.science/pith/CAPUW2LISH7OU5PWGH75JFBPCA/action/citation_signature","submit_replication":"https://pith.science/pith/CAPUW2LISH7OU5PWGH75JFBPCA/action/replication_record"}},"created_at":"2026-05-18T00:29:45.267626+00:00","updated_at":"2026-05-18T00:29:45.267626+00:00"}