{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ISXFGQOHX3MHTI55GM7MVLBZKQ","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":"e16baa2e5bd05e67eab8ed7191f535ab3026bd01d464f2f86ba0fde45186beef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-12T11:20:10Z","title_canon_sha256":"33fb7d92b7b5ed400e099bf40917d5ecfc82956b2ca13f260a5621587ee77388"},"schema_version":"1.0","source":{"id":"1409.3700","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3700","created_at":"2026-05-18T02:42:54Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3700v1","created_at":"2026-05-18T02:42:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3700","created_at":"2026-05-18T02:42:54Z"},{"alias_kind":"pith_short_12","alias_value":"ISXFGQOHX3MH","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"ISXFGQOHX3MHTI55","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"ISXFGQOH","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:381d625f631dd90d59178c108d376247904531dca78afd425517e0c4dfaa4184","target":"graph","created_at":"2026-05-18T02:42:54Z","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 focuses on finding a spanning tree of a graph to maximize the number of its internal vertices. We present an approximation algorithm for this problem which can achieve a performance ratio $\\frac{4}{3}$ on undirected simple graphs. This improves upon the best known approximation algorithm with performance ratio $\\frac{5}{3}$ before. Our algorithm benefits from a new observation for bounding the number of internal vertices of a spanning tree, which reveals that a spanning tree of an undirected simple graph has less internal vertices than the edges a maximum path-cycle cover of that gr","authors_text":"Daming Zhu, Xingfu Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-12T11:20:10Z","title":"A 4/3-approximation algorithm for finding a spanning tree to maximize its internal vertices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3700","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:da5e44f99e8ce87f15e10c20429a6135b85eb8998faf363eb33bd6019617530c","target":"record","created_at":"2026-05-18T02:42:54Z","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":"e16baa2e5bd05e67eab8ed7191f535ab3026bd01d464f2f86ba0fde45186beef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-12T11:20:10Z","title_canon_sha256":"33fb7d92b7b5ed400e099bf40917d5ecfc82956b2ca13f260a5621587ee77388"},"schema_version":"1.0","source":{"id":"1409.3700","kind":"arxiv","version":1}},"canonical_sha256":"44ae5341c7bed879a3bd333ecaac39541a39c0ae7fae0151c78a798264572046","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44ae5341c7bed879a3bd333ecaac39541a39c0ae7fae0151c78a798264572046","first_computed_at":"2026-05-18T02:42:54.785271Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:54.785271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WX0IC3gsUhtlyqSEdWSZYwMgVGertV/kjtE6c3w9byAgTdbOhMBz8cjrxH/xId/QIlIWprTombZnA9fTyHDEDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:54.785615Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.3700","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da5e44f99e8ce87f15e10c20429a6135b85eb8998faf363eb33bd6019617530c","sha256:381d625f631dd90d59178c108d376247904531dca78afd425517e0c4dfaa4184"],"state_sha256":"283c139ee9c5c2b0c337d8ed5bff80d59beba12078fe52ceafa0f447534c5d4d"}