{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5UGLUVVOFF4IO6OQWBLSOORW2W","short_pith_number":"pith:5UGLUVVO","schema_version":"1.0","canonical_sha256":"ed0cba56ae29788779d0b057273a36d5bc0ac004ee96bd4e6793c56592677e47","source":{"kind":"arxiv","id":"1608.03299","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1608.03299","created_at":"2026-05-18T00:43:35.697622+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.03299v2","created_at":"2026-05-18T00:43:35.697622+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03299","created_at":"2026-05-18T00:43:35.697622+00:00"},{"alias_kind":"pith_short_12","alias_value":"5UGLUVVOFF4I","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5UGLUVVOFF4IO6OQ","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5UGLUVVO","created_at":"2026-05-18T12:30:01.593930+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/5UGLUVVOFF4IO6OQWBLSOORW2W","json":"https://pith.science/pith/5UGLUVVOFF4IO6OQWBLSOORW2W.json","graph_json":"https://pith.science/api/pith-number/5UGLUVVOFF4IO6OQWBLSOORW2W/graph.json","events_json":"https://pith.science/api/pith-number/5UGLUVVOFF4IO6OQWBLSOORW2W/events.json","paper":"https://pith.science/paper/5UGLUVVO"},"agent_actions":{"view_html":"https://pith.science/pith/5UGLUVVOFF4IO6OQWBLSOORW2W","download_json":"https://pith.science/pith/5UGLUVVOFF4IO6OQWBLSOORW2W.json","view_paper":"https://pith.science/paper/5UGLUVVO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.03299&json=true","fetch_graph":"https://pith.science/api/pith-number/5UGLUVVOFF4IO6OQWBLSOORW2W/graph.json","fetch_events":"https://pith.science/api/pith-number/5UGLUVVOFF4IO6OQWBLSOORW2W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5UGLUVVOFF4IO6OQWBLSOORW2W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5UGLUVVOFF4IO6OQWBLSOORW2W/action/storage_attestation","attest_author":"https://pith.science/pith/5UGLUVVOFF4IO6OQWBLSOORW2W/action/author_attestation","sign_citation":"https://pith.science/pith/5UGLUVVOFF4IO6OQWBLSOORW2W/action/citation_signature","submit_replication":"https://pith.science/pith/5UGLUVVOFF4IO6OQWBLSOORW2W/action/replication_record"}},"created_at":"2026-05-18T00:43:35.697622+00:00","updated_at":"2026-05-18T00:43:35.697622+00:00"}