{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LIPP7AN55ATDJOPQW4E2234WZI","short_pith_number":"pith:LIPP7AN5","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"},"canonical_sha256":"5a1eff81bde82634b9f0b709ad6f96ca310119daeda76fb08df3567fbbda0479","source":{"kind":"arxiv","id":"1408.3079","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.3079","created_at":"2026-05-18T02:45:15Z"},{"alias_kind":"arxiv_version","alias_value":"1408.3079v1","created_at":"2026-05-18T02:45:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.3079","created_at":"2026-05-18T02:45:15Z"},{"alias_kind":"pith_short_12","alias_value":"LIPP7AN55ATD","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LIPP7AN55ATDJOPQ","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LIPP7AN5","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LIPP7AN55ATDJOPQW4E2234WZI","target":"record","payload":{"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"},"canonical_sha256":"5a1eff81bde82634b9f0b709ad6f96ca310119daeda76fb08df3567fbbda0479","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"},"source_kind":"arxiv","source_id":"1408.3079","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-18T02:45:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UYQH9340Q22gQ50FwGVxAC866wz5wyNcr7EMgbfSfowOhRSB71Ho/pOQJUIB1iWhqgFugLKklA7EEzdFeH/wDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T14:48:50.976346Z"},"content_sha256":"9b65a4b06410b27ada3d6bb54b56837d15993505da79e4cf895d7632867f0a39","schema_version":"1.0","event_id":"sha256:9b65a4b06410b27ada3d6bb54b56837d15993505da79e4cf895d7632867f0a39"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LIPP7AN55ATDJOPQW4E2234WZI","target":"graph","payload":{"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"},"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-18T02:45:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"InmdsJvgCF8SwOfiqEFMfIjKmw8SX1aIGSmkUUZqYvLeY64Xg6Rr2kcfKd7eTjkS82Y2NRcqnh5YubXcPghrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T14:48:50.976687Z"},"content_sha256":"b22ddb974f3322159a911f9ee77fe09eab3122469655f8f43664b0687ab2db5e","schema_version":"1.0","event_id":"sha256:b22ddb974f3322159a911f9ee77fe09eab3122469655f8f43664b0687ab2db5e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LIPP7AN55ATDJOPQW4E2234WZI/bundle.json","state_url":"https://pith.science/pith/LIPP7AN55ATDJOPQW4E2234WZI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LIPP7AN55ATDJOPQW4E2234WZI/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-06-20T14:48:50Z","links":{"resolver":"https://pith.science/pith/LIPP7AN55ATDJOPQW4E2234WZI","bundle":"https://pith.science/pith/LIPP7AN55ATDJOPQW4E2234WZI/bundle.json","state":"https://pith.science/pith/LIPP7AN55ATDJOPQW4E2234WZI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LIPP7AN55ATDJOPQW4E2234WZI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LIPP7AN55ATDJOPQW4E2234WZI","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":"9e901c3f98a596edc56b4b402775cc8ddd0b618520edc9938c7777157cf6c8f5","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-07-27T06:45:04Z","title_canon_sha256":"52c5f0ab960920b66f19cfac50684187a0e8fe7ac5283bc6fb9e051fc35affb9"},"schema_version":"1.0","source":{"id":"1408.3079","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.3079","created_at":"2026-05-18T02:45:15Z"},{"alias_kind":"arxiv_version","alias_value":"1408.3079v1","created_at":"2026-05-18T02:45:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.3079","created_at":"2026-05-18T02:45:15Z"},{"alias_kind":"pith_short_12","alias_value":"LIPP7AN55ATD","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LIPP7AN55ATDJOPQ","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LIPP7AN5","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:b22ddb974f3322159a911f9ee77fe09eab3122469655f8f43664b0687ab2db5e","target":"graph","created_at":"2026-05-18T02:45: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":"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 ","authors_text":"Hani Salah, Stefanie Roos, Thorsten Strufe","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-07-27T06:45:04Z","title":"A Lightweight Approach for Improving the Lookup Performance in Kademlia-type Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.3079","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:9b65a4b06410b27ada3d6bb54b56837d15993505da79e4cf895d7632867f0a39","target":"record","created_at":"2026-05-18T02:45: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":"9e901c3f98a596edc56b4b402775cc8ddd0b618520edc9938c7777157cf6c8f5","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-07-27T06:45:04Z","title_canon_sha256":"52c5f0ab960920b66f19cfac50684187a0e8fe7ac5283bc6fb9e051fc35affb9"},"schema_version":"1.0","source":{"id":"1408.3079","kind":"arxiv","version":1}},"canonical_sha256":"5a1eff81bde82634b9f0b709ad6f96ca310119daeda76fb08df3567fbbda0479","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a1eff81bde82634b9f0b709ad6f96ca310119daeda76fb08df3567fbbda0479","first_computed_at":"2026-05-18T02:45:15.078244Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:15.078244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fe5FZVbiquf6qO1ra2Tc+dhd9hPMaAoakQ5aVtJFrRY+9FYZZ0tjWhE05n3Tnwt1QYjRhfH6e1VuPyTVFyveAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:15.079107Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.3079","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b65a4b06410b27ada3d6bb54b56837d15993505da79e4cf895d7632867f0a39","sha256:b22ddb974f3322159a911f9ee77fe09eab3122469655f8f43664b0687ab2db5e"],"state_sha256":"69511f21b340697ed60b8a7f934b1b5b8b1199b84812fb0fb9138ebbe3682c9e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LfsJ1DgGmlmhx1K5Rq+ErPhBwMbnPZ6os5Unijq3a9keXwcmRFUv7pd3ynQkLC9O97r1EJCOsUMqPjDH90/RCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T14:48:50.978474Z","bundle_sha256":"ea74c9a3163d220d992cb8f1a772d5673a8227d76b0e6c69d1d98c4903c2cb2c"}}