{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LM77ETSKL4UXKMG4BWS4AI5REG","short_pith_number":"pith:LM77ETSK","schema_version":"1.0","canonical_sha256":"5b3ff24e4a5f297530dc0da5c023b121ba2427b5ca80fc03adeb6ef012ced289","source":{"kind":"arxiv","id":"1807.01527","version":1},"attestation_state":"computed","paper":{"title":"Distributed super point cardinality estimation under sliding time window for high speed network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Jie Xu","submitted_at":"2018-07-04T11:53:46Z","abstract_excerpt":"Super point is a special kind of host whose cardinality, the number of contacting hosts in a certain period, is bigger than a threshold. Super point cardinality estimation plays important roles in network field. This paper proposes a super point cardinality estimation algorithm under sliding time window. To maintain the state of previous hosts with few updating operations, a novel counter, asynchronous time stamp (AT), is proposed. For a sliding time window containing k time slices, AT only needs to be updated every k time slices at the cost of 1 more bit than a previous state-of-art counter w"},"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":"1807.01527","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-07-04T11:53:46Z","cross_cats_sorted":[],"title_canon_sha256":"c7a1c8413e31270e40048684a5d36ff1550a2e1d6fa40b395b4ea80286e83a93","abstract_canon_sha256":"bffa632054ebcebe878ce4b4bf63bc4a9ea0df71d456b80872af8a79f14de578"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:29.529798Z","signature_b64":"J74lYxh0oLtoYY/8XOyxDO63PHjxhr2f1gLZIaDElwktIcf+/SSC1vHExT8FkBZ3bhmOJGtIrkwl8nbvRkWcDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b3ff24e4a5f297530dc0da5c023b121ba2427b5ca80fc03adeb6ef012ced289","last_reissued_at":"2026-05-18T00:11:29.529264Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:29.529264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed super point cardinality estimation under sliding time window for high speed network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Jie Xu","submitted_at":"2018-07-04T11:53:46Z","abstract_excerpt":"Super point is a special kind of host whose cardinality, the number of contacting hosts in a certain period, is bigger than a threshold. Super point cardinality estimation plays important roles in network field. This paper proposes a super point cardinality estimation algorithm under sliding time window. To maintain the state of previous hosts with few updating operations, a novel counter, asynchronous time stamp (AT), is proposed. For a sliding time window containing k time slices, AT only needs to be updated every k time slices at the cost of 1 more bit than a previous state-of-art counter w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.01527","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":"1807.01527","created_at":"2026-05-18T00:11:29.529347+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.01527v1","created_at":"2026-05-18T00:11:29.529347+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01527","created_at":"2026-05-18T00:11:29.529347+00:00"},{"alias_kind":"pith_short_12","alias_value":"LM77ETSKL4UX","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LM77ETSKL4UXKMG4","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LM77ETSK","created_at":"2026-05-18T12:32:37.024351+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/LM77ETSKL4UXKMG4BWS4AI5REG","json":"https://pith.science/pith/LM77ETSKL4UXKMG4BWS4AI5REG.json","graph_json":"https://pith.science/api/pith-number/LM77ETSKL4UXKMG4BWS4AI5REG/graph.json","events_json":"https://pith.science/api/pith-number/LM77ETSKL4UXKMG4BWS4AI5REG/events.json","paper":"https://pith.science/paper/LM77ETSK"},"agent_actions":{"view_html":"https://pith.science/pith/LM77ETSKL4UXKMG4BWS4AI5REG","download_json":"https://pith.science/pith/LM77ETSKL4UXKMG4BWS4AI5REG.json","view_paper":"https://pith.science/paper/LM77ETSK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.01527&json=true","fetch_graph":"https://pith.science/api/pith-number/LM77ETSKL4UXKMG4BWS4AI5REG/graph.json","fetch_events":"https://pith.science/api/pith-number/LM77ETSKL4UXKMG4BWS4AI5REG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LM77ETSKL4UXKMG4BWS4AI5REG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LM77ETSKL4UXKMG4BWS4AI5REG/action/storage_attestation","attest_author":"https://pith.science/pith/LM77ETSKL4UXKMG4BWS4AI5REG/action/author_attestation","sign_citation":"https://pith.science/pith/LM77ETSKL4UXKMG4BWS4AI5REG/action/citation_signature","submit_replication":"https://pith.science/pith/LM77ETSKL4UXKMG4BWS4AI5REG/action/replication_record"}},"created_at":"2026-05-18T00:11:29.529347+00:00","updated_at":"2026-05-18T00:11:29.529347+00:00"}