{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EA23EUUWOXLK7SF2S2YU7E7G6Q","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":"d52caceaf5f36845a82be9c70493a8288011f1c3eca29631a23de6f5871ff08c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-31T16:48:56Z","title_canon_sha256":"1233be03cc47f08953122fedb58957d75620fca40c614eb16f2e7cfd90b7fefa"},"schema_version":"1.0","source":{"id":"1801.00313","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.00313","created_at":"2026-05-18T00:16:36Z"},{"alias_kind":"arxiv_version","alias_value":"1801.00313v2","created_at":"2026-05-18T00:16:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00313","created_at":"2026-05-18T00:16:36Z"},{"alias_kind":"pith_short_12","alias_value":"EA23EUUWOXLK","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EA23EUUWOXLK7SF2","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EA23EUUW","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:82d3730a4969c014312043bd5dd06c7db5544c342db9b67c806e5b25b835ae5c","target":"graph","created_at":"2026-05-18T00:16:36Z","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":"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)","authors_text":"Jaros{\\l}aw Byrka, Joachim Spoerhase, Mateusz Lewandowski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-31T16:48:56Z","title":"Approximating Node-Weighted k-MST on Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00313","kind":"arxiv","version":2},"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:a4283cef8ee34127f4f6ed63db0ea6a491bc95c338cd883a3dd22a60508dfe4a","target":"record","created_at":"2026-05-18T00:16:36Z","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":"d52caceaf5f36845a82be9c70493a8288011f1c3eca29631a23de6f5871ff08c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-31T16:48:56Z","title_canon_sha256":"1233be03cc47f08953122fedb58957d75620fca40c614eb16f2e7cfd90b7fefa"},"schema_version":"1.0","source":{"id":"1801.00313","kind":"arxiv","version":2}},"canonical_sha256":"2035b2529675d6afc8ba96b14f93e6f42e047235b59f824b8aacdf27b1e2ab20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2035b2529675d6afc8ba96b14f93e6f42e047235b59f824b8aacdf27b1e2ab20","first_computed_at":"2026-05-18T00:16:36.531992Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:36.531992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IGg9kKuI1UsHC6Hjrz8sllhBNno1epPw2kQ4s01Wqq1B/0FBn4Zi4YIBF0u+716+kRqrp7reKzjQbI2I6rCSAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:36.532582Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.00313","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4283cef8ee34127f4f6ed63db0ea6a491bc95c338cd883a3dd22a60508dfe4a","sha256:82d3730a4969c014312043bd5dd06c7db5544c342db9b67c806e5b25b835ae5c"],"state_sha256":"bf3cf22eeef387633f7ddc8d11c9b92d67d7c310997b504a9056d61e14d2bc7f"}