{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:7BCBAJ6TDRTABK2ACIOKZL2OPI","short_pith_number":"pith:7BCBAJ6T","canonical_record":{"source":{"id":"1109.1754","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-08T16:17:07Z","cross_cats_sorted":["cs.CC","stat.ML"],"title_canon_sha256":"3dbbddab56e454c9711d53f56db6d173cc6049d732e61da87375c5406b00bf08","abstract_canon_sha256":"164ee40859a8e516a12e74f7a0a7d1fe6679f48b96f668852ad1339554f37cca"},"schema_version":"1.0"},"canonical_sha256":"f8441027d31c6600ab40121cacaf4e7a0f7e1126471411752447cb43bc6fed3b","source":{"kind":"arxiv","id":"1109.1754","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.1754","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"arxiv_version","alias_value":"1109.1754v2","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1754","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"pith_short_12","alias_value":"7BCBAJ6TDRTA","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7BCBAJ6TDRTABK2A","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7BCBAJ6T","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:7BCBAJ6TDRTABK2ACIOKZL2OPI","target":"record","payload":{"canonical_record":{"source":{"id":"1109.1754","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-08T16:17:07Z","cross_cats_sorted":["cs.CC","stat.ML"],"title_canon_sha256":"3dbbddab56e454c9711d53f56db6d173cc6049d732e61da87375c5406b00bf08","abstract_canon_sha256":"164ee40859a8e516a12e74f7a0a7d1fe6679f48b96f668852ad1339554f37cca"},"schema_version":"1.0"},"canonical_sha256":"f8441027d31c6600ab40121cacaf4e7a0f7e1126471411752447cb43bc6fed3b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:36.860753Z","signature_b64":"cHHTxgBh7Z2qRGqCVE8MeshgS5XYdKg1BX813Tqvbg4qRfOWwSVsti7u77YeIbXXHuv6xVL/oyzQ/KeYf9LbBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8441027d31c6600ab40121cacaf4e7a0f7e1126471411752447cb43bc6fed3b","last_reissued_at":"2026-05-18T02:21:36.860357Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:36.860357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.1754","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-18T02:21:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3s4wVmKx1hbWpLnGkvxEloNGllEtn6iWkVGfDmRemH3EUQYISlW58iugcyhafTowJX2n3GjDeFFP6y11XuuQBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:52:01.501662Z"},"content_sha256":"b51b25d6cf6d98e04abef31f72cbf96a1d75ebdd55d42cc23cf59c5fc35edca5","schema_version":"1.0","event_id":"sha256:b51b25d6cf6d98e04abef31f72cbf96a1d75ebdd55d42cc23cf59c5fc35edca5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:7BCBAJ6TDRTABK2ACIOKZL2OPI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving Limited Memory Influence Diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","stat.ML"],"primary_cat":"cs.AI","authors_text":"Cassio Polpo de Campos, Denis Deratani Mau\\'a, Marco Zaffalon","submitted_at":"2011-09-08T16:17:07Z","abstract_excerpt":"We present a new algorithm for exactly solving decision making problems represented as influence diagrams. We do not require the usual assumptions of no forgetting and regularity; this allows us to solve problems with simultaneous decisions and limited information. The algorithm is empirically shown to outperform a state-of-the-art algorithm on randomly generated problems of up to 150 variables and $10^{64}$ solutions. We show that the problem is NP-hard even if the underlying graph structure of the problem has small treewidth and the variables take on a bounded number of states, but that a fu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1754","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-18T02:21:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0TGlOmu+aIfSMnubZAhxbiusEfbPDyuMGhu/125c3qVNDjGeRmcc508V4fiAgQJkYH1XrZAbjAl9a5hP2IOoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:52:01.502033Z"},"content_sha256":"fdabebcc7af3ebaf61732bfe808a15270ef431524f9e0ba3f9023a61484a9a3f","schema_version":"1.0","event_id":"sha256:fdabebcc7af3ebaf61732bfe808a15270ef431524f9e0ba3f9023a61484a9a3f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7BCBAJ6TDRTABK2ACIOKZL2OPI/bundle.json","state_url":"https://pith.science/pith/7BCBAJ6TDRTABK2ACIOKZL2OPI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7BCBAJ6TDRTABK2ACIOKZL2OPI/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-27T18:52:01Z","links":{"resolver":"https://pith.science/pith/7BCBAJ6TDRTABK2ACIOKZL2OPI","bundle":"https://pith.science/pith/7BCBAJ6TDRTABK2ACIOKZL2OPI/bundle.json","state":"https://pith.science/pith/7BCBAJ6TDRTABK2ACIOKZL2OPI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7BCBAJ6TDRTABK2ACIOKZL2OPI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:7BCBAJ6TDRTABK2ACIOKZL2OPI","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":"164ee40859a8e516a12e74f7a0a7d1fe6679f48b96f668852ad1339554f37cca","cross_cats_sorted":["cs.CC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-08T16:17:07Z","title_canon_sha256":"3dbbddab56e454c9711d53f56db6d173cc6049d732e61da87375c5406b00bf08"},"schema_version":"1.0","source":{"id":"1109.1754","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.1754","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"arxiv_version","alias_value":"1109.1754v2","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1754","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"pith_short_12","alias_value":"7BCBAJ6TDRTA","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7BCBAJ6TDRTABK2A","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7BCBAJ6T","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:fdabebcc7af3ebaf61732bfe808a15270ef431524f9e0ba3f9023a61484a9a3f","target":"graph","created_at":"2026-05-18T02:21:36Z","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 present a new algorithm for exactly solving decision making problems represented as influence diagrams. We do not require the usual assumptions of no forgetting and regularity; this allows us to solve problems with simultaneous decisions and limited information. The algorithm is empirically shown to outperform a state-of-the-art algorithm on randomly generated problems of up to 150 variables and $10^{64}$ solutions. We show that the problem is NP-hard even if the underlying graph structure of the problem has small treewidth and the variables take on a bounded number of states, but that a fu","authors_text":"Cassio Polpo de Campos, Denis Deratani Mau\\'a, Marco Zaffalon","cross_cats":["cs.CC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-08T16:17:07Z","title":"Solving Limited Memory Influence Diagrams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1754","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:b51b25d6cf6d98e04abef31f72cbf96a1d75ebdd55d42cc23cf59c5fc35edca5","target":"record","created_at":"2026-05-18T02:21:36Z","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":"164ee40859a8e516a12e74f7a0a7d1fe6679f48b96f668852ad1339554f37cca","cross_cats_sorted":["cs.CC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-08T16:17:07Z","title_canon_sha256":"3dbbddab56e454c9711d53f56db6d173cc6049d732e61da87375c5406b00bf08"},"schema_version":"1.0","source":{"id":"1109.1754","kind":"arxiv","version":2}},"canonical_sha256":"f8441027d31c6600ab40121cacaf4e7a0f7e1126471411752447cb43bc6fed3b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8441027d31c6600ab40121cacaf4e7a0f7e1126471411752447cb43bc6fed3b","first_computed_at":"2026-05-18T02:21:36.860357Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:36.860357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cHHTxgBh7Z2qRGqCVE8MeshgS5XYdKg1BX813Tqvbg4qRfOWwSVsti7u77YeIbXXHuv6xVL/oyzQ/KeYf9LbBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:36.860753Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.1754","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b51b25d6cf6d98e04abef31f72cbf96a1d75ebdd55d42cc23cf59c5fc35edca5","sha256:fdabebcc7af3ebaf61732bfe808a15270ef431524f9e0ba3f9023a61484a9a3f"],"state_sha256":"c064a1246410f856996c38449da3b1aa4f84a436982b77b2466bb631462fcbb8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HC5t2V3frr6RimS1lP1YVLk8bWLkJXa/dX9FHuf2Chf7Twk8OhMY2r4FSVzIH3ke4nxHkbJELJXN/FXOA2/zBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T18:52:01.504607Z","bundle_sha256":"d99dabd54ee002e6b24f1a1a6b6a3facfb366f86d5b30daef7aec90abfde8dc3"}}