{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5253LFM7VTA5SZCUE42CK56DG5","short_pith_number":"pith:5253LFM7","canonical_record":{"source":{"id":"1606.00389","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-01T18:43:13Z","cross_cats_sorted":["cs.LG","math.CO"],"title_canon_sha256":"567e51d57fab28d2294874e79f9fe1d1f78107db10679e018c4ccc6e62a292f8","abstract_canon_sha256":"140439d17119d8d1e7cd83ad381c7a5942814cde83e20ed40f77998871c5bc42"},"schema_version":"1.0"},"canonical_sha256":"eebbb5959facc1d9645427342577c33748faac35826f47cc31d202bbcf29561e","source":{"kind":"arxiv","id":"1606.00389","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.00389","created_at":"2026-05-18T00:23:46Z"},{"alias_kind":"arxiv_version","alias_value":"1606.00389v3","created_at":"2026-05-18T00:23:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00389","created_at":"2026-05-18T00:23:46Z"},{"alias_kind":"pith_short_12","alias_value":"5253LFM7VTA5","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"5253LFM7VTA5SZCU","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"5253LFM7","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5253LFM7VTA5SZCUE42CK56DG5","target":"record","payload":{"canonical_record":{"source":{"id":"1606.00389","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-01T18:43:13Z","cross_cats_sorted":["cs.LG","math.CO"],"title_canon_sha256":"567e51d57fab28d2294874e79f9fe1d1f78107db10679e018c4ccc6e62a292f8","abstract_canon_sha256":"140439d17119d8d1e7cd83ad381c7a5942814cde83e20ed40f77998871c5bc42"},"schema_version":"1.0"},"canonical_sha256":"eebbb5959facc1d9645427342577c33748faac35826f47cc31d202bbcf29561e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:46.176447Z","signature_b64":"U5Q9cGGxVN6UY+c4e+8i/8bPsyg+SeJUvtl6a9GRwOnKPPxFNPqvmOZ1AqluTkOTAChK0Q/YvVHKHNbrtsFIBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eebbb5959facc1d9645427342577c33748faac35826f47cc31d202bbcf29561e","last_reissued_at":"2026-05-18T00:23:46.175855Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:46.175855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.00389","source_version":3,"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:23:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EtKg206ovlvz29cKirigEcBUXhPkSA+eyMxq5E/7j7pQkpea3S3eYkBuVEnJB9QVsxwQeYgxPjX/M3n+4AGLCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:02:01.580811Z"},"content_sha256":"f0c35a08ce938934502fdb0f7423217d54882c52c78bbcb223d227ac4096d4d7","schema_version":"1.0","event_id":"sha256:f0c35a08ce938934502fdb0f7423217d54882c52c78bbcb223d227ac4096d4d7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5253LFM7VTA5SZCUE42CK56DG5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stream Clipper: Scalable Submodular Maximization on Stream","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.CO"],"primary_cat":"stat.ML","authors_text":"Jeff Bilmes, Tianyi Zhou","submitted_at":"2016-06-01T18:43:13Z","abstract_excerpt":"We propose a streaming submodular maximization algorithm \"stream clipper\" that performs as well as the offline greedy algorithm on document/video summarization in practice. It adds elements from a stream either to a solution set $S$ or to an extra buffer $B$ based on two adaptive thresholds, and improves $S$ by a final greedy step that starts from $S$ adding elements from $B$. During this process, swapping elements out of $S$ can occur if doing so yields improvements. The thresholds adapt based on if current memory utilization exceeds a budget, e.g., it increases the lower threshold, and remov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00389","kind":"arxiv","version":3},"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:23:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1t80iXCFNNCChT+HInp+EMjOx/lCH1Eam5PU4XFovyJU1PVfaJowEsJG5gZ38i+lWVbcrg6/Fgb4MpV30B5TAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:02:01.581152Z"},"content_sha256":"ef6c41c9c5839f80da308b0b89bfe9badfa1e023af873381586278f7632c093d","schema_version":"1.0","event_id":"sha256:ef6c41c9c5839f80da308b0b89bfe9badfa1e023af873381586278f7632c093d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5253LFM7VTA5SZCUE42CK56DG5/bundle.json","state_url":"https://pith.science/pith/5253LFM7VTA5SZCUE42CK56DG5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5253LFM7VTA5SZCUE42CK56DG5/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-06-04T17:02:01Z","links":{"resolver":"https://pith.science/pith/5253LFM7VTA5SZCUE42CK56DG5","bundle":"https://pith.science/pith/5253LFM7VTA5SZCUE42CK56DG5/bundle.json","state":"https://pith.science/pith/5253LFM7VTA5SZCUE42CK56DG5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5253LFM7VTA5SZCUE42CK56DG5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5253LFM7VTA5SZCUE42CK56DG5","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":"140439d17119d8d1e7cd83ad381c7a5942814cde83e20ed40f77998871c5bc42","cross_cats_sorted":["cs.LG","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-01T18:43:13Z","title_canon_sha256":"567e51d57fab28d2294874e79f9fe1d1f78107db10679e018c4ccc6e62a292f8"},"schema_version":"1.0","source":{"id":"1606.00389","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.00389","created_at":"2026-05-18T00:23:46Z"},{"alias_kind":"arxiv_version","alias_value":"1606.00389v3","created_at":"2026-05-18T00:23:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00389","created_at":"2026-05-18T00:23:46Z"},{"alias_kind":"pith_short_12","alias_value":"5253LFM7VTA5","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"5253LFM7VTA5SZCU","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"5253LFM7","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:ef6c41c9c5839f80da308b0b89bfe9badfa1e023af873381586278f7632c093d","target":"graph","created_at":"2026-05-18T00:23:46Z","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 propose a streaming submodular maximization algorithm \"stream clipper\" that performs as well as the offline greedy algorithm on document/video summarization in practice. It adds elements from a stream either to a solution set $S$ or to an extra buffer $B$ based on two adaptive thresholds, and improves $S$ by a final greedy step that starts from $S$ adding elements from $B$. During this process, swapping elements out of $S$ can occur if doing so yields improvements. The thresholds adapt based on if current memory utilization exceeds a budget, e.g., it increases the lower threshold, and remov","authors_text":"Jeff Bilmes, Tianyi Zhou","cross_cats":["cs.LG","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-01T18:43:13Z","title":"Stream Clipper: Scalable Submodular Maximization on Stream"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00389","kind":"arxiv","version":3},"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:f0c35a08ce938934502fdb0f7423217d54882c52c78bbcb223d227ac4096d4d7","target":"record","created_at":"2026-05-18T00:23:46Z","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":"140439d17119d8d1e7cd83ad381c7a5942814cde83e20ed40f77998871c5bc42","cross_cats_sorted":["cs.LG","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-01T18:43:13Z","title_canon_sha256":"567e51d57fab28d2294874e79f9fe1d1f78107db10679e018c4ccc6e62a292f8"},"schema_version":"1.0","source":{"id":"1606.00389","kind":"arxiv","version":3}},"canonical_sha256":"eebbb5959facc1d9645427342577c33748faac35826f47cc31d202bbcf29561e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eebbb5959facc1d9645427342577c33748faac35826f47cc31d202bbcf29561e","first_computed_at":"2026-05-18T00:23:46.175855Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:46.175855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U5Q9cGGxVN6UY+c4e+8i/8bPsyg+SeJUvtl6a9GRwOnKPPxFNPqvmOZ1AqluTkOTAChK0Q/YvVHKHNbrtsFIBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:46.176447Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.00389","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0c35a08ce938934502fdb0f7423217d54882c52c78bbcb223d227ac4096d4d7","sha256:ef6c41c9c5839f80da308b0b89bfe9badfa1e023af873381586278f7632c093d"],"state_sha256":"303cfe8a4907f759eae27620f34872ef210a9b5ce0511f843c4609a279ba4f27"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NtJOU5lh+k+2afiV1Dec3ygql+tuQeb0MZSyNdnH+VQJ19GFBo+gkqIXhu6whRTzr3nUJnjxUh+aMaipiscCAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T17:02:01.583016Z","bundle_sha256":"c415d1ee623e86a6d69eb801931adcd35f2d039d3a19ef4bcfb7e14b8836dd5f"}}