{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:22UBWLFOIRHWV2O4BBZC2JGEV4","short_pith_number":"pith:22UBWLFO","schema_version":"1.0","canonical_sha256":"d6a81b2cae444f6ae9dc08722d24c4af349260cc5f41d34aaf0c5bfb39c0855f","source":{"kind":"arxiv","id":"1412.8296","version":1},"attestation_state":"computed","paper":{"title":"A $2k$-Vertex Kernel for Maximum Internal Spanning Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jianer Chen, Jianxin Wang, Wenjun Li, Yixin Cao","submitted_at":"2014-12-29T10:19:48Z","abstract_excerpt":"We consider the parameterized version of the maximum internal spanning tree problem, which, given an $n$-vertex graph and a parameter $k$, asks for a spanning tree with at least $k$ internal vertices. Fomin et al. [J. Comput. System Sci., 79:1-6] crafted a very ingenious reduction rule, and showed that a simple application of this rule is sufficient to yield a $3k$-vertex kernel. Here we propose a novel way to use the same reduction rule, resulting in an improved $2k$-vertex kernel. Our algorithm applies first a greedy procedure consisting of a sequence of local exchange operations, which ends"},"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":"1412.8296","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-29T10:19:48Z","cross_cats_sorted":[],"title_canon_sha256":"c0288db1bbda8a1774e63d3dd99558d27cdc0af04c8a1df4245443691a303295","abstract_canon_sha256":"93a7be202ed0cde1ce5ba423046673cf5077e9911bef41df9ace5903ad4f4fd0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:23.554868Z","signature_b64":"nS6cRKQ6AYKHyk3wjuZ0/af/xnAGlwOhKnytbV3gLwORl4xIckL+tmUaikS8/hRvo9z4QYxiqjUubo+S8XC9Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6a81b2cae444f6ae9dc08722d24c4af349260cc5f41d34aaf0c5bfb39c0855f","last_reissued_at":"2026-05-18T02:30:23.554397Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:23.554397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A $2k$-Vertex Kernel for Maximum Internal Spanning Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jianer Chen, Jianxin Wang, Wenjun Li, Yixin Cao","submitted_at":"2014-12-29T10:19:48Z","abstract_excerpt":"We consider the parameterized version of the maximum internal spanning tree problem, which, given an $n$-vertex graph and a parameter $k$, asks for a spanning tree with at least $k$ internal vertices. Fomin et al. [J. Comput. System Sci., 79:1-6] crafted a very ingenious reduction rule, and showed that a simple application of this rule is sufficient to yield a $3k$-vertex kernel. Here we propose a novel way to use the same reduction rule, resulting in an improved $2k$-vertex kernel. Our algorithm applies first a greedy procedure consisting of a sequence of local exchange operations, which ends"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.8296","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":"1412.8296","created_at":"2026-05-18T02:30:23.554471+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.8296v1","created_at":"2026-05-18T02:30:23.554471+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8296","created_at":"2026-05-18T02:30:23.554471+00:00"},{"alias_kind":"pith_short_12","alias_value":"22UBWLFOIRHW","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"22UBWLFOIRHWV2O4","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"22UBWLFO","created_at":"2026-05-18T12:28:09.283467+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/22UBWLFOIRHWV2O4BBZC2JGEV4","json":"https://pith.science/pith/22UBWLFOIRHWV2O4BBZC2JGEV4.json","graph_json":"https://pith.science/api/pith-number/22UBWLFOIRHWV2O4BBZC2JGEV4/graph.json","events_json":"https://pith.science/api/pith-number/22UBWLFOIRHWV2O4BBZC2JGEV4/events.json","paper":"https://pith.science/paper/22UBWLFO"},"agent_actions":{"view_html":"https://pith.science/pith/22UBWLFOIRHWV2O4BBZC2JGEV4","download_json":"https://pith.science/pith/22UBWLFOIRHWV2O4BBZC2JGEV4.json","view_paper":"https://pith.science/paper/22UBWLFO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.8296&json=true","fetch_graph":"https://pith.science/api/pith-number/22UBWLFOIRHWV2O4BBZC2JGEV4/graph.json","fetch_events":"https://pith.science/api/pith-number/22UBWLFOIRHWV2O4BBZC2JGEV4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/22UBWLFOIRHWV2O4BBZC2JGEV4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/22UBWLFOIRHWV2O4BBZC2JGEV4/action/storage_attestation","attest_author":"https://pith.science/pith/22UBWLFOIRHWV2O4BBZC2JGEV4/action/author_attestation","sign_citation":"https://pith.science/pith/22UBWLFOIRHWV2O4BBZC2JGEV4/action/citation_signature","submit_replication":"https://pith.science/pith/22UBWLFOIRHWV2O4BBZC2JGEV4/action/replication_record"}},"created_at":"2026-05-18T02:30:23.554471+00:00","updated_at":"2026-05-18T02:30:23.554471+00:00"}