{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2002:A6EVE72VERNCVJK5XZOW2KMVSW","short_pith_number":"pith:A6EVE72V","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"},"canonical_sha256":"0789527f55245a2aa55dbe5d6d299595a8b92a140cabcf5b1bfd0201476d4114","source":{"kind":"arxiv","id":"cs/0205045","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2002:A6EVE72VERNCVJK5XZOW2KMVSW","target":"record","payload":{"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"},"canonical_sha256":"0789527f55245a2aa55dbe5d6d299595a8b92a140cabcf5b1bfd0201476d4114","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"},"source_kind":"arxiv","source_id":"cs/0205045","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:59:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hISJ6/aTiz8ODEApCbpMjCMBDdbXIhp+0LY4YkQpEaWxOi4fFt/akadyU9KpPyurPYQJbw6jdllbgM11u70ODg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:38:37.776596Z"},"content_sha256":"a75d315af9ee6a1202affab5b2b0c1d7697e9b3e6604808dd9f2b54c91dbaf2e","schema_version":"1.0","event_id":"sha256:a75d315af9ee6a1202affab5b2b0c1d7697e9b3e6604808dd9f2b54c91dbaf2e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2002:A6EVE72VERNCVJK5XZOW2KMVSW","target":"graph","payload":{"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"},"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:59:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L34E5C5CdaavUR0VOgA4MINskBKtPJF5ASf9kcnAWviHB+f/YkUEqNBVko0oQw5Hy8IBWQnKn4OPvobG32C6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:38:37.776976Z"},"content_sha256":"1654cf8e6c53a59c7d39a22c34059e5a250dcc3fa14ef1a26a418b46d9df9ead","schema_version":"1.0","event_id":"sha256:1654cf8e6c53a59c7d39a22c34059e5a250dcc3fa14ef1a26a418b46d9df9ead"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A6EVE72VERNCVJK5XZOW2KMVSW/bundle.json","state_url":"https://pith.science/pith/A6EVE72VERNCVJK5XZOW2KMVSW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A6EVE72VERNCVJK5XZOW2KMVSW/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-27T17:38:37Z","links":{"resolver":"https://pith.science/pith/A6EVE72VERNCVJK5XZOW2KMVSW","bundle":"https://pith.science/pith/A6EVE72VERNCVJK5XZOW2KMVSW/bundle.json","state":"https://pith.science/pith/A6EVE72VERNCVJK5XZOW2KMVSW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A6EVE72VERNCVJK5XZOW2KMVSW/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wOuPofuQQW0BBvuumofiK3n2LaTED5RA6TRWXXUX5QmoPCnpT2FfpalBxurWKjyCRZiC8crCb3n8eSd2SzY+Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T17:38:37.780437Z","bundle_sha256":"92ed25a7b3466ac788f2ac237f417d1413a9884567c6252e2e6b66f87e62dc17"}}