{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NBFVPV4GGJ5G6EG4IKPFU3AKFB","short_pith_number":"pith:NBFVPV4G","schema_version":"1.0","canonical_sha256":"684b57d786327a6f10dc429e5a6c0a28422f1307a262d2fdf47b406caa4b4a7f","source":{"kind":"arxiv","id":"1710.07040","version":2},"attestation_state":"computed","paper":{"title":"A Primal-Dual based Distributed Approximation Algorithm for Prize-Collecting Steiner Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Aris T. Pagourtzis, Parikshit Saikia, Sushanta Karmakar","submitted_at":"2017-10-19T08:41:38Z","abstract_excerpt":"The Prize-Collecting Steiner Tree (PCST) problem is a generalization of the Steiner Tree problem that has applications in network design, content distribution networks, and many more. There are a few centralized approximation algorithms \\cite{DB_MG_DS_DW_1993, GW_1995, DJ_MM_SP_2000, AA_MB_MH_2011} for solving the PCST problem. However no distributed algorithm is known that solves PCST with a guaranteed approximation factor. In this work we present an asynchronous distributed $(2 - \\frac{1}{n - 1})$-approximation algorithm that constructs a PCST for a given connected undirected graph with non-"},"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.07040","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-10-19T08:41:38Z","cross_cats_sorted":[],"title_canon_sha256":"c50f25683dd7785d202466cb0d7ff500171303986e084744eb509f0f95acae9b","abstract_canon_sha256":"3b53e0dbad56737f136ddb5b628a5990d1b07b17bbfc1d1483ce34cbeba35d4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:58.250612Z","signature_b64":"W9pOiCpobPo6PmX3GdKmMwO4O+VfpJN7/S0qA+G8v0Noo3znjLhPduXw1k+jhMV5Xns3zisR+Asi1TGbdJbgCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"684b57d786327a6f10dc429e5a6c0a28422f1307a262d2fdf47b406caa4b4a7f","last_reissued_at":"2026-05-18T00:22:58.250183Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:58.250183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Primal-Dual based Distributed Approximation Algorithm for Prize-Collecting Steiner Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Aris T. Pagourtzis, Parikshit Saikia, Sushanta Karmakar","submitted_at":"2017-10-19T08:41:38Z","abstract_excerpt":"The Prize-Collecting Steiner Tree (PCST) problem is a generalization of the Steiner Tree problem that has applications in network design, content distribution networks, and many more. There are a few centralized approximation algorithms \\cite{DB_MG_DS_DW_1993, GW_1995, DJ_MM_SP_2000, AA_MB_MH_2011} for solving the PCST problem. However no distributed algorithm is known that solves PCST with a guaranteed approximation factor. In this work we present an asynchronous distributed $(2 - \\frac{1}{n - 1})$-approximation algorithm that constructs a PCST for a given connected undirected graph with non-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07040","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.07040","created_at":"2026-05-18T00:22:58.250270+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.07040v2","created_at":"2026-05-18T00:22:58.250270+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07040","created_at":"2026-05-18T00:22:58.250270+00:00"},{"alias_kind":"pith_short_12","alias_value":"NBFVPV4GGJ5G","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"NBFVPV4GGJ5G6EG4","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"NBFVPV4G","created_at":"2026-05-18T12:31:31.346846+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/NBFVPV4GGJ5G6EG4IKPFU3AKFB","json":"https://pith.science/pith/NBFVPV4GGJ5G6EG4IKPFU3AKFB.json","graph_json":"https://pith.science/api/pith-number/NBFVPV4GGJ5G6EG4IKPFU3AKFB/graph.json","events_json":"https://pith.science/api/pith-number/NBFVPV4GGJ5G6EG4IKPFU3AKFB/events.json","paper":"https://pith.science/paper/NBFVPV4G"},"agent_actions":{"view_html":"https://pith.science/pith/NBFVPV4GGJ5G6EG4IKPFU3AKFB","download_json":"https://pith.science/pith/NBFVPV4GGJ5G6EG4IKPFU3AKFB.json","view_paper":"https://pith.science/paper/NBFVPV4G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.07040&json=true","fetch_graph":"https://pith.science/api/pith-number/NBFVPV4GGJ5G6EG4IKPFU3AKFB/graph.json","fetch_events":"https://pith.science/api/pith-number/NBFVPV4GGJ5G6EG4IKPFU3AKFB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NBFVPV4GGJ5G6EG4IKPFU3AKFB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NBFVPV4GGJ5G6EG4IKPFU3AKFB/action/storage_attestation","attest_author":"https://pith.science/pith/NBFVPV4GGJ5G6EG4IKPFU3AKFB/action/author_attestation","sign_citation":"https://pith.science/pith/NBFVPV4GGJ5G6EG4IKPFU3AKFB/action/citation_signature","submit_replication":"https://pith.science/pith/NBFVPV4GGJ5G6EG4IKPFU3AKFB/action/replication_record"}},"created_at":"2026-05-18T00:22:58.250270+00:00","updated_at":"2026-05-18T00:22:58.250270+00:00"}