{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3EKRC7AYPMAGTXTLVC5BRPRZHE","short_pith_number":"pith:3EKRC7AY","schema_version":"1.0","canonical_sha256":"d915117c187b0069de6ba8ba18be3939251ccab01d9027a0f66ef4fd1532a60b","source":{"kind":"arxiv","id":"1401.3860","version":1},"attestation_state":"computed","paper":{"title":"Planning with Noisy Probabilistic Relational Rules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Marc Toussaint, Tobias Lang","submitted_at":"2014-01-16T05:03:40Z","abstract_excerpt":"Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually interpretable and they can be learned effectively from the action experiences in complex worlds. We investigate reasoning with such rules in grounded relational domains. Our algorithms exploit the compactness of rules for efficient and flexible decision-theoretic planning. As a first approach, we combine these rules with the Upper Confidence Bounds applied to Trees (UCT) algorithm based on look-ahead trees. Our second a"},"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":"1401.3860","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:03:40Z","cross_cats_sorted":[],"title_canon_sha256":"36ec351b2815d5c1e6afd363e146ec1a5089a9384d0507e9374d18a9ce538fe4","abstract_canon_sha256":"28d48dad504f94d6f0423632c3719faafff3cd5deb19293e7aa881deac9ddf93"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:06.499990Z","signature_b64":"O10g2vV4FkFj7q2EWipaHl+BIgMEql9Um/6vCRtKCRKzNe7QynnrKWRdvOljwlBWcbvsnKNMfaV/B/BjjQR5Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d915117c187b0069de6ba8ba18be3939251ccab01d9027a0f66ef4fd1532a60b","last_reissued_at":"2026-05-18T03:02:06.498958Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:06.498958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Planning with Noisy Probabilistic Relational Rules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Marc Toussaint, Tobias Lang","submitted_at":"2014-01-16T05:03:40Z","abstract_excerpt":"Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually interpretable and they can be learned effectively from the action experiences in complex worlds. We investigate reasoning with such rules in grounded relational domains. Our algorithms exploit the compactness of rules for efficient and flexible decision-theoretic planning. As a first approach, we combine these rules with the Upper Confidence Bounds applied to Trees (UCT) algorithm based on look-ahead trees. Our second a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3860","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":"1401.3860","created_at":"2026-05-18T03:02:06.499122+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.3860v1","created_at":"2026-05-18T03:02:06.499122+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3860","created_at":"2026-05-18T03:02:06.499122+00:00"},{"alias_kind":"pith_short_12","alias_value":"3EKRC7AYPMAG","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3EKRC7AYPMAGTXTL","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3EKRC7AY","created_at":"2026-05-18T12:28:11.866339+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/3EKRC7AYPMAGTXTLVC5BRPRZHE","json":"https://pith.science/pith/3EKRC7AYPMAGTXTLVC5BRPRZHE.json","graph_json":"https://pith.science/api/pith-number/3EKRC7AYPMAGTXTLVC5BRPRZHE/graph.json","events_json":"https://pith.science/api/pith-number/3EKRC7AYPMAGTXTLVC5BRPRZHE/events.json","paper":"https://pith.science/paper/3EKRC7AY"},"agent_actions":{"view_html":"https://pith.science/pith/3EKRC7AYPMAGTXTLVC5BRPRZHE","download_json":"https://pith.science/pith/3EKRC7AYPMAGTXTLVC5BRPRZHE.json","view_paper":"https://pith.science/paper/3EKRC7AY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.3860&json=true","fetch_graph":"https://pith.science/api/pith-number/3EKRC7AYPMAGTXTLVC5BRPRZHE/graph.json","fetch_events":"https://pith.science/api/pith-number/3EKRC7AYPMAGTXTLVC5BRPRZHE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3EKRC7AYPMAGTXTLVC5BRPRZHE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3EKRC7AYPMAGTXTLVC5BRPRZHE/action/storage_attestation","attest_author":"https://pith.science/pith/3EKRC7AYPMAGTXTLVC5BRPRZHE/action/author_attestation","sign_citation":"https://pith.science/pith/3EKRC7AYPMAGTXTLVC5BRPRZHE/action/citation_signature","submit_replication":"https://pith.science/pith/3EKRC7AYPMAGTXTLVC5BRPRZHE/action/replication_record"}},"created_at":"2026-05-18T03:02:06.499122+00:00","updated_at":"2026-05-18T03:02:06.499122+00:00"}