{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ZDNZ4NQOZWLANGNWK4JPU3VPDR","short_pith_number":"pith:ZDNZ4NQO","schema_version":"1.0","canonical_sha256":"c8db9e360ecd960699b65712fa6eaf1c72f04e214b69d5bf9e314c44b71db5db","source":{"kind":"arxiv","id":"2606.12707","version":1},"attestation_state":"computed","paper":{"title":"Storage and Transport Capacity Design for a Self-Reliable Two-Node Stochastic Resource System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.PR"],"primary_cat":"eess.SY","authors_text":"Ankur Mani, Arnab Deya, Murti V. Salapaka, Vivek Khatana","submitted_at":"2026-06-10T21:54:53Z","abstract_excerpt":"We study a two-node stochastic resource system operating over a finite horizon. Each node experiences uncertain supply and demand and is equipped with finite storage. The objective is to ensure that resource levels remain within prescribed limits with high probability. To this end, we formulate a chance-constrained capacity-design problem in which resources can be exchanged through a capacity-limited transport link. We characterize the minimum storage required at each node, derive the optimal transport policy, and quantify the trade-off between storage and transport capacities. Our results sho"},"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":"2606.12707","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2026-06-10T21:54:53Z","cross_cats_sorted":["cs.SY","math.PR"],"title_canon_sha256":"5ad3e68a47d186d73e67de33631bd1272a58f36349f86e7e38a97ad1cef790b9","abstract_canon_sha256":"5bc8419ea96861c3b041374d7a60cb3647b4d729a2608f1689d8b1318d1a93f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:08:46.508936Z","signature_b64":"Aq4zFNn6+cdcX87erq/0YQ1hXom5h0cOPXFAll++qrEE+Qag/FbuVI3bCABXmitQO0QHBca8aMHNM/kpLq/PBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8db9e360ecd960699b65712fa6eaf1c72f04e214b69d5bf9e314c44b71db5db","last_reissued_at":"2026-06-12T01:08:46.508065Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:08:46.508065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Storage and Transport Capacity Design for a Self-Reliable Two-Node Stochastic Resource System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.PR"],"primary_cat":"eess.SY","authors_text":"Ankur Mani, Arnab Deya, Murti V. Salapaka, Vivek Khatana","submitted_at":"2026-06-10T21:54:53Z","abstract_excerpt":"We study a two-node stochastic resource system operating over a finite horizon. Each node experiences uncertain supply and demand and is equipped with finite storage. The objective is to ensure that resource levels remain within prescribed limits with high probability. To this end, we formulate a chance-constrained capacity-design problem in which resources can be exchanged through a capacity-limited transport link. We characterize the minimum storage required at each node, derive the optimal transport policy, and quantify the trade-off between storage and transport capacities. Our results sho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.12707","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.12707/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.12707","created_at":"2026-06-12T01:08:46.508209+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.12707v1","created_at":"2026-06-12T01:08:46.508209+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.12707","created_at":"2026-06-12T01:08:46.508209+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZDNZ4NQOZWLA","created_at":"2026-06-12T01:08:46.508209+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZDNZ4NQOZWLANGNW","created_at":"2026-06-12T01:08:46.508209+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZDNZ4NQO","created_at":"2026-06-12T01:08:46.508209+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/ZDNZ4NQOZWLANGNWK4JPU3VPDR","json":"https://pith.science/pith/ZDNZ4NQOZWLANGNWK4JPU3VPDR.json","graph_json":"https://pith.science/api/pith-number/ZDNZ4NQOZWLANGNWK4JPU3VPDR/graph.json","events_json":"https://pith.science/api/pith-number/ZDNZ4NQOZWLANGNWK4JPU3VPDR/events.json","paper":"https://pith.science/paper/ZDNZ4NQO"},"agent_actions":{"view_html":"https://pith.science/pith/ZDNZ4NQOZWLANGNWK4JPU3VPDR","download_json":"https://pith.science/pith/ZDNZ4NQOZWLANGNWK4JPU3VPDR.json","view_paper":"https://pith.science/paper/ZDNZ4NQO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.12707&json=true","fetch_graph":"https://pith.science/api/pith-number/ZDNZ4NQOZWLANGNWK4JPU3VPDR/graph.json","fetch_events":"https://pith.science/api/pith-number/ZDNZ4NQOZWLANGNWK4JPU3VPDR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZDNZ4NQOZWLANGNWK4JPU3VPDR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZDNZ4NQOZWLANGNWK4JPU3VPDR/action/storage_attestation","attest_author":"https://pith.science/pith/ZDNZ4NQOZWLANGNWK4JPU3VPDR/action/author_attestation","sign_citation":"https://pith.science/pith/ZDNZ4NQOZWLANGNWK4JPU3VPDR/action/citation_signature","submit_replication":"https://pith.science/pith/ZDNZ4NQOZWLANGNWK4JPU3VPDR/action/replication_record"}},"created_at":"2026-06-12T01:08:46.508209+00:00","updated_at":"2026-06-12T01:08:46.508209+00:00"}