{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:S245W5KT32637T4AXL5IPMRP2G","short_pith_number":"pith:S245W5KT","canonical_record":{"source":{"id":"2401.04068","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2024-01-08T18:11:22Z","cross_cats_sorted":["cs.LO","cs.SY"],"title_canon_sha256":"27bd433b45046e2f4b6c5e6838596eb640ec9f1228fe5206ffd0fe1d11452e62","abstract_canon_sha256":"6bc13becb0838c78413159c216c83c6c36767c2731e2c0628dc1b850fdb5f750"},"schema_version":"1.0"},"canonical_sha256":"96b9db7553debdbfcf80bafa87b22fd1a34638f8f000912c7156353f2c4adbd7","source":{"kind":"arxiv","id":"2401.04068","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.04068","created_at":"2026-07-05T08:13:11Z"},{"alias_kind":"arxiv_version","alias_value":"2401.04068v2","created_at":"2026-07-05T08:13:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.04068","created_at":"2026-07-05T08:13:11Z"},{"alias_kind":"pith_short_12","alias_value":"S245W5KT3263","created_at":"2026-07-05T08:13:11Z"},{"alias_kind":"pith_short_16","alias_value":"S245W5KT32637T4A","created_at":"2026-07-05T08:13:11Z"},{"alias_kind":"pith_short_8","alias_value":"S245W5KT","created_at":"2026-07-05T08:13:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:S245W5KT32637T4AXL5IPMRP2G","target":"record","payload":{"canonical_record":{"source":{"id":"2401.04068","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2024-01-08T18:11:22Z","cross_cats_sorted":["cs.LO","cs.SY"],"title_canon_sha256":"27bd433b45046e2f4b6c5e6838596eb640ec9f1228fe5206ffd0fe1d11452e62","abstract_canon_sha256":"6bc13becb0838c78413159c216c83c6c36767c2731e2c0628dc1b850fdb5f750"},"schema_version":"1.0"},"canonical_sha256":"96b9db7553debdbfcf80bafa87b22fd1a34638f8f000912c7156353f2c4adbd7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:13:11.495277Z","signature_b64":"DnL9AkWMx3HHu96VXL5SHr5NC1h9YWxwy1fTplID1a3/0nhMmcGeQrw/83kFMlUDfp1hKVgIruHSttMHaygSBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96b9db7553debdbfcf80bafa87b22fd1a34638f8f000912c7156353f2c4adbd7","last_reissued_at":"2026-07-05T08:13:11.494845Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:13:11.494845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2401.04068","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-07-05T08:13:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zDX+8/wzUvWc32U/N2sl6uJBPfEPThWHvyJCnX0yzM7anoL+OW73M+IQI7On8m78z9K8OL8eB4lDW6Y2vvgvDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T19:34:16.191365Z"},"content_sha256":"fb25eebb843b696e0e8e37c118f365864b9e2cdadc1d9ead22462db5e7e69360","schema_version":"1.0","event_id":"sha256:fb25eebb843b696e0e8e37c118f365864b9e2cdadc1d9ead22462db5e7e69360"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:S245W5KT32637T4AXL5IPMRP2G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"IntervalMDP.jl: Accelerated Value Iteration for Interval Markov Decision Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","cs.SY"],"primary_cat":"eess.SY","authors_text":"Frederik Baymler Mathiesen, Luca Laurenti, Morteza Lahijanian","submitted_at":"2024-01-08T18:11:22Z","abstract_excerpt":"In this paper, we present IntervalMDP.jl, a Julia package for probabilistic analysis of interval Markov Decision Processes (IMDPs). IntervalMDP.jl facilitates the synthesis of optimal strategies and verification of IMDPs against reachability specifications and discounted reward properties. The library supports sparse matrices and is compatible with data formats from common tools for the analysis of probabilistic models, such as PRISM. A key feature of IntervalMDP.jl is that it presents both a multi-threaded CPU and a GPU-accelerated implementation of value iteration algorithms for IMDPs. In pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.04068","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2401.04068/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-07-05T08:13:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WJgNJWo+MBvs/XsHhU+7SsukQUBIJbSA5k4e6RHz+PPPSItmTHYXQ9SNpkxY2bLRRwb4wdDuTa7xcmN9emoVAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T19:34:16.191998Z"},"content_sha256":"2ebb609b81996331eb2f54e9ff3d1483d84c931e0c3b1c2e797bbc1b3475a862","schema_version":"1.0","event_id":"sha256:2ebb609b81996331eb2f54e9ff3d1483d84c931e0c3b1c2e797bbc1b3475a862"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S245W5KT32637T4AXL5IPMRP2G/bundle.json","state_url":"https://pith.science/pith/S245W5KT32637T4AXL5IPMRP2G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S245W5KT32637T4AXL5IPMRP2G/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-08-08T19:34:16Z","links":{"resolver":"https://pith.science/pith/S245W5KT32637T4AXL5IPMRP2G","bundle":"https://pith.science/pith/S245W5KT32637T4AXL5IPMRP2G/bundle.json","state":"https://pith.science/pith/S245W5KT32637T4AXL5IPMRP2G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S245W5KT32637T4AXL5IPMRP2G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:S245W5KT32637T4AXL5IPMRP2G","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":"6bc13becb0838c78413159c216c83c6c36767c2731e2c0628dc1b850fdb5f750","cross_cats_sorted":["cs.LO","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2024-01-08T18:11:22Z","title_canon_sha256":"27bd433b45046e2f4b6c5e6838596eb640ec9f1228fe5206ffd0fe1d11452e62"},"schema_version":"1.0","source":{"id":"2401.04068","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.04068","created_at":"2026-07-05T08:13:11Z"},{"alias_kind":"arxiv_version","alias_value":"2401.04068v2","created_at":"2026-07-05T08:13:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.04068","created_at":"2026-07-05T08:13:11Z"},{"alias_kind":"pith_short_12","alias_value":"S245W5KT3263","created_at":"2026-07-05T08:13:11Z"},{"alias_kind":"pith_short_16","alias_value":"S245W5KT32637T4A","created_at":"2026-07-05T08:13:11Z"},{"alias_kind":"pith_short_8","alias_value":"S245W5KT","created_at":"2026-07-05T08:13:11Z"}],"graph_snapshots":[{"event_id":"sha256:2ebb609b81996331eb2f54e9ff3d1483d84c931e0c3b1c2e797bbc1b3475a862","target":"graph","created_at":"2026-07-05T08:13:11Z","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/2401.04068/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we present IntervalMDP.jl, a Julia package for probabilistic analysis of interval Markov Decision Processes (IMDPs). IntervalMDP.jl facilitates the synthesis of optimal strategies and verification of IMDPs against reachability specifications and discounted reward properties. The library supports sparse matrices and is compatible with data formats from common tools for the analysis of probabilistic models, such as PRISM. A key feature of IntervalMDP.jl is that it presents both a multi-threaded CPU and a GPU-accelerated implementation of value iteration algorithms for IMDPs. In pa","authors_text":"Frederik Baymler Mathiesen, Luca Laurenti, Morteza Lahijanian","cross_cats":["cs.LO","cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2024-01-08T18:11:22Z","title":"IntervalMDP.jl: Accelerated Value Iteration for Interval Markov Decision Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.04068","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:fb25eebb843b696e0e8e37c118f365864b9e2cdadc1d9ead22462db5e7e69360","target":"record","created_at":"2026-07-05T08:13:11Z","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":"6bc13becb0838c78413159c216c83c6c36767c2731e2c0628dc1b850fdb5f750","cross_cats_sorted":["cs.LO","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2024-01-08T18:11:22Z","title_canon_sha256":"27bd433b45046e2f4b6c5e6838596eb640ec9f1228fe5206ffd0fe1d11452e62"},"schema_version":"1.0","source":{"id":"2401.04068","kind":"arxiv","version":2}},"canonical_sha256":"96b9db7553debdbfcf80bafa87b22fd1a34638f8f000912c7156353f2c4adbd7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96b9db7553debdbfcf80bafa87b22fd1a34638f8f000912c7156353f2c4adbd7","first_computed_at":"2026-07-05T08:13:11.494845Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:13:11.494845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DnL9AkWMx3HHu96VXL5SHr5NC1h9YWxwy1fTplID1a3/0nhMmcGeQrw/83kFMlUDfp1hKVgIruHSttMHaygSBw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:13:11.495277Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.04068","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb25eebb843b696e0e8e37c118f365864b9e2cdadc1d9ead22462db5e7e69360","sha256:2ebb609b81996331eb2f54e9ff3d1483d84c931e0c3b1c2e797bbc1b3475a862"],"state_sha256":"39b1dbd2b9c877edbf1ddf04625d61bf7ddfee129cc2c6a745767aa11234fb1c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Avv9idRMg1JpJ+FgUeY2DHDLly8m44boQ1sppYc3HiF1qakrBzXdgvZrawgZGPBjJqX0JQWH13oafYHyOnZCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T19:34:16.197531Z","bundle_sha256":"fa564ac33512f6f3d14b63b935e0b75b4aeb201646ce5b3d6c20645848a9aeb4"}}