{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5UGLUVVOFF4IO6OQWBLSOORW2W","short_pith_number":"pith:5UGLUVVO","canonical_record":{"source":{"id":"1608.03299","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-10T20:43:39Z","cross_cats_sorted":[],"title_canon_sha256":"37172a3c683fc954d68af2ed4c8a6a70947538eb89334d479a6702db145d2c07","abstract_canon_sha256":"13811d30f02912a54f261001ca231a7e0a0d6e747f5abc6c57bef1fad4e11e05"},"schema_version":"1.0"},"canonical_sha256":"ed0cba56ae29788779d0b057273a36d5bc0ac004ee96bd4e6793c56592677e47","source":{"kind":"arxiv","id":"1608.03299","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03299","created_at":"2026-05-18T00:43:35Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03299v2","created_at":"2026-05-18T00:43:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03299","created_at":"2026-05-18T00:43:35Z"},{"alias_kind":"pith_short_12","alias_value":"5UGLUVVOFF4I","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5UGLUVVOFF4IO6OQ","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5UGLUVVO","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5UGLUVVOFF4IO6OQWBLSOORW2W","target":"record","payload":{"canonical_record":{"source":{"id":"1608.03299","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-10T20:43:39Z","cross_cats_sorted":[],"title_canon_sha256":"37172a3c683fc954d68af2ed4c8a6a70947538eb89334d479a6702db145d2c07","abstract_canon_sha256":"13811d30f02912a54f261001ca231a7e0a0d6e747f5abc6c57bef1fad4e11e05"},"schema_version":"1.0"},"canonical_sha256":"ed0cba56ae29788779d0b057273a36d5bc0ac004ee96bd4e6793c56592677e47","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:35.697941Z","signature_b64":"yJw7duFGSuoTZfeGXbQ3f5fPJah0WpsxJ87sVOymN1ZfyLDh/weaMvut3g4b7kjfjtdR+/gkiObhdqAdt/gwCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed0cba56ae29788779d0b057273a36d5bc0ac004ee96bd4e6793c56592677e47","last_reissued_at":"2026-05-18T00:43:35.697566Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:35.697566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.03299","source_version":2,"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-18T00:43:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pPH9ciH5AGMLhNtgDNUiCm5Cx9uk0iWL2jCgZ8u5MQmczye8dne0TeBz4a26DOcUzjMal9lwWHRESu3Z7NOtDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T03:04:42.923960Z"},"content_sha256":"bc9c453972954672b8a1fcbaee011d6d13d9892f250a8dc1a83218a051d8e780","schema_version":"1.0","event_id":"sha256:bc9c453972954672b8a1fcbaee011d6d13d9892f250a8dc1a83218a051d8e780"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5UGLUVVOFF4IO6OQWBLSOORW2W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation algorithms for the maximum weight internal spanning tree problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dan Wang, Guohui Lin, Lusheng Wang, Yong Chen, Zhi-Zhong Chen","submitted_at":"2016-08-10T20:43:39Z","abstract_excerpt":"Given a vertex-weighted connected graph $G = (V, E)$, the maximum weight internal spanning tree (MwIST for short) problem asks for a spanning tree $T$ of $G$ such that the total weight of the internal vertices in $T$ is maximized. The un-weighted variant, denoted as MIST, is NP-hard and APX-hard, and the currently best approximation algorithm has a proven performance ratio $13/17$. The currently best approximation algorithm for MwIST only has a performance ratio $1/3 - \\epsilon$, for any $\\epsilon > 0$. In this paper, we present a simple algorithm based on a novel relationship between MwIST an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03299","kind":"arxiv","version":2},"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-18T00:43:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gOt28Rj18tf1MkiFjwAYbL/QeLKJLNrNlXlG7TJK1s4KRRq55EbRewon02Bne0245yOTYvpOFN0IjpRp2D68Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T03:04:42.924758Z"},"content_sha256":"1f47dfcb691b8d2d4f3124287b8935385692c38be93cd85faa8c1ae700b3d5aa","schema_version":"1.0","event_id":"sha256:1f47dfcb691b8d2d4f3124287b8935385692c38be93cd85faa8c1ae700b3d5aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5UGLUVVOFF4IO6OQWBLSOORW2W/bundle.json","state_url":"https://pith.science/pith/5UGLUVVOFF4IO6OQWBLSOORW2W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5UGLUVVOFF4IO6OQWBLSOORW2W/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-24T03:04:42Z","links":{"resolver":"https://pith.science/pith/5UGLUVVOFF4IO6OQWBLSOORW2W","bundle":"https://pith.science/pith/5UGLUVVOFF4IO6OQWBLSOORW2W/bundle.json","state":"https://pith.science/pith/5UGLUVVOFF4IO6OQWBLSOORW2W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5UGLUVVOFF4IO6OQWBLSOORW2W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5UGLUVVOFF4IO6OQWBLSOORW2W","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":"13811d30f02912a54f261001ca231a7e0a0d6e747f5abc6c57bef1fad4e11e05","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-10T20:43:39Z","title_canon_sha256":"37172a3c683fc954d68af2ed4c8a6a70947538eb89334d479a6702db145d2c07"},"schema_version":"1.0","source":{"id":"1608.03299","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03299","created_at":"2026-05-18T00:43:35Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03299v2","created_at":"2026-05-18T00:43:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03299","created_at":"2026-05-18T00:43:35Z"},{"alias_kind":"pith_short_12","alias_value":"5UGLUVVOFF4I","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5UGLUVVOFF4IO6OQ","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5UGLUVVO","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:1f47dfcb691b8d2d4f3124287b8935385692c38be93cd85faa8c1ae700b3d5aa","target":"graph","created_at":"2026-05-18T00:43:35Z","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":"Given a vertex-weighted connected graph $G = (V, E)$, the maximum weight internal spanning tree (MwIST for short) problem asks for a spanning tree $T$ of $G$ such that the total weight of the internal vertices in $T$ is maximized. The un-weighted variant, denoted as MIST, is NP-hard and APX-hard, and the currently best approximation algorithm has a proven performance ratio $13/17$. The currently best approximation algorithm for MwIST only has a performance ratio $1/3 - \\epsilon$, for any $\\epsilon > 0$. In this paper, we present a simple algorithm based on a novel relationship between MwIST an","authors_text":"Dan Wang, Guohui Lin, Lusheng Wang, Yong Chen, Zhi-Zhong Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-10T20:43:39Z","title":"Approximation algorithms for the maximum weight internal spanning tree problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03299","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:bc9c453972954672b8a1fcbaee011d6d13d9892f250a8dc1a83218a051d8e780","target":"record","created_at":"2026-05-18T00:43:35Z","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":"13811d30f02912a54f261001ca231a7e0a0d6e747f5abc6c57bef1fad4e11e05","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-10T20:43:39Z","title_canon_sha256":"37172a3c683fc954d68af2ed4c8a6a70947538eb89334d479a6702db145d2c07"},"schema_version":"1.0","source":{"id":"1608.03299","kind":"arxiv","version":2}},"canonical_sha256":"ed0cba56ae29788779d0b057273a36d5bc0ac004ee96bd4e6793c56592677e47","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed0cba56ae29788779d0b057273a36d5bc0ac004ee96bd4e6793c56592677e47","first_computed_at":"2026-05-18T00:43:35.697566Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:35.697566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yJw7duFGSuoTZfeGXbQ3f5fPJah0WpsxJ87sVOymN1ZfyLDh/weaMvut3g4b7kjfjtdR+/gkiObhdqAdt/gwCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:35.697941Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.03299","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc9c453972954672b8a1fcbaee011d6d13d9892f250a8dc1a83218a051d8e780","sha256:1f47dfcb691b8d2d4f3124287b8935385692c38be93cd85faa8c1ae700b3d5aa"],"state_sha256":"85d4d1534e0bcf29853e5729c626ddb3f1c5a86fef383a342be88e7792a7db35"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LtzLj84NCFMJRSxlphpNt0tSKeHPrPWYBe/umfz6dJvqYCVzls/0GMo7jn8pSiWVuQ1u3Oyzz1sqP2JElreZDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T03:04:42.929269Z","bundle_sha256":"a47c35874fc2fec597bc6db12fdfc54eb36e8aacb78ae6ca3dc1b64a39da3acd"}}