{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VZVUQ2SYFNHIJUXQ2CKNB3WDCR","short_pith_number":"pith:VZVUQ2SY","schema_version":"1.0","canonical_sha256":"ae6b486a582b4e84d2f0d094d0eec31457492a722e952175d930e30508dabb76","source":{"kind":"arxiv","id":"1806.00760","version":1},"attestation_state":"computed","paper":{"title":"Efficient Time-Evolving Stream Processing at Scale","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Yu Huang","submitted_at":"2018-06-03T10:08:42Z","abstract_excerpt":"Time-evolving stream datasets exist ubiquitously in many real-world applications where their inherent hot keys often evolve over times. Nevertheless, few existing solutions can provide efficient load balance on these time-evolving datasets while preserving low memory overhead. In this paper, we present a novel grouping approach (named FISH), which can provide the efficient time-evolving stream processing at scale. The key insight of this work is that the keys of time-evolving stream data can have a skewed distribution within any bounded distance of time interval. This enables to accurately ide"},"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":"1806.00760","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-06-03T10:08:42Z","cross_cats_sorted":[],"title_canon_sha256":"83d56253d69b33122a15e015838dfe88e19d989d38ce8731be1c0e1e91d8cfa5","abstract_canon_sha256":"b8bca8519e6ec84029added70381e7d6de0db7c3734d1e6cdcfc40d33d8ad6de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:18.533209Z","signature_b64":"E/TCH3MsgIQq0bZCWrI4sBIT3EzCJcB+4A5rDv88qY8R8JsvYaLUVS/TZbKXE/FRizUfDnrefAVhIXZwLQhpBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae6b486a582b4e84d2f0d094d0eec31457492a722e952175d930e30508dabb76","last_reissued_at":"2026-05-18T00:14:18.532653Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:18.532653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Time-Evolving Stream Processing at Scale","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Yu Huang","submitted_at":"2018-06-03T10:08:42Z","abstract_excerpt":"Time-evolving stream datasets exist ubiquitously in many real-world applications where their inherent hot keys often evolve over times. Nevertheless, few existing solutions can provide efficient load balance on these time-evolving datasets while preserving low memory overhead. In this paper, we present a novel grouping approach (named FISH), which can provide the efficient time-evolving stream processing at scale. The key insight of this work is that the keys of time-evolving stream data can have a skewed distribution within any bounded distance of time interval. This enables to accurately ide"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00760","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":"1806.00760","created_at":"2026-05-18T00:14:18.532733+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.00760v1","created_at":"2026-05-18T00:14:18.532733+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00760","created_at":"2026-05-18T00:14:18.532733+00:00"},{"alias_kind":"pith_short_12","alias_value":"VZVUQ2SYFNHI","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VZVUQ2SYFNHIJUXQ","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VZVUQ2SY","created_at":"2026-05-18T12:32:59.047623+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/VZVUQ2SYFNHIJUXQ2CKNB3WDCR","json":"https://pith.science/pith/VZVUQ2SYFNHIJUXQ2CKNB3WDCR.json","graph_json":"https://pith.science/api/pith-number/VZVUQ2SYFNHIJUXQ2CKNB3WDCR/graph.json","events_json":"https://pith.science/api/pith-number/VZVUQ2SYFNHIJUXQ2CKNB3WDCR/events.json","paper":"https://pith.science/paper/VZVUQ2SY"},"agent_actions":{"view_html":"https://pith.science/pith/VZVUQ2SYFNHIJUXQ2CKNB3WDCR","download_json":"https://pith.science/pith/VZVUQ2SYFNHIJUXQ2CKNB3WDCR.json","view_paper":"https://pith.science/paper/VZVUQ2SY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.00760&json=true","fetch_graph":"https://pith.science/api/pith-number/VZVUQ2SYFNHIJUXQ2CKNB3WDCR/graph.json","fetch_events":"https://pith.science/api/pith-number/VZVUQ2SYFNHIJUXQ2CKNB3WDCR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VZVUQ2SYFNHIJUXQ2CKNB3WDCR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VZVUQ2SYFNHIJUXQ2CKNB3WDCR/action/storage_attestation","attest_author":"https://pith.science/pith/VZVUQ2SYFNHIJUXQ2CKNB3WDCR/action/author_attestation","sign_citation":"https://pith.science/pith/VZVUQ2SYFNHIJUXQ2CKNB3WDCR/action/citation_signature","submit_replication":"https://pith.science/pith/VZVUQ2SYFNHIJUXQ2CKNB3WDCR/action/replication_record"}},"created_at":"2026-05-18T00:14:18.532733+00:00","updated_at":"2026-05-18T00:14:18.532733+00:00"}