{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:73XKZUJ6XKPV7OK3X4Y3W5JUOW","short_pith_number":"pith:73XKZUJ6","canonical_record":{"source":{"id":"1810.13132","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-10-31T07:19:32Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"869a8da7dddc4beb21e0d46172822320b45447981776a065cc0469feb4a9ff19","abstract_canon_sha256":"1615cca32a605d1ff73d8adcf34825fadd97bdf751ab60e0c722f10b31eb3818"},"schema_version":"1.0"},"canonical_sha256":"feeeacd13eba9f5fb95bbf31bb753475afb344a0d5df4307f4c252c6dc291123","source":{"kind":"arxiv","id":"1810.13132","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.13132","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"arxiv_version","alias_value":"1810.13132v1","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.13132","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"pith_short_12","alias_value":"73XKZUJ6XKPV","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"73XKZUJ6XKPV7OK3","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"73XKZUJ6","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:73XKZUJ6XKPV7OK3X4Y3W5JUOW","target":"record","payload":{"canonical_record":{"source":{"id":"1810.13132","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-10-31T07:19:32Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"869a8da7dddc4beb21e0d46172822320b45447981776a065cc0469feb4a9ff19","abstract_canon_sha256":"1615cca32a605d1ff73d8adcf34825fadd97bdf751ab60e0c722f10b31eb3818"},"schema_version":"1.0"},"canonical_sha256":"feeeacd13eba9f5fb95bbf31bb753475afb344a0d5df4307f4c252c6dc291123","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:52.217725Z","signature_b64":"VX40vvW/s3yogMAa/jFMgdT5Y2dGiCzpcYUZXN5ZOATY6aU3y5/5jpy/MeLLxNjzdKm7dly6SqGf9kp/hc4mAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"feeeacd13eba9f5fb95bbf31bb753475afb344a0d5df4307f4c252c6dc291123","last_reissued_at":"2026-05-18T00:01:52.217150Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:52.217150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.13132","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:01:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5How6UUpStYs6hKVCxzu7WTFg+LyaziTTwKaQbvuUk59K6PdUjw1xkykFtUWBflXDJS5ZtvuHS3zLPytaj7FDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T09:00:00.347303Z"},"content_sha256":"39b9c810d07e6516892be8e5b58dd790f59a93e54f6fd3b969b5f928bc0e31ed","schema_version":"1.0","event_id":"sha256:39b9c810d07e6516892be8e5b58dd790f59a93e54f6fd3b969b5f928bc0e31ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:73XKZUJ6XKPV7OK3X4Y3W5JUOW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cardinalities estimation under sliding time window by sharing HyperLogLog Counter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.NI","authors_text":"Jie Xu","submitted_at":"2018-10-31T07:19:32Z","abstract_excerpt":"Cardinalities estimation is an important research topic in network management and security. How to solve this problem under sliding time window is a hot topic. HyperLogLog is a memory efficient algorithm work under a fixed time window. A sliding version of HyperLogLog can work under sliding time window by replacing every counter of HyperLogLog with a list of feature possible maxim (LFPM). But LFPM is a dynamic structure whose size is variable at running time. This paper proposes a novel counter for HyperLogLog which consumes smaller size of memory than that of LFPM. Our counter is called bit d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.13132","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:01:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3HY/SPUolSUJAeMmBZSCbW5RZB0gMgWRi6meiAOqxIK7zcMunIXE7HPw7cmVWTO5IB6bKsgkdP1Qy+rxEraxDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T09:00:00.347873Z"},"content_sha256":"1e08e33935316759aeb9d7cfcdada324670e6d8bb09bc7131e6bdca59ea25e9d","schema_version":"1.0","event_id":"sha256:1e08e33935316759aeb9d7cfcdada324670e6d8bb09bc7131e6bdca59ea25e9d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/73XKZUJ6XKPV7OK3X4Y3W5JUOW/bundle.json","state_url":"https://pith.science/pith/73XKZUJ6XKPV7OK3X4Y3W5JUOW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/73XKZUJ6XKPV7OK3X4Y3W5JUOW/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-04T09:00:00Z","links":{"resolver":"https://pith.science/pith/73XKZUJ6XKPV7OK3X4Y3W5JUOW","bundle":"https://pith.science/pith/73XKZUJ6XKPV7OK3X4Y3W5JUOW/bundle.json","state":"https://pith.science/pith/73XKZUJ6XKPV7OK3X4Y3W5JUOW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/73XKZUJ6XKPV7OK3X4Y3W5JUOW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:73XKZUJ6XKPV7OK3X4Y3W5JUOW","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":"1615cca32a605d1ff73d8adcf34825fadd97bdf751ab60e0c722f10b31eb3818","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-10-31T07:19:32Z","title_canon_sha256":"869a8da7dddc4beb21e0d46172822320b45447981776a065cc0469feb4a9ff19"},"schema_version":"1.0","source":{"id":"1810.13132","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.13132","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"arxiv_version","alias_value":"1810.13132v1","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.13132","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"pith_short_12","alias_value":"73XKZUJ6XKPV","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"73XKZUJ6XKPV7OK3","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"73XKZUJ6","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:1e08e33935316759aeb9d7cfcdada324670e6d8bb09bc7131e6bdca59ea25e9d","target":"graph","created_at":"2026-05-18T00:01:52Z","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":"Cardinalities estimation is an important research topic in network management and security. How to solve this problem under sliding time window is a hot topic. HyperLogLog is a memory efficient algorithm work under a fixed time window. A sliding version of HyperLogLog can work under sliding time window by replacing every counter of HyperLogLog with a list of feature possible maxim (LFPM). But LFPM is a dynamic structure whose size is variable at running time. This paper proposes a novel counter for HyperLogLog which consumes smaller size of memory than that of LFPM. Our counter is called bit d","authors_text":"Jie Xu","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-10-31T07:19:32Z","title":"Cardinalities estimation under sliding time window by sharing HyperLogLog Counter"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.13132","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:39b9c810d07e6516892be8e5b58dd790f59a93e54f6fd3b969b5f928bc0e31ed","target":"record","created_at":"2026-05-18T00:01:52Z","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":"1615cca32a605d1ff73d8adcf34825fadd97bdf751ab60e0c722f10b31eb3818","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-10-31T07:19:32Z","title_canon_sha256":"869a8da7dddc4beb21e0d46172822320b45447981776a065cc0469feb4a9ff19"},"schema_version":"1.0","source":{"id":"1810.13132","kind":"arxiv","version":1}},"canonical_sha256":"feeeacd13eba9f5fb95bbf31bb753475afb344a0d5df4307f4c252c6dc291123","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"feeeacd13eba9f5fb95bbf31bb753475afb344a0d5df4307f4c252c6dc291123","first_computed_at":"2026-05-18T00:01:52.217150Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:52.217150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VX40vvW/s3yogMAa/jFMgdT5Y2dGiCzpcYUZXN5ZOATY6aU3y5/5jpy/MeLLxNjzdKm7dly6SqGf9kp/hc4mAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:52.217725Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.13132","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:39b9c810d07e6516892be8e5b58dd790f59a93e54f6fd3b969b5f928bc0e31ed","sha256:1e08e33935316759aeb9d7cfcdada324670e6d8bb09bc7131e6bdca59ea25e9d"],"state_sha256":"25945e5e0d2f086956ad4cac142b0c5b00280ea817eec1a2aaae9ab65bd0f163"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yk19tKeIxq2CA/SgnDBP44s8U6wXjTcYrM+KSN2J0L29U/4D7NaTFFdOtNMsj37uyplcGQoSWDDvx0fulUH+DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T09:00:00.350881Z","bundle_sha256":"e38bca34eaefa4eac8cb793852d6b1a8aa9cae6b676204d0ffe61f893f0a02e0"}}