{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:PYFCEJ4UQFRLXNMIB6OXNL75BC","short_pith_number":"pith:PYFCEJ4U","canonical_record":{"source":{"id":"1104.5368","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-04-28T12:14:53Z","cross_cats_sorted":[],"title_canon_sha256":"4b99c3debc9c6218a71c966af2941c4b61c5bacdbfe20f49cc9e1a597701d342","abstract_canon_sha256":"23bce40d2812241beeab6172c36c7e2135bc1bcdfef2ebfb4a70375f5ebe2d05"},"schema_version":"1.0"},"canonical_sha256":"7e0a2227948162bbb5880f9d76affd08ad434770a28be5e4a5ee20d1147f3177","source":{"kind":"arxiv","id":"1104.5368","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.5368","created_at":"2026-05-18T04:23:21Z"},{"alias_kind":"arxiv_version","alias_value":"1104.5368v1","created_at":"2026-05-18T04:23:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.5368","created_at":"2026-05-18T04:23:21Z"},{"alias_kind":"pith_short_12","alias_value":"PYFCEJ4UQFRL","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PYFCEJ4UQFRLXNMI","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PYFCEJ4U","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:PYFCEJ4UQFRLXNMIB6OXNL75BC","target":"record","payload":{"canonical_record":{"source":{"id":"1104.5368","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-04-28T12:14:53Z","cross_cats_sorted":[],"title_canon_sha256":"4b99c3debc9c6218a71c966af2941c4b61c5bacdbfe20f49cc9e1a597701d342","abstract_canon_sha256":"23bce40d2812241beeab6172c36c7e2135bc1bcdfef2ebfb4a70375f5ebe2d05"},"schema_version":"1.0"},"canonical_sha256":"7e0a2227948162bbb5880f9d76affd08ad434770a28be5e4a5ee20d1147f3177","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:21.621974Z","signature_b64":"fzNd5SvGsJoaBIRPY7+2tCQgh6pTs0m1CBDS5cgn7/Zfu6NIVRNHgU7PMYaJyDPK1aZr5XJ94GCdt9PVPriTDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e0a2227948162bbb5880f9d76affd08ad434770a28be5e4a5ee20d1147f3177","last_reissued_at":"2026-05-18T04:23:21.621411Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:21.621411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.5368","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-18T04:23:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mfzFYcF7SgoBpv/GRJ4Gs3fdQuZ1FXg5M4H0hvxN3lVo01mmGluQWQ3updIaP7NCxzfkMZk7RkL9swBuTWZcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T21:27:16.519267Z"},"content_sha256":"f250c39ec529763aa2177c437463ea270d7632da25f532f00f133d50b7887b92","schema_version":"1.0","event_id":"sha256:f250c39ec529763aa2177c437463ea270d7632da25f532f00f133d50b7887b92"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:PYFCEJ4UQFRLXNMIB6OXNL75BC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum Metric Spanning Tree made Byzantine Tolerant","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Computer sciences Osaka University), INRIA Rocquencourt), IUF), S\\'ebastien Tixeuil (LIP6, Swan Dubois (LIP6, Toshimitsu Masuzawa (Department of Information","submitted_at":"2011-04-28T12:14:53Z","abstract_excerpt":"Self-stabilization is a versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of all memories in the system. Byzantine tolerance is an attractive feature of distributed systems that permits to cope with arbitrary malicious behaviors. This paper focus on systems that are both self-stabilizing and Byzantine tolerant. We consider the well known problem of constructing a maximum metric tree in this context. Combining these two properties is known to induce many impossibility results. In this paper, we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.5368","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-18T04:23:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+zjSlRk4+FplRZ1jaQ0Fm1ALuEOhWaNRY4jg1KGNlHFQpodaz7B98cKBCbJB9LLvFQmQJzTPy3ZZ3HFM9g/fCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T21:27:16.520007Z"},"content_sha256":"a95174b9684ba73ba18630fc7b6cf6d7832ac12efdf72e2decc63011066d30c7","schema_version":"1.0","event_id":"sha256:a95174b9684ba73ba18630fc7b6cf6d7832ac12efdf72e2decc63011066d30c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PYFCEJ4UQFRLXNMIB6OXNL75BC/bundle.json","state_url":"https://pith.science/pith/PYFCEJ4UQFRLXNMIB6OXNL75BC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PYFCEJ4UQFRLXNMIB6OXNL75BC/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-24T21:27:16Z","links":{"resolver":"https://pith.science/pith/PYFCEJ4UQFRLXNMIB6OXNL75BC","bundle":"https://pith.science/pith/PYFCEJ4UQFRLXNMIB6OXNL75BC/bundle.json","state":"https://pith.science/pith/PYFCEJ4UQFRLXNMIB6OXNL75BC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PYFCEJ4UQFRLXNMIB6OXNL75BC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:PYFCEJ4UQFRLXNMIB6OXNL75BC","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":"23bce40d2812241beeab6172c36c7e2135bc1bcdfef2ebfb4a70375f5ebe2d05","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-04-28T12:14:53Z","title_canon_sha256":"4b99c3debc9c6218a71c966af2941c4b61c5bacdbfe20f49cc9e1a597701d342"},"schema_version":"1.0","source":{"id":"1104.5368","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.5368","created_at":"2026-05-18T04:23:21Z"},{"alias_kind":"arxiv_version","alias_value":"1104.5368v1","created_at":"2026-05-18T04:23:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.5368","created_at":"2026-05-18T04:23:21Z"},{"alias_kind":"pith_short_12","alias_value":"PYFCEJ4UQFRL","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PYFCEJ4UQFRLXNMI","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PYFCEJ4U","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:a95174b9684ba73ba18630fc7b6cf6d7832ac12efdf72e2decc63011066d30c7","target":"graph","created_at":"2026-05-18T04:23:21Z","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":"Self-stabilization is a versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of all memories in the system. Byzantine tolerance is an attractive feature of distributed systems that permits to cope with arbitrary malicious behaviors. This paper focus on systems that are both self-stabilizing and Byzantine tolerant. We consider the well known problem of constructing a maximum metric tree in this context. Combining these two properties is known to induce many impossibility results. In this paper, we ","authors_text":"Computer sciences Osaka University), INRIA Rocquencourt), IUF), S\\'ebastien Tixeuil (LIP6, Swan Dubois (LIP6, Toshimitsu Masuzawa (Department of Information","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-04-28T12:14:53Z","title":"Maximum Metric Spanning Tree made Byzantine Tolerant"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.5368","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:f250c39ec529763aa2177c437463ea270d7632da25f532f00f133d50b7887b92","target":"record","created_at":"2026-05-18T04:23:21Z","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":"23bce40d2812241beeab6172c36c7e2135bc1bcdfef2ebfb4a70375f5ebe2d05","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-04-28T12:14:53Z","title_canon_sha256":"4b99c3debc9c6218a71c966af2941c4b61c5bacdbfe20f49cc9e1a597701d342"},"schema_version":"1.0","source":{"id":"1104.5368","kind":"arxiv","version":1}},"canonical_sha256":"7e0a2227948162bbb5880f9d76affd08ad434770a28be5e4a5ee20d1147f3177","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e0a2227948162bbb5880f9d76affd08ad434770a28be5e4a5ee20d1147f3177","first_computed_at":"2026-05-18T04:23:21.621411Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:23:21.621411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fzNd5SvGsJoaBIRPY7+2tCQgh6pTs0m1CBDS5cgn7/Zfu6NIVRNHgU7PMYaJyDPK1aZr5XJ94GCdt9PVPriTDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:23:21.621974Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.5368","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f250c39ec529763aa2177c437463ea270d7632da25f532f00f133d50b7887b92","sha256:a95174b9684ba73ba18630fc7b6cf6d7832ac12efdf72e2decc63011066d30c7"],"state_sha256":"204ee1515574337c6d1c81605b8235bed5d1c00782e209d6ef6cb5719c44ccad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cR6ck9mx7Gp5kXAKMCzHn0E22Zg8jkUaa7eGvar2vUjusKlkBN0Vq/UxY5NwJeTslTEV4hdsbN9fnshWPyQSBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T21:27:16.523555Z","bundle_sha256":"7931f3384d0dd44be158bc20eaff96e5f8241a97453e475dd2656b67720b59d4"}}