{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3OR6FJYQRUENMSUJLEHFRW5UOY","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":"8f4ed7bbf35b63d029705c882c193288aaf55923e456bfa18f4b98af2c54e065","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-11T16:47:57Z","title_canon_sha256":"2aa7c39f9d99449daa360d8f23592c1a0977f599410ccfd1308551138ce8c88a"},"schema_version":"1.0","source":{"id":"1412.3721","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.3721","created_at":"2026-05-18T02:31:30Z"},{"alias_kind":"arxiv_version","alias_value":"1412.3721v1","created_at":"2026-05-18T02:31:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3721","created_at":"2026-05-18T02:31:30Z"},{"alias_kind":"pith_short_12","alias_value":"3OR6FJYQRUEN","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3OR6FJYQRUENMSUJ","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3OR6FJYQ","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:cde843e502d278e5e81399b4e373a585bc114807d49f10ff8bca77582c3f6c15","target":"graph","created_at":"2026-05-18T02:31:30Z","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":"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","authors_text":"Debjyoti Saharoy, Sandeep Sen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-11T16:47:57Z","title":"Approximation Algorithms for Budget Constrained Network Upgradeable Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3721","kind":"arxiv","version":1},"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:49eb0dfd31f489b632d2e28011209b79fe50635d81721f4f9a7aade51982e455","target":"record","created_at":"2026-05-18T02:31:30Z","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":"8f4ed7bbf35b63d029705c882c193288aaf55923e456bfa18f4b98af2c54e065","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-11T16:47:57Z","title_canon_sha256":"2aa7c39f9d99449daa360d8f23592c1a0977f599410ccfd1308551138ce8c88a"},"schema_version":"1.0","source":{"id":"1412.3721","kind":"arxiv","version":1}},"canonical_sha256":"dba3e2a7108d08d64a89590e58dbb4763cd66f6b0d8380bc489208764dc317ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dba3e2a7108d08d64a89590e58dbb4763cd66f6b0d8380bc489208764dc317ed","first_computed_at":"2026-05-18T02:31:30.473590Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:30.473590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2nzYABZMLLTHZ8g9tpz0Y/wsWzP/7E/UvI7JG4ESnbHdDkUoIZJ/dMMq7ZmgrfL4w1c4c1U3DTY39W+AuCdtCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:30.473981Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.3721","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49eb0dfd31f489b632d2e28011209b79fe50635d81721f4f9a7aade51982e455","sha256:cde843e502d278e5e81399b4e373a585bc114807d49f10ff8bca77582c3f6c15"],"state_sha256":"c16e6c2191cda1f2186f298e824103321c44d6749d479426bd2b039b0f7a4d40"}