{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2004:MGYRLYBZGB54UOEPIJ5TRXWCFK","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":"2441e5ad7b73b05beb431f033f8d8d6f2432c31492e8ad2e1e9aa067015ec951","cross_cats_sorted":[],"license":"","primary_cat":"cs.DC","submitted_at":"2004-10-29T02:56:21Z","title_canon_sha256":"fa15a1f25d7eafc550970ced508f330601ffacf669ec39d951decfbd1ebcd4fb"},"schema_version":"1.0","source":{"id":"cs/0410074","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0410074","created_at":"2026-05-18T01:06:49Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0410074v2","created_at":"2026-05-18T01:06:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0410074","created_at":"2026-05-18T01:06:49Z"},{"alias_kind":"pith_short_12","alias_value":"MGYRLYBZGB54","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"MGYRLYBZGB54UOEP","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"MGYRLYBZ","created_at":"2026-05-18T12:25:52Z"}],"graph_snapshots":[{"event_id":"sha256:7b42c62653b72cc8d772d007796b8d09ca63c5ae3ac60027779cbd213ad69eaa","target":"graph","created_at":"2026-05-18T01:06:49Z","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":"We propose a simple distributed hash table called ReCord, which is a generalized version of Randomized-Chord and offers improved tradeoffs in performance and topology maintenance over existing P2P systems. ReCord is scalable and can be easily implemented as an overlay network, and offers a good tradeoff between the node degree and query latency. For instance, an $n$-node ReCord with $O(\\log n)$ node degree has an expected latency of $\\Theta(\\log n)$ hops. Alternatively, it can also offer $\\Theta(\\frac{\\log n}{\\log \\log n})$ hops latency at a higher cost of $O(\\frac{\\log^2 n}{\\log\n \\log n})$ no","authors_text":"Jianyang Zeng, Wen-Jing Hsu","cross_cats":[],"headline":"","license":"","primary_cat":"cs.DC","submitted_at":"2004-10-29T02:56:21Z","title":"ReCord: A Distributed Hash Table with Recursive Structure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0410074","kind":"arxiv","version":2},"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:7d45d42e6cf64fe9f3eeaede3abd9b02e4635343fda13f38ed5228e457bf2238","target":"record","created_at":"2026-05-18T01:06:49Z","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":"2441e5ad7b73b05beb431f033f8d8d6f2432c31492e8ad2e1e9aa067015ec951","cross_cats_sorted":[],"license":"","primary_cat":"cs.DC","submitted_at":"2004-10-29T02:56:21Z","title_canon_sha256":"fa15a1f25d7eafc550970ced508f330601ffacf669ec39d951decfbd1ebcd4fb"},"schema_version":"1.0","source":{"id":"cs/0410074","kind":"arxiv","version":2}},"canonical_sha256":"61b115e039307bca388f427b38dec22aabe8d21f9fab2de6cf7fce19b6a18681","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61b115e039307bca388f427b38dec22aabe8d21f9fab2de6cf7fce19b6a18681","first_computed_at":"2026-05-18T01:06:49.203564Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:49.203564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bESgQgLVpsIDTIxJmRFfIGFCKyd2ZKctQSCplY3csXcpyWQW55tJH/kwOmSMb87buUwz/gxcLpSwKoE+TBM7CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:49.204214Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0410074","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d45d42e6cf64fe9f3eeaede3abd9b02e4635343fda13f38ed5228e457bf2238","sha256:7b42c62653b72cc8d772d007796b8d09ca63c5ae3ac60027779cbd213ad69eaa"],"state_sha256":"b235c8f67f45903c707f4b1b769103a50cc58ab4f596fcc7a81c8bde1b34d28f"}