{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:WRECXWOBF7R3XWET5ILSAP35P3","short_pith_number":"pith:WRECXWOB","schema_version":"1.0","canonical_sha256":"b4482bd9c12fe3bbd893ea17203f7d7edd7f12a56de535e300235ab30fbaa2f4","source":{"kind":"arxiv","id":"2405.03792","version":1},"attestation_state":"computed","paper":{"title":"Prize-Collecting Steiner Tree: A 1.79 Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ali Ahmadi, Iman Gholami, Mohammad Mahdavi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade","submitted_at":"2024-05-06T18:53:44Z","abstract_excerpt":"Prize-Collecting Steiner Tree (PCST) is a generalization of the Steiner Tree problem, a fundamental problem in computer science. In the classic Steiner Tree problem, we aim to connect a set of vertices known as terminals using the minimum-weight tree in a given weighted graph. In this generalized version, each vertex has a penalty, and there is flexibility to decide whether to connect each vertex or pay its associated penalty, making the problem more realistic and practical.\n  Both the Steiner Tree problem and its Prize-Collecting version had long-standing $2$-approximation algorithms, matchin"},"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":"2405.03792","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-05-06T18:53:44Z","cross_cats_sorted":[],"title_canon_sha256":"6a831da4259eaf3fd0a5a414b46dfea3a1b35943bf7e1b1e9a0535cf3dc24991","abstract_canon_sha256":"1c8531193527d07622b870b5ef37d94183b2737319c759c8e286672440122e3f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:16:10.771728Z","signature_b64":"oeJMHoxuDUti9y28JUpxrY0ro+Xjf/LJpRHE8gzrl9bzlt1qNvcMPsI3T86Fwb6aWCPK1fnWd3PYIrn1zDFDAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4482bd9c12fe3bbd893ea17203f7d7edd7f12a56de535e300235ab30fbaa2f4","last_reissued_at":"2026-07-05T08:16:10.771234Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:16:10.771234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Prize-Collecting Steiner Tree: A 1.79 Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ali Ahmadi, Iman Gholami, Mohammad Mahdavi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade","submitted_at":"2024-05-06T18:53:44Z","abstract_excerpt":"Prize-Collecting Steiner Tree (PCST) is a generalization of the Steiner Tree problem, a fundamental problem in computer science. In the classic Steiner Tree problem, we aim to connect a set of vertices known as terminals using the minimum-weight tree in a given weighted graph. In this generalized version, each vertex has a penalty, and there is flexibility to decide whether to connect each vertex or pay its associated penalty, making the problem more realistic and practical.\n  Both the Steiner Tree problem and its Prize-Collecting version had long-standing $2$-approximation algorithms, matchin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.03792","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.03792/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2405.03792","created_at":"2026-07-05T08:16:10.771296+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.03792v1","created_at":"2026-07-05T08:16:10.771296+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.03792","created_at":"2026-07-05T08:16:10.771296+00:00"},{"alias_kind":"pith_short_12","alias_value":"WRECXWOBF7R3","created_at":"2026-07-05T08:16:10.771296+00:00"},{"alias_kind":"pith_short_16","alias_value":"WRECXWOBF7R3XWET","created_at":"2026-07-05T08:16:10.771296+00:00"},{"alias_kind":"pith_short_8","alias_value":"WRECXWOB","created_at":"2026-07-05T08:16:10.771296+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/WRECXWOBF7R3XWET5ILSAP35P3","json":"https://pith.science/pith/WRECXWOBF7R3XWET5ILSAP35P3.json","graph_json":"https://pith.science/api/pith-number/WRECXWOBF7R3XWET5ILSAP35P3/graph.json","events_json":"https://pith.science/api/pith-number/WRECXWOBF7R3XWET5ILSAP35P3/events.json","paper":"https://pith.science/paper/WRECXWOB"},"agent_actions":{"view_html":"https://pith.science/pith/WRECXWOBF7R3XWET5ILSAP35P3","download_json":"https://pith.science/pith/WRECXWOBF7R3XWET5ILSAP35P3.json","view_paper":"https://pith.science/paper/WRECXWOB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.03792&json=true","fetch_graph":"https://pith.science/api/pith-number/WRECXWOBF7R3XWET5ILSAP35P3/graph.json","fetch_events":"https://pith.science/api/pith-number/WRECXWOBF7R3XWET5ILSAP35P3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WRECXWOBF7R3XWET5ILSAP35P3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WRECXWOBF7R3XWET5ILSAP35P3/action/storage_attestation","attest_author":"https://pith.science/pith/WRECXWOBF7R3XWET5ILSAP35P3/action/author_attestation","sign_citation":"https://pith.science/pith/WRECXWOBF7R3XWET5ILSAP35P3/action/citation_signature","submit_replication":"https://pith.science/pith/WRECXWOBF7R3XWET5ILSAP35P3/action/replication_record"}},"created_at":"2026-07-05T08:16:10.771296+00:00","updated_at":"2026-07-05T08:16:10.771296+00:00"}