{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5253LFM7VTA5SZCUE42CK56DG5","short_pith_number":"pith:5253LFM7","schema_version":"1.0","canonical_sha256":"eebbb5959facc1d9645427342577c33748faac35826f47cc31d202bbcf29561e","source":{"kind":"arxiv","id":"1606.00389","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.00389","created_at":"2026-05-18T00:23:46.175932+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.00389v3","created_at":"2026-05-18T00:23:46.175932+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00389","created_at":"2026-05-18T00:23:46.175932+00:00"},{"alias_kind":"pith_short_12","alias_value":"5253LFM7VTA5","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"5253LFM7VTA5SZCU","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"5253LFM7","created_at":"2026-05-18T12:29:58.707656+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/5253LFM7VTA5SZCUE42CK56DG5","json":"https://pith.science/pith/5253LFM7VTA5SZCUE42CK56DG5.json","graph_json":"https://pith.science/api/pith-number/5253LFM7VTA5SZCUE42CK56DG5/graph.json","events_json":"https://pith.science/api/pith-number/5253LFM7VTA5SZCUE42CK56DG5/events.json","paper":"https://pith.science/paper/5253LFM7"},"agent_actions":{"view_html":"https://pith.science/pith/5253LFM7VTA5SZCUE42CK56DG5","download_json":"https://pith.science/pith/5253LFM7VTA5SZCUE42CK56DG5.json","view_paper":"https://pith.science/paper/5253LFM7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.00389&json=true","fetch_graph":"https://pith.science/api/pith-number/5253LFM7VTA5SZCUE42CK56DG5/graph.json","fetch_events":"https://pith.science/api/pith-number/5253LFM7VTA5SZCUE42CK56DG5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5253LFM7VTA5SZCUE42CK56DG5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5253LFM7VTA5SZCUE42CK56DG5/action/storage_attestation","attest_author":"https://pith.science/pith/5253LFM7VTA5SZCUE42CK56DG5/action/author_attestation","sign_citation":"https://pith.science/pith/5253LFM7VTA5SZCUE42CK56DG5/action/citation_signature","submit_replication":"https://pith.science/pith/5253LFM7VTA5SZCUE42CK56DG5/action/replication_record"}},"created_at":"2026-05-18T00:23:46.175932+00:00","updated_at":"2026-05-18T00:23:46.175932+00:00"}