{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UCEGD2VIBYRSWVFNRBV2HCBRJI","short_pith_number":"pith:UCEGD2VI","schema_version":"1.0","canonical_sha256":"a08861eaa80e232b54ad886ba388314a3760a3fb78df0a64045fc3a347640530","source":{"kind":"arxiv","id":"1508.04234","version":1},"attestation_state":"computed","paper":{"title":"Compact Routing Messages in Self-Healing Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NI"],"primary_cat":"cs.DC","authors_text":"Amitabh Trehan, Armando Castaneda, Danny Dolev","submitted_at":"2015-08-18T07:47:55Z","abstract_excerpt":"Existing compact routing schemes, e.g., Thorup and Zwick [SPAA 2001] and Chechik [PODC 2013], often have no means to tolerate failures, once the system has been setup and started. This paper presents, to our knowledge, the first self-healing compact routing scheme. Besides, our schemes are developed for low memory nodes, i.e., nodes need only $O(\\log^2 n)$ memory, and are thus, compact schemes.\n  We introduce two algorithms of independent interest: The first is CompactFT, a novel compact version (using only $O(\\log n)$ local memory) of the self-healing algorithm Forgiving Tree of Hayes et al. "},"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":"1508.04234","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-08-18T07:47:55Z","cross_cats_sorted":["cs.DS","cs.NI"],"title_canon_sha256":"a5566b55292cb8b590ff33baedbc17858614de7bca6ef2f0efb66fa47f42d5d3","abstract_canon_sha256":"86a6abf49dd6835038b820bd4a55ae1338cbb5e61245f63f21f33b14dfd556c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:05.902900Z","signature_b64":"CBAjQRmT60wgjdcqse9jLhiLbM6ZguoPHP5AqVd+upfkhKl8oq+dIr7Ygn1eI0oSA2tpm8guENOEcDKDQNx3DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a08861eaa80e232b54ad886ba388314a3760a3fb78df0a64045fc3a347640530","last_reissued_at":"2026-05-18T01:35:05.902184Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:05.902184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compact Routing Messages in Self-Healing Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NI"],"primary_cat":"cs.DC","authors_text":"Amitabh Trehan, Armando Castaneda, Danny Dolev","submitted_at":"2015-08-18T07:47:55Z","abstract_excerpt":"Existing compact routing schemes, e.g., Thorup and Zwick [SPAA 2001] and Chechik [PODC 2013], often have no means to tolerate failures, once the system has been setup and started. This paper presents, to our knowledge, the first self-healing compact routing scheme. Besides, our schemes are developed for low memory nodes, i.e., nodes need only $O(\\log^2 n)$ memory, and are thus, compact schemes.\n  We introduce two algorithms of independent interest: The first is CompactFT, a novel compact version (using only $O(\\log n)$ local memory) of the self-healing algorithm Forgiving Tree of Hayes et al. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04234","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":"1508.04234","created_at":"2026-05-18T01:35:05.902290+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.04234v1","created_at":"2026-05-18T01:35:05.902290+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04234","created_at":"2026-05-18T01:35:05.902290+00:00"},{"alias_kind":"pith_short_12","alias_value":"UCEGD2VIBYRS","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UCEGD2VIBYRSWVFN","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UCEGD2VI","created_at":"2026-05-18T12:29:44.643036+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/UCEGD2VIBYRSWVFNRBV2HCBRJI","json":"https://pith.science/pith/UCEGD2VIBYRSWVFNRBV2HCBRJI.json","graph_json":"https://pith.science/api/pith-number/UCEGD2VIBYRSWVFNRBV2HCBRJI/graph.json","events_json":"https://pith.science/api/pith-number/UCEGD2VIBYRSWVFNRBV2HCBRJI/events.json","paper":"https://pith.science/paper/UCEGD2VI"},"agent_actions":{"view_html":"https://pith.science/pith/UCEGD2VIBYRSWVFNRBV2HCBRJI","download_json":"https://pith.science/pith/UCEGD2VIBYRSWVFNRBV2HCBRJI.json","view_paper":"https://pith.science/paper/UCEGD2VI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.04234&json=true","fetch_graph":"https://pith.science/api/pith-number/UCEGD2VIBYRSWVFNRBV2HCBRJI/graph.json","fetch_events":"https://pith.science/api/pith-number/UCEGD2VIBYRSWVFNRBV2HCBRJI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UCEGD2VIBYRSWVFNRBV2HCBRJI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UCEGD2VIBYRSWVFNRBV2HCBRJI/action/storage_attestation","attest_author":"https://pith.science/pith/UCEGD2VIBYRSWVFNRBV2HCBRJI/action/author_attestation","sign_citation":"https://pith.science/pith/UCEGD2VIBYRSWVFNRBV2HCBRJI/action/citation_signature","submit_replication":"https://pith.science/pith/UCEGD2VIBYRSWVFNRBV2HCBRJI/action/replication_record"}},"created_at":"2026-05-18T01:35:05.902290+00:00","updated_at":"2026-05-18T01:35:05.902290+00:00"}