{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BSAFI63KT6JGHCMMV3SJDTRGE3","short_pith_number":"pith:BSAFI63K","schema_version":"1.0","canonical_sha256":"0c80547b6a9f9263898caee491ce2626e7fcf05c7b3d45c74371702e1d2e84a5","source":{"kind":"arxiv","id":"1704.07531","version":2},"attestation_state":"computed","paper":{"title":"Sufficient Markov Decision Processes with Alternating Deep Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"stat.ME","authors_text":"Eric B. Laber, Katie Witkiewitz, Longshaokan Wang","submitted_at":"2017-04-25T04:10:37Z","abstract_excerpt":"Advances in mobile computing technologies have made it possible to monitor and apply data-driven interventions across complex systems in real time. Markov decision processes (MDPs) are the primary model for sequential decision problems with a large or indefinite time horizon. Choosing a representation of the underlying decision process that is both Markov and low-dimensional is non-trivial. We propose a method for constructing a low-dimensional representation of the original decision process for which: 1. the MDP model holds; 2. a decision strategy that maximizes mean utility when applied to t"},"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":"1704.07531","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-04-25T04:10:37Z","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"title_canon_sha256":"a24026bda191aa041b47a9b161109225d09390cf997ddf0d82abad71320ddcbd","abstract_canon_sha256":"4a96590ea103979edc496c222f5db6b2d221d6422ff5d2ee89525c3345888e05"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:49.059064Z","signature_b64":"JF/cmjFktMOQ1os2ISJv9Jj9NQvIA3o1WtnQqF5WKnoftbahODnws5F6wTyyj8a0+ZAci1GIIGwcNVXH+SbuBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c80547b6a9f9263898caee491ce2626e7fcf05c7b3d45c74371702e1d2e84a5","last_reissued_at":"2026-05-18T00:20:49.058298Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:49.058298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sufficient Markov Decision Processes with Alternating Deep Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"stat.ME","authors_text":"Eric B. Laber, Katie Witkiewitz, Longshaokan Wang","submitted_at":"2017-04-25T04:10:37Z","abstract_excerpt":"Advances in mobile computing technologies have made it possible to monitor and apply data-driven interventions across complex systems in real time. Markov decision processes (MDPs) are the primary model for sequential decision problems with a large or indefinite time horizon. Choosing a representation of the underlying decision process that is both Markov and low-dimensional is non-trivial. We propose a method for constructing a low-dimensional representation of the original decision process for which: 1. the MDP model holds; 2. a decision strategy that maximizes mean utility when applied to t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07531","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":"1704.07531","created_at":"2026-05-18T00:20:49.058426+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.07531v2","created_at":"2026-05-18T00:20:49.058426+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07531","created_at":"2026-05-18T00:20:49.058426+00:00"},{"alias_kind":"pith_short_12","alias_value":"BSAFI63KT6JG","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BSAFI63KT6JGHCMM","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BSAFI63K","created_at":"2026-05-18T12:31:08.081275+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/BSAFI63KT6JGHCMMV3SJDTRGE3","json":"https://pith.science/pith/BSAFI63KT6JGHCMMV3SJDTRGE3.json","graph_json":"https://pith.science/api/pith-number/BSAFI63KT6JGHCMMV3SJDTRGE3/graph.json","events_json":"https://pith.science/api/pith-number/BSAFI63KT6JGHCMMV3SJDTRGE3/events.json","paper":"https://pith.science/paper/BSAFI63K"},"agent_actions":{"view_html":"https://pith.science/pith/BSAFI63KT6JGHCMMV3SJDTRGE3","download_json":"https://pith.science/pith/BSAFI63KT6JGHCMMV3SJDTRGE3.json","view_paper":"https://pith.science/paper/BSAFI63K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.07531&json=true","fetch_graph":"https://pith.science/api/pith-number/BSAFI63KT6JGHCMMV3SJDTRGE3/graph.json","fetch_events":"https://pith.science/api/pith-number/BSAFI63KT6JGHCMMV3SJDTRGE3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BSAFI63KT6JGHCMMV3SJDTRGE3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BSAFI63KT6JGHCMMV3SJDTRGE3/action/storage_attestation","attest_author":"https://pith.science/pith/BSAFI63KT6JGHCMMV3SJDTRGE3/action/author_attestation","sign_citation":"https://pith.science/pith/BSAFI63KT6JGHCMMV3SJDTRGE3/action/citation_signature","submit_replication":"https://pith.science/pith/BSAFI63KT6JGHCMMV3SJDTRGE3/action/replication_record"}},"created_at":"2026-05-18T00:20:49.058426+00:00","updated_at":"2026-05-18T00:20:49.058426+00:00"}