{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JNB6V3X2KVNAZSUIUPPYONUUPQ","short_pith_number":"pith:JNB6V3X2","schema_version":"1.0","canonical_sha256":"4b43eaeefa555a0cca88a3df8736947c3a9a63670739cd67f97f6b3840aef519","source":{"kind":"arxiv","id":"1811.09068","version":1},"attestation_state":"computed","paper":{"title":"Reduction-based exact solution of prize-collecting Steiner tree problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel Rehfeldt, Thorsten Koch","submitted_at":"2018-11-22T09:18:50Z","abstract_excerpt":"The prize-collecting Steiner tree problem PCSTP is a well-known generalization of the classical Steiner tree problem in graphs, with a large number of practical applications. It attracted particular interest during the latest (11th) DIMACS Challenge and since then a number of PCSTP solvers have been introduced in the literature, some of which drastically improved on the best results achieved at the Challenge. The following article aims to further advance the state of the art. It introduces new techniques and algorithms for PCSTP, involving various forms of reductions of PCSTP instances to equi"},"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":"1811.09068","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-22T09:18:50Z","cross_cats_sorted":[],"title_canon_sha256":"e88381980377f633ac0922edba696094f1c50bcc9bcf1d5f2cc6b9a38440c42a","abstract_canon_sha256":"b8c3764f62bdd703801135d177679daa0e40a0c2daebf563ba85482660068642"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:07.169842Z","signature_b64":"nfHQqw4xmzVpU+UQqjku6l4FHz79VYhZ3dOT0/Ran5emc6OU9swNhB2wDerUBTgBxJ6HY+y9UsPkoUCW3C2/DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b43eaeefa555a0cca88a3df8736947c3a9a63670739cd67f97f6b3840aef519","last_reissued_at":"2026-05-18T00:00:07.169234Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:07.169234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reduction-based exact solution of prize-collecting Steiner tree problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel Rehfeldt, Thorsten Koch","submitted_at":"2018-11-22T09:18:50Z","abstract_excerpt":"The prize-collecting Steiner tree problem PCSTP is a well-known generalization of the classical Steiner tree problem in graphs, with a large number of practical applications. It attracted particular interest during the latest (11th) DIMACS Challenge and since then a number of PCSTP solvers have been introduced in the literature, some of which drastically improved on the best results achieved at the Challenge. The following article aims to further advance the state of the art. It introduces new techniques and algorithms for PCSTP, involving various forms of reductions of PCSTP instances to equi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.09068","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":"1811.09068","created_at":"2026-05-18T00:00:07.169334+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.09068v1","created_at":"2026-05-18T00:00:07.169334+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.09068","created_at":"2026-05-18T00:00:07.169334+00:00"},{"alias_kind":"pith_short_12","alias_value":"JNB6V3X2KVNA","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JNB6V3X2KVNAZSUI","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JNB6V3X2","created_at":"2026-05-18T12:32:31.084164+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/JNB6V3X2KVNAZSUIUPPYONUUPQ","json":"https://pith.science/pith/JNB6V3X2KVNAZSUIUPPYONUUPQ.json","graph_json":"https://pith.science/api/pith-number/JNB6V3X2KVNAZSUIUPPYONUUPQ/graph.json","events_json":"https://pith.science/api/pith-number/JNB6V3X2KVNAZSUIUPPYONUUPQ/events.json","paper":"https://pith.science/paper/JNB6V3X2"},"agent_actions":{"view_html":"https://pith.science/pith/JNB6V3X2KVNAZSUIUPPYONUUPQ","download_json":"https://pith.science/pith/JNB6V3X2KVNAZSUIUPPYONUUPQ.json","view_paper":"https://pith.science/paper/JNB6V3X2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.09068&json=true","fetch_graph":"https://pith.science/api/pith-number/JNB6V3X2KVNAZSUIUPPYONUUPQ/graph.json","fetch_events":"https://pith.science/api/pith-number/JNB6V3X2KVNAZSUIUPPYONUUPQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JNB6V3X2KVNAZSUIUPPYONUUPQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JNB6V3X2KVNAZSUIUPPYONUUPQ/action/storage_attestation","attest_author":"https://pith.science/pith/JNB6V3X2KVNAZSUIUPPYONUUPQ/action/author_attestation","sign_citation":"https://pith.science/pith/JNB6V3X2KVNAZSUIUPPYONUUPQ/action/citation_signature","submit_replication":"https://pith.science/pith/JNB6V3X2KVNAZSUIUPPYONUUPQ/action/replication_record"}},"created_at":"2026-05-18T00:00:07.169334+00:00","updated_at":"2026-05-18T00:00:07.169334+00:00"}