{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:5LBFTYNV6JEUQFP2O4S7SCCTJI","short_pith_number":"pith:5LBFTYNV","schema_version":"1.0","canonical_sha256":"eac259e1b5f2494815fa7725f908534a31ec6f4e394b79ceb3184d369c564dc7","source":{"kind":"arxiv","id":"1108.5893","version":1},"attestation_state":"computed","paper":{"title":"Edge-preserving self-healing: keeping network backbones densely connected","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NI"],"primary_cat":"cs.DC","authors_text":"Amitabh Trehan, Atish Das Sarma","submitted_at":"2011-08-30T09:51:39Z","abstract_excerpt":"Healing algorithms play a crucial part in distributed P2P networks where failures occur continuously and frequently. Several self-healing algorithms have been suggested recently [IPDPS'08, PODC'08, PODC'09, PODC'11] in a line of work that has yielded gradual improvements in the properties ensured on the graph. This work motivates a strong general phenomenon of edge-preserving healing that aims at obtaining self-healing algorithms with the constraint that all original edges in the graph (not deleted by the adversary), be retained in every intermediate graph.\n  The previous algorithms, in their "},"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":"1108.5893","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-08-30T09:51:39Z","cross_cats_sorted":["cs.DS","cs.NI"],"title_canon_sha256":"4af660301abe3c3059f574a22ce00e0d4d0a7f1de8ca23644106e6a791506d79","abstract_canon_sha256":"727121a316c7f30def1501323a1367bd5a23109ce790ce0db674460d189beb31"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:28.268078Z","signature_b64":"+EcdGhTceWbGTAyoXq0h1Rh58VAw1KkKnN/8MWggTBrIJg6CkrJ2FMdE6WTyy6+QwkGbKvujDG+dbpaXO5+XBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eac259e1b5f2494815fa7725f908534a31ec6f4e394b79ceb3184d369c564dc7","last_reissued_at":"2026-05-18T04:14:28.267509Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:28.267509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Edge-preserving self-healing: keeping network backbones densely connected","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NI"],"primary_cat":"cs.DC","authors_text":"Amitabh Trehan, Atish Das Sarma","submitted_at":"2011-08-30T09:51:39Z","abstract_excerpt":"Healing algorithms play a crucial part in distributed P2P networks where failures occur continuously and frequently. Several self-healing algorithms have been suggested recently [IPDPS'08, PODC'08, PODC'09, PODC'11] in a line of work that has yielded gradual improvements in the properties ensured on the graph. This work motivates a strong general phenomenon of edge-preserving healing that aims at obtaining self-healing algorithms with the constraint that all original edges in the graph (not deleted by the adversary), be retained in every intermediate graph.\n  The previous algorithms, in their "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.5893","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":"1108.5893","created_at":"2026-05-18T04:14:28.267598+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.5893v1","created_at":"2026-05-18T04:14:28.267598+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.5893","created_at":"2026-05-18T04:14:28.267598+00:00"},{"alias_kind":"pith_short_12","alias_value":"5LBFTYNV6JEU","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"5LBFTYNV6JEUQFP2","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"5LBFTYNV","created_at":"2026-05-18T12:26:20.644004+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/5LBFTYNV6JEUQFP2O4S7SCCTJI","json":"https://pith.science/pith/5LBFTYNV6JEUQFP2O4S7SCCTJI.json","graph_json":"https://pith.science/api/pith-number/5LBFTYNV6JEUQFP2O4S7SCCTJI/graph.json","events_json":"https://pith.science/api/pith-number/5LBFTYNV6JEUQFP2O4S7SCCTJI/events.json","paper":"https://pith.science/paper/5LBFTYNV"},"agent_actions":{"view_html":"https://pith.science/pith/5LBFTYNV6JEUQFP2O4S7SCCTJI","download_json":"https://pith.science/pith/5LBFTYNV6JEUQFP2O4S7SCCTJI.json","view_paper":"https://pith.science/paper/5LBFTYNV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.5893&json=true","fetch_graph":"https://pith.science/api/pith-number/5LBFTYNV6JEUQFP2O4S7SCCTJI/graph.json","fetch_events":"https://pith.science/api/pith-number/5LBFTYNV6JEUQFP2O4S7SCCTJI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5LBFTYNV6JEUQFP2O4S7SCCTJI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5LBFTYNV6JEUQFP2O4S7SCCTJI/action/storage_attestation","attest_author":"https://pith.science/pith/5LBFTYNV6JEUQFP2O4S7SCCTJI/action/author_attestation","sign_citation":"https://pith.science/pith/5LBFTYNV6JEUQFP2O4S7SCCTJI/action/citation_signature","submit_replication":"https://pith.science/pith/5LBFTYNV6JEUQFP2O4S7SCCTJI/action/replication_record"}},"created_at":"2026-05-18T04:14:28.267598+00:00","updated_at":"2026-05-18T04:14:28.267598+00:00"}