{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YND77XL6F36IY3J3U54UOXVGAL","short_pith_number":"pith:YND77XL6","schema_version":"1.0","canonical_sha256":"c347ffdd7e2efc8c6d3ba779475ea602e9cdf27005a5156406e5e6d471935a2a","source":{"kind":"arxiv","id":"1809.04923","version":3},"attestation_state":"computed","paper":{"title":"A Self-Stabilizing Hashed Patricia Trie","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Christian Scheideler, Till Knollmann","submitted_at":"2018-09-13T12:55:05Z","abstract_excerpt":"While a lot of research in distributed computing has covered solutions for self-stabilizing computing and topologies, there is far less work on self-stabilization for distributed data structures. Considering crashing peers in peer-to-peer networks, it should not be taken for granted that a distributed data structure remains intact. In this work, we present a self-stabilizing protocol for a distributed data structure called the hashed Patricia Trie (Kniesburges and Scheideler WALCOM'11) that enables efficient prefix search on a set of keys. The data structure has a wide area of applications inc"},"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":"1809.04923","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-09-13T12:55:05Z","cross_cats_sorted":[],"title_canon_sha256":"76839e721cbe6276f4dac0d707c0fabda7708c000026806748fbe39e0cd295e3","abstract_canon_sha256":"5f2ae2bc80ddc0e330f99ed5d428118d2906b06a0685154d0f189a09f9aa0c86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:45.233575Z","signature_b64":"CxKx84pmBknjz8I1VnRInoa6Jc4KxpE4C9xAHTjGTo1p+DGZiyDnd7KX0vhPTJmG6JGutfdmuNINghubg8ZwBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c347ffdd7e2efc8c6d3ba779475ea602e9cdf27005a5156406e5e6d471935a2a","last_reissued_at":"2026-05-18T00:03:45.233042Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:45.233042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Self-Stabilizing Hashed Patricia Trie","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Christian Scheideler, Till Knollmann","submitted_at":"2018-09-13T12:55:05Z","abstract_excerpt":"While a lot of research in distributed computing has covered solutions for self-stabilizing computing and topologies, there is far less work on self-stabilization for distributed data structures. Considering crashing peers in peer-to-peer networks, it should not be taken for granted that a distributed data structure remains intact. In this work, we present a self-stabilizing protocol for a distributed data structure called the hashed Patricia Trie (Kniesburges and Scheideler WALCOM'11) that enables efficient prefix search on a set of keys. The data structure has a wide area of applications inc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04923","kind":"arxiv","version":3},"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":"1809.04923","created_at":"2026-05-18T00:03:45.233123+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.04923v3","created_at":"2026-05-18T00:03:45.233123+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04923","created_at":"2026-05-18T00:03:45.233123+00:00"},{"alias_kind":"pith_short_12","alias_value":"YND77XL6F36I","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YND77XL6F36IY3J3","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YND77XL6","created_at":"2026-05-18T12:33:04.347982+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/YND77XL6F36IY3J3U54UOXVGAL","json":"https://pith.science/pith/YND77XL6F36IY3J3U54UOXVGAL.json","graph_json":"https://pith.science/api/pith-number/YND77XL6F36IY3J3U54UOXVGAL/graph.json","events_json":"https://pith.science/api/pith-number/YND77XL6F36IY3J3U54UOXVGAL/events.json","paper":"https://pith.science/paper/YND77XL6"},"agent_actions":{"view_html":"https://pith.science/pith/YND77XL6F36IY3J3U54UOXVGAL","download_json":"https://pith.science/pith/YND77XL6F36IY3J3U54UOXVGAL.json","view_paper":"https://pith.science/paper/YND77XL6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.04923&json=true","fetch_graph":"https://pith.science/api/pith-number/YND77XL6F36IY3J3U54UOXVGAL/graph.json","fetch_events":"https://pith.science/api/pith-number/YND77XL6F36IY3J3U54UOXVGAL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YND77XL6F36IY3J3U54UOXVGAL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YND77XL6F36IY3J3U54UOXVGAL/action/storage_attestation","attest_author":"https://pith.science/pith/YND77XL6F36IY3J3U54UOXVGAL/action/author_attestation","sign_citation":"https://pith.science/pith/YND77XL6F36IY3J3U54UOXVGAL/action/citation_signature","submit_replication":"https://pith.science/pith/YND77XL6F36IY3J3U54UOXVGAL/action/replication_record"}},"created_at":"2026-05-18T00:03:45.233123+00:00","updated_at":"2026-05-18T00:03:45.233123+00:00"}