{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3OR6FJYQRUENMSUJLEHFRW5UOY","short_pith_number":"pith:3OR6FJYQ","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"},"canonical_sha256":"dba3e2a7108d08d64a89590e58dbb4763cd66f6b0d8380bc489208764dc317ed","source":{"kind":"arxiv","id":"1412.3721","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3OR6FJYQRUENMSUJLEHFRW5UOY","target":"record","payload":{"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"},"canonical_sha256":"dba3e2a7108d08d64a89590e58dbb4763cd66f6b0d8380bc489208764dc317ed","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"},"source_kind":"arxiv","source_id":"1412.3721","source_version":1,"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-18T02:31:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pb88SZ6OF1IcTzcBXzGSuGohwmXwJvZIGPqsSjyEDn0412NNR/S4AXzSl3fpoe8owzKL1248KsKiVEkBcxEiBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:24:54.570074Z"},"content_sha256":"49eb0dfd31f489b632d2e28011209b79fe50635d81721f4f9a7aade51982e455","schema_version":"1.0","event_id":"sha256:49eb0dfd31f489b632d2e28011209b79fe50635d81721f4f9a7aade51982e455"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3OR6FJYQRUENMSUJLEHFRW5UOY","target":"graph","payload":{"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"},"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-18T02:31:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tEtFn8vWviH9/ojTc+X0LFUSVO8TkIxQw0rh0sJtuDrxxkNGf5S80qiSOVOiE/hoetAYxFo0JfZlvWFjOKF8AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:24:54.570736Z"},"content_sha256":"cde843e502d278e5e81399b4e373a585bc114807d49f10ff8bca77582c3f6c15","schema_version":"1.0","event_id":"sha256:cde843e502d278e5e81399b4e373a585bc114807d49f10ff8bca77582c3f6c15"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3OR6FJYQRUENMSUJLEHFRW5UOY/bundle.json","state_url":"https://pith.science/pith/3OR6FJYQRUENMSUJLEHFRW5UOY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3OR6FJYQRUENMSUJLEHFRW5UOY/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-02T23:24:54Z","links":{"resolver":"https://pith.science/pith/3OR6FJYQRUENMSUJLEHFRW5UOY","bundle":"https://pith.science/pith/3OR6FJYQRUENMSUJLEHFRW5UOY/bundle.json","state":"https://pith.science/pith/3OR6FJYQRUENMSUJLEHFRW5UOY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3OR6FJYQRUENMSUJLEHFRW5UOY/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sCYMTWZ+g3fT2/XSrCb1YMMhQc2ApDhK2CEUf3/Oi2idNudtoz7Vmt5ChkcPTf6TbtC+myTj55pgphDomhX0Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T23:24:54.573901Z","bundle_sha256":"fa91b269cb3e2d56161b05bcd5693155af07806b7751d783b7596e593fc32bfc"}}