{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:36C33U6X2JSKU6S3EYOHFHOIDX","short_pith_number":"pith:36C33U6X","canonical_record":{"source":{"id":"1907.08057","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-07-18T14:03:39Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"733c24b83559aac30b874b3e8a03ac01dc6294e6551b958d7418a92b116b0a53","abstract_canon_sha256":"6c15ffa6ca1af298ad63527361a0b457e9b625b723e01a32de39706d89d1523f"},"schema_version":"1.0"},"canonical_sha256":"df85bdd3d7d264aa7a5b261c729dc81dde99695c5d2d90e436a841ec3e388593","source":{"kind":"arxiv","id":"1907.08057","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.08057","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"arxiv_version","alias_value":"1907.08057v1","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08057","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"pith_short_12","alias_value":"36C33U6X2JSK","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"36C33U6X2JSKU6S3","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"36C33U6X","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:36C33U6X2JSKU6S3EYOHFHOIDX","target":"record","payload":{"canonical_record":{"source":{"id":"1907.08057","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-07-18T14:03:39Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"733c24b83559aac30b874b3e8a03ac01dc6294e6551b958d7418a92b116b0a53","abstract_canon_sha256":"6c15ffa6ca1af298ad63527361a0b457e9b625b723e01a32de39706d89d1523f"},"schema_version":"1.0"},"canonical_sha256":"df85bdd3d7d264aa7a5b261c729dc81dde99695c5d2d90e436a841ec3e388593","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:15.263957Z","signature_b64":"w20Eqv9yGgC49qcxsguGazTRs4At2iRVO6gbPRto7nYImLnsnwWaOAEssFZ382YIkHu6yfoPeac9UJh5d6I4AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df85bdd3d7d264aa7a5b261c729dc81dde99695c5d2d90e436a841ec3e388593","last_reissued_at":"2026-05-17T23:40:15.263240Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:15.263240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.08057","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-17T23:40:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HR3LWFhYQMU7o2rLJiseZbqmktJsYnfleiaPcMo3Cq/zljLVXeMe5/hKNTfIxHTPkV+2dKa3qaF13dJsLYzeCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:27:55.477105Z"},"content_sha256":"1e1f591b15db2dbf169e76024c54b600a55f0fa506175f83279f128450a46c32","schema_version":"1.0","event_id":"sha256:1e1f591b15db2dbf169e76024c54b600a55f0fa506175f83279f128450a46c32"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:36C33U6X2JSKU6S3EYOHFHOIDX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"READ: a three-communicating-stage distributed super points detections algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DC","authors_text":"Jie Xu","submitted_at":"2019-07-18T14:03:39Z","abstract_excerpt":"A super point is a host that interacts with a far larger number of counterparts in the network over a period of time. Super point detection plays an important role in network research and application. With the increase of network scale, distributed super point detection has become a hot research topic. Compared with single-node super point detection algorithm, the difficulty of super point detection in multi-node distributed environment is how to reduce communication overhead. Therefore, this paper proposes a three-stage communication distributed super point detection algorithm: Rough Estimato"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08057","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-17T23:40:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0XVDFq7dQ+Uxa8YGgWK9fQHiyO8opG0zlPD6yms4Y0pGnEdoQCFqQTivWWflqaPiAldWTV7iEdQznL6Tb5spBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:27:55.477913Z"},"content_sha256":"6502af0d1bdfd3bed70a74c0bb5d29df3029b2c38c7a2e2ca19bd60611a54d74","schema_version":"1.0","event_id":"sha256:6502af0d1bdfd3bed70a74c0bb5d29df3029b2c38c7a2e2ca19bd60611a54d74"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/36C33U6X2JSKU6S3EYOHFHOIDX/bundle.json","state_url":"https://pith.science/pith/36C33U6X2JSKU6S3EYOHFHOIDX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/36C33U6X2JSKU6S3EYOHFHOIDX/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-05-31T14:27:55Z","links":{"resolver":"https://pith.science/pith/36C33U6X2JSKU6S3EYOHFHOIDX","bundle":"https://pith.science/pith/36C33U6X2JSKU6S3EYOHFHOIDX/bundle.json","state":"https://pith.science/pith/36C33U6X2JSKU6S3EYOHFHOIDX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/36C33U6X2JSKU6S3EYOHFHOIDX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:36C33U6X2JSKU6S3EYOHFHOIDX","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":"6c15ffa6ca1af298ad63527361a0b457e9b625b723e01a32de39706d89d1523f","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-07-18T14:03:39Z","title_canon_sha256":"733c24b83559aac30b874b3e8a03ac01dc6294e6551b958d7418a92b116b0a53"},"schema_version":"1.0","source":{"id":"1907.08057","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.08057","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"arxiv_version","alias_value":"1907.08057v1","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08057","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"pith_short_12","alias_value":"36C33U6X2JSK","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"36C33U6X2JSKU6S3","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"36C33U6X","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:6502af0d1bdfd3bed70a74c0bb5d29df3029b2c38c7a2e2ca19bd60611a54d74","target":"graph","created_at":"2026-05-17T23:40:15Z","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":"A super point is a host that interacts with a far larger number of counterparts in the network over a period of time. Super point detection plays an important role in network research and application. With the increase of network scale, distributed super point detection has become a hot research topic. Compared with single-node super point detection algorithm, the difficulty of super point detection in multi-node distributed environment is how to reduce communication overhead. Therefore, this paper proposes a three-stage communication distributed super point detection algorithm: Rough Estimato","authors_text":"Jie Xu","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-07-18T14:03:39Z","title":"READ: a three-communicating-stage distributed super points detections algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08057","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:1e1f591b15db2dbf169e76024c54b600a55f0fa506175f83279f128450a46c32","target":"record","created_at":"2026-05-17T23:40:15Z","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":"6c15ffa6ca1af298ad63527361a0b457e9b625b723e01a32de39706d89d1523f","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-07-18T14:03:39Z","title_canon_sha256":"733c24b83559aac30b874b3e8a03ac01dc6294e6551b958d7418a92b116b0a53"},"schema_version":"1.0","source":{"id":"1907.08057","kind":"arxiv","version":1}},"canonical_sha256":"df85bdd3d7d264aa7a5b261c729dc81dde99695c5d2d90e436a841ec3e388593","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df85bdd3d7d264aa7a5b261c729dc81dde99695c5d2d90e436a841ec3e388593","first_computed_at":"2026-05-17T23:40:15.263240Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:15.263240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w20Eqv9yGgC49qcxsguGazTRs4At2iRVO6gbPRto7nYImLnsnwWaOAEssFZ382YIkHu6yfoPeac9UJh5d6I4AQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:15.263957Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.08057","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e1f591b15db2dbf169e76024c54b600a55f0fa506175f83279f128450a46c32","sha256:6502af0d1bdfd3bed70a74c0bb5d29df3029b2c38c7a2e2ca19bd60611a54d74"],"state_sha256":"c1beb5d4971b8032c03fcb3d4de168f5671bab9335af61768e3a1fd098301f91"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ihtj50EJLgOi16bmjzvkhtZ6R8mM/WjWQL9IxLJzqJrcSOoWAUX2pT8Qi+jRoYkAt00aIuuM0lHBz0TKQiAlAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T14:27:55.481913Z","bundle_sha256":"02a8eb9ea21d7447624c5079c0a14aff4452b494fdfa54d0d55b0a806f6749a1"}}