{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2002:A6EVE72VERNCVJK5XZOW2KMVSW","short_pith_number":"pith:A6EVE72V","schema_version":"1.0","canonical_sha256":"0789527f55245a2aa55dbe5d6d299595a8b92a140cabcf5b1bfd0201476d4114","source":{"kind":"arxiv","id":"cs/0205045","version":1},"attestation_state":"computed","paper":{"title":"Balancing Minimum Spanning and Shortest Path Trees","license":"","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Balaji Raghavachari, Neal E. Young, Samir Khuller","submitted_at":"2002-05-18T18:08:46Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"cs/0205045","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2002-05-18T18:08:46Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f503311eec120116b9931a46551f058fe1121f95fa04c2f10bdaf66497a1df9b","abstract_canon_sha256":"7720a9de2ab6a3760caf635a4df85fbbff5db1bdd8370379cc50578b1c79d3c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:53.914632Z","signature_b64":"h/mNZk8fRFGId/4MiClLr1rRk7YncHcdt3+6dVNTBarcLBVQ/gqV/q6NqVNkmrNB0XsOQn1pRM8ZSNi1122aBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0789527f55245a2aa55dbe5d6d299595a8b92a140cabcf5b1bfd0201476d4114","last_reissued_at":"2026-05-18T01:59:53.914052Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:53.914052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Balancing Minimum Spanning and Shortest Path Trees","license":"","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Balaji Raghavachari, Neal E. Young, Samir Khuller","submitted_at":"2002-05-18T18:08:46Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0205045","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"cs/0205045","created_at":"2026-05-18T01:59:53.914136+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0205045v1","created_at":"2026-05-18T01:59:53.914136+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0205045","created_at":"2026-05-18T01:59:53.914136+00:00"},{"alias_kind":"pith_short_12","alias_value":"A6EVE72VERNC","created_at":"2026-05-18T12:25:50.845339+00:00"},{"alias_kind":"pith_short_16","alias_value":"A6EVE72VERNCVJK5","created_at":"2026-05-18T12:25:50.845339+00:00"},{"alias_kind":"pith_short_8","alias_value":"A6EVE72V","created_at":"2026-05-18T12:25:50.845339+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A6EVE72VERNCVJK5XZOW2KMVSW","json":"https://pith.science/pith/A6EVE72VERNCVJK5XZOW2KMVSW.json","graph_json":"https://pith.science/api/pith-number/A6EVE72VERNCVJK5XZOW2KMVSW/graph.json","events_json":"https://pith.science/api/pith-number/A6EVE72VERNCVJK5XZOW2KMVSW/events.json","paper":"https://pith.science/paper/A6EVE72V"},"agent_actions":{"view_html":"https://pith.science/pith/A6EVE72VERNCVJK5XZOW2KMVSW","download_json":"https://pith.science/pith/A6EVE72VERNCVJK5XZOW2KMVSW.json","view_paper":"https://pith.science/paper/A6EVE72V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0205045&json=true","fetch_graph":"https://pith.science/api/pith-number/A6EVE72VERNCVJK5XZOW2KMVSW/graph.json","fetch_events":"https://pith.science/api/pith-number/A6EVE72VERNCVJK5XZOW2KMVSW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A6EVE72VERNCVJK5XZOW2KMVSW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A6EVE72VERNCVJK5XZOW2KMVSW/action/storage_attestation","attest_author":"https://pith.science/pith/A6EVE72VERNCVJK5XZOW2KMVSW/action/author_attestation","sign_citation":"https://pith.science/pith/A6EVE72VERNCVJK5XZOW2KMVSW/action/citation_signature","submit_replication":"https://pith.science/pith/A6EVE72VERNCVJK5XZOW2KMVSW/action/replication_record"}},"created_at":"2026-05-18T01:59:53.914136+00:00","updated_at":"2026-05-18T01:59:53.914136+00:00"}