{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HBQNHF7WAI5W5QOLXVMX3CSUJ6","short_pith_number":"pith:HBQNHF7W","schema_version":"1.0","canonical_sha256":"3860d397f6023b6ec1cbbd597d8a544f85206ea4df3a6a69e20e87200e5fdbec","source":{"kind":"arxiv","id":"1902.01939","version":1},"attestation_state":"computed","paper":{"title":"The Fast Heuristic Algorithms and Post-Processing Techniques to Design Large and Low-Cost Communication Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Doreen Thomas, Marcus Brazil, Saman Halgamuge, Yahui Sun","submitted_at":"2019-01-09T01:00:28Z","abstract_excerpt":"It is challenging to design large and low-cost communication networks. In this paper, we formulate this challenge as the prize-collecting Steiner Tree Problem (PCSTP). The objective is to minimize the costs of transmission routes and the disconnected monetary or informational profits. Initially, we note that the PCSTP is MAX SNP-hard. Then, we propose some post-processing techniques to improve suboptimal solutions to PCSTP. Based on these techniques, we propose two fast heuristic algorithms: the first one is a quasilinear time heuristic algorithm that is faster and consumes less memory than ot"},"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":"1902.01939","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-01-09T01:00:28Z","cross_cats_sorted":[],"title_canon_sha256":"652eb098539ab99b48a45fdce0d8e501ecaa58798c6f25f7a1576f6d3918739d","abstract_canon_sha256":"a2b60c4bb06bada3345e7779cd27502e891636c556603276781d08deae090e84"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:38.284795Z","signature_b64":"UxWrhSCAIK3LMQRsb7OXfrHsYMT4fk5/lGs0EB/HIsKpi0POuQJgbYNTeGuRHiJCqskL1GehtTJaiLsGmZasAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3860d397f6023b6ec1cbbd597d8a544f85206ea4df3a6a69e20e87200e5fdbec","last_reissued_at":"2026-05-17T23:54:38.284253Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:38.284253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Fast Heuristic Algorithms and Post-Processing Techniques to Design Large and Low-Cost Communication Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Doreen Thomas, Marcus Brazil, Saman Halgamuge, Yahui Sun","submitted_at":"2019-01-09T01:00:28Z","abstract_excerpt":"It is challenging to design large and low-cost communication networks. In this paper, we formulate this challenge as the prize-collecting Steiner Tree Problem (PCSTP). The objective is to minimize the costs of transmission routes and the disconnected monetary or informational profits. Initially, we note that the PCSTP is MAX SNP-hard. Then, we propose some post-processing techniques to improve suboptimal solutions to PCSTP. Based on these techniques, we propose two fast heuristic algorithms: the first one is a quasilinear time heuristic algorithm that is faster and consumes less memory than ot"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01939","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":"1902.01939","created_at":"2026-05-17T23:54:38.284324+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.01939v1","created_at":"2026-05-17T23:54:38.284324+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01939","created_at":"2026-05-17T23:54:38.284324+00:00"},{"alias_kind":"pith_short_12","alias_value":"HBQNHF7WAI5W","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"HBQNHF7WAI5W5QOL","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"HBQNHF7W","created_at":"2026-05-18T12:33:18.533446+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/HBQNHF7WAI5W5QOLXVMX3CSUJ6","json":"https://pith.science/pith/HBQNHF7WAI5W5QOLXVMX3CSUJ6.json","graph_json":"https://pith.science/api/pith-number/HBQNHF7WAI5W5QOLXVMX3CSUJ6/graph.json","events_json":"https://pith.science/api/pith-number/HBQNHF7WAI5W5QOLXVMX3CSUJ6/events.json","paper":"https://pith.science/paper/HBQNHF7W"},"agent_actions":{"view_html":"https://pith.science/pith/HBQNHF7WAI5W5QOLXVMX3CSUJ6","download_json":"https://pith.science/pith/HBQNHF7WAI5W5QOLXVMX3CSUJ6.json","view_paper":"https://pith.science/paper/HBQNHF7W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.01939&json=true","fetch_graph":"https://pith.science/api/pith-number/HBQNHF7WAI5W5QOLXVMX3CSUJ6/graph.json","fetch_events":"https://pith.science/api/pith-number/HBQNHF7WAI5W5QOLXVMX3CSUJ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HBQNHF7WAI5W5QOLXVMX3CSUJ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HBQNHF7WAI5W5QOLXVMX3CSUJ6/action/storage_attestation","attest_author":"https://pith.science/pith/HBQNHF7WAI5W5QOLXVMX3CSUJ6/action/author_attestation","sign_citation":"https://pith.science/pith/HBQNHF7WAI5W5QOLXVMX3CSUJ6/action/citation_signature","submit_replication":"https://pith.science/pith/HBQNHF7WAI5W5QOLXVMX3CSUJ6/action/replication_record"}},"created_at":"2026-05-17T23:54:38.284324+00:00","updated_at":"2026-05-17T23:54:38.284324+00:00"}