{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HFREUK67IQ6OLUESHYJOKFVQMA","short_pith_number":"pith:HFREUK67","canonical_record":{"source":{"id":"1311.0798","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-11-04T18:17:47Z","cross_cats_sorted":["cs.DS","cs.NI"],"title_canon_sha256":"5c353a3f4d1f487629e47de1e9532457c268c31fd2c371040e512cee5f7a46be","abstract_canon_sha256":"fc303b32df7a63e9aad8dfb2faa252585e6f3c8ad2e7fc369691c31f3d97dc65"},"schema_version":"1.0"},"canonical_sha256":"39624a2bdf443ce5d0923e12e516b0603b7ce130fdd7c7cdc1f6404f788ed82b","source":{"kind":"arxiv","id":"1311.0798","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.0798","created_at":"2026-05-18T03:08:04Z"},{"alias_kind":"arxiv_version","alias_value":"1311.0798v1","created_at":"2026-05-18T03:08:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0798","created_at":"2026-05-18T03:08:04Z"},{"alias_kind":"pith_short_12","alias_value":"HFREUK67IQ6O","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HFREUK67IQ6OLUES","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HFREUK67","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HFREUK67IQ6OLUESHYJOKFVQMA","target":"record","payload":{"canonical_record":{"source":{"id":"1311.0798","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-11-04T18:17:47Z","cross_cats_sorted":["cs.DS","cs.NI"],"title_canon_sha256":"5c353a3f4d1f487629e47de1e9532457c268c31fd2c371040e512cee5f7a46be","abstract_canon_sha256":"fc303b32df7a63e9aad8dfb2faa252585e6f3c8ad2e7fc369691c31f3d97dc65"},"schema_version":"1.0"},"canonical_sha256":"39624a2bdf443ce5d0923e12e516b0603b7ce130fdd7c7cdc1f6404f788ed82b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:04.807736Z","signature_b64":"G7UTtdnWqLRIu83oDqxN5I4299MYUsxYfCXH6djwULDrMD/itAsssX10swCewlKCPye1f9rRCyvKHzLB6NSvDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39624a2bdf443ce5d0923e12e516b0603b7ce130fdd7c7cdc1f6404f788ed82b","last_reissued_at":"2026-05-18T03:08:04.807115Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:04.807115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.0798","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-18T03:08:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LeHLh8wmvliy/quFOLLctxGF1G6O6zW04mJrkCuPGkVzQ0TBixsyaGSl9zoO7gQmzTL3pqLqFKpM9RnucjnbAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T14:10:07.466882Z"},"content_sha256":"0f205cc1a2e4d128ad4d04c3f5f89227a3dfa83535e8b9229b1c0e838105ea8d","schema_version":"1.0","event_id":"sha256:0f205cc1a2e4d128ad4d04c3f5f89227a3dfa83535e8b9229b1c0e838105ea8d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HFREUK67IQ6OLUESHYJOKFVQMA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Self-Stabilizing Minimum Spanning Tree Construction Using Compact Nearest Common Ancestor Labeling Scheme","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.NI"],"primary_cat":"cs.DC","authors_text":"L\\'elia Blin (LIP6), Maria Gradinariu Potop-Butucaru (LIP6), Shlomi Dolev, Stephane Rovedakis (CEDRIC)","submitted_at":"2013-11-04T18:17:47Z","abstract_excerpt":"We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is $O(\\log^2n)$ bits and it converges in $O(n^2)$ rounds. Thus, this algorithm improves the convergence time of previously known self-stabilizing asynchronous MST algorithms by a multiplicative factor $\\Theta(n)$, to the price of increasing the best known space complexity by a factor $O(\\log n)$. The main ingredient used in our algorithm is the design, for the first time in self-stabilizing settings, of a labeling scheme for computing the nearest common ancestor with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.0798","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-18T03:08:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jwvOhzpyYW5DpkVva4EAJdlDLDb+lhO0MVF65SPIZDb+tKjlHthvZsSJio5gaO3LgQaaBFuB7b9GG7/be9AABw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T14:10:07.467223Z"},"content_sha256":"a785e360cdb23f9fba11c3ff51eb0379f99223cadff86e54843325acca495bb2","schema_version":"1.0","event_id":"sha256:a785e360cdb23f9fba11c3ff51eb0379f99223cadff86e54843325acca495bb2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HFREUK67IQ6OLUESHYJOKFVQMA/bundle.json","state_url":"https://pith.science/pith/HFREUK67IQ6OLUESHYJOKFVQMA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HFREUK67IQ6OLUESHYJOKFVQMA/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-06-24T14:10:07Z","links":{"resolver":"https://pith.science/pith/HFREUK67IQ6OLUESHYJOKFVQMA","bundle":"https://pith.science/pith/HFREUK67IQ6OLUESHYJOKFVQMA/bundle.json","state":"https://pith.science/pith/HFREUK67IQ6OLUESHYJOKFVQMA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HFREUK67IQ6OLUESHYJOKFVQMA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HFREUK67IQ6OLUESHYJOKFVQMA","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":"fc303b32df7a63e9aad8dfb2faa252585e6f3c8ad2e7fc369691c31f3d97dc65","cross_cats_sorted":["cs.DS","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-11-04T18:17:47Z","title_canon_sha256":"5c353a3f4d1f487629e47de1e9532457c268c31fd2c371040e512cee5f7a46be"},"schema_version":"1.0","source":{"id":"1311.0798","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.0798","created_at":"2026-05-18T03:08:04Z"},{"alias_kind":"arxiv_version","alias_value":"1311.0798v1","created_at":"2026-05-18T03:08:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0798","created_at":"2026-05-18T03:08:04Z"},{"alias_kind":"pith_short_12","alias_value":"HFREUK67IQ6O","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HFREUK67IQ6OLUES","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HFREUK67","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:a785e360cdb23f9fba11c3ff51eb0379f99223cadff86e54843325acca495bb2","target":"graph","created_at":"2026-05-18T03:08:04Z","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 novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is $O(\\log^2n)$ bits and it converges in $O(n^2)$ rounds. Thus, this algorithm improves the convergence time of previously known self-stabilizing asynchronous MST algorithms by a multiplicative factor $\\Theta(n)$, to the price of increasing the best known space complexity by a factor $O(\\log n)$. The main ingredient used in our algorithm is the design, for the first time in self-stabilizing settings, of a labeling scheme for computing the nearest common ancestor with","authors_text":"L\\'elia Blin (LIP6), Maria Gradinariu Potop-Butucaru (LIP6), Shlomi Dolev, Stephane Rovedakis (CEDRIC)","cross_cats":["cs.DS","cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-11-04T18:17:47Z","title":"Fast Self-Stabilizing Minimum Spanning Tree Construction Using Compact Nearest Common Ancestor Labeling Scheme"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.0798","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:0f205cc1a2e4d128ad4d04c3f5f89227a3dfa83535e8b9229b1c0e838105ea8d","target":"record","created_at":"2026-05-18T03:08:04Z","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":"fc303b32df7a63e9aad8dfb2faa252585e6f3c8ad2e7fc369691c31f3d97dc65","cross_cats_sorted":["cs.DS","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-11-04T18:17:47Z","title_canon_sha256":"5c353a3f4d1f487629e47de1e9532457c268c31fd2c371040e512cee5f7a46be"},"schema_version":"1.0","source":{"id":"1311.0798","kind":"arxiv","version":1}},"canonical_sha256":"39624a2bdf443ce5d0923e12e516b0603b7ce130fdd7c7cdc1f6404f788ed82b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39624a2bdf443ce5d0923e12e516b0603b7ce130fdd7c7cdc1f6404f788ed82b","first_computed_at":"2026-05-18T03:08:04.807115Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:08:04.807115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G7UTtdnWqLRIu83oDqxN5I4299MYUsxYfCXH6djwULDrMD/itAsssX10swCewlKCPye1f9rRCyvKHzLB6NSvDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:08:04.807736Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.0798","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f205cc1a2e4d128ad4d04c3f5f89227a3dfa83535e8b9229b1c0e838105ea8d","sha256:a785e360cdb23f9fba11c3ff51eb0379f99223cadff86e54843325acca495bb2"],"state_sha256":"27e17c1aaa46db8db61c37a81f83496823bf2323401bb1c1c5dce83f6edee3b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QgtA/kIDgkrS6LXWgIv8gV+kNeqkGJsMNph8dCwHrbEcTPMKkwNHDp1sdeJ1icMB9Hr6lc3Ae88lmJMR03tiBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T14:10:07.469235Z","bundle_sha256":"4c2ef54fcf1938bf39cf3588b2d99ff2f17396ac263d734ebf9d83ae001644a1"}}