{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EA23EUUWOXLK7SF2S2YU7E7G6Q","short_pith_number":"pith:EA23EUUW","schema_version":"1.0","canonical_sha256":"2035b2529675d6afc8ba96b14f93e6f42e047235b59f824b8aacdf27b1e2ab20","source":{"kind":"arxiv","id":"1801.00313","version":2},"attestation_state":"computed","paper":{"title":"Approximating Node-Weighted k-MST on Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jaros{\\l}aw Byrka, Joachim Spoerhase, Mateusz Lewandowski","submitted_at":"2017-12-31T16:48:56Z","abstract_excerpt":"We study the problem of finding a minimum weight connected subgraph spanning at least $k$ vertices on planar, node-weighted graphs. We give a $(4+\\eps)$-approximation algorithm for this problem. We achieve this by utilizing the recent LMP primal-dual $3$-approximation for the node-weighted prize-collecting Steiner tree problem by Byrka et al (SWAT'16) and adopting an approach by Chudak et al. (Math.\\ Prog.\\ '04) regarding Lagrangian relaxation for the edge-weighted variant. In particular, we improve the procedure of picking additional vertices (tree merging procedure) given by Sadeghian (2013)"},"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":"1801.00313","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-31T16:48:56Z","cross_cats_sorted":[],"title_canon_sha256":"1233be03cc47f08953122fedb58957d75620fca40c614eb16f2e7cfd90b7fefa","abstract_canon_sha256":"d52caceaf5f36845a82be9c70493a8288011f1c3eca29631a23de6f5871ff08c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:36.532582Z","signature_b64":"IGg9kKuI1UsHC6Hjrz8sllhBNno1epPw2kQ4s01Wqq1B/0FBn4Zi4YIBF0u+716+kRqrp7reKzjQbI2I6rCSAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2035b2529675d6afc8ba96b14f93e6f42e047235b59f824b8aacdf27b1e2ab20","last_reissued_at":"2026-05-18T00:16:36.531992Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:36.531992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating Node-Weighted k-MST on Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jaros{\\l}aw Byrka, Joachim Spoerhase, Mateusz Lewandowski","submitted_at":"2017-12-31T16:48:56Z","abstract_excerpt":"We study the problem of finding a minimum weight connected subgraph spanning at least $k$ vertices on planar, node-weighted graphs. We give a $(4+\\eps)$-approximation algorithm for this problem. We achieve this by utilizing the recent LMP primal-dual $3$-approximation for the node-weighted prize-collecting Steiner tree problem by Byrka et al (SWAT'16) and adopting an approach by Chudak et al. (Math.\\ Prog.\\ '04) regarding Lagrangian relaxation for the edge-weighted variant. In particular, we improve the procedure of picking additional vertices (tree merging procedure) given by Sadeghian (2013)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00313","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":"1801.00313","created_at":"2026-05-18T00:16:36.532114+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.00313v2","created_at":"2026-05-18T00:16:36.532114+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00313","created_at":"2026-05-18T00:16:36.532114+00:00"},{"alias_kind":"pith_short_12","alias_value":"EA23EUUWOXLK","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EA23EUUWOXLK7SF2","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EA23EUUW","created_at":"2026-05-18T12:31:12.930513+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/EA23EUUWOXLK7SF2S2YU7E7G6Q","json":"https://pith.science/pith/EA23EUUWOXLK7SF2S2YU7E7G6Q.json","graph_json":"https://pith.science/api/pith-number/EA23EUUWOXLK7SF2S2YU7E7G6Q/graph.json","events_json":"https://pith.science/api/pith-number/EA23EUUWOXLK7SF2S2YU7E7G6Q/events.json","paper":"https://pith.science/paper/EA23EUUW"},"agent_actions":{"view_html":"https://pith.science/pith/EA23EUUWOXLK7SF2S2YU7E7G6Q","download_json":"https://pith.science/pith/EA23EUUWOXLK7SF2S2YU7E7G6Q.json","view_paper":"https://pith.science/paper/EA23EUUW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.00313&json=true","fetch_graph":"https://pith.science/api/pith-number/EA23EUUWOXLK7SF2S2YU7E7G6Q/graph.json","fetch_events":"https://pith.science/api/pith-number/EA23EUUWOXLK7SF2S2YU7E7G6Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EA23EUUWOXLK7SF2S2YU7E7G6Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EA23EUUWOXLK7SF2S2YU7E7G6Q/action/storage_attestation","attest_author":"https://pith.science/pith/EA23EUUWOXLK7SF2S2YU7E7G6Q/action/author_attestation","sign_citation":"https://pith.science/pith/EA23EUUWOXLK7SF2S2YU7E7G6Q/action/citation_signature","submit_replication":"https://pith.science/pith/EA23EUUWOXLK7SF2S2YU7E7G6Q/action/replication_record"}},"created_at":"2026-05-18T00:16:36.532114+00:00","updated_at":"2026-05-18T00:16:36.532114+00:00"}