{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JHL2FSHSMDFVOVFVW7MSNAEBVY","short_pith_number":"pith:JHL2FSHS","schema_version":"1.0","canonical_sha256":"49d7a2c8f260cb5754b5b7d9268081ae0c13e8e4bc4e5bf121f01ee70092e884","source":{"kind":"arxiv","id":"1710.07774","version":2},"attestation_state":"computed","paper":{"title":"A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Haotian Jiang, Shaofeng H.-C. Jiang, T-H. Hubert Chan","submitted_at":"2017-10-21T08:33:37Z","abstract_excerpt":"We present a unified polynomial-time approximation scheme (PTAS) for the prize collecting traveling salesman problem (PCTSP) and the prize collecting Steiner tree problem (PCSTP) in doubling metrics. Given a metric space and a penalty function on a subset of points known as terminals, a solution is a subgraph on points in the metric space, whose cost is the weight of its edges plus the penalty due to terminals not covered by the subgraph. Under our unified framework, the solution subgraph needs to be Eulerian for PCTSP, while it needs to be connected for PCSTP. Before our work, even a QPTAS fo"},"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":"1710.07774","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-21T08:33:37Z","cross_cats_sorted":[],"title_canon_sha256":"f12936ec63f89b1c767949f80f4b734cfb46185bc26dbd1be3cb66a63c58dba6","abstract_canon_sha256":"7cc578da334fe7db7c13831cb82f9b5f8e34f66777bc0f957ced52db8b41379d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:43.780104Z","signature_b64":"PMu5Wd/BJeon02PajBBAV6t9F4Srb3SeqC33p7GWVAViWXuVh/K2XneMZmhewJUdjsgG/MGaBFNyHbwJ21YlBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49d7a2c8f260cb5754b5b7d9268081ae0c13e8e4bc4e5bf121f01ee70092e884","last_reissued_at":"2026-05-18T00:12:43.779630Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:43.779630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Haotian Jiang, Shaofeng H.-C. Jiang, T-H. Hubert Chan","submitted_at":"2017-10-21T08:33:37Z","abstract_excerpt":"We present a unified polynomial-time approximation scheme (PTAS) for the prize collecting traveling salesman problem (PCTSP) and the prize collecting Steiner tree problem (PCSTP) in doubling metrics. Given a metric space and a penalty function on a subset of points known as terminals, a solution is a subgraph on points in the metric space, whose cost is the weight of its edges plus the penalty due to terminals not covered by the subgraph. Under our unified framework, the solution subgraph needs to be Eulerian for PCTSP, while it needs to be connected for PCSTP. Before our work, even a QPTAS fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07774","kind":"arxiv","version":2},"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":"1710.07774","created_at":"2026-05-18T00:12:43.779700+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.07774v2","created_at":"2026-05-18T00:12:43.779700+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07774","created_at":"2026-05-18T00:12:43.779700+00:00"},{"alias_kind":"pith_short_12","alias_value":"JHL2FSHSMDFV","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JHL2FSHSMDFVOVFV","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JHL2FSHS","created_at":"2026-05-18T12:31:24.725408+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/JHL2FSHSMDFVOVFVW7MSNAEBVY","json":"https://pith.science/pith/JHL2FSHSMDFVOVFVW7MSNAEBVY.json","graph_json":"https://pith.science/api/pith-number/JHL2FSHSMDFVOVFVW7MSNAEBVY/graph.json","events_json":"https://pith.science/api/pith-number/JHL2FSHSMDFVOVFVW7MSNAEBVY/events.json","paper":"https://pith.science/paper/JHL2FSHS"},"agent_actions":{"view_html":"https://pith.science/pith/JHL2FSHSMDFVOVFVW7MSNAEBVY","download_json":"https://pith.science/pith/JHL2FSHSMDFVOVFVW7MSNAEBVY.json","view_paper":"https://pith.science/paper/JHL2FSHS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.07774&json=true","fetch_graph":"https://pith.science/api/pith-number/JHL2FSHSMDFVOVFVW7MSNAEBVY/graph.json","fetch_events":"https://pith.science/api/pith-number/JHL2FSHSMDFVOVFVW7MSNAEBVY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JHL2FSHSMDFVOVFVW7MSNAEBVY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JHL2FSHSMDFVOVFVW7MSNAEBVY/action/storage_attestation","attest_author":"https://pith.science/pith/JHL2FSHSMDFVOVFVW7MSNAEBVY/action/author_attestation","sign_citation":"https://pith.science/pith/JHL2FSHSMDFVOVFVW7MSNAEBVY/action/citation_signature","submit_replication":"https://pith.science/pith/JHL2FSHSMDFVOVFVW7MSNAEBVY/action/replication_record"}},"created_at":"2026-05-18T00:12:43.779700+00:00","updated_at":"2026-05-18T00:12:43.779700+00:00"}