{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5ME5BUDGNWOGWIEMCAXLRECMAX","short_pith_number":"pith:5ME5BUDG","canonical_record":{"source":{"id":"1905.00948","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-02T19:58:57Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"8d903ee67db4a45671fc74d756c6eb931c3a3fdd0b7dc2396859fc69c97f67d5","abstract_canon_sha256":"9adb73c03daefa1e87fc13424ad4374890c0b91d919359ae2d955aeedd1eb27d"},"schema_version":"1.0"},"canonical_sha256":"eb09d0d0666d9c6b208c102eb8904c05e6911692c38de787bf81e9209ecc1e34","source":{"kind":"arxiv","id":"1905.00948","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.00948","created_at":"2026-05-17T23:46:25Z"},{"alias_kind":"arxiv_version","alias_value":"1905.00948v2","created_at":"2026-05-17T23:46:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00948","created_at":"2026-05-17T23:46:25Z"},{"alias_kind":"pith_short_12","alias_value":"5ME5BUDGNWOG","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5ME5BUDGNWOGWIEM","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5ME5BUDG","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5ME5BUDGNWOGWIEMCAXLRECMAX","target":"record","payload":{"canonical_record":{"source":{"id":"1905.00948","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-02T19:58:57Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"8d903ee67db4a45671fc74d756c6eb931c3a3fdd0b7dc2396859fc69c97f67d5","abstract_canon_sha256":"9adb73c03daefa1e87fc13424ad4374890c0b91d919359ae2d955aeedd1eb27d"},"schema_version":"1.0"},"canonical_sha256":"eb09d0d0666d9c6b208c102eb8904c05e6911692c38de787bf81e9209ecc1e34","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:25.589502Z","signature_b64":"I+52D56rpRn4HuD3KeIaXuGculK/wbag+ZT6CKmat7NS7bToP8Bql9d37o292vuaHxEH/S6YnCQN9JM3N55jDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb09d0d0666d9c6b208c102eb8904c05e6911692c38de787bf81e9209ecc1e34","last_reissued_at":"2026-05-17T23:46:25.588728Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:25.588728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.00948","source_version":2,"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-17T23:46:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IHIA5dCo3+aiwVI/ogUj1T8z2Mn6r4ER5LWL268jVd4OsPNE5Vx+GGp25JvDwQNJJc2wO1xzZ7S99teC6DB0CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:32:33.603897Z"},"content_sha256":"c70779355589ccaea5a3baad72ff74229772a2413788a21667abb40d1f95aa06","schema_version":"1.0","event_id":"sha256:c70779355589ccaea5a3baad72ff74229772a2413788a21667abb40d1f95aa06"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5ME5BUDGNWOGWIEMCAXLRECMAX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Submodular Streaming in All its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Amin Karbasi, Ehsan Kazemi, Marko Mitrovic, Morteza Zadimoghaddam, Silvio Lattanzi","submitted_at":"2019-05-02T19:58:57Z","abstract_excerpt":"Streaming algorithms are generally judged by the quality of their solution, memory footprint, and computational complexity. In this paper, we study the problem of maximizing a monotone submodular function in the streaming setting with a cardinality constraint $k$. We first propose Sieve-Streaming++, which requires just one pass over the data, keeps only $O(k)$ elements and achieves the tight $(1/2)$-approximation guarantee. The best previously known streaming algorithms either achieve a suboptimal $(1/4)$-approximation with $\\Theta(k)$ memory or the optimal $(1/2)$-approximation with $O(k\\log "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00948","kind":"arxiv","version":2},"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-17T23:46:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nYSZjbgDTA0A7W6W4ts5vn9dEbsbATUlTzYVUCXfwBevftmTrEFbZSTu67eFunATEl1RUdG6wLZLOCqC1QzfAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:32:33.604600Z"},"content_sha256":"0699ba6f6d8a879763624d76fae92afad37a979b9ba100e7fbe443864b1ed951","schema_version":"1.0","event_id":"sha256:0699ba6f6d8a879763624d76fae92afad37a979b9ba100e7fbe443864b1ed951"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ME5BUDGNWOGWIEMCAXLRECMAX/bundle.json","state_url":"https://pith.science/pith/5ME5BUDGNWOGWIEMCAXLRECMAX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ME5BUDGNWOGWIEMCAXLRECMAX/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-26T22:32:33Z","links":{"resolver":"https://pith.science/pith/5ME5BUDGNWOGWIEMCAXLRECMAX","bundle":"https://pith.science/pith/5ME5BUDGNWOGWIEMCAXLRECMAX/bundle.json","state":"https://pith.science/pith/5ME5BUDGNWOGWIEMCAXLRECMAX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ME5BUDGNWOGWIEMCAXLRECMAX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5ME5BUDGNWOGWIEMCAXLRECMAX","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":"9adb73c03daefa1e87fc13424ad4374890c0b91d919359ae2d955aeedd1eb27d","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-02T19:58:57Z","title_canon_sha256":"8d903ee67db4a45671fc74d756c6eb931c3a3fdd0b7dc2396859fc69c97f67d5"},"schema_version":"1.0","source":{"id":"1905.00948","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.00948","created_at":"2026-05-17T23:46:25Z"},{"alias_kind":"arxiv_version","alias_value":"1905.00948v2","created_at":"2026-05-17T23:46:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00948","created_at":"2026-05-17T23:46:25Z"},{"alias_kind":"pith_short_12","alias_value":"5ME5BUDGNWOG","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5ME5BUDGNWOGWIEM","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5ME5BUDG","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:0699ba6f6d8a879763624d76fae92afad37a979b9ba100e7fbe443864b1ed951","target":"graph","created_at":"2026-05-17T23:46:25Z","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":"Streaming algorithms are generally judged by the quality of their solution, memory footprint, and computational complexity. In this paper, we study the problem of maximizing a monotone submodular function in the streaming setting with a cardinality constraint $k$. We first propose Sieve-Streaming++, which requires just one pass over the data, keeps only $O(k)$ elements and achieves the tight $(1/2)$-approximation guarantee. The best previously known streaming algorithms either achieve a suboptimal $(1/4)$-approximation with $\\Theta(k)$ memory or the optimal $(1/2)$-approximation with $O(k\\log ","authors_text":"Amin Karbasi, Ehsan Kazemi, Marko Mitrovic, Morteza Zadimoghaddam, Silvio Lattanzi","cross_cats":["cs.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-02T19:58:57Z","title":"Submodular Streaming in All its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00948","kind":"arxiv","version":2},"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:c70779355589ccaea5a3baad72ff74229772a2413788a21667abb40d1f95aa06","target":"record","created_at":"2026-05-17T23:46:25Z","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":"9adb73c03daefa1e87fc13424ad4374890c0b91d919359ae2d955aeedd1eb27d","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-02T19:58:57Z","title_canon_sha256":"8d903ee67db4a45671fc74d756c6eb931c3a3fdd0b7dc2396859fc69c97f67d5"},"schema_version":"1.0","source":{"id":"1905.00948","kind":"arxiv","version":2}},"canonical_sha256":"eb09d0d0666d9c6b208c102eb8904c05e6911692c38de787bf81e9209ecc1e34","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb09d0d0666d9c6b208c102eb8904c05e6911692c38de787bf81e9209ecc1e34","first_computed_at":"2026-05-17T23:46:25.588728Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:25.588728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I+52D56rpRn4HuD3KeIaXuGculK/wbag+ZT6CKmat7NS7bToP8Bql9d37o292vuaHxEH/S6YnCQN9JM3N55jDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:25.589502Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.00948","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c70779355589ccaea5a3baad72ff74229772a2413788a21667abb40d1f95aa06","sha256:0699ba6f6d8a879763624d76fae92afad37a979b9ba100e7fbe443864b1ed951"],"state_sha256":"f5b6a304a57209d81b3686635e8a35681acd8460875080991965df7f56e8fe96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W2ttv9IKI0vVVPNNoeGc8ExEXcGqnWmIQqUESv5Ca1fMD0Skp/kFfkvO+8y2uB1IdxAJwT6kI/bCnti5IRW4Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T22:32:33.607888Z","bundle_sha256":"2e53a4b76aa8a924dd0b42efadc6342e94668016566ee5e7fc9712951cb660c8"}}