{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CAPUW2LISH7OU5PWGH75JFBPCA","short_pith_number":"pith:CAPUW2LI","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"},"canonical_sha256":"101f4b696891feea75f631ffd4942f100c68991ce6aaaf413cdae325f5190573","source":{"kind":"arxiv","id":"1711.02598","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02598","created_at":"2026-05-18T00:29:45Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02598v1","created_at":"2026-05-18T00:29:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02598","created_at":"2026-05-18T00:29:45Z"},{"alias_kind":"pith_short_12","alias_value":"CAPUW2LISH7O","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CAPUW2LISH7OU5PW","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CAPUW2LI","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CAPUW2LISH7OU5PWGH75JFBPCA","target":"record","payload":{"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"},"canonical_sha256":"101f4b696891feea75f631ffd4942f100c68991ce6aaaf413cdae325f5190573","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"},"source_kind":"arxiv","source_id":"1711.02598","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-18T00:29:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r6mEAKRXY87J+FjllIEtDzB7AKPC96YGtXQ2X8tLj42D9WMYjYc9Jmsn/D+itG1sGtlggQvktI/TW9V6VX/XDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T09:22:33.616295Z"},"content_sha256":"b9eac8b8a3185be705110bd4d456e4ce0716a920ede9c5ae8fcb650d89f57a52","schema_version":"1.0","event_id":"sha256:b9eac8b8a3185be705110bd4d456e4ce0716a920ede9c5ae8fcb650d89f57a52"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CAPUW2LISH7OU5PWGH75JFBPCA","target":"graph","payload":{"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"},"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-18T00:29:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bmJDBeTlCAioXdVOsh6AtG+wvW36+Gbt3nhTAdwitJlVphj9PNMzm1gpygz/aRG0wB7mfVTE4ciBRrYjI/SDCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T09:22:33.616939Z"},"content_sha256":"c2d2576696b557127d927530c933d859f4565a056c299906a61cd4ad84f9581d","schema_version":"1.0","event_id":"sha256:c2d2576696b557127d927530c933d859f4565a056c299906a61cd4ad84f9581d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CAPUW2LISH7OU5PWGH75JFBPCA/bundle.json","state_url":"https://pith.science/pith/CAPUW2LISH7OU5PWGH75JFBPCA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CAPUW2LISH7OU5PWGH75JFBPCA/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-05-25T09:22:33Z","links":{"resolver":"https://pith.science/pith/CAPUW2LISH7OU5PWGH75JFBPCA","bundle":"https://pith.science/pith/CAPUW2LISH7OU5PWGH75JFBPCA/bundle.json","state":"https://pith.science/pith/CAPUW2LISH7OU5PWGH75JFBPCA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CAPUW2LISH7OU5PWGH75JFBPCA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CAPUW2LISH7OU5PWGH75JFBPCA","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":"896db36a93a6eebced45bcb6bfd1cffaec42c8d0b5dad121647e42c17efceff3","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-07T16:37:25Z","title_canon_sha256":"c51a44846cc84e71d3da625f88cec004e36908e774d68b8ebec7937dd8ed1794"},"schema_version":"1.0","source":{"id":"1711.02598","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02598","created_at":"2026-05-18T00:29:45Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02598v1","created_at":"2026-05-18T00:29:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02598","created_at":"2026-05-18T00:29:45Z"},{"alias_kind":"pith_short_12","alias_value":"CAPUW2LISH7O","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CAPUW2LISH7OU5PW","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CAPUW2LI","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:c2d2576696b557127d927530c933d859f4565a056c299906a61cd4ad84f9581d","target":"graph","created_at":"2026-05-18T00:29: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":"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","authors_text":"Ashkan Norouzi-Fard, Ilija Bogunovic, Jakub Tarnawski, Slobodan Mitrovi\\'c, Volkan Cevher","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-07T16:37:25Z","title":"Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02598","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:b9eac8b8a3185be705110bd4d456e4ce0716a920ede9c5ae8fcb650d89f57a52","target":"record","created_at":"2026-05-18T00:29: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":"896db36a93a6eebced45bcb6bfd1cffaec42c8d0b5dad121647e42c17efceff3","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-07T16:37:25Z","title_canon_sha256":"c51a44846cc84e71d3da625f88cec004e36908e774d68b8ebec7937dd8ed1794"},"schema_version":"1.0","source":{"id":"1711.02598","kind":"arxiv","version":1}},"canonical_sha256":"101f4b696891feea75f631ffd4942f100c68991ce6aaaf413cdae325f5190573","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"101f4b696891feea75f631ffd4942f100c68991ce6aaaf413cdae325f5190573","first_computed_at":"2026-05-18T00:29:45.267548Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:45.267548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5r3zNVn4yV3BP8/vgkbBd7Xa8CiYJPew8sc5r8jFQw7otMoOwwNS+P1xGxcnCxH9HOy+UrGQsfbHANd8N42/DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:45.268111Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.02598","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9eac8b8a3185be705110bd4d456e4ce0716a920ede9c5ae8fcb650d89f57a52","sha256:c2d2576696b557127d927530c933d859f4565a056c299906a61cd4ad84f9581d"],"state_sha256":"88573172dbb5596f920c42cb1b7b5e7216ca9d22598ecd0015f54fdb8ab9e9f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6RlFT9esXgwXj2yzWxPDzdfPFok0QkpiMnuHwV7GzbuAgeP1L5AbriJg9J0QbHT5yoD/mvTK56597lmxn6aPDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T09:22:33.620657Z","bundle_sha256":"193384c56601eb209a89bc931c2646f318281938fd752637b026a68aa7dba0fb"}}