{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:4RMDUMV66UPRNWMEKQBYNMLDQF","short_pith_number":"pith:4RMDUMV6","schema_version":"1.0","canonical_sha256":"e4583a32bef51f16d984540386b163817898e1b1732965f30bf40c6e142cf772","source":{"kind":"arxiv","id":"1205.0925","version":1},"attestation_state":"computed","paper":{"title":"Controlled stochastic networks in heavy traffic: Convergence of value functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Amarjit Budhiraja, Arka P. Ghosh","submitted_at":"2012-05-04T11:34:05Z","abstract_excerpt":"Scheduling control problems for a family of unitary networks under heavy traffic with general interarrival and service times, probabilistic routing and an infinite horizon discounted linear holding cost are studied. Diffusion control problems, that have been proposed as approximate models for the study of these critically loaded controlled stochastic networks, can be regarded as formal scaling limits of such stochastic systems. However, to date, a rigorous limit theory that justifies the use of such approximations for a general family of controlled networks has been lacking. It is shown that, "},"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":"1205.0925","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-05-04T11:34:05Z","cross_cats_sorted":[],"title_canon_sha256":"9b660d4a46e1a1a4fb5413fc5cd66ebafddbe3cae258903a5f52f214922727f4","abstract_canon_sha256":"7ef954ab5fd186c6efd3ff63753f25ac843d147d6b9526eef2b816e29925a553"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:23.560900Z","signature_b64":"wmhnf3iuTxHWeTYZeGgpFGFyykEv+Hu0//2IxCC03HCWdD7ZPpHY549t4UJO+ytrQAKjY8BJXIbQ04iJbA+kBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4583a32bef51f16d984540386b163817898e1b1732965f30bf40c6e142cf772","last_reissued_at":"2026-05-18T03:56:23.560446Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:23.560446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Controlled stochastic networks in heavy traffic: Convergence of value functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Amarjit Budhiraja, Arka P. Ghosh","submitted_at":"2012-05-04T11:34:05Z","abstract_excerpt":"Scheduling control problems for a family of unitary networks under heavy traffic with general interarrival and service times, probabilistic routing and an infinite horizon discounted linear holding cost are studied. Diffusion control problems, that have been proposed as approximate models for the study of these critically loaded controlled stochastic networks, can be regarded as formal scaling limits of such stochastic systems. However, to date, a rigorous limit theory that justifies the use of such approximations for a general family of controlled networks has been lacking. It is shown that, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0925","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":"1205.0925","created_at":"2026-05-18T03:56:23.560508+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.0925v1","created_at":"2026-05-18T03:56:23.560508+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0925","created_at":"2026-05-18T03:56:23.560508+00:00"},{"alias_kind":"pith_short_12","alias_value":"4RMDUMV66UPR","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"4RMDUMV66UPRNWME","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"4RMDUMV6","created_at":"2026-05-18T12:26:53.410803+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/4RMDUMV66UPRNWMEKQBYNMLDQF","json":"https://pith.science/pith/4RMDUMV66UPRNWMEKQBYNMLDQF.json","graph_json":"https://pith.science/api/pith-number/4RMDUMV66UPRNWMEKQBYNMLDQF/graph.json","events_json":"https://pith.science/api/pith-number/4RMDUMV66UPRNWMEKQBYNMLDQF/events.json","paper":"https://pith.science/paper/4RMDUMV6"},"agent_actions":{"view_html":"https://pith.science/pith/4RMDUMV66UPRNWMEKQBYNMLDQF","download_json":"https://pith.science/pith/4RMDUMV66UPRNWMEKQBYNMLDQF.json","view_paper":"https://pith.science/paper/4RMDUMV6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.0925&json=true","fetch_graph":"https://pith.science/api/pith-number/4RMDUMV66UPRNWMEKQBYNMLDQF/graph.json","fetch_events":"https://pith.science/api/pith-number/4RMDUMV66UPRNWMEKQBYNMLDQF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4RMDUMV66UPRNWMEKQBYNMLDQF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4RMDUMV66UPRNWMEKQBYNMLDQF/action/storage_attestation","attest_author":"https://pith.science/pith/4RMDUMV66UPRNWMEKQBYNMLDQF/action/author_attestation","sign_citation":"https://pith.science/pith/4RMDUMV66UPRNWMEKQBYNMLDQF/action/citation_signature","submit_replication":"https://pith.science/pith/4RMDUMV66UPRNWMEKQBYNMLDQF/action/replication_record"}},"created_at":"2026-05-18T03:56:23.560508+00:00","updated_at":"2026-05-18T03:56:23.560508+00:00"}