{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:Z2AG7VDZ2KQMF5RC4HNV4PPRX4","short_pith_number":"pith:Z2AG7VDZ","schema_version":"1.0","canonical_sha256":"ce806fd479d2a0c2f622e1db5e3df1bf26494641a9745b366904c91170d4160d","source":{"kind":"arxiv","id":"1111.0044","version":1},"attestation_state":"computed","paper":{"title":"Probabilistic Planning via Heuristic Forward Search and Weighted Model Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"C. Domshlak, J. Hoffmann","submitted_at":"2011-10-31T21:47:05Z","abstract_excerpt":"We present a new algorithm for probabilistic planning with no observability.  Our algorithm, called  Probabilistic-FF, extends the heuristic forward-search machinery of Conformant-FF to problems with probabilistic uncertainty about both the initial state and action effects. Specifically,  Probabilistic-FF combines Conformant-FFs techniques with a powerful machinery for weighted model counting in (weighted) CNFs, serving to elegantly define both the search space and the heuristic function. Our evaluation of  Probabilistic-FF shows its fine scalability in a range of probabilistic domains, consti"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1111.0044","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-10-31T21:47:05Z","cross_cats_sorted":[],"title_canon_sha256":"6ba3254552d237434a27efd69b7164ee8521b789a834c4db21c088ad0019c4a0","abstract_canon_sha256":"1e9e2fef1cede81a4858f1864c7de5123c3c405870d7fd19d98a9e12d9ff579b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:46.592533Z","signature_b64":"BubsegjvoxyWZ58PhxJPPhisY9v8LpYuL6SJCGqd1fK9SmjNud54aTRApVRyrJv8H4A9pFPUJUeXlE853tFxDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce806fd479d2a0c2f622e1db5e3df1bf26494641a9745b366904c91170d4160d","last_reissued_at":"2026-05-18T04:09:46.591905Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:46.591905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Probabilistic Planning via Heuristic Forward Search and Weighted Model Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"C. Domshlak, J. Hoffmann","submitted_at":"2011-10-31T21:47:05Z","abstract_excerpt":"We present a new algorithm for probabilistic planning with no observability.  Our algorithm, called  Probabilistic-FF, extends the heuristic forward-search machinery of Conformant-FF to problems with probabilistic uncertainty about both the initial state and action effects. Specifically,  Probabilistic-FF combines Conformant-FFs techniques with a powerful machinery for weighted model counting in (weighted) CNFs, serving to elegantly define both the search space and the heuristic function. Our evaluation of  Probabilistic-FF shows its fine scalability in a range of probabilistic domains, consti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0044","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1111.0044","created_at":"2026-05-18T04:09:46.591993+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.0044v1","created_at":"2026-05-18T04:09:46.591993+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0044","created_at":"2026-05-18T04:09:46.591993+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z2AG7VDZ2KQM","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z2AG7VDZ2KQMF5RC","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z2AG7VDZ","created_at":"2026-05-18T12:26:47.523578+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z2AG7VDZ2KQMF5RC4HNV4PPRX4","json":"https://pith.science/pith/Z2AG7VDZ2KQMF5RC4HNV4PPRX4.json","graph_json":"https://pith.science/api/pith-number/Z2AG7VDZ2KQMF5RC4HNV4PPRX4/graph.json","events_json":"https://pith.science/api/pith-number/Z2AG7VDZ2KQMF5RC4HNV4PPRX4/events.json","paper":"https://pith.science/paper/Z2AG7VDZ"},"agent_actions":{"view_html":"https://pith.science/pith/Z2AG7VDZ2KQMF5RC4HNV4PPRX4","download_json":"https://pith.science/pith/Z2AG7VDZ2KQMF5RC4HNV4PPRX4.json","view_paper":"https://pith.science/paper/Z2AG7VDZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.0044&json=true","fetch_graph":"https://pith.science/api/pith-number/Z2AG7VDZ2KQMF5RC4HNV4PPRX4/graph.json","fetch_events":"https://pith.science/api/pith-number/Z2AG7VDZ2KQMF5RC4HNV4PPRX4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z2AG7VDZ2KQMF5RC4HNV4PPRX4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z2AG7VDZ2KQMF5RC4HNV4PPRX4/action/storage_attestation","attest_author":"https://pith.science/pith/Z2AG7VDZ2KQMF5RC4HNV4PPRX4/action/author_attestation","sign_citation":"https://pith.science/pith/Z2AG7VDZ2KQMF5RC4HNV4PPRX4/action/citation_signature","submit_replication":"https://pith.science/pith/Z2AG7VDZ2KQMF5RC4HNV4PPRX4/action/replication_record"}},"created_at":"2026-05-18T04:09:46.591993+00:00","updated_at":"2026-05-18T04:09:46.591993+00:00"}