{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:C4OW53ZEMCQA7QIUQ6HSO3XU3O","short_pith_number":"pith:C4OW53ZE","schema_version":"1.0","canonical_sha256":"171d6eef2460a00fc114878f276ef4dba9db79a2e64200da5828c9d1cd1060af","source":{"kind":"arxiv","id":"1806.06580","version":4},"attestation_state":"computed","paper":{"title":"Mining frequent items in unstructured P2P networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Italo Epicoco, Marco Pulimeno, Massimo Cafaro","submitted_at":"2018-06-18T10:13:19Z","abstract_excerpt":"Large scale decentralized systems, such as P2P, sensor or IoT device networks are becoming increasingly common, and require robust protocols to address the challenges posed by the distribution of data and the large number of peers belonging to the network. In this paper, we deal with the problem of mining frequent items in unstructured P2P networks. This problem, of practical importance, has many useful applications. We design P2PSS, a fully decentralized, gossip--based protocol for frequent items discovery, leveraging the Space-Saving algorithm. We formally prove the correctness and theoretic"},"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":"1806.06580","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-18T10:13:19Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"257802fe8908760beb886861b227db73cc9ea290cd547592f6e4b9fb5e25743c","abstract_canon_sha256":"d0bb6ee67c35c9cf671229b032dafbfbc3a8bf58d44d45f02d8569f414b01990"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:59.701800Z","signature_b64":"hPNzVmVlET3XihUtwx6xMT2qSNW8WCjD8yF9UyQFYrlnz+5MLqWo9x5mDdDeE5jzOqVKBHBjsVozY6I6fl7VCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"171d6eef2460a00fc114878f276ef4dba9db79a2e64200da5828c9d1cd1060af","last_reissued_at":"2026-05-18T00:02:59.701243Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:59.701243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mining frequent items in unstructured P2P networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Italo Epicoco, Marco Pulimeno, Massimo Cafaro","submitted_at":"2018-06-18T10:13:19Z","abstract_excerpt":"Large scale decentralized systems, such as P2P, sensor or IoT device networks are becoming increasingly common, and require robust protocols to address the challenges posed by the distribution of data and the large number of peers belonging to the network. In this paper, we deal with the problem of mining frequent items in unstructured P2P networks. This problem, of practical importance, has many useful applications. We design P2PSS, a fully decentralized, gossip--based protocol for frequent items discovery, leveraging the Space-Saving algorithm. We formally prove the correctness and theoretic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.06580","kind":"arxiv","version":4},"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":"1806.06580","created_at":"2026-05-18T00:02:59.701313+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.06580v4","created_at":"2026-05-18T00:02:59.701313+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.06580","created_at":"2026-05-18T00:02:59.701313+00:00"},{"alias_kind":"pith_short_12","alias_value":"C4OW53ZEMCQA","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"C4OW53ZEMCQA7QIU","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"C4OW53ZE","created_at":"2026-05-18T12:32:16.446611+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/C4OW53ZEMCQA7QIUQ6HSO3XU3O","json":"https://pith.science/pith/C4OW53ZEMCQA7QIUQ6HSO3XU3O.json","graph_json":"https://pith.science/api/pith-number/C4OW53ZEMCQA7QIUQ6HSO3XU3O/graph.json","events_json":"https://pith.science/api/pith-number/C4OW53ZEMCQA7QIUQ6HSO3XU3O/events.json","paper":"https://pith.science/paper/C4OW53ZE"},"agent_actions":{"view_html":"https://pith.science/pith/C4OW53ZEMCQA7QIUQ6HSO3XU3O","download_json":"https://pith.science/pith/C4OW53ZEMCQA7QIUQ6HSO3XU3O.json","view_paper":"https://pith.science/paper/C4OW53ZE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.06580&json=true","fetch_graph":"https://pith.science/api/pith-number/C4OW53ZEMCQA7QIUQ6HSO3XU3O/graph.json","fetch_events":"https://pith.science/api/pith-number/C4OW53ZEMCQA7QIUQ6HSO3XU3O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C4OW53ZEMCQA7QIUQ6HSO3XU3O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C4OW53ZEMCQA7QIUQ6HSO3XU3O/action/storage_attestation","attest_author":"https://pith.science/pith/C4OW53ZEMCQA7QIUQ6HSO3XU3O/action/author_attestation","sign_citation":"https://pith.science/pith/C4OW53ZEMCQA7QIUQ6HSO3XU3O/action/citation_signature","submit_replication":"https://pith.science/pith/C4OW53ZEMCQA7QIUQ6HSO3XU3O/action/replication_record"}},"created_at":"2026-05-18T00:02:59.701313+00:00","updated_at":"2026-05-18T00:02:59.701313+00:00"}