{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2002:A6EVE72VERNCVJK5XZOW2KMVSW","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":"7720a9de2ab6a3760caf635a4df85fbbff5db1bdd8370379cc50578b1c79d3c4","cross_cats_sorted":["cs.DM"],"license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T18:08:46Z","title_canon_sha256":"f503311eec120116b9931a46551f058fe1121f95fa04c2f10bdaf66497a1df9b"},"schema_version":"1.0","source":{"id":"cs/0205045","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0205045","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0205045v1","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0205045","created_at":"2026-05-18T01:59:53Z"},{"alias_kind":"pith_short_12","alias_value":"A6EVE72VERNC","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_16","alias_value":"A6EVE72VERNCVJK5","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_8","alias_value":"A6EVE72V","created_at":"2026-05-18T12:25:50Z"}],"graph_snapshots":[{"event_id":"sha256:1654cf8e6c53a59c7d39a22c34059e5a250dcc3fa14ef1a26a418b46d9df9ead","target":"graph","created_at":"2026-05-18T01:59:53Z","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 give a simple linear-time algorithm that, given a weighted digraph, finds a spanning tree that simultaneously approximates a shortest-path tree and a minimum spanning tree. The algorithm provides a continuous trade-off: given the two trees and epsilon > 0, the algorithm returns a spanning tree in which the distance between any vertex and the root of the shortest-path tree is at most 1+epsilon times the shortest-path distance, and yet the total weight of the tree is at most 1+2/epsilon times the weight of a minimum spanning tree. This is the best tradeoff possible. The paper also des","authors_text":"Balaji Raghavachari, Neal E. Young, Samir Khuller","cross_cats":["cs.DM"],"headline":"","license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T18:08:46Z","title":"Balancing Minimum Spanning and Shortest Path Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0205045","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:a75d315af9ee6a1202affab5b2b0c1d7697e9b3e6604808dd9f2b54c91dbaf2e","target":"record","created_at":"2026-05-18T01:59:53Z","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":"7720a9de2ab6a3760caf635a4df85fbbff5db1bdd8370379cc50578b1c79d3c4","cross_cats_sorted":["cs.DM"],"license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T18:08:46Z","title_canon_sha256":"f503311eec120116b9931a46551f058fe1121f95fa04c2f10bdaf66497a1df9b"},"schema_version":"1.0","source":{"id":"cs/0205045","kind":"arxiv","version":1}},"canonical_sha256":"0789527f55245a2aa55dbe5d6d299595a8b92a140cabcf5b1bfd0201476d4114","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0789527f55245a2aa55dbe5d6d299595a8b92a140cabcf5b1bfd0201476d4114","first_computed_at":"2026-05-18T01:59:53.914052Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:53.914052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h/mNZk8fRFGId/4MiClLr1rRk7YncHcdt3+6dVNTBarcLBVQ/gqV/q6NqVNkmrNB0XsOQn1pRM8ZSNi1122aBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:53.914632Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0205045","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a75d315af9ee6a1202affab5b2b0c1d7697e9b3e6604808dd9f2b54c91dbaf2e","sha256:1654cf8e6c53a59c7d39a22c34059e5a250dcc3fa14ef1a26a418b46d9df9ead"],"state_sha256":"c83845d2802f073d0841860a0c38414975220199e92780137f1f06d3116bfca5"}