{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YO5G6WK6QDLIBM5KXKQC4TC56U","short_pith_number":"pith:YO5G6WK6","schema_version":"1.0","canonical_sha256":"c3ba6f595e80d680b3aabaa02e4c5df525c3bfd66b539ca829b78a691360d423","source":{"kind":"arxiv","id":"1703.03315","version":3},"attestation_state":"computed","paper":{"title":"Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DC","authors_text":"Colette Johnen (LaBRI), David Ilcinkas (LaBRI), St\\'ephane Devismes","submitted_at":"2017-03-09T16:04:37Z","abstract_excerpt":"We deal with the problem of maintaining a shortest-path tree rooted at some process r in a network that may be disconnected after topological changes. The goal is then to maintain a shortest-path tree rooted at r in its connected component, V\\_r, and make all processes of other components detecting that r is not part of their connected component.  We propose, in the composite atomicity model, a silent self-stabilizing algorithm for this problem working in semi-anonymous networks, where edges have strictly positive weights. This algorithm does not require any a priori knowledge about global par"},"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":"1703.03315","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-03-09T16:04:37Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"01f8677fa8aae2c0938ad0b8f80575a2eb34047460531550daca7e2df5037fbd","abstract_canon_sha256":"5dbb63523e1e7005b899511615412ce69badc7415a9a14e03d9aa24e1dec457d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:15.349702Z","signature_b64":"M/x5SPXzFMx0n05F/IgeKy4/0uKqVSAhLy0VKIq7+GTr/54xU9hIUJ4PwRFw8YZtxirGY9EmTDttLUfGVY6ZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3ba6f595e80d680b3aabaa02e4c5df525c3bfd66b539ca829b78a691360d423","last_reissued_at":"2026-05-18T00:29:15.349202Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:15.349202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DC","authors_text":"Colette Johnen (LaBRI), David Ilcinkas (LaBRI), St\\'ephane Devismes","submitted_at":"2017-03-09T16:04:37Z","abstract_excerpt":"We deal with the problem of maintaining a shortest-path tree rooted at some process r in a network that may be disconnected after topological changes. The goal is then to maintain a shortest-path tree rooted at r in its connected component, V\\_r, and make all processes of other components detecting that r is not part of their connected component.  We propose, in the composite atomicity model, a silent self-stabilizing algorithm for this problem working in semi-anonymous networks, where edges have strictly positive weights. This algorithm does not require any a priori knowledge about global par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.03315","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":"1703.03315","created_at":"2026-05-18T00:29:15.349288+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.03315v3","created_at":"2026-05-18T00:29:15.349288+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.03315","created_at":"2026-05-18T00:29:15.349288+00:00"},{"alias_kind":"pith_short_12","alias_value":"YO5G6WK6QDLI","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YO5G6WK6QDLIBM5K","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YO5G6WK6","created_at":"2026-05-18T12:31:56.362134+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/YO5G6WK6QDLIBM5KXKQC4TC56U","json":"https://pith.science/pith/YO5G6WK6QDLIBM5KXKQC4TC56U.json","graph_json":"https://pith.science/api/pith-number/YO5G6WK6QDLIBM5KXKQC4TC56U/graph.json","events_json":"https://pith.science/api/pith-number/YO5G6WK6QDLIBM5KXKQC4TC56U/events.json","paper":"https://pith.science/paper/YO5G6WK6"},"agent_actions":{"view_html":"https://pith.science/pith/YO5G6WK6QDLIBM5KXKQC4TC56U","download_json":"https://pith.science/pith/YO5G6WK6QDLIBM5KXKQC4TC56U.json","view_paper":"https://pith.science/paper/YO5G6WK6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.03315&json=true","fetch_graph":"https://pith.science/api/pith-number/YO5G6WK6QDLIBM5KXKQC4TC56U/graph.json","fetch_events":"https://pith.science/api/pith-number/YO5G6WK6QDLIBM5KXKQC4TC56U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YO5G6WK6QDLIBM5KXKQC4TC56U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YO5G6WK6QDLIBM5KXKQC4TC56U/action/storage_attestation","attest_author":"https://pith.science/pith/YO5G6WK6QDLIBM5KXKQC4TC56U/action/author_attestation","sign_citation":"https://pith.science/pith/YO5G6WK6QDLIBM5KXKQC4TC56U/action/citation_signature","submit_replication":"https://pith.science/pith/YO5G6WK6QDLIBM5KXKQC4TC56U/action/replication_record"}},"created_at":"2026-05-18T00:29:15.349288+00:00","updated_at":"2026-05-18T00:29:15.349288+00:00"}