{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:36C33U6X2JSKU6S3EYOHFHOIDX","short_pith_number":"pith:36C33U6X","schema_version":"1.0","canonical_sha256":"df85bdd3d7d264aa7a5b261c729dc81dde99695c5d2d90e436a841ec3e388593","source":{"kind":"arxiv","id":"1907.08057","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.08057","created_at":"2026-05-17T23:40:15.263377+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.08057v1","created_at":"2026-05-17T23:40:15.263377+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08057","created_at":"2026-05-17T23:40:15.263377+00:00"},{"alias_kind":"pith_short_12","alias_value":"36C33U6X2JSK","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"36C33U6X2JSKU6S3","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"36C33U6X","created_at":"2026-05-18T12:33:07.085635+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.08057","citing_title":"READ: a three-communicating-stage distributed super points detections algorithm","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/36C33U6X2JSKU6S3EYOHFHOIDX","json":"https://pith.science/pith/36C33U6X2JSKU6S3EYOHFHOIDX.json","graph_json":"https://pith.science/api/pith-number/36C33U6X2JSKU6S3EYOHFHOIDX/graph.json","events_json":"https://pith.science/api/pith-number/36C33U6X2JSKU6S3EYOHFHOIDX/events.json","paper":"https://pith.science/paper/36C33U6X"},"agent_actions":{"view_html":"https://pith.science/pith/36C33U6X2JSKU6S3EYOHFHOIDX","download_json":"https://pith.science/pith/36C33U6X2JSKU6S3EYOHFHOIDX.json","view_paper":"https://pith.science/paper/36C33U6X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.08057&json=true","fetch_graph":"https://pith.science/api/pith-number/36C33U6X2JSKU6S3EYOHFHOIDX/graph.json","fetch_events":"https://pith.science/api/pith-number/36C33U6X2JSKU6S3EYOHFHOIDX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/36C33U6X2JSKU6S3EYOHFHOIDX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/36C33U6X2JSKU6S3EYOHFHOIDX/action/storage_attestation","attest_author":"https://pith.science/pith/36C33U6X2JSKU6S3EYOHFHOIDX/action/author_attestation","sign_citation":"https://pith.science/pith/36C33U6X2JSKU6S3EYOHFHOIDX/action/citation_signature","submit_replication":"https://pith.science/pith/36C33U6X2JSKU6S3EYOHFHOIDX/action/replication_record"}},"created_at":"2026-05-17T23:40:15.263377+00:00","updated_at":"2026-05-17T23:40:15.263377+00:00"}