{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LIPP7AN55ATDJOPQW4E2234WZI","short_pith_number":"pith:LIPP7AN5","schema_version":"1.0","canonical_sha256":"5a1eff81bde82634b9f0b709ad6f96ca310119daeda76fb08df3567fbbda0479","source":{"kind":"arxiv","id":"1408.3079","version":1},"attestation_state":"computed","paper":{"title":"A Lightweight Approach for Improving the Lookup Performance in Kademlia-type Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.NI","authors_text":"Hani Salah, Stefanie Roos, Thorsten Strufe","submitted_at":"2014-07-27T06:45:04Z","abstract_excerpt":"Discovery of nodes and content in large-scale distributed systems is generally based on Kademlia, today. Understanding Kademlia-type systems to improve their performance is essential for maintaining a high service quality for an increased number of participants, particularly when those systems are adopted by latency-sensitive applications.\n  This paper contributes to the understanding of Kademlia by studying the impact of \\emph{diversifying} neighbours' identifiers within each routing table bucket on the lookup performance. We propose a new, yet backward-compatible, neighbour selection scheme "},"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":"1408.3079","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-07-27T06:45:04Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"52c5f0ab960920b66f19cfac50684187a0e8fe7ac5283bc6fb9e051fc35affb9","abstract_canon_sha256":"9e901c3f98a596edc56b4b402775cc8ddd0b618520edc9938c7777157cf6c8f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:15.079107Z","signature_b64":"fe5FZVbiquf6qO1ra2Tc+dhd9hPMaAoakQ5aVtJFrRY+9FYZZ0tjWhE05n3Tnwt1QYjRhfH6e1VuPyTVFyveAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a1eff81bde82634b9f0b709ad6f96ca310119daeda76fb08df3567fbbda0479","last_reissued_at":"2026-05-18T02:45:15.078244Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:15.078244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Lightweight Approach for Improving the Lookup Performance in Kademlia-type Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.NI","authors_text":"Hani Salah, Stefanie Roos, Thorsten Strufe","submitted_at":"2014-07-27T06:45:04Z","abstract_excerpt":"Discovery of nodes and content in large-scale distributed systems is generally based on Kademlia, today. Understanding Kademlia-type systems to improve their performance is essential for maintaining a high service quality for an increased number of participants, particularly when those systems are adopted by latency-sensitive applications.\n  This paper contributes to the understanding of Kademlia by studying the impact of \\emph{diversifying} neighbours' identifiers within each routing table bucket on the lookup performance. We propose a new, yet backward-compatible, neighbour selection scheme "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.3079","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":"1408.3079","created_at":"2026-05-18T02:45:15.078388+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.3079v1","created_at":"2026-05-18T02:45:15.078388+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.3079","created_at":"2026-05-18T02:45:15.078388+00:00"},{"alias_kind":"pith_short_12","alias_value":"LIPP7AN55ATD","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LIPP7AN55ATDJOPQ","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LIPP7AN5","created_at":"2026-05-18T12:28:38.356838+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/LIPP7AN55ATDJOPQW4E2234WZI","json":"https://pith.science/pith/LIPP7AN55ATDJOPQW4E2234WZI.json","graph_json":"https://pith.science/api/pith-number/LIPP7AN55ATDJOPQW4E2234WZI/graph.json","events_json":"https://pith.science/api/pith-number/LIPP7AN55ATDJOPQW4E2234WZI/events.json","paper":"https://pith.science/paper/LIPP7AN5"},"agent_actions":{"view_html":"https://pith.science/pith/LIPP7AN55ATDJOPQW4E2234WZI","download_json":"https://pith.science/pith/LIPP7AN55ATDJOPQW4E2234WZI.json","view_paper":"https://pith.science/paper/LIPP7AN5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.3079&json=true","fetch_graph":"https://pith.science/api/pith-number/LIPP7AN55ATDJOPQW4E2234WZI/graph.json","fetch_events":"https://pith.science/api/pith-number/LIPP7AN55ATDJOPQW4E2234WZI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LIPP7AN55ATDJOPQW4E2234WZI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LIPP7AN55ATDJOPQW4E2234WZI/action/storage_attestation","attest_author":"https://pith.science/pith/LIPP7AN55ATDJOPQW4E2234WZI/action/author_attestation","sign_citation":"https://pith.science/pith/LIPP7AN55ATDJOPQW4E2234WZI/action/citation_signature","submit_replication":"https://pith.science/pith/LIPP7AN55ATDJOPQW4E2234WZI/action/replication_record"}},"created_at":"2026-05-18T02:45:15.078388+00:00","updated_at":"2026-05-18T02:45:15.078388+00:00"}