{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FGFGPCLXHSWGDG4Z7M24D5TDWI","short_pith_number":"pith:FGFGPCLX","canonical_record":{"source":{"id":"1309.6839","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-09-26T12:41:55Z","cross_cats_sorted":[],"title_canon_sha256":"9be08143d1fc676a4eac6b2e5305dd77ff81a57a4e039351931c8d54097acf44","abstract_canon_sha256":"fa9cf2464e8b7d7c077dc3f5f1e9d1f4daf27b7629e7888064f30e2aa5874291"},"schema_version":"1.0"},"canonical_sha256":"298a6789773cac619b99fb35c1f663b214df198503d97a5f4c3ded8dce8bb64b","source":{"kind":"arxiv","id":"1309.6839","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6839","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6839v1","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6839","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"FGFGPCLXHSWG","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FGFGPCLXHSWGDG4Z","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FGFGPCLX","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FGFGPCLXHSWGDG4Z7M24D5TDWI","target":"record","payload":{"canonical_record":{"source":{"id":"1309.6839","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-09-26T12:41:55Z","cross_cats_sorted":[],"title_canon_sha256":"9be08143d1fc676a4eac6b2e5305dd77ff81a57a4e039351931c8d54097acf44","abstract_canon_sha256":"fa9cf2464e8b7d7c077dc3f5f1e9d1f4daf27b7629e7888064f30e2aa5874291"},"schema_version":"1.0"},"canonical_sha256":"298a6789773cac619b99fb35c1f663b214df198503d97a5f4c3ded8dce8bb64b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:10.186926Z","signature_b64":"/4EzGEx0yd8COfocgh0mqzPZBD6+XQYcXGoHkYM5ykq1/5ZIN04+D3s5u8Qh8ZIxBhFtSeQDox3CH3BMtRmQCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"298a6789773cac619b99fb35c1f663b214df198503d97a5f4c3ded8dce8bb64b","last_reissued_at":"2026-05-18T03:12:10.186204Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:10.186204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.6839","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-05-18T03:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E1gKBLAkw+PElcNXLUTJQM3uVXZJQn9VOuxmyWzfSXU2K8toHjqq6WqCMHzEeiF5WHKA0IrH0R7WKNHdpNCsCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:40:56.261613Z"},"content_sha256":"7449be435af5c931e6f56078dee084936f62cc2ab8176f2bba55abc59c90b939","schema_version":"1.0","event_id":"sha256:7449be435af5c931e6f56078dee084936f62cc2ab8176f2bba55abc59c90b939"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FGFGPCLXHSWGDG4Z7M24D5TDWI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving Limited-Memory Influence Diagrams Using Branch-and-Bound Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Arindam Khaled, Changhe Yuan, Eric A. Hansen","submitted_at":"2013-09-26T12:41:55Z","abstract_excerpt":"A limited-memory influence diagram (LIMID) generalizes a traditional influence diagram by relaxing the assumptions of regularity and no-forgetting, allowing a wider range of decision problems to be modeled. Algorithms for solving traditional influence diagrams are not easily generalized to solve LIMIDs, however, and only recently have exact algorithms for solving LIMIDs been developed. In this paper, we introduce an exact algorithm for solving LIMIDs that is based on branch-and-bound search. Our approach is related to the approach of solving an influence diagram by converting it to an equivale"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6839","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":""},"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-18T03:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uUgEztFoKNJqA0kx1KKd9v+9Ap+qJ+9Ks+U5i0sSqfYwYQWEpxQCnvIKDUygctZyt9SY+AcxJ1in4+ROAWxsCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:40:56.262266Z"},"content_sha256":"9fd554d3284b163401fa3e1d5de9dd752c5561d4a03090cc73a0cae56cf82994","schema_version":"1.0","event_id":"sha256:9fd554d3284b163401fa3e1d5de9dd752c5561d4a03090cc73a0cae56cf82994"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FGFGPCLXHSWGDG4Z7M24D5TDWI/bundle.json","state_url":"https://pith.science/pith/FGFGPCLXHSWGDG4Z7M24D5TDWI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FGFGPCLXHSWGDG4Z7M24D5TDWI/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-27T17:40:56Z","links":{"resolver":"https://pith.science/pith/FGFGPCLXHSWGDG4Z7M24D5TDWI","bundle":"https://pith.science/pith/FGFGPCLXHSWGDG4Z7M24D5TDWI/bundle.json","state":"https://pith.science/pith/FGFGPCLXHSWGDG4Z7M24D5TDWI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FGFGPCLXHSWGDG4Z7M24D5TDWI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FGFGPCLXHSWGDG4Z7M24D5TDWI","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":"fa9cf2464e8b7d7c077dc3f5f1e9d1f4daf27b7629e7888064f30e2aa5874291","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-09-26T12:41:55Z","title_canon_sha256":"9be08143d1fc676a4eac6b2e5305dd77ff81a57a4e039351931c8d54097acf44"},"schema_version":"1.0","source":{"id":"1309.6839","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6839","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6839v1","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6839","created_at":"2026-05-18T03:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"FGFGPCLXHSWG","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FGFGPCLXHSWGDG4Z","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FGFGPCLX","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:9fd554d3284b163401fa3e1d5de9dd752c5561d4a03090cc73a0cae56cf82994","target":"graph","created_at":"2026-05-18T03:12:10Z","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":"A limited-memory influence diagram (LIMID) generalizes a traditional influence diagram by relaxing the assumptions of regularity and no-forgetting, allowing a wider range of decision problems to be modeled. Algorithms for solving traditional influence diagrams are not easily generalized to solve LIMIDs, however, and only recently have exact algorithms for solving LIMIDs been developed. In this paper, we introduce an exact algorithm for solving LIMIDs that is based on branch-and-bound search. Our approach is related to the approach of solving an influence diagram by converting it to an equivale","authors_text":"Arindam Khaled, Changhe Yuan, Eric A. Hansen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-09-26T12:41:55Z","title":"Solving Limited-Memory Influence Diagrams Using Branch-and-Bound Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6839","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:7449be435af5c931e6f56078dee084936f62cc2ab8176f2bba55abc59c90b939","target":"record","created_at":"2026-05-18T03:12:10Z","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":"fa9cf2464e8b7d7c077dc3f5f1e9d1f4daf27b7629e7888064f30e2aa5874291","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-09-26T12:41:55Z","title_canon_sha256":"9be08143d1fc676a4eac6b2e5305dd77ff81a57a4e039351931c8d54097acf44"},"schema_version":"1.0","source":{"id":"1309.6839","kind":"arxiv","version":1}},"canonical_sha256":"298a6789773cac619b99fb35c1f663b214df198503d97a5f4c3ded8dce8bb64b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"298a6789773cac619b99fb35c1f663b214df198503d97a5f4c3ded8dce8bb64b","first_computed_at":"2026-05-18T03:12:10.186204Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:10.186204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/4EzGEx0yd8COfocgh0mqzPZBD6+XQYcXGoHkYM5ykq1/5ZIN04+D3s5u8Qh8ZIxBhFtSeQDox3CH3BMtRmQCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:10.186926Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.6839","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7449be435af5c931e6f56078dee084936f62cc2ab8176f2bba55abc59c90b939","sha256:9fd554d3284b163401fa3e1d5de9dd752c5561d4a03090cc73a0cae56cf82994"],"state_sha256":"0121efab45d045b0556d3a43c83fb729b3c494ef9a84b0eb93d25c39846a1971"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MnM+no0Dak3YBS+jOFZtcWBkMfpvXOlg9h7jc0zcriGvEIHSxM5aaWHgxwSFp74GNQSHntR6n65jYWF1MTdYBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T17:40:56.265344Z","bundle_sha256":"7f2fdfd4503157661a76934cf868e978b2910c3749316232b0e62c76c432d6a3"}}