{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BZI2QK4XP4WBVSSLOYXXKSQJHY","short_pith_number":"pith:BZI2QK4X","schema_version":"1.0","canonical_sha256":"0e51a82b977f2c1aca4b762f754a093e283c911d5f89d0e31d386c542c24e15d","source":{"kind":"arxiv","id":"1503.07905","version":1},"attestation_state":"computed","paper":{"title":"D3-Tree: A Dynamic Distributed Deterministic Load - Balancer for decentralized tree structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Christos Zaroliagis, Efrosini Sourla, Kostas Tsichlas, Spyros Sioutas","submitted_at":"2015-03-26T21:14:34Z","abstract_excerpt":"In this work, we propose D3-Tree, a dynamic distributed deterministic structure for data management in decentralized networks. We present in brief the theoretical algorithmic analysis, in which our proposed structure is based on, and we describe thoroughly the key aspects of the implementation. Conducting experiments, we verify that the implemented structure outperforms other well-known hierarchical tree-based structures, since it provides better complexities regarding load-balancing operations. More specifically, the structure achieves a logarithmic amortized bound, using an efficient determi"},"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":"1503.07905","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-26T21:14:34Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"9b7c979273d32a9098149a54ef718552c19b489f8a8785b1bf235e7a439e8625","abstract_canon_sha256":"e5536db0365231f43eabd47ba998b51d734c98161b2a4538bc32dee226b8a872"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:11.976333Z","signature_b64":"+lrYnY3h6RuW8jqGciBbje6VjfBp4FnMwZI27i97Sd4fV8e41dphhRMrwAOVi/e2s3ys+s7WlxNF9+8AIebqCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e51a82b977f2c1aca4b762f754a093e283c911d5f89d0e31d386c542c24e15d","last_reissued_at":"2026-05-18T02:20:11.975822Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:11.975822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"D3-Tree: A Dynamic Distributed Deterministic Load - Balancer for decentralized tree structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Christos Zaroliagis, Efrosini Sourla, Kostas Tsichlas, Spyros Sioutas","submitted_at":"2015-03-26T21:14:34Z","abstract_excerpt":"In this work, we propose D3-Tree, a dynamic distributed deterministic structure for data management in decentralized networks. We present in brief the theoretical algorithmic analysis, in which our proposed structure is based on, and we describe thoroughly the key aspects of the implementation. Conducting experiments, we verify that the implemented structure outperforms other well-known hierarchical tree-based structures, since it provides better complexities regarding load-balancing operations. More specifically, the structure achieves a logarithmic amortized bound, using an efficient determi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07905","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":"1503.07905","created_at":"2026-05-18T02:20:11.975902+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.07905v1","created_at":"2026-05-18T02:20:11.975902+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07905","created_at":"2026-05-18T02:20:11.975902+00:00"},{"alias_kind":"pith_short_12","alias_value":"BZI2QK4XP4WB","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BZI2QK4XP4WBVSSL","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BZI2QK4X","created_at":"2026-05-18T12:29:14.074870+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/BZI2QK4XP4WBVSSLOYXXKSQJHY","json":"https://pith.science/pith/BZI2QK4XP4WBVSSLOYXXKSQJHY.json","graph_json":"https://pith.science/api/pith-number/BZI2QK4XP4WBVSSLOYXXKSQJHY/graph.json","events_json":"https://pith.science/api/pith-number/BZI2QK4XP4WBVSSLOYXXKSQJHY/events.json","paper":"https://pith.science/paper/BZI2QK4X"},"agent_actions":{"view_html":"https://pith.science/pith/BZI2QK4XP4WBVSSLOYXXKSQJHY","download_json":"https://pith.science/pith/BZI2QK4XP4WBVSSLOYXXKSQJHY.json","view_paper":"https://pith.science/paper/BZI2QK4X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.07905&json=true","fetch_graph":"https://pith.science/api/pith-number/BZI2QK4XP4WBVSSLOYXXKSQJHY/graph.json","fetch_events":"https://pith.science/api/pith-number/BZI2QK4XP4WBVSSLOYXXKSQJHY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BZI2QK4XP4WBVSSLOYXXKSQJHY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BZI2QK4XP4WBVSSLOYXXKSQJHY/action/storage_attestation","attest_author":"https://pith.science/pith/BZI2QK4XP4WBVSSLOYXXKSQJHY/action/author_attestation","sign_citation":"https://pith.science/pith/BZI2QK4XP4WBVSSLOYXXKSQJHY/action/citation_signature","submit_replication":"https://pith.science/pith/BZI2QK4XP4WBVSSLOYXXKSQJHY/action/replication_record"}},"created_at":"2026-05-18T02:20:11.975902+00:00","updated_at":"2026-05-18T02:20:11.975902+00:00"}