{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CSCQLHNTSOVEAESFBA5CVUUKO7","short_pith_number":"pith:CSCQLHNT","canonical_record":{"source":{"id":"1809.02436","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-09-07T12:26:37Z","cross_cats_sorted":[],"title_canon_sha256":"e75ce006dead56bc65befea1ac231e466c1df10265265e875c06c877bc39f2c6","abstract_canon_sha256":"86d5066c5c715aebc1846a653d3064e8752849612c96600071aedc61921aba8b"},"schema_version":"1.0"},"canonical_sha256":"1485059db393aa401245083a2ad28a77f495181069a3ecdf04a92c81ce332fa5","source":{"kind":"arxiv","id":"1809.02436","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.02436","created_at":"2026-05-18T00:06:17Z"},{"alias_kind":"arxiv_version","alias_value":"1809.02436v1","created_at":"2026-05-18T00:06:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02436","created_at":"2026-05-18T00:06:17Z"},{"alias_kind":"pith_short_12","alias_value":"CSCQLHNTSOVE","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"CSCQLHNTSOVEAESF","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"CSCQLHNT","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CSCQLHNTSOVEAESFBA5CVUUKO7","target":"record","payload":{"canonical_record":{"source":{"id":"1809.02436","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-09-07T12:26:37Z","cross_cats_sorted":[],"title_canon_sha256":"e75ce006dead56bc65befea1ac231e466c1df10265265e875c06c877bc39f2c6","abstract_canon_sha256":"86d5066c5c715aebc1846a653d3064e8752849612c96600071aedc61921aba8b"},"schema_version":"1.0"},"canonical_sha256":"1485059db393aa401245083a2ad28a77f495181069a3ecdf04a92c81ce332fa5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:17.119163Z","signature_b64":"LoScToikPo0wMhdYSbYsndGZTfCzg4jfZyvRkS7p+Rf9ErUYhBjSy+WywY5YW++m7ieWP1g9EwUltQv2Rc6zBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1485059db393aa401245083a2ad28a77f495181069a3ecdf04a92c81ce332fa5","last_reissued_at":"2026-05-18T00:06:17.118605Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:17.118605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.02436","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-18T00:06:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VYJyVM0/FBJGlMm7LY6TMmpRrkqhO4aNczT0bD7CkQR+kzRwNjMP4I8A47FTey50Gq8NBs4C18kKpvN1Y+8xCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:09:50.559246Z"},"content_sha256":"ed7b9ae091111ebb77b2af30c6cb10f06cbc3b0cff93a71a1b5bc595eaa67962","schema_version":"1.0","event_id":"sha256:ed7b9ae091111ebb77b2af30c6cb10f06cbc3b0cff93a71a1b5bc595eaa67962"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CSCQLHNTSOVEAESFBA5CVUUKO7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Underlay-Aware Self-Stabilizing Overlay Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexander Setzer, Christian Scheideler, Thorsten G\\\"otte","submitted_at":"2018-09-07T12:26:37Z","abstract_excerpt":"We present a self-stabilizing protocol for an overlay network that constructs the Minimum Spanning Tree (MST) for an underlay that is modeled by a weighted tree. The weight of an overlay edge between two nodes is the weighted length of their shortest path in the tree. We rigorously prove that our protocol works correctly under asynchronous and non-FIFO message delivery. Further, the protocol stabilizes after $\\mathcal{O}(N^2)$ asynchronous rounds where $N$ is the number of nodes in the overlay."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02436","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-18T00:06:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cVKmA7ag5ARszLxGniQK/AlgFCZ9GqGWDDB/CbSVGCPUdmA+VhoQbrEGWHqZzVN4RpGwt43dHEU0MuqzVMjMAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:09:50.559607Z"},"content_sha256":"e1c53ad9db4fc11f73ef6ec3827ce396698370273e05d46ee9cbe3f1f6e64b03","schema_version":"1.0","event_id":"sha256:e1c53ad9db4fc11f73ef6ec3827ce396698370273e05d46ee9cbe3f1f6e64b03"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CSCQLHNTSOVEAESFBA5CVUUKO7/bundle.json","state_url":"https://pith.science/pith/CSCQLHNTSOVEAESFBA5CVUUKO7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CSCQLHNTSOVEAESFBA5CVUUKO7/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-05-28T14:09:50Z","links":{"resolver":"https://pith.science/pith/CSCQLHNTSOVEAESFBA5CVUUKO7","bundle":"https://pith.science/pith/CSCQLHNTSOVEAESFBA5CVUUKO7/bundle.json","state":"https://pith.science/pith/CSCQLHNTSOVEAESFBA5CVUUKO7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CSCQLHNTSOVEAESFBA5CVUUKO7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CSCQLHNTSOVEAESFBA5CVUUKO7","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":"86d5066c5c715aebc1846a653d3064e8752849612c96600071aedc61921aba8b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-09-07T12:26:37Z","title_canon_sha256":"e75ce006dead56bc65befea1ac231e466c1df10265265e875c06c877bc39f2c6"},"schema_version":"1.0","source":{"id":"1809.02436","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.02436","created_at":"2026-05-18T00:06:17Z"},{"alias_kind":"arxiv_version","alias_value":"1809.02436v1","created_at":"2026-05-18T00:06:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02436","created_at":"2026-05-18T00:06:17Z"},{"alias_kind":"pith_short_12","alias_value":"CSCQLHNTSOVE","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"CSCQLHNTSOVEAESF","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"CSCQLHNT","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:e1c53ad9db4fc11f73ef6ec3827ce396698370273e05d46ee9cbe3f1f6e64b03","target":"graph","created_at":"2026-05-18T00:06:17Z","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":"We present a self-stabilizing protocol for an overlay network that constructs the Minimum Spanning Tree (MST) for an underlay that is modeled by a weighted tree. The weight of an overlay edge between two nodes is the weighted length of their shortest path in the tree. We rigorously prove that our protocol works correctly under asynchronous and non-FIFO message delivery. Further, the protocol stabilizes after $\\mathcal{O}(N^2)$ asynchronous rounds where $N$ is the number of nodes in the overlay.","authors_text":"Alexander Setzer, Christian Scheideler, Thorsten G\\\"otte","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-09-07T12:26:37Z","title":"On Underlay-Aware Self-Stabilizing Overlay Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02436","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:ed7b9ae091111ebb77b2af30c6cb10f06cbc3b0cff93a71a1b5bc595eaa67962","target":"record","created_at":"2026-05-18T00:06:17Z","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":"86d5066c5c715aebc1846a653d3064e8752849612c96600071aedc61921aba8b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-09-07T12:26:37Z","title_canon_sha256":"e75ce006dead56bc65befea1ac231e466c1df10265265e875c06c877bc39f2c6"},"schema_version":"1.0","source":{"id":"1809.02436","kind":"arxiv","version":1}},"canonical_sha256":"1485059db393aa401245083a2ad28a77f495181069a3ecdf04a92c81ce332fa5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1485059db393aa401245083a2ad28a77f495181069a3ecdf04a92c81ce332fa5","first_computed_at":"2026-05-18T00:06:17.118605Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:17.118605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LoScToikPo0wMhdYSbYsndGZTfCzg4jfZyvRkS7p+Rf9ErUYhBjSy+WywY5YW++m7ieWP1g9EwUltQv2Rc6zBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:17.119163Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.02436","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed7b9ae091111ebb77b2af30c6cb10f06cbc3b0cff93a71a1b5bc595eaa67962","sha256:e1c53ad9db4fc11f73ef6ec3827ce396698370273e05d46ee9cbe3f1f6e64b03"],"state_sha256":"8d26ac679b7620a00a6dc5c7057489609a7be56775b50fcdbbc19952655c2ba8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l0aPdJPQ82C4/B2P9UmHc0p5pbuHk06pIwvXRHGaUbWO9Sbl9A65+IwR7MH248fCbvAtk6WayBjDmeY5YaxuCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T14:09:50.561523Z","bundle_sha256":"9ce48290e28e42f5db5bc558503e264e987fd95578d111fb7d532305041970db"}}