{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:477BOH2AZO3TI3RZT5VZTVSUQL","short_pith_number":"pith:477BOH2A","schema_version":"1.0","canonical_sha256":"e7fe171f40cbb7346e399f6b99d65482d08c0769862bab17bc6a68fe5c783305","source":{"kind":"arxiv","id":"1206.5249","version":1},"attestation_state":"computed","paper":{"title":"Learning Probabilistic Relational Dynamics for Multiple Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ashwin Deshpande, Brian Milch, Leslie Pack Kaelbling, Luke S. Zettlemoyer","submitted_at":"2012-06-20T14:55:37Z","abstract_excerpt":"The ways in which an agent's actions affect the world can often be modeled compactly using a set of relational probabilistic planning rules. This paper addresses the problem of learning such rule sets for multiple related tasks. We take a hierarchical Bayesian approach, in which the system learns a prior distribution over rule sets. We present a class of prior distributions parameterized by a rule set prototype that is stochastically modified to produce a task-specific rule set. We also describe a coordinate ascent algorithm that iteratively optimizes the task-specific rule sets and the prior "},"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":"1206.5249","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-20T14:55:37Z","cross_cats_sorted":[],"title_canon_sha256":"5582db8876fa3959ac3b1fef8c8798a15bc6b39028c2e222504b625a4d012510","abstract_canon_sha256":"33842ea07cc58ad844799e04670bd5af1b28bc6593f4049818cefc25a97142e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:40.932341Z","signature_b64":"mkf6AdlTsc9Nfru96JG4VOdvFkjXmcDYDmu9bGx5+fc8XsLtw/u4pna482a4Bo/SrTdMd6RMHs12SjQDyA0HDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7fe171f40cbb7346e399f6b99d65482d08c0769862bab17bc6a68fe5c783305","last_reissued_at":"2026-05-18T03:52:40.931520Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:40.931520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Probabilistic Relational Dynamics for Multiple Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ashwin Deshpande, Brian Milch, Leslie Pack Kaelbling, Luke S. Zettlemoyer","submitted_at":"2012-06-20T14:55:37Z","abstract_excerpt":"The ways in which an agent's actions affect the world can often be modeled compactly using a set of relational probabilistic planning rules. This paper addresses the problem of learning such rule sets for multiple related tasks. We take a hierarchical Bayesian approach, in which the system learns a prior distribution over rule sets. We present a class of prior distributions parameterized by a rule set prototype that is stochastically modified to produce a task-specific rule set. We also describe a coordinate ascent algorithm that iteratively optimizes the task-specific rule sets and the prior "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5249","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":"1206.5249","created_at":"2026-05-18T03:52:40.931640+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.5249v1","created_at":"2026-05-18T03:52:40.931640+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5249","created_at":"2026-05-18T03:52:40.931640+00:00"},{"alias_kind":"pith_short_12","alias_value":"477BOH2AZO3T","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"477BOH2AZO3TI3RZ","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"477BOH2A","created_at":"2026-05-18T12:26:53.410803+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/477BOH2AZO3TI3RZT5VZTVSUQL","json":"https://pith.science/pith/477BOH2AZO3TI3RZT5VZTVSUQL.json","graph_json":"https://pith.science/api/pith-number/477BOH2AZO3TI3RZT5VZTVSUQL/graph.json","events_json":"https://pith.science/api/pith-number/477BOH2AZO3TI3RZT5VZTVSUQL/events.json","paper":"https://pith.science/paper/477BOH2A"},"agent_actions":{"view_html":"https://pith.science/pith/477BOH2AZO3TI3RZT5VZTVSUQL","download_json":"https://pith.science/pith/477BOH2AZO3TI3RZT5VZTVSUQL.json","view_paper":"https://pith.science/paper/477BOH2A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.5249&json=true","fetch_graph":"https://pith.science/api/pith-number/477BOH2AZO3TI3RZT5VZTVSUQL/graph.json","fetch_events":"https://pith.science/api/pith-number/477BOH2AZO3TI3RZT5VZTVSUQL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/477BOH2AZO3TI3RZT5VZTVSUQL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/477BOH2AZO3TI3RZT5VZTVSUQL/action/storage_attestation","attest_author":"https://pith.science/pith/477BOH2AZO3TI3RZT5VZTVSUQL/action/author_attestation","sign_citation":"https://pith.science/pith/477BOH2AZO3TI3RZT5VZTVSUQL/action/citation_signature","submit_replication":"https://pith.science/pith/477BOH2AZO3TI3RZT5VZTVSUQL/action/replication_record"}},"created_at":"2026-05-18T03:52:40.931640+00:00","updated_at":"2026-05-18T03:52:40.931640+00:00"}