{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ZDNZ4NQOZWLANGNWK4JPU3VPDR","short_pith_number":"pith:ZDNZ4NQO","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"},"canonical_sha256":"c8db9e360ecd960699b65712fa6eaf1c72f04e214b69d5bf9e314c44b71db5db","source":{"kind":"arxiv","id":"2606.12707","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.12707","created_at":"2026-06-12T01:08:46Z"},{"alias_kind":"arxiv_version","alias_value":"2606.12707v1","created_at":"2026-06-12T01:08:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.12707","created_at":"2026-06-12T01:08:46Z"},{"alias_kind":"pith_short_12","alias_value":"ZDNZ4NQOZWLA","created_at":"2026-06-12T01:08:46Z"},{"alias_kind":"pith_short_16","alias_value":"ZDNZ4NQOZWLANGNW","created_at":"2026-06-12T01:08:46Z"},{"alias_kind":"pith_short_8","alias_value":"ZDNZ4NQO","created_at":"2026-06-12T01:08:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ZDNZ4NQOZWLANGNWK4JPU3VPDR","target":"record","payload":{"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"},"canonical_sha256":"c8db9e360ecd960699b65712fa6eaf1c72f04e214b69d5bf9e314c44b71db5db","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"},"source_kind":"arxiv","source_id":"2606.12707","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-06-12T01:08:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vhZJGX3S43vcUaE816eE/jw7UUAqaHU9cYMgErRV0qTSQKo6VyXAK0nNK9oTiAfoFVEdzUpR2N4+jRKaaF/iAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:02:24.985285Z"},"content_sha256":"0fe652e209a2196919ede990813b7bf34b762c89b81be75519d75bf36174ed33","schema_version":"1.0","event_id":"sha256:0fe652e209a2196919ede990813b7bf34b762c89b81be75519d75bf36174ed33"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ZDNZ4NQOZWLANGNWK4JPU3VPDR","target":"graph","payload":{"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"},"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-06-12T01:08:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OmfsBM/CPJwl/mncRJhJYisPtFQTv6aZOGNVbU6HDdG6eZT5YU1LILweIGOrZMhiIs/vC2zIGc7Ds8KZdDrfBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:02:24.985687Z"},"content_sha256":"7986a526fa946dc30cde56318741921312e46daca059dbcc862de4e4f688fcbd","schema_version":"1.0","event_id":"sha256:7986a526fa946dc30cde56318741921312e46daca059dbcc862de4e4f688fcbd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZDNZ4NQOZWLANGNWK4JPU3VPDR/bundle.json","state_url":"https://pith.science/pith/ZDNZ4NQOZWLANGNWK4JPU3VPDR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZDNZ4NQOZWLANGNWK4JPU3VPDR/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-20T08:02:24Z","links":{"resolver":"https://pith.science/pith/ZDNZ4NQOZWLANGNWK4JPU3VPDR","bundle":"https://pith.science/pith/ZDNZ4NQOZWLANGNWK4JPU3VPDR/bundle.json","state":"https://pith.science/pith/ZDNZ4NQOZWLANGNWK4JPU3VPDR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZDNZ4NQOZWLANGNWK4JPU3VPDR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ZDNZ4NQOZWLANGNWK4JPU3VPDR","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":"5bc8419ea96861c3b041374d7a60cb3647b4d729a2608f1689d8b1318d1a93f5","cross_cats_sorted":["cs.SY","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2026-06-10T21:54:53Z","title_canon_sha256":"5ad3e68a47d186d73e67de33631bd1272a58f36349f86e7e38a97ad1cef790b9"},"schema_version":"1.0","source":{"id":"2606.12707","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.12707","created_at":"2026-06-12T01:08:46Z"},{"alias_kind":"arxiv_version","alias_value":"2606.12707v1","created_at":"2026-06-12T01:08:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.12707","created_at":"2026-06-12T01:08:46Z"},{"alias_kind":"pith_short_12","alias_value":"ZDNZ4NQOZWLA","created_at":"2026-06-12T01:08:46Z"},{"alias_kind":"pith_short_16","alias_value":"ZDNZ4NQOZWLANGNW","created_at":"2026-06-12T01:08:46Z"},{"alias_kind":"pith_short_8","alias_value":"ZDNZ4NQO","created_at":"2026-06-12T01:08:46Z"}],"graph_snapshots":[{"event_id":"sha256:7986a526fa946dc30cde56318741921312e46daca059dbcc862de4e4f688fcbd","target":"graph","created_at":"2026-06-12T01:08:46Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.12707/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ankur Mani, Arnab Deya, Murti V. Salapaka, Vivek Khatana","cross_cats":["cs.SY","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2026-06-10T21:54:53Z","title":"Storage and Transport Capacity Design for a Self-Reliable Two-Node Stochastic Resource System"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.12707","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:0fe652e209a2196919ede990813b7bf34b762c89b81be75519d75bf36174ed33","target":"record","created_at":"2026-06-12T01:08:46Z","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":"5bc8419ea96861c3b041374d7a60cb3647b4d729a2608f1689d8b1318d1a93f5","cross_cats_sorted":["cs.SY","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2026-06-10T21:54:53Z","title_canon_sha256":"5ad3e68a47d186d73e67de33631bd1272a58f36349f86e7e38a97ad1cef790b9"},"schema_version":"1.0","source":{"id":"2606.12707","kind":"arxiv","version":1}},"canonical_sha256":"c8db9e360ecd960699b65712fa6eaf1c72f04e214b69d5bf9e314c44b71db5db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8db9e360ecd960699b65712fa6eaf1c72f04e214b69d5bf9e314c44b71db5db","first_computed_at":"2026-06-12T01:08:46.508065Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-12T01:08:46.508065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Aq4zFNn6+cdcX87erq/0YQ1hXom5h0cOPXFAll++qrEE+Qag/FbuVI3bCABXmitQO0QHBca8aMHNM/kpLq/PBQ==","signature_status":"signed_v1","signed_at":"2026-06-12T01:08:46.508936Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.12707","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0fe652e209a2196919ede990813b7bf34b762c89b81be75519d75bf36174ed33","sha256:7986a526fa946dc30cde56318741921312e46daca059dbcc862de4e4f688fcbd"],"state_sha256":"bba733a934d4ffecd0c3fa8d69888b167c4c49cdfa48cabd65a745deb9584243"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iShGj72JypCJ1H/pkK1Qvte4HKzG/DNhKJ1OjSiyLVAuuotbire81fhtxB/W3/z/CYEdWGUOtZby9FaIoLq4CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T08:02:24.987636Z","bundle_sha256":"676c97e1282f91ce246c1601ec3182918824ff99357cab0d1c6b3f118af3fff4"}}