{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:INYCVT53SPX7HMVOOIRWYDLNX3","short_pith_number":"pith:INYCVT53","schema_version":"1.0","canonical_sha256":"43702acfbb93eff3b2ae72236c0d6dbecd877f8681573e483fba30034fcad9cc","source":{"kind":"arxiv","id":"1601.02481","version":1},"attestation_state":"computed","paper":{"title":"Approximation algorithms for node-weighted prize-collecting Steiner tree problems on planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Carsten Moldenhauer, Jaros{\\l}aw Byrka, Mateusz Lewandowski","submitted_at":"2016-01-11T15:39:41Z","abstract_excerpt":"We study the prize-collecting version of the Node-weighted Steiner Tree problem (NWPCST) restricted to planar graphs. We give a new primal-dual Lagrangian-multiplier-preserving (LMP) 3-approximation algorithm for planar NWPCST. We then show a ($2.88 + \\epsilon$)-approximation which establishes a new best approximation guarantee for planar NWPCST. This is done by combining our LMP algorithm with a threshold rounding technique and utilizing the 2.4-approximation of Berman and Yaroslavtsev for the version without penalties. We also give a primal-dual 4-approximation algorithm for the more general"},"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":"1601.02481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-01-11T15:39:41Z","cross_cats_sorted":[],"title_canon_sha256":"9d4bcc113883ee31283d36b263ec0c2dac219ce2a97c22c4482731d548046010","abstract_canon_sha256":"df96cfbf4285a1dd078cbc9b722502c5108aea6aa76db0d9a3d01f9c50fdfdce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:06.348336Z","signature_b64":"z5n/1LDabg9Wj/RYpQ3jc8K9Qw4+aK8rA/XA3AyKfkr35TJw9sjQI6zFkIgTOFinJRikPdcu9uumRkePrHwODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43702acfbb93eff3b2ae72236c0d6dbecd877f8681573e483fba30034fcad9cc","last_reissued_at":"2026-05-18T01:23:06.347582Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:06.347582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation algorithms for node-weighted prize-collecting Steiner tree problems on planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Carsten Moldenhauer, Jaros{\\l}aw Byrka, Mateusz Lewandowski","submitted_at":"2016-01-11T15:39:41Z","abstract_excerpt":"We study the prize-collecting version of the Node-weighted Steiner Tree problem (NWPCST) restricted to planar graphs. We give a new primal-dual Lagrangian-multiplier-preserving (LMP) 3-approximation algorithm for planar NWPCST. We then show a ($2.88 + \\epsilon$)-approximation which establishes a new best approximation guarantee for planar NWPCST. This is done by combining our LMP algorithm with a threshold rounding technique and utilizing the 2.4-approximation of Berman and Yaroslavtsev for the version without penalties. We also give a primal-dual 4-approximation algorithm for the more general"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.02481","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":"1601.02481","created_at":"2026-05-18T01:23:06.347694+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.02481v1","created_at":"2026-05-18T01:23:06.347694+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.02481","created_at":"2026-05-18T01:23:06.347694+00:00"},{"alias_kind":"pith_short_12","alias_value":"INYCVT53SPX7","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"INYCVT53SPX7HMVO","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"INYCVT53","created_at":"2026-05-18T12:30:22.444734+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/INYCVT53SPX7HMVOOIRWYDLNX3","json":"https://pith.science/pith/INYCVT53SPX7HMVOOIRWYDLNX3.json","graph_json":"https://pith.science/api/pith-number/INYCVT53SPX7HMVOOIRWYDLNX3/graph.json","events_json":"https://pith.science/api/pith-number/INYCVT53SPX7HMVOOIRWYDLNX3/events.json","paper":"https://pith.science/paper/INYCVT53"},"agent_actions":{"view_html":"https://pith.science/pith/INYCVT53SPX7HMVOOIRWYDLNX3","download_json":"https://pith.science/pith/INYCVT53SPX7HMVOOIRWYDLNX3.json","view_paper":"https://pith.science/paper/INYCVT53","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.02481&json=true","fetch_graph":"https://pith.science/api/pith-number/INYCVT53SPX7HMVOOIRWYDLNX3/graph.json","fetch_events":"https://pith.science/api/pith-number/INYCVT53SPX7HMVOOIRWYDLNX3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/INYCVT53SPX7HMVOOIRWYDLNX3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/INYCVT53SPX7HMVOOIRWYDLNX3/action/storage_attestation","attest_author":"https://pith.science/pith/INYCVT53SPX7HMVOOIRWYDLNX3/action/author_attestation","sign_citation":"https://pith.science/pith/INYCVT53SPX7HMVOOIRWYDLNX3/action/citation_signature","submit_replication":"https://pith.science/pith/INYCVT53SPX7HMVOOIRWYDLNX3/action/replication_record"}},"created_at":"2026-05-18T01:23:06.347694+00:00","updated_at":"2026-05-18T01:23:06.347694+00:00"}