{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:WB5EQDRU2RD4EQGESYBKDC5OKB","short_pith_number":"pith:WB5EQDRU","canonical_record":{"source":{"id":"1902.04659","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-02-12T22:18:26Z","cross_cats_sorted":[],"title_canon_sha256":"e8fd8c7eb7d9a487d784e8d364a685443cd672eead1fa370cdc834e91c4e9246","abstract_canon_sha256":"0869174cd336554c826b5704abef2481758d7405de77d432425155b79dc75045"},"schema_version":"1.0"},"canonical_sha256":"b07a480e34d447c240c49602a18bae507641b4d03cc6da59c6d381d1454bd111","source":{"kind":"arxiv","id":"1902.04659","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.04659","created_at":"2026-05-17T23:50:33Z"},{"alias_kind":"arxiv_version","alias_value":"1902.04659v2","created_at":"2026-05-17T23:50:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.04659","created_at":"2026-05-17T23:50:33Z"},{"alias_kind":"pith_short_12","alias_value":"WB5EQDRU2RD4","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"WB5EQDRU2RD4EQGE","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"WB5EQDRU","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:WB5EQDRU2RD4EQGESYBKDC5OKB","target":"record","payload":{"canonical_record":{"source":{"id":"1902.04659","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-02-12T22:18:26Z","cross_cats_sorted":[],"title_canon_sha256":"e8fd8c7eb7d9a487d784e8d364a685443cd672eead1fa370cdc834e91c4e9246","abstract_canon_sha256":"0869174cd336554c826b5704abef2481758d7405de77d432425155b79dc75045"},"schema_version":"1.0"},"canonical_sha256":"b07a480e34d447c240c49602a18bae507641b4d03cc6da59c6d381d1454bd111","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:33.299416Z","signature_b64":"CxZLQwnO5rSmUyV4W2HncqSmcZNtyC26WOs4SLd4KGFH4TA70c+jxixSYL7vcjK8UUPDUQipvdwyIN0BJ8pFDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b07a480e34d447c240c49602a18bae507641b4d03cc6da59c6d381d1454bd111","last_reissued_at":"2026-05-17T23:50:33.298916Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:33.298916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.04659","source_version":2,"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-17T23:50:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TWtXymHj0diGdKTFdEQdXP21BIy90lX3GN/iV3dPJSp5KUyMRyLvPhy/TAy6m7kgvfEmTuBHI5PtmCTTQBlQDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:01:59.429833Z"},"content_sha256":"acd629126a5d1ac6d9e3f41661843df56733c1a148f5da68bf81043d297403b2","schema_version":"1.0","event_id":"sha256:acd629126a5d1ac6d9e3f41661843df56733c1a148f5da68bf81043d297403b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:WB5EQDRU2RD4EQGESYBKDC5OKB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cost Analysis of Nondeterministic Probabilistic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Amir Kafshdar Goharshady, Hongfei Fu, Krishnendu Chatterjee, Peixin Wang, Wenjun Shi, Xudong Qin","submitted_at":"2019-02-12T22:18:26Z","abstract_excerpt":"We consider the problem of expected cost analysis over nondeterministic probabilistic programs, which aims at automated methods for analyzing the resource-usage of such programs. Previous approaches for this problem could only handle nonnegative bounded costs. However, in many scenarios, such as queuing networks or analysis of cryptocurrency protocols, both positive and negative costs are necessary and the costs are unbounded as well.\n  In this work, we present a sound and efficient approach to obtain polynomial bounds on the expected accumulated cost of nondeterministic probabilistic programs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.04659","kind":"arxiv","version":2},"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-17T23:50:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XkM4/NCDObAqFxGp87tJCLAMoosG+5WUkJRTh5Md8wm7pekt8vGLkbEz0R+skKjmidgsJ8wuYDgDjmfyHeJJAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:01:59.430496Z"},"content_sha256":"fd774e606ed723daf4be6faac2368db0870af513514051ceed6446093ec189a6","schema_version":"1.0","event_id":"sha256:fd774e606ed723daf4be6faac2368db0870af513514051ceed6446093ec189a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WB5EQDRU2RD4EQGESYBKDC5OKB/bundle.json","state_url":"https://pith.science/pith/WB5EQDRU2RD4EQGESYBKDC5OKB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WB5EQDRU2RD4EQGESYBKDC5OKB/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-05-27T03:01:59Z","links":{"resolver":"https://pith.science/pith/WB5EQDRU2RD4EQGESYBKDC5OKB","bundle":"https://pith.science/pith/WB5EQDRU2RD4EQGESYBKDC5OKB/bundle.json","state":"https://pith.science/pith/WB5EQDRU2RD4EQGESYBKDC5OKB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WB5EQDRU2RD4EQGESYBKDC5OKB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:WB5EQDRU2RD4EQGESYBKDC5OKB","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":"0869174cd336554c826b5704abef2481758d7405de77d432425155b79dc75045","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-02-12T22:18:26Z","title_canon_sha256":"e8fd8c7eb7d9a487d784e8d364a685443cd672eead1fa370cdc834e91c4e9246"},"schema_version":"1.0","source":{"id":"1902.04659","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.04659","created_at":"2026-05-17T23:50:33Z"},{"alias_kind":"arxiv_version","alias_value":"1902.04659v2","created_at":"2026-05-17T23:50:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.04659","created_at":"2026-05-17T23:50:33Z"},{"alias_kind":"pith_short_12","alias_value":"WB5EQDRU2RD4","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"WB5EQDRU2RD4EQGE","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"WB5EQDRU","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:fd774e606ed723daf4be6faac2368db0870af513514051ceed6446093ec189a6","target":"graph","created_at":"2026-05-17T23:50:33Z","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 consider the problem of expected cost analysis over nondeterministic probabilistic programs, which aims at automated methods for analyzing the resource-usage of such programs. Previous approaches for this problem could only handle nonnegative bounded costs. However, in many scenarios, such as queuing networks or analysis of cryptocurrency protocols, both positive and negative costs are necessary and the costs are unbounded as well.\n  In this work, we present a sound and efficient approach to obtain polynomial bounds on the expected accumulated cost of nondeterministic probabilistic programs","authors_text":"Amir Kafshdar Goharshady, Hongfei Fu, Krishnendu Chatterjee, Peixin Wang, Wenjun Shi, Xudong Qin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-02-12T22:18:26Z","title":"Cost Analysis of Nondeterministic Probabilistic Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.04659","kind":"arxiv","version":2},"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:acd629126a5d1ac6d9e3f41661843df56733c1a148f5da68bf81043d297403b2","target":"record","created_at":"2026-05-17T23:50:33Z","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":"0869174cd336554c826b5704abef2481758d7405de77d432425155b79dc75045","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-02-12T22:18:26Z","title_canon_sha256":"e8fd8c7eb7d9a487d784e8d364a685443cd672eead1fa370cdc834e91c4e9246"},"schema_version":"1.0","source":{"id":"1902.04659","kind":"arxiv","version":2}},"canonical_sha256":"b07a480e34d447c240c49602a18bae507641b4d03cc6da59c6d381d1454bd111","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b07a480e34d447c240c49602a18bae507641b4d03cc6da59c6d381d1454bd111","first_computed_at":"2026-05-17T23:50:33.298916Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:33.298916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CxZLQwnO5rSmUyV4W2HncqSmcZNtyC26WOs4SLd4KGFH4TA70c+jxixSYL7vcjK8UUPDUQipvdwyIN0BJ8pFDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:33.299416Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.04659","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:acd629126a5d1ac6d9e3f41661843df56733c1a148f5da68bf81043d297403b2","sha256:fd774e606ed723daf4be6faac2368db0870af513514051ceed6446093ec189a6"],"state_sha256":"4ba6930b57daed1d0a1801dc744d1a518ede993543f57305dfab213c1cb76320"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t7IgbW19fTyPEjq/5JQKXdxgtioxNYTaxi0FyE2vXr3NCpaYQWYiCnKxXuPYI8ovGEuB03TUPyXyWZPjIDoLDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:01:59.433999Z","bundle_sha256":"b23eb9d878d8dcbc0d94007b48e6744eca0e63d28baa044ac47668df77d7903e"}}