{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SJHQIAHLJZI43S2JFSK6WL3ZUN","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":"5a4a35bbb82f2c5c27e26f8ebbdb3f416470cdb364bd157586f6a1183d2e1f6c","cross_cats_sorted":["cs.DS","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-12-06T19:04:02Z","title_canon_sha256":"7c77ac933a56965108f0026bcaa77bff2000230a1991e7855f049c20e247f3c2"},"schema_version":"1.0","source":{"id":"1312.1961","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1961","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1961v2","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1961","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"pith_short_12","alias_value":"SJHQIAHLJZI4","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SJHQIAHLJZI43S2J","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SJHQIAHL","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:4240af6c55932ff0b9dfd4f47c90c133c33abe3210c5d3537679ace62e721305","target":"graph","created_at":"2026-05-18T03:05:00Z","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 new algorithm, which solves the problem of distributively finding a minimum diameter spanning tree of any (non-negatively) real-weighted graph $G = (V,E,\\omega)$. As an intermediate step, we use a new, fast, linear-time all-pairs shortest paths distributed algorithm to find an absolute center of $G$. The resulting distributed algorithm is asynchronous, it works for named asynchronous arbitrary networks and achieves $\\mathcal{O}(|V|)$ time complexity and $\\mathcal{O}\\left(|V|\\,|E|\\right)$","authors_text":"Christian Lavault (LIPN), Franck Butelle (LIPN), Marc Bui (CHART)","cross_cats":["cs.DS","cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-12-06T19:04:02Z","title":"A Distributed Algorithm for Constructing a Minimum Diameter Spanning Tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1961","kind":"arxiv","version":2},"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:0e6b6b3a8047b440044cee6db0c349125f6ff33aa2f8dd40464bd49335ec41dd","target":"record","created_at":"2026-05-18T03:05:00Z","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":"5a4a35bbb82f2c5c27e26f8ebbdb3f416470cdb364bd157586f6a1183d2e1f6c","cross_cats_sorted":["cs.DS","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-12-06T19:04:02Z","title_canon_sha256":"7c77ac933a56965108f0026bcaa77bff2000230a1991e7855f049c20e247f3c2"},"schema_version":"1.0","source":{"id":"1312.1961","kind":"arxiv","version":2}},"canonical_sha256":"924f0400eb4e51cdcb492c95eb2f79a34a8c60bc1a7aae04e1b9dba7fcd1560f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"924f0400eb4e51cdcb492c95eb2f79a34a8c60bc1a7aae04e1b9dba7fcd1560f","first_computed_at":"2026-05-18T03:05:00.952434Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:00.952434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"55Ito4CWlSVed3qf71op1cSfjBeBZ8vvGeaUfj9b1DLzu8T+b0ZkOp4+n87g99vGjHUpa+8iDY2ZTw6BZZX9Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:00.952919Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.1961","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e6b6b3a8047b440044cee6db0c349125f6ff33aa2f8dd40464bd49335ec41dd","sha256:4240af6c55932ff0b9dfd4f47c90c133c33abe3210c5d3537679ace62e721305"],"state_sha256":"4a113e524065f526889623303f50cf7910145d8aec76523d583ab46e06b63432"}