{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UCEGD2VIBYRSWVFNRBV2HCBRJI","short_pith_number":"pith:UCEGD2VI","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"},"canonical_sha256":"a08861eaa80e232b54ad886ba388314a3760a3fb78df0a64045fc3a347640530","source":{"kind":"arxiv","id":"1508.04234","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.04234","created_at":"2026-05-18T01:35:05Z"},{"alias_kind":"arxiv_version","alias_value":"1508.04234v1","created_at":"2026-05-18T01:35:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04234","created_at":"2026-05-18T01:35:05Z"},{"alias_kind":"pith_short_12","alias_value":"UCEGD2VIBYRS","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UCEGD2VIBYRSWVFN","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UCEGD2VI","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UCEGD2VIBYRSWVFNRBV2HCBRJI","target":"record","payload":{"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"},"canonical_sha256":"a08861eaa80e232b54ad886ba388314a3760a3fb78df0a64045fc3a347640530","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"},"source_kind":"arxiv","source_id":"1508.04234","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:35:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W5sd/H4c+4IdC9qAarpLx3VV7r4DHCOVabyT3nePlAyN1iuNMwy8Mdb5D02DmsaGOH4j6qKACjF8HAw5aQ/NCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:22:08.463849Z"},"content_sha256":"bc357f74182e01a6fc797c93b52fa209ba2fa509827ecc8797756e8698d3d5ac","schema_version":"1.0","event_id":"sha256:bc357f74182e01a6fc797c93b52fa209ba2fa509827ecc8797756e8698d3d5ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UCEGD2VIBYRSWVFNRBV2HCBRJI","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:35:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yrFkN1VGtoUI8g7Omq0OBPvCEkzZl6g/pH2g6YM3JCRMidJM/KdLDq4lNnZyDQtWPdB/WPMbZz+BSi6ecx7sDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:22:08.464193Z"},"content_sha256":"20bb7819031b60736e1593ecf21a9ad3af47b671867e2a7590461dd70aa92045","schema_version":"1.0","event_id":"sha256:20bb7819031b60736e1593ecf21a9ad3af47b671867e2a7590461dd70aa92045"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UCEGD2VIBYRSWVFNRBV2HCBRJI/bundle.json","state_url":"https://pith.science/pith/UCEGD2VIBYRSWVFNRBV2HCBRJI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UCEGD2VIBYRSWVFNRBV2HCBRJI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-21T23:22:08Z","links":{"resolver":"https://pith.science/pith/UCEGD2VIBYRSWVFNRBV2HCBRJI","bundle":"https://pith.science/pith/UCEGD2VIBYRSWVFNRBV2HCBRJI/bundle.json","state":"https://pith.science/pith/UCEGD2VIBYRSWVFNRBV2HCBRJI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UCEGD2VIBYRSWVFNRBV2HCBRJI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UCEGD2VIBYRSWVFNRBV2HCBRJI","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":"86a6abf49dd6835038b820bd4a55ae1338cbb5e61245f63f21f33b14dfd556c8","cross_cats_sorted":["cs.DS","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-08-18T07:47:55Z","title_canon_sha256":"a5566b55292cb8b590ff33baedbc17858614de7bca6ef2f0efb66fa47f42d5d3"},"schema_version":"1.0","source":{"id":"1508.04234","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.04234","created_at":"2026-05-18T01:35:05Z"},{"alias_kind":"arxiv_version","alias_value":"1508.04234v1","created_at":"2026-05-18T01:35:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04234","created_at":"2026-05-18T01:35:05Z"},{"alias_kind":"pith_short_12","alias_value":"UCEGD2VIBYRS","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UCEGD2VIBYRSWVFN","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UCEGD2VI","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:20bb7819031b60736e1593ecf21a9ad3af47b671867e2a7590461dd70aa92045","target":"graph","created_at":"2026-05-18T01:35:05Z","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":"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. ","authors_text":"Amitabh Trehan, Armando Castaneda, Danny Dolev","cross_cats":["cs.DS","cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-08-18T07:47:55Z","title":"Compact Routing Messages in Self-Healing Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04234","kind":"arxiv","version":1},"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:bc357f74182e01a6fc797c93b52fa209ba2fa509827ecc8797756e8698d3d5ac","target":"record","created_at":"2026-05-18T01:35:05Z","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":"86a6abf49dd6835038b820bd4a55ae1338cbb5e61245f63f21f33b14dfd556c8","cross_cats_sorted":["cs.DS","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-08-18T07:47:55Z","title_canon_sha256":"a5566b55292cb8b590ff33baedbc17858614de7bca6ef2f0efb66fa47f42d5d3"},"schema_version":"1.0","source":{"id":"1508.04234","kind":"arxiv","version":1}},"canonical_sha256":"a08861eaa80e232b54ad886ba388314a3760a3fb78df0a64045fc3a347640530","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a08861eaa80e232b54ad886ba388314a3760a3fb78df0a64045fc3a347640530","first_computed_at":"2026-05-18T01:35:05.902184Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:05.902184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CBAjQRmT60wgjdcqse9jLhiLbM6ZguoPHP5AqVd+upfkhKl8oq+dIr7Ygn1eI0oSA2tpm8guENOEcDKDQNx3DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:05.902900Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.04234","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc357f74182e01a6fc797c93b52fa209ba2fa509827ecc8797756e8698d3d5ac","sha256:20bb7819031b60736e1593ecf21a9ad3af47b671867e2a7590461dd70aa92045"],"state_sha256":"05a86b0f669236ff4426170de8690dfa0dcb6afe0f8f42b0815ca9a455505d18"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JZGXDgdXPDNJTMz4ujR539WVozMztUGcPA68C6Skmi94hWARTE9FDMkKYEkMrPPg9nDjDT2lKni3VnfnJJXOCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T23:22:08.466149Z","bundle_sha256":"2021df0ca51bd65e624e5db3e35d5d731c998922d678cc4e84a609afd5339044"}}