{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:XHGZLAGXI4NBSDYX5PMT4SEUJM","short_pith_number":"pith:XHGZLAGX","canonical_record":{"source":{"id":"1301.0606","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-12-12T15:58:46Z","cross_cats_sorted":[],"title_canon_sha256":"2b24bba0b69409c5c322d51a50ed15b8b9fc9d61262bd8033ca21a59f3805056","abstract_canon_sha256":"b8d21503c2bee6bb368556066eea9769e4c87f2cf1610f641e8de1fc3c930d33"},"schema_version":"1.0"},"canonical_sha256":"b9cd9580d7471a190f17ebd93e48944b2f30ad2feef332470f6dcc9650aac5d1","source":{"kind":"arxiv","id":"1301.0606","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0606","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0606v1","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0606","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"pith_short_12","alias_value":"XHGZLAGXI4NB","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XHGZLAGXI4NBSDYX","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XHGZLAGX","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:XHGZLAGXI4NBSDYX5PMT4SEUJM","target":"record","payload":{"canonical_record":{"source":{"id":"1301.0606","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-12-12T15:58:46Z","cross_cats_sorted":[],"title_canon_sha256":"2b24bba0b69409c5c322d51a50ed15b8b9fc9d61262bd8033ca21a59f3805056","abstract_canon_sha256":"b8d21503c2bee6bb368556066eea9769e4c87f2cf1610f641e8de1fc3c930d33"},"schema_version":"1.0"},"canonical_sha256":"b9cd9580d7471a190f17ebd93e48944b2f30ad2feef332470f6dcc9650aac5d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:18.179791Z","signature_b64":"HeO9pIzPTIT/9825HV8blez0Osh7EobMAjCfOQBH6IbZGbNOnsPPmJvdTz29BZnHi29fRnR8o2xuXW6TJ5o0Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9cd9580d7471a190f17ebd93e48944b2f30ad2feef332470f6dcc9650aac5d1","last_reissued_at":"2026-05-18T03:37:18.179282Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:18.179282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.0606","source_version":1,"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-18T03:37:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MLFvBUlk34NqqqhfU8sirQliH1xd104c8glrdlNVB+lZCjAiu8G3svzcmLQ97R4p8zja3ckc/1DQPW98LGQDBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:29:10.659032Z"},"content_sha256":"9dd4b3bc330ccc3b4bdf3a016abf4d59ebb7b092207e632934c036f61dc9d952","schema_version":"1.0","event_id":"sha256:9dd4b3bc330ccc3b4bdf3a016abf4d59ebb7b092207e632934c036f61dc9d952"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:XHGZLAGXI4NBSDYX5PMT4SEUJM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Anytime State-Based Solution Methods for Decision Processes with non-Markovian Rewards","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Froduald Kabanza, John Slanley, Sylvie Thiebaux","submitted_at":"2012-12-12T15:58:46Z","abstract_excerpt":"A popular approach to solving a decision process with non-Markovian rewards (NMRDP) is to exploit a compact representation of the reward function to automatically translate the NMRDP into an equivalent Markov decision process (MDP) amenable to our favorite MDP solution method. The contribution of this paper is a representation of non-Markovian reward functions and a translation into MDP aimed at making the best possible use of state-based anytime algorithms as the solution method. By explicitly constructing and exploring only parts of the state space, these algorithms are able to trade computa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0606","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"},"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-18T03:37:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JlT3xWuxdgj/paEt/wbHnA6MSyISNrMIGOL5kdblnQEf/pOvTRNjRVMqZlSjpF5sw/CbbB2hm4f4nmdGuFtRDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:29:10.659635Z"},"content_sha256":"0706423d7567e0b4e80ef79135f2b6c5dc91e4564fa2ce53a26540c134c12c77","schema_version":"1.0","event_id":"sha256:0706423d7567e0b4e80ef79135f2b6c5dc91e4564fa2ce53a26540c134c12c77"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XHGZLAGXI4NBSDYX5PMT4SEUJM/bundle.json","state_url":"https://pith.science/pith/XHGZLAGXI4NBSDYX5PMT4SEUJM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XHGZLAGXI4NBSDYX5PMT4SEUJM/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-06-09T00:29:10Z","links":{"resolver":"https://pith.science/pith/XHGZLAGXI4NBSDYX5PMT4SEUJM","bundle":"https://pith.science/pith/XHGZLAGXI4NBSDYX5PMT4SEUJM/bundle.json","state":"https://pith.science/pith/XHGZLAGXI4NBSDYX5PMT4SEUJM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XHGZLAGXI4NBSDYX5PMT4SEUJM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:XHGZLAGXI4NBSDYX5PMT4SEUJM","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":"b8d21503c2bee6bb368556066eea9769e4c87f2cf1610f641e8de1fc3c930d33","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-12-12T15:58:46Z","title_canon_sha256":"2b24bba0b69409c5c322d51a50ed15b8b9fc9d61262bd8033ca21a59f3805056"},"schema_version":"1.0","source":{"id":"1301.0606","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0606","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0606v1","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0606","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"pith_short_12","alias_value":"XHGZLAGXI4NB","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XHGZLAGXI4NBSDYX","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XHGZLAGX","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:0706423d7567e0b4e80ef79135f2b6c5dc91e4564fa2ce53a26540c134c12c77","target":"graph","created_at":"2026-05-18T03:37:18Z","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":"A popular approach to solving a decision process with non-Markovian rewards (NMRDP) is to exploit a compact representation of the reward function to automatically translate the NMRDP into an equivalent Markov decision process (MDP) amenable to our favorite MDP solution method. The contribution of this paper is a representation of non-Markovian reward functions and a translation into MDP aimed at making the best possible use of state-based anytime algorithms as the solution method. By explicitly constructing and exploring only parts of the state space, these algorithms are able to trade computa","authors_text":"Froduald Kabanza, John Slanley, Sylvie Thiebaux","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-12-12T15:58:46Z","title":"Anytime State-Based Solution Methods for Decision Processes with non-Markovian Rewards"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0606","kind":"arxiv","version":1},"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:9dd4b3bc330ccc3b4bdf3a016abf4d59ebb7b092207e632934c036f61dc9d952","target":"record","created_at":"2026-05-18T03:37:18Z","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":"b8d21503c2bee6bb368556066eea9769e4c87f2cf1610f641e8de1fc3c930d33","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-12-12T15:58:46Z","title_canon_sha256":"2b24bba0b69409c5c322d51a50ed15b8b9fc9d61262bd8033ca21a59f3805056"},"schema_version":"1.0","source":{"id":"1301.0606","kind":"arxiv","version":1}},"canonical_sha256":"b9cd9580d7471a190f17ebd93e48944b2f30ad2feef332470f6dcc9650aac5d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b9cd9580d7471a190f17ebd93e48944b2f30ad2feef332470f6dcc9650aac5d1","first_computed_at":"2026-05-18T03:37:18.179282Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:37:18.179282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HeO9pIzPTIT/9825HV8blez0Osh7EobMAjCfOQBH6IbZGbNOnsPPmJvdTz29BZnHi29fRnR8o2xuXW6TJ5o0Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:37:18.179791Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.0606","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9dd4b3bc330ccc3b4bdf3a016abf4d59ebb7b092207e632934c036f61dc9d952","sha256:0706423d7567e0b4e80ef79135f2b6c5dc91e4564fa2ce53a26540c134c12c77"],"state_sha256":"f1b8938fbc45e81e73286f4c0c7a9e16faeda7c481033e5a78bff5259d709aeb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5B2BLatpWjzn8uAtMjj/cKVwX9oiSASzVuSiUT/TuDQ0yR9sflBVjTLe9zbjzEhmL/kuWG4kkaoKkKi+gIjnDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T00:29:10.662552Z","bundle_sha256":"1c8ec41cfe7a319ed12f032cfd80ca928ff96ebb3508388e41cab10db9f8b8fc"}}