{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3OR6FJYQRUENMSUJLEHFRW5UOY","short_pith_number":"pith:3OR6FJYQ","schema_version":"1.0","canonical_sha256":"dba3e2a7108d08d64a89590e58dbb4763cd66f6b0d8380bc489208764dc317ed","source":{"kind":"arxiv","id":"1412.3721","version":1},"attestation_state":"computed","paper":{"title":"Approximation Algorithms for Budget Constrained Network Upgradeable Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Debjyoti Saharoy, Sandeep Sen","submitted_at":"2014-12-11T16:47:57Z","abstract_excerpt":"We study budget constrained network upgradeable problems. We are given an undirected edge weighted graph $G=(V,E)$ where the weight an edge $e \\in E$ can be upgraded for a cost $c(e)$. Given a budget $B$ for improvement, the goal is to find a subset of edges to be upgraded so that the resulting network is optimum for $B$. The results obtained in this paper include the following.\n  Maximum Weight Constrained Spanning Tree\n  We present a randomized algorithm for the problem of weight upgradeable budget constrained maximum spanning tree on a general graph. This returns a spanning tree $\\mathcal{T"},"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":"1412.3721","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-11T16:47:57Z","cross_cats_sorted":[],"title_canon_sha256":"2aa7c39f9d99449daa360d8f23592c1a0977f599410ccfd1308551138ce8c88a","abstract_canon_sha256":"8f4ed7bbf35b63d029705c882c193288aaf55923e456bfa18f4b98af2c54e065"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:30.473981Z","signature_b64":"2nzYABZMLLTHZ8g9tpz0Y/wsWzP/7E/UvI7JG4ESnbHdDkUoIZJ/dMMq7ZmgrfL4w1c4c1U3DTY39W+AuCdtCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dba3e2a7108d08d64a89590e58dbb4763cd66f6b0d8380bc489208764dc317ed","last_reissued_at":"2026-05-18T02:31:30.473590Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:30.473590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation Algorithms for Budget Constrained Network Upgradeable Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Debjyoti Saharoy, Sandeep Sen","submitted_at":"2014-12-11T16:47:57Z","abstract_excerpt":"We study budget constrained network upgradeable problems. We are given an undirected edge weighted graph $G=(V,E)$ where the weight an edge $e \\in E$ can be upgraded for a cost $c(e)$. Given a budget $B$ for improvement, the goal is to find a subset of edges to be upgraded so that the resulting network is optimum for $B$. The results obtained in this paper include the following.\n  Maximum Weight Constrained Spanning Tree\n  We present a randomized algorithm for the problem of weight upgradeable budget constrained maximum spanning tree on a general graph. This returns a spanning tree $\\mathcal{T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3721","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":"1412.3721","created_at":"2026-05-18T02:31:30.473649+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.3721v1","created_at":"2026-05-18T02:31:30.473649+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3721","created_at":"2026-05-18T02:31:30.473649+00:00"},{"alias_kind":"pith_short_12","alias_value":"3OR6FJYQRUEN","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3OR6FJYQRUENMSUJ","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3OR6FJYQ","created_at":"2026-05-18T12:28:11.866339+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/3OR6FJYQRUENMSUJLEHFRW5UOY","json":"https://pith.science/pith/3OR6FJYQRUENMSUJLEHFRW5UOY.json","graph_json":"https://pith.science/api/pith-number/3OR6FJYQRUENMSUJLEHFRW5UOY/graph.json","events_json":"https://pith.science/api/pith-number/3OR6FJYQRUENMSUJLEHFRW5UOY/events.json","paper":"https://pith.science/paper/3OR6FJYQ"},"agent_actions":{"view_html":"https://pith.science/pith/3OR6FJYQRUENMSUJLEHFRW5UOY","download_json":"https://pith.science/pith/3OR6FJYQRUENMSUJLEHFRW5UOY.json","view_paper":"https://pith.science/paper/3OR6FJYQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.3721&json=true","fetch_graph":"https://pith.science/api/pith-number/3OR6FJYQRUENMSUJLEHFRW5UOY/graph.json","fetch_events":"https://pith.science/api/pith-number/3OR6FJYQRUENMSUJLEHFRW5UOY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3OR6FJYQRUENMSUJLEHFRW5UOY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3OR6FJYQRUENMSUJLEHFRW5UOY/action/storage_attestation","attest_author":"https://pith.science/pith/3OR6FJYQRUENMSUJLEHFRW5UOY/action/author_attestation","sign_citation":"https://pith.science/pith/3OR6FJYQRUENMSUJLEHFRW5UOY/action/citation_signature","submit_replication":"https://pith.science/pith/3OR6FJYQRUENMSUJLEHFRW5UOY/action/replication_record"}},"created_at":"2026-05-18T02:31:30.473649+00:00","updated_at":"2026-05-18T02:31:30.473649+00:00"}