{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:XQQX6XHONOJFGWNXV4FTIKUDLW","short_pith_number":"pith:XQQX6XHO","canonical_record":{"source":{"id":"1512.07800","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-12-24T12:06:18Z","cross_cats_sorted":[],"title_canon_sha256":"89fb6942dbf1b547fb56cca5f44c6e2188071134c49cc548328cacef5d130553","abstract_canon_sha256":"657c9eda91811339e50b4e7fb9d87c68c6c817eb6fb82af2b735eea115480a19"},"schema_version":"1.0"},"canonical_sha256":"bc217f5cee6b925359b7af0b342a835d865eb7d12c6adbdc8ce120e6cbf0d42e","source":{"kind":"arxiv","id":"1512.07800","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.07800","created_at":"2026-05-18T01:23:47Z"},{"alias_kind":"arxiv_version","alias_value":"1512.07800v1","created_at":"2026-05-18T01:23:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07800","created_at":"2026-05-18T01:23:47Z"},{"alias_kind":"pith_short_12","alias_value":"XQQX6XHONOJF","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XQQX6XHONOJFGWNX","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XQQX6XHO","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:XQQX6XHONOJFGWNXV4FTIKUDLW","target":"record","payload":{"canonical_record":{"source":{"id":"1512.07800","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-12-24T12:06:18Z","cross_cats_sorted":[],"title_canon_sha256":"89fb6942dbf1b547fb56cca5f44c6e2188071134c49cc548328cacef5d130553","abstract_canon_sha256":"657c9eda91811339e50b4e7fb9d87c68c6c817eb6fb82af2b735eea115480a19"},"schema_version":"1.0"},"canonical_sha256":"bc217f5cee6b925359b7af0b342a835d865eb7d12c6adbdc8ce120e6cbf0d42e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:47.770443Z","signature_b64":"rz1BQoK7QNa9keKR/0U3xVp3SmpNDNS/vzmV2x2/tszoftxSlaGnYEVKo0aka3taojyXh6IOuT8YGIq1S+d/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc217f5cee6b925359b7af0b342a835d865eb7d12c6adbdc8ce120e6cbf0d42e","last_reissued_at":"2026-05-18T01:23:47.769854Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:47.769854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.07800","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-18T01:23:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NHq6n+NXyJpbHCCUoVFRt1GTDy6H2x34jIkstsU10QSpDovSMA/ORUN5qlUhI9KrxSw1TFy0VxOVzCvUlu7CBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:49:15.071024Z"},"content_sha256":"cc8b575da81bf7498abd03591e190203e231d3417cb91bb0ed25e17403d2ec07","schema_version":"1.0","event_id":"sha256:cc8b575da81bf7498abd03591e190203e231d3417cb91bb0ed25e17403d2ec07"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:XQQX6XHONOJFGWNXV4FTIKUDLW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast and compact self-stabilizing verification, computation, and fault detection of an MST","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Amos Korman (LIAFA, Computer sciences Osaka University), GANG), Shay Kutten, Toshimitsu Masuzawa (Department of Information","submitted_at":"2015-12-24T12:06:18Z","abstract_excerpt":"This paper demonstrates the usefulness of distributed local verification of proofs, as a tool for the design of self-stabilizing algorithms.In particular, it introduces a somewhat generalized notion of distributed local proofs, and utilizes it for improving the time complexity significantly, while maintaining space optimality. As a result, we show that optimizing the memory size carries at most a small cost in terms of time, in the context of Minimum Spanning Tree (MST). That is, we present algorithms that are both time and space efficient  for both constructing an MST and for verifying it.Thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07800","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-18T01:23:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R3egATq1FYN9OTvzuv11R7GCBLXzEuc2ZcOvkOUliEhUJ6W6wjnvYJVkqPBiTvpBR26Ovequ7SjWKJ4uNCeJAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:49:15.071376Z"},"content_sha256":"41804638969a8122962047d39e48bea8f66c19b508850c64fe2116b0b59a9896","schema_version":"1.0","event_id":"sha256:41804638969a8122962047d39e48bea8f66c19b508850c64fe2116b0b59a9896"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XQQX6XHONOJFGWNXV4FTIKUDLW/bundle.json","state_url":"https://pith.science/pith/XQQX6XHONOJFGWNXV4FTIKUDLW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XQQX6XHONOJFGWNXV4FTIKUDLW/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-08T23:49:15Z","links":{"resolver":"https://pith.science/pith/XQQX6XHONOJFGWNXV4FTIKUDLW","bundle":"https://pith.science/pith/XQQX6XHONOJFGWNXV4FTIKUDLW/bundle.json","state":"https://pith.science/pith/XQQX6XHONOJFGWNXV4FTIKUDLW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XQQX6XHONOJFGWNXV4FTIKUDLW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XQQX6XHONOJFGWNXV4FTIKUDLW","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":"657c9eda91811339e50b4e7fb9d87c68c6c817eb6fb82af2b735eea115480a19","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-12-24T12:06:18Z","title_canon_sha256":"89fb6942dbf1b547fb56cca5f44c6e2188071134c49cc548328cacef5d130553"},"schema_version":"1.0","source":{"id":"1512.07800","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.07800","created_at":"2026-05-18T01:23:47Z"},{"alias_kind":"arxiv_version","alias_value":"1512.07800v1","created_at":"2026-05-18T01:23:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07800","created_at":"2026-05-18T01:23:47Z"},{"alias_kind":"pith_short_12","alias_value":"XQQX6XHONOJF","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XQQX6XHONOJFGWNX","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XQQX6XHO","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:41804638969a8122962047d39e48bea8f66c19b508850c64fe2116b0b59a9896","target":"graph","created_at":"2026-05-18T01:23:47Z","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":"This paper demonstrates the usefulness of distributed local verification of proofs, as a tool for the design of self-stabilizing algorithms.In particular, it introduces a somewhat generalized notion of distributed local proofs, and utilizes it for improving the time complexity significantly, while maintaining space optimality. As a result, we show that optimizing the memory size carries at most a small cost in terms of time, in the context of Minimum Spanning Tree (MST). That is, we present algorithms that are both time and space efficient  for both constructing an MST and for verifying it.Thi","authors_text":"Amos Korman (LIAFA, Computer sciences Osaka University), GANG), Shay Kutten, Toshimitsu Masuzawa (Department of Information","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-12-24T12:06:18Z","title":"Fast and compact self-stabilizing verification, computation, and fault detection of an MST"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07800","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:cc8b575da81bf7498abd03591e190203e231d3417cb91bb0ed25e17403d2ec07","target":"record","created_at":"2026-05-18T01:23:47Z","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":"657c9eda91811339e50b4e7fb9d87c68c6c817eb6fb82af2b735eea115480a19","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-12-24T12:06:18Z","title_canon_sha256":"89fb6942dbf1b547fb56cca5f44c6e2188071134c49cc548328cacef5d130553"},"schema_version":"1.0","source":{"id":"1512.07800","kind":"arxiv","version":1}},"canonical_sha256":"bc217f5cee6b925359b7af0b342a835d865eb7d12c6adbdc8ce120e6cbf0d42e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc217f5cee6b925359b7af0b342a835d865eb7d12c6adbdc8ce120e6cbf0d42e","first_computed_at":"2026-05-18T01:23:47.769854Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:47.769854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rz1BQoK7QNa9keKR/0U3xVp3SmpNDNS/vzmV2x2/tszoftxSlaGnYEVKo0aka3taojyXh6IOuT8YGIq1S+d/Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:47.770443Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.07800","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc8b575da81bf7498abd03591e190203e231d3417cb91bb0ed25e17403d2ec07","sha256:41804638969a8122962047d39e48bea8f66c19b508850c64fe2116b0b59a9896"],"state_sha256":"104b90be5ecd549b2c58b936e584cf0fb379466ab9a2d21002be9367a170906f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kv7ZALDMe99AaT9ZVDzPAafma+9ybnbJuk3xc6lPi0WzzhCoVxaXDp9fFfTV3BEJCf3F/rPhxo04Q0WQfb/hBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T23:49:15.073172Z","bundle_sha256":"7f27a9fc96feebf7be3991b94f9f6f1145fea8a021f48ee89e37112f03f52d1b"}}