{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ISXFGQOHX3MHTI55GM7MVLBZKQ","short_pith_number":"pith:ISXFGQOH","schema_version":"1.0","canonical_sha256":"44ae5341c7bed879a3bd333ecaac39541a39c0ae7fae0151c78a798264572046","source":{"kind":"arxiv","id":"1409.3700","version":1},"attestation_state":"computed","paper":{"title":"A 4/3-approximation algorithm for finding a spanning tree to maximize its internal vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daming Zhu, Xingfu Li","submitted_at":"2014-09-12T11:20:10Z","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"},"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":"1409.3700","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-12T11:20:10Z","cross_cats_sorted":[],"title_canon_sha256":"33fb7d92b7b5ed400e099bf40917d5ecfc82956b2ca13f260a5621587ee77388","abstract_canon_sha256":"e16baa2e5bd05e67eab8ed7191f535ab3026bd01d464f2f86ba0fde45186beef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:54.785615Z","signature_b64":"WX0IC3gsUhtlyqSEdWSZYwMgVGertV/kjtE6c3w9byAgTdbOhMBz8cjrxH/xId/QIlIWprTombZnA9fTyHDEDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44ae5341c7bed879a3bd333ecaac39541a39c0ae7fae0151c78a798264572046","last_reissued_at":"2026-05-18T02:42:54.785271Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:54.785271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A 4/3-approximation algorithm for finding a spanning tree to maximize its internal vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daming Zhu, Xingfu Li","submitted_at":"2014-09-12T11:20:10Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3700","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":"1409.3700","created_at":"2026-05-18T02:42:54.785322+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.3700v1","created_at":"2026-05-18T02:42:54.785322+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3700","created_at":"2026-05-18T02:42:54.785322+00:00"},{"alias_kind":"pith_short_12","alias_value":"ISXFGQOHX3MH","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"ISXFGQOHX3MHTI55","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"ISXFGQOH","created_at":"2026-05-18T12:28:33.132498+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/ISXFGQOHX3MHTI55GM7MVLBZKQ","json":"https://pith.science/pith/ISXFGQOHX3MHTI55GM7MVLBZKQ.json","graph_json":"https://pith.science/api/pith-number/ISXFGQOHX3MHTI55GM7MVLBZKQ/graph.json","events_json":"https://pith.science/api/pith-number/ISXFGQOHX3MHTI55GM7MVLBZKQ/events.json","paper":"https://pith.science/paper/ISXFGQOH"},"agent_actions":{"view_html":"https://pith.science/pith/ISXFGQOHX3MHTI55GM7MVLBZKQ","download_json":"https://pith.science/pith/ISXFGQOHX3MHTI55GM7MVLBZKQ.json","view_paper":"https://pith.science/paper/ISXFGQOH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.3700&json=true","fetch_graph":"https://pith.science/api/pith-number/ISXFGQOHX3MHTI55GM7MVLBZKQ/graph.json","fetch_events":"https://pith.science/api/pith-number/ISXFGQOHX3MHTI55GM7MVLBZKQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ISXFGQOHX3MHTI55GM7MVLBZKQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ISXFGQOHX3MHTI55GM7MVLBZKQ/action/storage_attestation","attest_author":"https://pith.science/pith/ISXFGQOHX3MHTI55GM7MVLBZKQ/action/author_attestation","sign_citation":"https://pith.science/pith/ISXFGQOHX3MHTI55GM7MVLBZKQ/action/citation_signature","submit_replication":"https://pith.science/pith/ISXFGQOHX3MHTI55GM7MVLBZKQ/action/replication_record"}},"created_at":"2026-05-18T02:42:54.785322+00:00","updated_at":"2026-05-18T02:42:54.785322+00:00"}