{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:VWH5DZ3DMGNOE3PSBAGQXYYOK6","short_pith_number":"pith:VWH5DZ3D","schema_version":"1.0","canonical_sha256":"ad8fd1e763619ae26df2080d0be30e57a9c0a25bf73fc69844ac420c20dacfec","source":{"kind":"arxiv","id":"1302.2127","version":3},"attestation_state":"computed","paper":{"title":"An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jochen K\\\"onemann, Laura Sanit\\`a, Sina Sadeghian","submitted_at":"2013-02-08T19:41:06Z","abstract_excerpt":"In the node-weighted prize-collecting Steiner tree problem (NW-PCST) we are given an undirected graph $G=(V,E)$, non-negative costs $c(v)$ and penalties $\\pi(v)$ for each $v \\in V$. The goal is to find a tree $T$ that minimizes the total cost of the vertices spanned by $T$ plus the total penalty of vertices not in $T$. This problem is well-known to be set-cover hard to approximate. Moss and Rabani (STOC'01) presented a primal-dual Lagrangean-multiplier-preserving $O(\\ln |V|)$-approximation algorithm for this problem. We show a serious problem with the algorithm, and present a new, fundamentall"},"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":"1302.2127","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-08T19:41:06Z","cross_cats_sorted":[],"title_canon_sha256":"458ceabca3d544d904262101cfce4a6df34ea51beaa473db02a098d9dd5c76ef","abstract_canon_sha256":"12d27bb09bc865e4d01316354fc2f322d06d85dde3ce95ae8a15f65482b48dda"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:29.004264Z","signature_b64":"/94YquQzHPslECBO/Li5BtS40zkUbRWj7u2JWSmGtOj1a5wYPTXMPIIycrnPIANWFOdwHS9CiDSTS+ROtjSECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad8fd1e763619ae26df2080d0be30e57a9c0a25bf73fc69844ac420c20dacfec","last_reissued_at":"2026-05-18T03:28:29.003662Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:29.003662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jochen K\\\"onemann, Laura Sanit\\`a, Sina Sadeghian","submitted_at":"2013-02-08T19:41:06Z","abstract_excerpt":"In the node-weighted prize-collecting Steiner tree problem (NW-PCST) we are given an undirected graph $G=(V,E)$, non-negative costs $c(v)$ and penalties $\\pi(v)$ for each $v \\in V$. The goal is to find a tree $T$ that minimizes the total cost of the vertices spanned by $T$ plus the total penalty of vertices not in $T$. This problem is well-known to be set-cover hard to approximate. Moss and Rabani (STOC'01) presented a primal-dual Lagrangean-multiplier-preserving $O(\\ln |V|)$-approximation algorithm for this problem. We show a serious problem with the algorithm, and present a new, fundamentall"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2127","kind":"arxiv","version":3},"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":"1302.2127","created_at":"2026-05-18T03:28:29.003746+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.2127v3","created_at":"2026-05-18T03:28:29.003746+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2127","created_at":"2026-05-18T03:28:29.003746+00:00"},{"alias_kind":"pith_short_12","alias_value":"VWH5DZ3DMGNO","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"VWH5DZ3DMGNOE3PS","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"VWH5DZ3D","created_at":"2026-05-18T12:28:04.890932+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/VWH5DZ3DMGNOE3PSBAGQXYYOK6","json":"https://pith.science/pith/VWH5DZ3DMGNOE3PSBAGQXYYOK6.json","graph_json":"https://pith.science/api/pith-number/VWH5DZ3DMGNOE3PSBAGQXYYOK6/graph.json","events_json":"https://pith.science/api/pith-number/VWH5DZ3DMGNOE3PSBAGQXYYOK6/events.json","paper":"https://pith.science/paper/VWH5DZ3D"},"agent_actions":{"view_html":"https://pith.science/pith/VWH5DZ3DMGNOE3PSBAGQXYYOK6","download_json":"https://pith.science/pith/VWH5DZ3DMGNOE3PSBAGQXYYOK6.json","view_paper":"https://pith.science/paper/VWH5DZ3D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.2127&json=true","fetch_graph":"https://pith.science/api/pith-number/VWH5DZ3DMGNOE3PSBAGQXYYOK6/graph.json","fetch_events":"https://pith.science/api/pith-number/VWH5DZ3DMGNOE3PSBAGQXYYOK6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VWH5DZ3DMGNOE3PSBAGQXYYOK6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VWH5DZ3DMGNOE3PSBAGQXYYOK6/action/storage_attestation","attest_author":"https://pith.science/pith/VWH5DZ3DMGNOE3PSBAGQXYYOK6/action/author_attestation","sign_citation":"https://pith.science/pith/VWH5DZ3DMGNOE3PSBAGQXYYOK6/action/citation_signature","submit_replication":"https://pith.science/pith/VWH5DZ3DMGNOE3PSBAGQXYYOK6/action/replication_record"}},"created_at":"2026-05-18T03:28:29.003746+00:00","updated_at":"2026-05-18T03:28:29.003746+00:00"}