{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ORTRSBI6K6OCEUYFF5O3BJRYQ7","short_pith_number":"pith:ORTRSBI6","schema_version":"1.0","canonical_sha256":"746719051e579c2253052f5db0a63887fcbfeac89fe9035450055da2b5e2ae6a","source":{"kind":"arxiv","id":"1402.2496","version":1},"attestation_state":"computed","paper":{"title":"Polynomial-Time Space-Optimal Silent Self-Stabilizing Minimum-Degree Spanning Tree Construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"L\\'elia Blin, Pierre Fraigniaud","submitted_at":"2014-02-11T14:19:00Z","abstract_excerpt":"Motivated by applications to sensor networks, as well as to many other areas, this paper studies the construction of minimum-degree spanning trees. We consider the classical node-register state model, with a weakly fair scheduler, and we present a space-optimal \\emph{silent} self-stabilizing construction of minimum-degree spanning trees in this model. Computing a spanning tree with minimum degree is NP-hard. Therefore, we actually focus on constructing a spanning tree whose degree is within one from the optimal. Our algorithm uses registers on $O(\\log n)$ bits, converges in a polynomial number"},"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":"1402.2496","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-02-11T14:19:00Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b78104cb52855c5665801c56be4d62241b5fc8f0888578cea10ff204c00a09af","abstract_canon_sha256":"9e523410d60aaabee151b6eb752a6d408e81eb5969886fd744327493d4cf2d13"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:19.586407Z","signature_b64":"q6ZUS+KIEW0HsE2lP8dHBvt/YYq00wQUpga85A9c1bkPtmVtjaJC7BMYn1acz5YB+b5j4QiLM55hofrOZ11qCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"746719051e579c2253052f5db0a63887fcbfeac89fe9035450055da2b5e2ae6a","last_reissued_at":"2026-05-18T02:59:19.585609Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:19.585609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial-Time Space-Optimal Silent Self-Stabilizing Minimum-Degree Spanning Tree Construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"L\\'elia Blin, Pierre Fraigniaud","submitted_at":"2014-02-11T14:19:00Z","abstract_excerpt":"Motivated by applications to sensor networks, as well as to many other areas, this paper studies the construction of minimum-degree spanning trees. We consider the classical node-register state model, with a weakly fair scheduler, and we present a space-optimal \\emph{silent} self-stabilizing construction of minimum-degree spanning trees in this model. Computing a spanning tree with minimum degree is NP-hard. Therefore, we actually focus on constructing a spanning tree whose degree is within one from the optimal. Our algorithm uses registers on $O(\\log n)$ bits, converges in a polynomial number"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2496","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":"1402.2496","created_at":"2026-05-18T02:59:19.585724+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.2496v1","created_at":"2026-05-18T02:59:19.585724+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2496","created_at":"2026-05-18T02:59:19.585724+00:00"},{"alias_kind":"pith_short_12","alias_value":"ORTRSBI6K6OC","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"ORTRSBI6K6OCEUYF","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"ORTRSBI6","created_at":"2026-05-18T12:28:43.426989+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/ORTRSBI6K6OCEUYFF5O3BJRYQ7","json":"https://pith.science/pith/ORTRSBI6K6OCEUYFF5O3BJRYQ7.json","graph_json":"https://pith.science/api/pith-number/ORTRSBI6K6OCEUYFF5O3BJRYQ7/graph.json","events_json":"https://pith.science/api/pith-number/ORTRSBI6K6OCEUYFF5O3BJRYQ7/events.json","paper":"https://pith.science/paper/ORTRSBI6"},"agent_actions":{"view_html":"https://pith.science/pith/ORTRSBI6K6OCEUYFF5O3BJRYQ7","download_json":"https://pith.science/pith/ORTRSBI6K6OCEUYFF5O3BJRYQ7.json","view_paper":"https://pith.science/paper/ORTRSBI6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.2496&json=true","fetch_graph":"https://pith.science/api/pith-number/ORTRSBI6K6OCEUYFF5O3BJRYQ7/graph.json","fetch_events":"https://pith.science/api/pith-number/ORTRSBI6K6OCEUYFF5O3BJRYQ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ORTRSBI6K6OCEUYFF5O3BJRYQ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ORTRSBI6K6OCEUYFF5O3BJRYQ7/action/storage_attestation","attest_author":"https://pith.science/pith/ORTRSBI6K6OCEUYFF5O3BJRYQ7/action/author_attestation","sign_citation":"https://pith.science/pith/ORTRSBI6K6OCEUYFF5O3BJRYQ7/action/citation_signature","submit_replication":"https://pith.science/pith/ORTRSBI6K6OCEUYFF5O3BJRYQ7/action/replication_record"}},"created_at":"2026-05-18T02:59:19.585724+00:00","updated_at":"2026-05-18T02:59:19.585724+00:00"}