{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:WRECXWOBF7R3XWET5ILSAP35P3","short_pith_number":"pith:WRECXWOB","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"},"canonical_sha256":"b4482bd9c12fe3bbd893ea17203f7d7edd7f12a56de535e300235ab30fbaa2f4","source":{"kind":"arxiv","id":"2405.03792","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.03792","created_at":"2026-07-05T08:16:10Z"},{"alias_kind":"arxiv_version","alias_value":"2405.03792v1","created_at":"2026-07-05T08:16:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.03792","created_at":"2026-07-05T08:16:10Z"},{"alias_kind":"pith_short_12","alias_value":"WRECXWOBF7R3","created_at":"2026-07-05T08:16:10Z"},{"alias_kind":"pith_short_16","alias_value":"WRECXWOBF7R3XWET","created_at":"2026-07-05T08:16:10Z"},{"alias_kind":"pith_short_8","alias_value":"WRECXWOB","created_at":"2026-07-05T08:16:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:WRECXWOBF7R3XWET5ILSAP35P3","target":"record","payload":{"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"},"canonical_sha256":"b4482bd9c12fe3bbd893ea17203f7d7edd7f12a56de535e300235ab30fbaa2f4","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"},"source_kind":"arxiv","source_id":"2405.03792","source_version":1,"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-07-05T08:16:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fNGvfUmygWcYeayoRg9LPZb17Wkb+eCW3jrKaYe63Hd578OKcSyGmK8ymSVs8ZnncY0CmLDLSomfaiREEImuDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T17:07:08.088026Z"},"content_sha256":"441e68c5fa10e657e5d1da69b968d6864aa0b38f3e56f1067e60ecee94559cd2","schema_version":"1.0","event_id":"sha256:441e68c5fa10e657e5d1da69b968d6864aa0b38f3e56f1067e60ecee94559cd2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:WRECXWOBF7R3XWET5ILSAP35P3","target":"graph","payload":{"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"},"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-07-05T08:16:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ApnWf40Crk8BY5U/Y9JbuPiD+Uy02b8DmZ8EO8ULyJCKLF/ZeplZPAHeemPgkA9iwf+opcMmL7ZXOQk7M+ZwBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T17:07:08.088402Z"},"content_sha256":"01293e17f556811838232043e5e585bcdc1a5b789ef030483230ff47890a0ca7","schema_version":"1.0","event_id":"sha256:01293e17f556811838232043e5e585bcdc1a5b789ef030483230ff47890a0ca7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WRECXWOBF7R3XWET5ILSAP35P3/bundle.json","state_url":"https://pith.science/pith/WRECXWOBF7R3XWET5ILSAP35P3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WRECXWOBF7R3XWET5ILSAP35P3/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-07-08T17:07:08Z","links":{"resolver":"https://pith.science/pith/WRECXWOBF7R3XWET5ILSAP35P3","bundle":"https://pith.science/pith/WRECXWOBF7R3XWET5ILSAP35P3/bundle.json","state":"https://pith.science/pith/WRECXWOBF7R3XWET5ILSAP35P3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WRECXWOBF7R3XWET5ILSAP35P3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:WRECXWOBF7R3XWET5ILSAP35P3","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":"1c8531193527d07622b870b5ef37d94183b2737319c759c8e286672440122e3f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-05-06T18:53:44Z","title_canon_sha256":"6a831da4259eaf3fd0a5a414b46dfea3a1b35943bf7e1b1e9a0535cf3dc24991"},"schema_version":"1.0","source":{"id":"2405.03792","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.03792","created_at":"2026-07-05T08:16:10Z"},{"alias_kind":"arxiv_version","alias_value":"2405.03792v1","created_at":"2026-07-05T08:16:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.03792","created_at":"2026-07-05T08:16:10Z"},{"alias_kind":"pith_short_12","alias_value":"WRECXWOBF7R3","created_at":"2026-07-05T08:16:10Z"},{"alias_kind":"pith_short_16","alias_value":"WRECXWOBF7R3XWET","created_at":"2026-07-05T08:16:10Z"},{"alias_kind":"pith_short_8","alias_value":"WRECXWOB","created_at":"2026-07-05T08:16:10Z"}],"graph_snapshots":[{"event_id":"sha256:01293e17f556811838232043e5e585bcdc1a5b789ef030483230ff47890a0ca7","target":"graph","created_at":"2026-07-05T08:16:10Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2405.03792/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ali Ahmadi, Iman Gholami, Mohammad Mahdavi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-05-06T18:53:44Z","title":"Prize-Collecting Steiner Tree: A 1.79 Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.03792","kind":"arxiv","version":1},"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:441e68c5fa10e657e5d1da69b968d6864aa0b38f3e56f1067e60ecee94559cd2","target":"record","created_at":"2026-07-05T08:16:10Z","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":"1c8531193527d07622b870b5ef37d94183b2737319c759c8e286672440122e3f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-05-06T18:53:44Z","title_canon_sha256":"6a831da4259eaf3fd0a5a414b46dfea3a1b35943bf7e1b1e9a0535cf3dc24991"},"schema_version":"1.0","source":{"id":"2405.03792","kind":"arxiv","version":1}},"canonical_sha256":"b4482bd9c12fe3bbd893ea17203f7d7edd7f12a56de535e300235ab30fbaa2f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4482bd9c12fe3bbd893ea17203f7d7edd7f12a56de535e300235ab30fbaa2f4","first_computed_at":"2026-07-05T08:16:10.771234Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:16:10.771234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oeJMHoxuDUti9y28JUpxrY0ro+Xjf/LJpRHE8gzrl9bzlt1qNvcMPsI3T86Fwb6aWCPK1fnWd3PYIrn1zDFDAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:16:10.771728Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.03792","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:441e68c5fa10e657e5d1da69b968d6864aa0b38f3e56f1067e60ecee94559cd2","sha256:01293e17f556811838232043e5e585bcdc1a5b789ef030483230ff47890a0ca7"],"state_sha256":"e76aa54d63c968c21d42869c5291fc1d6d66ebadfe2fa5d2929dc0d083e12c28"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yie3bxgN7852VoZb+PgddjYNkINsRKaKOB3APxKRMhOa3u/Uhr483e8D79LnjaTGndnrR9bmVeh72qv65hMfAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T17:07:08.090378Z","bundle_sha256":"cafc36650ae7df501f531faa9aeaf43cdaa93f20f8dca027da0435f1387771ae"}}