{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VZVUQ2SYFNHIJUXQ2CKNB3WDCR","short_pith_number":"pith:VZVUQ2SY","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"},"canonical_sha256":"ae6b486a582b4e84d2f0d094d0eec31457492a722e952175d930e30508dabb76","source":{"kind":"arxiv","id":"1806.00760","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00760","created_at":"2026-05-18T00:14:18Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00760v1","created_at":"2026-05-18T00:14:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00760","created_at":"2026-05-18T00:14:18Z"},{"alias_kind":"pith_short_12","alias_value":"VZVUQ2SYFNHI","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VZVUQ2SYFNHIJUXQ","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VZVUQ2SY","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VZVUQ2SYFNHIJUXQ2CKNB3WDCR","target":"record","payload":{"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"},"canonical_sha256":"ae6b486a582b4e84d2f0d094d0eec31457492a722e952175d930e30508dabb76","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"},"source_kind":"arxiv","source_id":"1806.00760","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:14:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ExHDiMrlwqFsmu73WySn5LZu4yOTHxhfGzWX/WptAIyNB5SOoUMR1RiSm9oo/A2vYLRtILjKHgO4eRPQ8Q1zAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:54:01.429456Z"},"content_sha256":"d95d740c62ffbb91c36eeb0870f80409e6750431b0f9285ce14b0c0d4317d415","schema_version":"1.0","event_id":"sha256:d95d740c62ffbb91c36eeb0870f80409e6750431b0f9285ce14b0c0d4317d415"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VZVUQ2SYFNHIJUXQ2CKNB3WDCR","target":"graph","payload":{"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"},"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:14:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NYdWVYffDgCOG1Ju889N1EUgdqUFqIi6sAE7vXXWSspSFwdsraIysUYgjhrUzvhgB6DGIEH5g89DrzzfihqvBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:54:01.429800Z"},"content_sha256":"eb724f2dac89d7891a73366619a1a3bdc93b7fcef551fbf86d5a6a61578fb567","schema_version":"1.0","event_id":"sha256:eb724f2dac89d7891a73366619a1a3bdc93b7fcef551fbf86d5a6a61578fb567"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VZVUQ2SYFNHIJUXQ2CKNB3WDCR/bundle.json","state_url":"https://pith.science/pith/VZVUQ2SYFNHIJUXQ2CKNB3WDCR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VZVUQ2SYFNHIJUXQ2CKNB3WDCR/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-03T05:54:01Z","links":{"resolver":"https://pith.science/pith/VZVUQ2SYFNHIJUXQ2CKNB3WDCR","bundle":"https://pith.science/pith/VZVUQ2SYFNHIJUXQ2CKNB3WDCR/bundle.json","state":"https://pith.science/pith/VZVUQ2SYFNHIJUXQ2CKNB3WDCR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VZVUQ2SYFNHIJUXQ2CKNB3WDCR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VZVUQ2SYFNHIJUXQ2CKNB3WDCR","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":"b8bca8519e6ec84029added70381e7d6de0db7c3734d1e6cdcfc40d33d8ad6de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-06-03T10:08:42Z","title_canon_sha256":"83d56253d69b33122a15e015838dfe88e19d989d38ce8731be1c0e1e91d8cfa5"},"schema_version":"1.0","source":{"id":"1806.00760","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00760","created_at":"2026-05-18T00:14:18Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00760v1","created_at":"2026-05-18T00:14:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00760","created_at":"2026-05-18T00:14:18Z"},{"alias_kind":"pith_short_12","alias_value":"VZVUQ2SYFNHI","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VZVUQ2SYFNHIJUXQ","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VZVUQ2SY","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:eb724f2dac89d7891a73366619a1a3bdc93b7fcef551fbf86d5a6a61578fb567","target":"graph","created_at":"2026-05-18T00:14:18Z","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":"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","authors_text":"Yu Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-06-03T10:08:42Z","title":"Efficient Time-Evolving Stream Processing at Scale"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00760","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:d95d740c62ffbb91c36eeb0870f80409e6750431b0f9285ce14b0c0d4317d415","target":"record","created_at":"2026-05-18T00:14:18Z","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":"b8bca8519e6ec84029added70381e7d6de0db7c3734d1e6cdcfc40d33d8ad6de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-06-03T10:08:42Z","title_canon_sha256":"83d56253d69b33122a15e015838dfe88e19d989d38ce8731be1c0e1e91d8cfa5"},"schema_version":"1.0","source":{"id":"1806.00760","kind":"arxiv","version":1}},"canonical_sha256":"ae6b486a582b4e84d2f0d094d0eec31457492a722e952175d930e30508dabb76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae6b486a582b4e84d2f0d094d0eec31457492a722e952175d930e30508dabb76","first_computed_at":"2026-05-18T00:14:18.532653Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:18.532653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E/TCH3MsgIQq0bZCWrI4sBIT3EzCJcB+4A5rDv88qY8R8JsvYaLUVS/TZbKXE/FRizUfDnrefAVhIXZwLQhpBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:18.533209Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.00760","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d95d740c62ffbb91c36eeb0870f80409e6750431b0f9285ce14b0c0d4317d415","sha256:eb724f2dac89d7891a73366619a1a3bdc93b7fcef551fbf86d5a6a61578fb567"],"state_sha256":"bbd0105cbf048110726594fa5ca9d5a37a2571b93d96129e97eec4a47334fd59"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gzyFpDUD8aVdzdVIlS6cp4wz2PPqHBo4bLEoZy+O+yksUtltf5GVjGyyh/U7JuUzTX/UDhOeaIqnl+8D2WUTDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T05:54:01.431793Z","bundle_sha256":"081d4a14f2fa6c0e1dfe96190cc2a9f0a8814997edbc368fc4217c03736e84a5"}}