{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DL6HJRLTEMAGS7TZ3IPMDIQZ6Z","short_pith_number":"pith:DL6HJRLT","schema_version":"1.0","canonical_sha256":"1afc74c5732300697e79da1ec1a219f679b0848fd73f90cb9eebeaae2e74954d","source":{"kind":"arxiv","id":"1306.6302","version":2},"attestation_state":"computed","paper":{"title":"Solving Relational MDPs with Exogenous Events and Additive Rewards","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"A. Fern, A. Raghavan, P. Tadepalli, R. Khardon, S. Joshi","submitted_at":"2013-06-26T17:59:49Z","abstract_excerpt":"We formalize a simple but natural subclass of service domains for relational planning problems with object-centered, independent exogenous events and additive rewards capturing, for example, problems in inventory control. Focusing on this subclass, we present a new symbolic planning algorithm which is the first algorithm that has explicit performance guarantees for relational MDPs with exogenous events. In particular, under some technical conditions, our planning algorithm provides a monotonic lower bound on the optimal value function. To support this algorithm we present novel evaluation and "},"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":"1306.6302","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-06-26T17:59:49Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4bae2e1a9915ff141de273a78fc7b24c75716333b5c6b330b68c49e3d91a1202","abstract_canon_sha256":"ac4f8b80ef25cd4865e5a99c16f125c53168cb35695222e991b4c004e56dfdf7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:45.107553Z","signature_b64":"RFSj5i/RevRCai8b0iw+NGEIVPuKwpkb5s6crDoyRdwHf8AiFJFziRjU1darRzRLj/rMzFLbSnOLGDeDXG/KBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1afc74c5732300697e79da1ec1a219f679b0848fd73f90cb9eebeaae2e74954d","last_reissued_at":"2026-05-18T03:19:45.106865Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:45.106865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Relational MDPs with Exogenous Events and Additive Rewards","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"A. Fern, A. Raghavan, P. Tadepalli, R. Khardon, S. Joshi","submitted_at":"2013-06-26T17:59:49Z","abstract_excerpt":"We formalize a simple but natural subclass of service domains for relational planning problems with object-centered, independent exogenous events and additive rewards capturing, for example, problems in inventory control. Focusing on this subclass, we present a new symbolic planning algorithm which is the first algorithm that has explicit performance guarantees for relational MDPs with exogenous events. In particular, under some technical conditions, our planning algorithm provides a monotonic lower bound on the optimal value function. To support this algorithm we present novel evaluation and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.6302","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1306.6302","created_at":"2026-05-18T03:19:45.106962+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.6302v2","created_at":"2026-05-18T03:19:45.106962+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.6302","created_at":"2026-05-18T03:19:45.106962+00:00"},{"alias_kind":"pith_short_12","alias_value":"DL6HJRLTEMAG","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DL6HJRLTEMAGS7TZ","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DL6HJRLT","created_at":"2026-05-18T12:27:43.054852+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/DL6HJRLTEMAGS7TZ3IPMDIQZ6Z","json":"https://pith.science/pith/DL6HJRLTEMAGS7TZ3IPMDIQZ6Z.json","graph_json":"https://pith.science/api/pith-number/DL6HJRLTEMAGS7TZ3IPMDIQZ6Z/graph.json","events_json":"https://pith.science/api/pith-number/DL6HJRLTEMAGS7TZ3IPMDIQZ6Z/events.json","paper":"https://pith.science/paper/DL6HJRLT"},"agent_actions":{"view_html":"https://pith.science/pith/DL6HJRLTEMAGS7TZ3IPMDIQZ6Z","download_json":"https://pith.science/pith/DL6HJRLTEMAGS7TZ3IPMDIQZ6Z.json","view_paper":"https://pith.science/paper/DL6HJRLT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.6302&json=true","fetch_graph":"https://pith.science/api/pith-number/DL6HJRLTEMAGS7TZ3IPMDIQZ6Z/graph.json","fetch_events":"https://pith.science/api/pith-number/DL6HJRLTEMAGS7TZ3IPMDIQZ6Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DL6HJRLTEMAGS7TZ3IPMDIQZ6Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DL6HJRLTEMAGS7TZ3IPMDIQZ6Z/action/storage_attestation","attest_author":"https://pith.science/pith/DL6HJRLTEMAGS7TZ3IPMDIQZ6Z/action/author_attestation","sign_citation":"https://pith.science/pith/DL6HJRLTEMAGS7TZ3IPMDIQZ6Z/action/citation_signature","submit_replication":"https://pith.science/pith/DL6HJRLTEMAGS7TZ3IPMDIQZ6Z/action/replication_record"}},"created_at":"2026-05-18T03:19:45.106962+00:00","updated_at":"2026-05-18T03:19:45.106962+00:00"}