{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:XCLOCWGQGWJKJ75UQVLI5O42ZI","short_pith_number":"pith:XCLOCWGQ","canonical_record":{"source":{"id":"1902.07039","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-19T13:22:36Z","cross_cats_sorted":[],"title_canon_sha256":"e776f05127b5dc6e619700abb5dd7bf968e44ae3ed11a3344425acad8acc0957","abstract_canon_sha256":"ebe66d7402caa3e3a959ef1a0bfa2e3f96b80997ab056cf81834a1775dc6067c"},"schema_version":"1.0"},"canonical_sha256":"b896e158d03592a4ffb485568ebb9aca1fa1c7a4e0775e79f2e3f59ac6d287b9","source":{"kind":"arxiv","id":"1902.07039","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.07039","created_at":"2026-05-17T23:41:24Z"},{"alias_kind":"arxiv_version","alias_value":"1902.07039v2","created_at":"2026-05-17T23:41:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07039","created_at":"2026-05-17T23:41:24Z"},{"alias_kind":"pith_short_12","alias_value":"XCLOCWGQGWJK","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XCLOCWGQGWJKJ75U","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XCLOCWGQ","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:XCLOCWGQGWJKJ75UQVLI5O42ZI","target":"record","payload":{"canonical_record":{"source":{"id":"1902.07039","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-19T13:22:36Z","cross_cats_sorted":[],"title_canon_sha256":"e776f05127b5dc6e619700abb5dd7bf968e44ae3ed11a3344425acad8acc0957","abstract_canon_sha256":"ebe66d7402caa3e3a959ef1a0bfa2e3f96b80997ab056cf81834a1775dc6067c"},"schema_version":"1.0"},"canonical_sha256":"b896e158d03592a4ffb485568ebb9aca1fa1c7a4e0775e79f2e3f59ac6d287b9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:24.607353Z","signature_b64":"pui0XyaWNQkwYmnRzYsfooqJGT0Mh3N1UYELxSq7bZzxax3SPkQ+q8P4CP16mG5y2qdBhxWZ3PnsxjtVOx16AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b896e158d03592a4ffb485568ebb9aca1fa1c7a4e0775e79f2e3f59ac6d287b9","last_reissued_at":"2026-05-17T23:41:24.606747Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:24.606747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.07039","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:41:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ivoZndeGq6ccYHyNhxDXcYNvnNZiUysz8vmsIUXb0XHpS9e4nXuXz5dH5aLVFb1IvdMH5yFg4cHzf4lj4Q4ACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:02:50.535534Z"},"content_sha256":"f55be3882b8583d60bdcad356aa32a11c0113c16b8144e6c938c8760f8e5c061","schema_version":"1.0","event_id":"sha256:f55be3882b8583d60bdcad356aa32a11c0113c16b8144e6c938c8760f8e5c061"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:XCLOCWGQGWJKJ75UQVLI5O42ZI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Integer programming on the junction tree polytope for influence diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Axel Parmentier, Guillaume Obozinski, Joseph Salmon, Victor Cohen, Vincent Lecl\\`ere","submitted_at":"2019-02-19T13:22:36Z","abstract_excerpt":"Influence Diagrams (ID) are a flexible tool to represent discrete stochastic optimization problems, including Markov Decision Process (MDP) and Partially Observable MDP as standard examples. More precisely, given random variables considered as vertices of an acyclic digraph, a probabilistic graphical model defines a joint distribution via the conditional distributions of vertices given their parents. In ID, the random variables are represented by a probabilistic graphical model whose vertices are partitioned into three types : chance, decision and utility vertices. The user chooses the distrib"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07039","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:41:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S5Jb7GeI8bBci/4yxvUhW7bxy/W3/puueDR1Vb54p+1CXc1Jy1NY5IvQPyvomGemE2UlV5drNZAsIdUPS+TPBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:02:50.535882Z"},"content_sha256":"ba230d4bb07d35ae4f2d5d1e0308d6620eef85acdf9990bf095d5b9301051810","schema_version":"1.0","event_id":"sha256:ba230d4bb07d35ae4f2d5d1e0308d6620eef85acdf9990bf095d5b9301051810"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XCLOCWGQGWJKJ75UQVLI5O42ZI/bundle.json","state_url":"https://pith.science/pith/XCLOCWGQGWJKJ75UQVLI5O42ZI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XCLOCWGQGWJKJ75UQVLI5O42ZI/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-01T10:02:50Z","links":{"resolver":"https://pith.science/pith/XCLOCWGQGWJKJ75UQVLI5O42ZI","bundle":"https://pith.science/pith/XCLOCWGQGWJKJ75UQVLI5O42ZI/bundle.json","state":"https://pith.science/pith/XCLOCWGQGWJKJ75UQVLI5O42ZI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XCLOCWGQGWJKJ75UQVLI5O42ZI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:XCLOCWGQGWJKJ75UQVLI5O42ZI","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":"ebe66d7402caa3e3a959ef1a0bfa2e3f96b80997ab056cf81834a1775dc6067c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-19T13:22:36Z","title_canon_sha256":"e776f05127b5dc6e619700abb5dd7bf968e44ae3ed11a3344425acad8acc0957"},"schema_version":"1.0","source":{"id":"1902.07039","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.07039","created_at":"2026-05-17T23:41:24Z"},{"alias_kind":"arxiv_version","alias_value":"1902.07039v2","created_at":"2026-05-17T23:41:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07039","created_at":"2026-05-17T23:41:24Z"},{"alias_kind":"pith_short_12","alias_value":"XCLOCWGQGWJK","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XCLOCWGQGWJKJ75U","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XCLOCWGQ","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:ba230d4bb07d35ae4f2d5d1e0308d6620eef85acdf9990bf095d5b9301051810","target":"graph","created_at":"2026-05-17T23:41:24Z","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":"Influence Diagrams (ID) are a flexible tool to represent discrete stochastic optimization problems, including Markov Decision Process (MDP) and Partially Observable MDP as standard examples. More precisely, given random variables considered as vertices of an acyclic digraph, a probabilistic graphical model defines a joint distribution via the conditional distributions of vertices given their parents. In ID, the random variables are represented by a probabilistic graphical model whose vertices are partitioned into three types : chance, decision and utility vertices. The user chooses the distrib","authors_text":"Axel Parmentier, Guillaume Obozinski, Joseph Salmon, Victor Cohen, Vincent Lecl\\`ere","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-19T13:22:36Z","title":"Integer programming on the junction tree polytope for influence diagrams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07039","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:f55be3882b8583d60bdcad356aa32a11c0113c16b8144e6c938c8760f8e5c061","target":"record","created_at":"2026-05-17T23:41:24Z","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":"ebe66d7402caa3e3a959ef1a0bfa2e3f96b80997ab056cf81834a1775dc6067c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-19T13:22:36Z","title_canon_sha256":"e776f05127b5dc6e619700abb5dd7bf968e44ae3ed11a3344425acad8acc0957"},"schema_version":"1.0","source":{"id":"1902.07039","kind":"arxiv","version":2}},"canonical_sha256":"b896e158d03592a4ffb485568ebb9aca1fa1c7a4e0775e79f2e3f59ac6d287b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b896e158d03592a4ffb485568ebb9aca1fa1c7a4e0775e79f2e3f59ac6d287b9","first_computed_at":"2026-05-17T23:41:24.606747Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:24.606747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pui0XyaWNQkwYmnRzYsfooqJGT0Mh3N1UYELxSq7bZzxax3SPkQ+q8P4CP16mG5y2qdBhxWZ3PnsxjtVOx16AQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:24.607353Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.07039","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f55be3882b8583d60bdcad356aa32a11c0113c16b8144e6c938c8760f8e5c061","sha256:ba230d4bb07d35ae4f2d5d1e0308d6620eef85acdf9990bf095d5b9301051810"],"state_sha256":"700b9c94fde93b022936ffec88000fea816c4809cac2bfd3d49ed5d7a9a4e8de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oRAmB7u85FtDyrtjuqtuNF6SskVWAxsDX0hamw8n9jMuxshMuL6xHiABC8NKynQvT/pk8+HS1alL8ei8jqf1Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:02:50.537824Z","bundle_sha256":"fc199bfee4ce8ff572bc5228ba00cd1a5c8b8bd7ebbce390d8766d16759fa5ac"}}