{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NBFVPV4GGJ5G6EG4IKPFU3AKFB","short_pith_number":"pith:NBFVPV4G","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"},"canonical_sha256":"684b57d786327a6f10dc429e5a6c0a28422f1307a262d2fdf47b406caa4b4a7f","source":{"kind":"arxiv","id":"1710.07040","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07040","created_at":"2026-05-18T00:22:58Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07040v2","created_at":"2026-05-18T00:22:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07040","created_at":"2026-05-18T00:22:58Z"},{"alias_kind":"pith_short_12","alias_value":"NBFVPV4GGJ5G","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NBFVPV4GGJ5G6EG4","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NBFVPV4G","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NBFVPV4GGJ5G6EG4IKPFU3AKFB","target":"record","payload":{"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"},"canonical_sha256":"684b57d786327a6f10dc429e5a6c0a28422f1307a262d2fdf47b406caa4b4a7f","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"},"source_kind":"arxiv","source_id":"1710.07040","source_version":2,"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-05-18T00:22:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QCLpUTdOqUoWb6hEL3nWSDitu5XlgL7zp3/dx6WqFBqUQTrRftWqE+4KI7QoQWqPU6rAysJuxFCRFdCZ6YlGDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T04:37:07.194260Z"},"content_sha256":"3fa26834389efe5ecfb907c8e082e0ca595b391ad835f4c20f1c6f3fc78ce0c9","schema_version":"1.0","event_id":"sha256:3fa26834389efe5ecfb907c8e082e0ca595b391ad835f4c20f1c6f3fc78ce0c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NBFVPV4GGJ5G6EG4IKPFU3AKFB","target":"graph","payload":{"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"},"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-05-18T00:22:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eiEMgXmTxXnko/Sep7b8W+stO134EfCUut8C9pLH/3HnEsSxtV+yzESd5o/LABpNtAT2N501aWSbrO4Aa5IKDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T04:37:07.194686Z"},"content_sha256":"63dd66097ce8a6db6106663bdd0ab1c8461c12ec624305fa0729bc518d53b196","schema_version":"1.0","event_id":"sha256:63dd66097ce8a6db6106663bdd0ab1c8461c12ec624305fa0729bc518d53b196"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NBFVPV4GGJ5G6EG4IKPFU3AKFB/bundle.json","state_url":"https://pith.science/pith/NBFVPV4GGJ5G6EG4IKPFU3AKFB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NBFVPV4GGJ5G6EG4IKPFU3AKFB/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-06-26T04:37:07Z","links":{"resolver":"https://pith.science/pith/NBFVPV4GGJ5G6EG4IKPFU3AKFB","bundle":"https://pith.science/pith/NBFVPV4GGJ5G6EG4IKPFU3AKFB/bundle.json","state":"https://pith.science/pith/NBFVPV4GGJ5G6EG4IKPFU3AKFB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NBFVPV4GGJ5G6EG4IKPFU3AKFB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NBFVPV4GGJ5G6EG4IKPFU3AKFB","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":"3b53e0dbad56737f136ddb5b628a5990d1b07b17bbfc1d1483ce34cbeba35d4a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-10-19T08:41:38Z","title_canon_sha256":"c50f25683dd7785d202466cb0d7ff500171303986e084744eb509f0f95acae9b"},"schema_version":"1.0","source":{"id":"1710.07040","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07040","created_at":"2026-05-18T00:22:58Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07040v2","created_at":"2026-05-18T00:22:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07040","created_at":"2026-05-18T00:22:58Z"},{"alias_kind":"pith_short_12","alias_value":"NBFVPV4GGJ5G","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NBFVPV4GGJ5G6EG4","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NBFVPV4G","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:63dd66097ce8a6db6106663bdd0ab1c8461c12ec624305fa0729bc518d53b196","target":"graph","created_at":"2026-05-18T00:22:58Z","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"},"paper":{"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-","authors_text":"Aris T. Pagourtzis, Parikshit Saikia, Sushanta Karmakar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-10-19T08:41:38Z","title":"A Primal-Dual based Distributed Approximation Algorithm for Prize-Collecting Steiner Tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07040","kind":"arxiv","version":2},"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:3fa26834389efe5ecfb907c8e082e0ca595b391ad835f4c20f1c6f3fc78ce0c9","target":"record","created_at":"2026-05-18T00:22:58Z","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":"3b53e0dbad56737f136ddb5b628a5990d1b07b17bbfc1d1483ce34cbeba35d4a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-10-19T08:41:38Z","title_canon_sha256":"c50f25683dd7785d202466cb0d7ff500171303986e084744eb509f0f95acae9b"},"schema_version":"1.0","source":{"id":"1710.07040","kind":"arxiv","version":2}},"canonical_sha256":"684b57d786327a6f10dc429e5a6c0a28422f1307a262d2fdf47b406caa4b4a7f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"684b57d786327a6f10dc429e5a6c0a28422f1307a262d2fdf47b406caa4b4a7f","first_computed_at":"2026-05-18T00:22:58.250183Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:58.250183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W9pOiCpobPo6PmX3GdKmMwO4O+VfpJN7/S0qA+G8v0Noo3znjLhPduXw1k+jhMV5Xns3zisR+Asi1TGbdJbgCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:58.250612Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.07040","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3fa26834389efe5ecfb907c8e082e0ca595b391ad835f4c20f1c6f3fc78ce0c9","sha256:63dd66097ce8a6db6106663bdd0ab1c8461c12ec624305fa0729bc518d53b196"],"state_sha256":"394a2a316db3c4587f29b38869de6a82a6ff8371c16cab2bea9cad25583f91e8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LnrIVE0fz6GU51K56tLSVxbF7vQCunLp4mDP7pev5R7rco794i65QDaorxaOEv/nmgec+IkUMOuLMpiMW1E0CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T04:37:07.196866Z","bundle_sha256":"8495de934d840746f59f994c927b52ad8305636b39400714f5a684b66ad1bbe1"}}