{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:VWH5DZ3DMGNOE3PSBAGQXYYOK6","short_pith_number":"pith:VWH5DZ3D","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"},"canonical_sha256":"ad8fd1e763619ae26df2080d0be30e57a9c0a25bf73fc69844ac420c20dacfec","source":{"kind":"arxiv","id":"1302.2127","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.2127","created_at":"2026-05-18T03:28:29Z"},{"alias_kind":"arxiv_version","alias_value":"1302.2127v3","created_at":"2026-05-18T03:28:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2127","created_at":"2026-05-18T03:28:29Z"},{"alias_kind":"pith_short_12","alias_value":"VWH5DZ3DMGNO","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VWH5DZ3DMGNOE3PS","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VWH5DZ3D","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:VWH5DZ3DMGNOE3PSBAGQXYYOK6","target":"record","payload":{"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"},"canonical_sha256":"ad8fd1e763619ae26df2080d0be30e57a9c0a25bf73fc69844ac420c20dacfec","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"},"source_kind":"arxiv","source_id":"1302.2127","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:28:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zwpO03bzI8qwDyET+X0rXjfnhW2m6DM6mrOmgnSkjWo4hapGfV86ozGH4twn+wvOVB6r56j9d3gS9Zs6tq5QDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T17:48:18.732915Z"},"content_sha256":"c155d9d2b4527dcfac628f85d36ba140b0d23f3a51eefe86d7b259ae5951d6e4","schema_version":"1.0","event_id":"sha256:c155d9d2b4527dcfac628f85d36ba140b0d23f3a51eefe86d7b259ae5951d6e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:VWH5DZ3DMGNOE3PSBAGQXYYOK6","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:28:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0x5SlmpkoiZ2sCsbPHnqiPV64/50vZxLuvy7QdRe/pQJMCpzISDPl3vnt9Tk1CaGpnTUB9loYES6ahIzX5icDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T17:48:18.733660Z"},"content_sha256":"028eb189cebbad1b8975d42eac9dd5b21c8c036d9eb3e4c36a98a63f5851898a","schema_version":"1.0","event_id":"sha256:028eb189cebbad1b8975d42eac9dd5b21c8c036d9eb3e4c36a98a63f5851898a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VWH5DZ3DMGNOE3PSBAGQXYYOK6/bundle.json","state_url":"https://pith.science/pith/VWH5DZ3DMGNOE3PSBAGQXYYOK6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VWH5DZ3DMGNOE3PSBAGQXYYOK6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-24T17:48:18Z","links":{"resolver":"https://pith.science/pith/VWH5DZ3DMGNOE3PSBAGQXYYOK6","bundle":"https://pith.science/pith/VWH5DZ3DMGNOE3PSBAGQXYYOK6/bundle.json","state":"https://pith.science/pith/VWH5DZ3DMGNOE3PSBAGQXYYOK6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VWH5DZ3DMGNOE3PSBAGQXYYOK6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VWH5DZ3DMGNOE3PSBAGQXYYOK6","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":"12d27bb09bc865e4d01316354fc2f322d06d85dde3ce95ae8a15f65482b48dda","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-08T19:41:06Z","title_canon_sha256":"458ceabca3d544d904262101cfce4a6df34ea51beaa473db02a098d9dd5c76ef"},"schema_version":"1.0","source":{"id":"1302.2127","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.2127","created_at":"2026-05-18T03:28:29Z"},{"alias_kind":"arxiv_version","alias_value":"1302.2127v3","created_at":"2026-05-18T03:28:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2127","created_at":"2026-05-18T03:28:29Z"},{"alias_kind":"pith_short_12","alias_value":"VWH5DZ3DMGNO","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VWH5DZ3DMGNOE3PS","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VWH5DZ3D","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:028eb189cebbad1b8975d42eac9dd5b21c8c036d9eb3e4c36a98a63f5851898a","target":"graph","created_at":"2026-05-18T03:28:29Z","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":"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","authors_text":"Jochen K\\\"onemann, Laura Sanit\\`a, Sina Sadeghian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-08T19:41:06Z","title":"An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2127","kind":"arxiv","version":3},"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:c155d9d2b4527dcfac628f85d36ba140b0d23f3a51eefe86d7b259ae5951d6e4","target":"record","created_at":"2026-05-18T03:28:29Z","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":"12d27bb09bc865e4d01316354fc2f322d06d85dde3ce95ae8a15f65482b48dda","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-08T19:41:06Z","title_canon_sha256":"458ceabca3d544d904262101cfce4a6df34ea51beaa473db02a098d9dd5c76ef"},"schema_version":"1.0","source":{"id":"1302.2127","kind":"arxiv","version":3}},"canonical_sha256":"ad8fd1e763619ae26df2080d0be30e57a9c0a25bf73fc69844ac420c20dacfec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad8fd1e763619ae26df2080d0be30e57a9c0a25bf73fc69844ac420c20dacfec","first_computed_at":"2026-05-18T03:28:29.003662Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:29.003662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/94YquQzHPslECBO/Li5BtS40zkUbRWj7u2JWSmGtOj1a5wYPTXMPIIycrnPIANWFOdwHS9CiDSTS+ROtjSECQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:29.004264Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.2127","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c155d9d2b4527dcfac628f85d36ba140b0d23f3a51eefe86d7b259ae5951d6e4","sha256:028eb189cebbad1b8975d42eac9dd5b21c8c036d9eb3e4c36a98a63f5851898a"],"state_sha256":"6d572c481654249d7df608751b53b86ed85f1986ff1b98976c363481c80878a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gcAWUeKY0bYzhE1qgPo6OfZlqCVXNWnsmZNnpaG/6qza2a05uZoD8R8BS2aavrVv/5ob9rRSWMBHU/+7KKoyAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T17:48:18.741652Z","bundle_sha256":"57895f5d0b81fa1376dcc706c4abd57532fc4a2d540bd497d1e4a11acbde33c7"}}