{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:QOZNMBLYX6HS6B65U2K2XRUFXH","short_pith_number":"pith:QOZNMBLY","canonical_record":{"source":{"id":"1911.04112","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-11-11T06:58:25Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"387a723ab509e003b144121e898d1ddb994e39e6e1e07a83b1e3a9a862e7a0b5","abstract_canon_sha256":"088e023e2ae7474e15839d8338f78bf30b534b7de4072963e74190a1ebe0c5b2"},"schema_version":"1.0"},"canonical_sha256":"83b2d60578bf8f2f07dda695abc685b9f48089be4397998fd37b485fd2fb6050","source":{"kind":"arxiv","id":"1911.04112","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.04112","created_at":"2026-07-05T02:18:14Z"},{"alias_kind":"arxiv_version","alias_value":"1911.04112v3","created_at":"2026-07-05T02:18:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.04112","created_at":"2026-07-05T02:18:14Z"},{"alias_kind":"pith_short_12","alias_value":"QOZNMBLYX6HS","created_at":"2026-07-05T02:18:14Z"},{"alias_kind":"pith_short_16","alias_value":"QOZNMBLYX6HS6B65","created_at":"2026-07-05T02:18:14Z"},{"alias_kind":"pith_short_8","alias_value":"QOZNMBLY","created_at":"2026-07-05T02:18:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:QOZNMBLYX6HS6B65U2K2XRUFXH","target":"record","payload":{"canonical_record":{"source":{"id":"1911.04112","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-11-11T06:58:25Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"387a723ab509e003b144121e898d1ddb994e39e6e1e07a83b1e3a9a862e7a0b5","abstract_canon_sha256":"088e023e2ae7474e15839d8338f78bf30b534b7de4072963e74190a1ebe0c5b2"},"schema_version":"1.0"},"canonical_sha256":"83b2d60578bf8f2f07dda695abc685b9f48089be4397998fd37b485fd2fb6050","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:18:14.319834Z","signature_b64":"AjtF2wIJTEdBpHpfh+2vCQ+Gqqz/gUYXRrg57Yt73j1j7ukm4MHZmmtb84xbEBs/Dpru/eCS/gDDxSBFQq4hDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83b2d60578bf8f2f07dda695abc685b9f48089be4397998fd37b485fd2fb6050","last_reissued_at":"2026-07-05T02:18:14.319357Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:18:14.319357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1911.04112","source_version":3,"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-05T02:18:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JTiXTrgEGNR+XOcJdz/Wz5HXyPXbzKMhsR+qRbnqfuCoMJkCAynSaPQaJzSw6mYA2OSZomzbIvIrrqH4A3NCCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T15:26:05.972513Z"},"content_sha256":"5c4e664b85f72521016bf85b344665409df036b1992c4d3454afda3e7e6c7d27","schema_version":"1.0","event_id":"sha256:5c4e664b85f72521016bf85b344665409df036b1992c4d3454afda3e7e6c7d27"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:QOZNMBLYX6HS6B65U2K2XRUFXH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dependency Stochastic Boolean Satisfiability: A Logical Formalism for NEXPTIME Decision Problems with Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Jie-Hong R. Jiang, Nian-Ze Lee","submitted_at":"2019-11-11T06:58:25Z","abstract_excerpt":"Stochastic Boolean Satisfiability (SSAT) is a logical formalism to model decision problems with uncertainty, such as Partially Observable Markov Decision Process (POMDP) for verification of probabilistic systems. SSAT, however, is limited by its descriptive power within the PSPACE complexity class. More complex problems, such as the NEXPTIME-complete Decentralized POMDP (Dec-POMDP), cannot be succinctly encoded with SSAT. To provide a logical formalism of such problems, we extend the Dependency Quantified Boolean Formula (DQBF), a representative problem in the NEXPTIME-complete class, to its s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.04112","kind":"arxiv","version":3},"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/1911.04112/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-05T02:18:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cMMl6T7Cue/yKEdAY3YqCfoIgn+3xxPfegQtMXtoynI+e+qRH2ZeFBgp964LiUPjWWGwqdVMXk99RjDy3IwwBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T15:26:05.973228Z"},"content_sha256":"ebc76872b58033bc312a12d1881d929ac185d92b59afa61402b003771fe362ea","schema_version":"1.0","event_id":"sha256:ebc76872b58033bc312a12d1881d929ac185d92b59afa61402b003771fe362ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QOZNMBLYX6HS6B65U2K2XRUFXH/bundle.json","state_url":"https://pith.science/pith/QOZNMBLYX6HS6B65U2K2XRUFXH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QOZNMBLYX6HS6B65U2K2XRUFXH/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-11T15:26:05Z","links":{"resolver":"https://pith.science/pith/QOZNMBLYX6HS6B65U2K2XRUFXH","bundle":"https://pith.science/pith/QOZNMBLYX6HS6B65U2K2XRUFXH/bundle.json","state":"https://pith.science/pith/QOZNMBLYX6HS6B65U2K2XRUFXH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QOZNMBLYX6HS6B65U2K2XRUFXH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QOZNMBLYX6HS6B65U2K2XRUFXH","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":"088e023e2ae7474e15839d8338f78bf30b534b7de4072963e74190a1ebe0c5b2","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-11-11T06:58:25Z","title_canon_sha256":"387a723ab509e003b144121e898d1ddb994e39e6e1e07a83b1e3a9a862e7a0b5"},"schema_version":"1.0","source":{"id":"1911.04112","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.04112","created_at":"2026-07-05T02:18:14Z"},{"alias_kind":"arxiv_version","alias_value":"1911.04112v3","created_at":"2026-07-05T02:18:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.04112","created_at":"2026-07-05T02:18:14Z"},{"alias_kind":"pith_short_12","alias_value":"QOZNMBLYX6HS","created_at":"2026-07-05T02:18:14Z"},{"alias_kind":"pith_short_16","alias_value":"QOZNMBLYX6HS6B65","created_at":"2026-07-05T02:18:14Z"},{"alias_kind":"pith_short_8","alias_value":"QOZNMBLY","created_at":"2026-07-05T02:18:14Z"}],"graph_snapshots":[{"event_id":"sha256:ebc76872b58033bc312a12d1881d929ac185d92b59afa61402b003771fe362ea","target":"graph","created_at":"2026-07-05T02:18:14Z","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/1911.04112/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Stochastic Boolean Satisfiability (SSAT) is a logical formalism to model decision problems with uncertainty, such as Partially Observable Markov Decision Process (POMDP) for verification of probabilistic systems. SSAT, however, is limited by its descriptive power within the PSPACE complexity class. More complex problems, such as the NEXPTIME-complete Decentralized POMDP (Dec-POMDP), cannot be succinctly encoded with SSAT. To provide a logical formalism of such problems, we extend the Dependency Quantified Boolean Formula (DQBF), a representative problem in the NEXPTIME-complete class, to its s","authors_text":"Jie-Hong R. Jiang, Nian-Ze Lee","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-11-11T06:58:25Z","title":"Dependency Stochastic Boolean Satisfiability: A Logical Formalism for NEXPTIME Decision Problems with Uncertainty"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.04112","kind":"arxiv","version":3},"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:5c4e664b85f72521016bf85b344665409df036b1992c4d3454afda3e7e6c7d27","target":"record","created_at":"2026-07-05T02:18:14Z","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":"088e023e2ae7474e15839d8338f78bf30b534b7de4072963e74190a1ebe0c5b2","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-11-11T06:58:25Z","title_canon_sha256":"387a723ab509e003b144121e898d1ddb994e39e6e1e07a83b1e3a9a862e7a0b5"},"schema_version":"1.0","source":{"id":"1911.04112","kind":"arxiv","version":3}},"canonical_sha256":"83b2d60578bf8f2f07dda695abc685b9f48089be4397998fd37b485fd2fb6050","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83b2d60578bf8f2f07dda695abc685b9f48089be4397998fd37b485fd2fb6050","first_computed_at":"2026-07-05T02:18:14.319357Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:18:14.319357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AjtF2wIJTEdBpHpfh+2vCQ+Gqqz/gUYXRrg57Yt73j1j7ukm4MHZmmtb84xbEBs/Dpru/eCS/gDDxSBFQq4hDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:18:14.319834Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.04112","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c4e664b85f72521016bf85b344665409df036b1992c4d3454afda3e7e6c7d27","sha256:ebc76872b58033bc312a12d1881d929ac185d92b59afa61402b003771fe362ea"],"state_sha256":"412255c5d0da39fadb595568def629279708ccdc3119bbb9f697b2d165af0b6b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ANpciTH2CinHivaH772/shem4nZYYubUUsiMXgoVB78V6sx1IaF99x2qoJVqgRXjnTFVH9FXEcLVs6HOrd+HCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T15:26:05.979917Z","bundle_sha256":"800e95560c0f6510778c9766f568bc73237a1af534eb92a5cb84666c4a2b412e"}}