{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:K5CTSM4DWBGGQZUIGHSCILNOQ4","short_pith_number":"pith:K5CTSM4D","schema_version":"1.0","canonical_sha256":"5745393383b04c68668831e4242dae871bd207e1f24b4b05dc3f0e3b7b6fbd26","source":{"kind":"arxiv","id":"1907.07944","version":1},"attestation_state":"computed","paper":{"title":"Analysis of a Memory-Efficient Self-Stabilizing BFS Spanning Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ajoy K. Datta, Colette Johnen, Lawrence L. Larmore, St\\'ephane Devismes","submitted_at":"2019-07-18T09:24:26Z","abstract_excerpt":"We present results on the last topic we collaborate with our late friend, Professor Ajoy Kumar Datta (1958-2019).\n  In this work, we shed new light on a self-stabilizing wave algorithm proposed by Colette Johnen in 1997. This algorithm constructs a BFS spanning tree in any connected rooted network. Nowadays, it is still the best existing self-stabilizing BFS spanning tree construction in terms of memory requirement, {\\em i.e.}, it only requires $\\Theta(1)$ bits per edge. However, it has been proven assuming a weakly fair daemon. Moreover, its stabilization time was unknown.\n  Here, we study th"},"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":"1907.07944","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-07-18T09:24:26Z","cross_cats_sorted":[],"title_canon_sha256":"982721c9b86ba1dda813c25c5409f6e7fe5d9193d211761f27995dcbc98f0d98","abstract_canon_sha256":"3c4876e2e2fd9cacdab50eb8f105a74b9f7c03ed244d7b4fe1ae921dcdffc5a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:15.643353Z","signature_b64":"pRGyvIm7+E0yiKrkkRCFW/xcYTDSkncIB8FLTSXuVyHLnzf1+zR1A7uj9WZFDWEgvVXronGsSbDpPsSXxtKWDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5745393383b04c68668831e4242dae871bd207e1f24b4b05dc3f0e3b7b6fbd26","last_reissued_at":"2026-05-17T23:40:15.642667Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:15.642667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analysis of a Memory-Efficient Self-Stabilizing BFS Spanning Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ajoy K. Datta, Colette Johnen, Lawrence L. Larmore, St\\'ephane Devismes","submitted_at":"2019-07-18T09:24:26Z","abstract_excerpt":"We present results on the last topic we collaborate with our late friend, Professor Ajoy Kumar Datta (1958-2019).\n  In this work, we shed new light on a self-stabilizing wave algorithm proposed by Colette Johnen in 1997. This algorithm constructs a BFS spanning tree in any connected rooted network. Nowadays, it is still the best existing self-stabilizing BFS spanning tree construction in terms of memory requirement, {\\em i.e.}, it only requires $\\Theta(1)$ bits per edge. However, it has been proven assuming a weakly fair daemon. Moreover, its stabilization time was unknown.\n  Here, we study th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07944","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":"1907.07944","created_at":"2026-05-17T23:40:15.642775+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.07944v1","created_at":"2026-05-17T23:40:15.642775+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07944","created_at":"2026-05-17T23:40:15.642775+00:00"},{"alias_kind":"pith_short_12","alias_value":"K5CTSM4DWBGG","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"K5CTSM4DWBGGQZUI","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"K5CTSM4D","created_at":"2026-05-18T12:33:21.387695+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/K5CTSM4DWBGGQZUIGHSCILNOQ4","json":"https://pith.science/pith/K5CTSM4DWBGGQZUIGHSCILNOQ4.json","graph_json":"https://pith.science/api/pith-number/K5CTSM4DWBGGQZUIGHSCILNOQ4/graph.json","events_json":"https://pith.science/api/pith-number/K5CTSM4DWBGGQZUIGHSCILNOQ4/events.json","paper":"https://pith.science/paper/K5CTSM4D"},"agent_actions":{"view_html":"https://pith.science/pith/K5CTSM4DWBGGQZUIGHSCILNOQ4","download_json":"https://pith.science/pith/K5CTSM4DWBGGQZUIGHSCILNOQ4.json","view_paper":"https://pith.science/paper/K5CTSM4D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.07944&json=true","fetch_graph":"https://pith.science/api/pith-number/K5CTSM4DWBGGQZUIGHSCILNOQ4/graph.json","fetch_events":"https://pith.science/api/pith-number/K5CTSM4DWBGGQZUIGHSCILNOQ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K5CTSM4DWBGGQZUIGHSCILNOQ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K5CTSM4DWBGGQZUIGHSCILNOQ4/action/storage_attestation","attest_author":"https://pith.science/pith/K5CTSM4DWBGGQZUIGHSCILNOQ4/action/author_attestation","sign_citation":"https://pith.science/pith/K5CTSM4DWBGGQZUIGHSCILNOQ4/action/citation_signature","submit_replication":"https://pith.science/pith/K5CTSM4DWBGGQZUIGHSCILNOQ4/action/replication_record"}},"created_at":"2026-05-17T23:40:15.642775+00:00","updated_at":"2026-05-17T23:40:15.642775+00:00"}