{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XGWV7ZWXT6CDWBCT7B4UFYLNTA","short_pith_number":"pith:XGWV7ZWX","schema_version":"1.0","canonical_sha256":"b9ad5fe6d79f843b0453f87942e16d980e894e6a83f479f6230d0d1a27a98998","source":{"kind":"arxiv","id":"2402.09993","version":1},"attestation_state":"computed","paper":{"title":"Scalability limitations of Kademlia DHTs when enabling Data Availability Sampling in Ethereum","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.NI","authors_text":"Csaba Kiraly, Dmitriy Ryajov, Jose Luis Mu\\~noz-Tapia, Leonardo Bautista-Gomez, Mikel Cortes-Goicoechea","submitted_at":"2024-02-15T14:56:44Z","abstract_excerpt":"Scalability in blockchain remains a significant challenge, especially when prioritizing decentralization and security. The Ethereum community has proposed comprehensive data-sharding techniques to overcome storage, computational, and network processing limitations. In this context, the propagation and availability of large blocks become the subject of research to achieve scalable data-sharding. This paper provides insights after exploring the usage of a Kademlia-based DHT to enable Data Availability Sampling (DAS) in Ethereum. It presents a DAS-DHT simulator to study this problem and validates"},"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":"2402.09993","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2024-02-15T14:56:44Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"c15be546ddd8e66617c01b8bb987c13b2c2fa2e3e743a5db6bca6ce790e5dd2d","abstract_canon_sha256":"d1412a0d4ac8174d2992b768e4d0e4a723e715cb36271270218b35fb7d76cde1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:45:40.013233Z","signature_b64":"h8PSRzW5prUoVa7IoAf4HXeY/Ams0Gke9aFv/MOp1IRLsikP91VplN6If+kftAQi5jznzw5BrpmjE7/CmNIFCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9ad5fe6d79f843b0453f87942e16d980e894e6a83f479f6230d0d1a27a98998","last_reissued_at":"2026-07-05T07:45:40.012802Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:45:40.012802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalability limitations of Kademlia DHTs when enabling Data Availability Sampling in Ethereum","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.NI","authors_text":"Csaba Kiraly, Dmitriy Ryajov, Jose Luis Mu\\~noz-Tapia, Leonardo Bautista-Gomez, Mikel Cortes-Goicoechea","submitted_at":"2024-02-15T14:56:44Z","abstract_excerpt":"Scalability in blockchain remains a significant challenge, especially when prioritizing decentralization and security. The Ethereum community has proposed comprehensive data-sharding techniques to overcome storage, computational, and network processing limitations. In this context, the propagation and availability of large blocks become the subject of research to achieve scalable data-sharding. This paper provides insights after exploring the usage of a Kademlia-based DHT to enable Data Availability Sampling (DAS) in Ethereum. It presents a DAS-DHT simulator to study this problem and validates"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.09993","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.09993/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2402.09993","created_at":"2026-07-05T07:45:40.012859+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.09993v1","created_at":"2026-07-05T07:45:40.012859+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.09993","created_at":"2026-07-05T07:45:40.012859+00:00"},{"alias_kind":"pith_short_12","alias_value":"XGWV7ZWXT6CD","created_at":"2026-07-05T07:45:40.012859+00:00"},{"alias_kind":"pith_short_16","alias_value":"XGWV7ZWXT6CDWBCT","created_at":"2026-07-05T07:45:40.012859+00:00"},{"alias_kind":"pith_short_8","alias_value":"XGWV7ZWX","created_at":"2026-07-05T07:45:40.012859+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.13757","citing_title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XGWV7ZWXT6CDWBCT7B4UFYLNTA","json":"https://pith.science/pith/XGWV7ZWXT6CDWBCT7B4UFYLNTA.json","graph_json":"https://pith.science/api/pith-number/XGWV7ZWXT6CDWBCT7B4UFYLNTA/graph.json","events_json":"https://pith.science/api/pith-number/XGWV7ZWXT6CDWBCT7B4UFYLNTA/events.json","paper":"https://pith.science/paper/XGWV7ZWX"},"agent_actions":{"view_html":"https://pith.science/pith/XGWV7ZWXT6CDWBCT7B4UFYLNTA","download_json":"https://pith.science/pith/XGWV7ZWXT6CDWBCT7B4UFYLNTA.json","view_paper":"https://pith.science/paper/XGWV7ZWX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.09993&json=true","fetch_graph":"https://pith.science/api/pith-number/XGWV7ZWXT6CDWBCT7B4UFYLNTA/graph.json","fetch_events":"https://pith.science/api/pith-number/XGWV7ZWXT6CDWBCT7B4UFYLNTA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XGWV7ZWXT6CDWBCT7B4UFYLNTA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XGWV7ZWXT6CDWBCT7B4UFYLNTA/action/storage_attestation","attest_author":"https://pith.science/pith/XGWV7ZWXT6CDWBCT7B4UFYLNTA/action/author_attestation","sign_citation":"https://pith.science/pith/XGWV7ZWXT6CDWBCT7B4UFYLNTA/action/citation_signature","submit_replication":"https://pith.science/pith/XGWV7ZWXT6CDWBCT7B4UFYLNTA/action/replication_record"}},"created_at":"2026-07-05T07:45:40.012859+00:00","updated_at":"2026-07-05T07:45:40.012859+00:00"}