{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3YYMGZFJW346I42SRDRV3OPAIK","short_pith_number":"pith:3YYMGZFJ","schema_version":"1.0","canonical_sha256":"de30c364a9b6f9e4735288e35db9e0428a7fce6fd35ab6d79adbcfaedfa5bdbd","source":{"kind":"arxiv","id":"1602.07565","version":2},"attestation_state":"computed","paper":{"title":"Stochastic Shortest Path with Energy Constraints in POMDPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Anchit Gupta, Krishnendu Chatterjee, Martin Chmel\\'ik, Petr Novotn\\'y, Tom\\'a\\v{s} Br\\'azdil","submitted_at":"2016-02-24T15:41:22Z","abstract_excerpt":"We consider partially observable Markov decision processes (POMDPs) with a set of target states and positive integer costs associated with every transition. The traditional optimization objective (stochastic shortest path) asks to minimize the expected total cost until the target set is reached. We extend the traditional framework of POMDPs to model energy consumption, which represents a hard constraint. The energy levels may increase and decrease with transitions, and the hard constraint requires that the energy level must remain positive in all steps till the target is reached. First, we pre"},"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":"1602.07565","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-02-24T15:41:22Z","cross_cats_sorted":[],"title_canon_sha256":"b5c30b3b606385aaf2c46f5b95b2d67abbbf32a7ac3ab0fca6a7caaa556de4f8","abstract_canon_sha256":"e16a3e3d295225766472c09efb73a5d75e926bb20efc8e5a55206bc3689577c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:06.278950Z","signature_b64":"3HIR5eAcCHqiXcp3BsNeYSYb4etb828XriOA2IOp8V4iPHoaOITpVKonEA0fUVBbi4cUmOHRcBq15lxaGOWGDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de30c364a9b6f9e4735288e35db9e0428a7fce6fd35ab6d79adbcfaedfa5bdbd","last_reissued_at":"2026-05-18T01:15:06.278501Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:06.278501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Shortest Path with Energy Constraints in POMDPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Anchit Gupta, Krishnendu Chatterjee, Martin Chmel\\'ik, Petr Novotn\\'y, Tom\\'a\\v{s} Br\\'azdil","submitted_at":"2016-02-24T15:41:22Z","abstract_excerpt":"We consider partially observable Markov decision processes (POMDPs) with a set of target states and positive integer costs associated with every transition. The traditional optimization objective (stochastic shortest path) asks to minimize the expected total cost until the target set is reached. We extend the traditional framework of POMDPs to model energy consumption, which represents a hard constraint. The energy levels may increase and decrease with transitions, and the hard constraint requires that the energy level must remain positive in all steps till the target is reached. First, we pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07565","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":"1602.07565","created_at":"2026-05-18T01:15:06.278564+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.07565v2","created_at":"2026-05-18T01:15:06.278564+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07565","created_at":"2026-05-18T01:15:06.278564+00:00"},{"alias_kind":"pith_short_12","alias_value":"3YYMGZFJW346","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"3YYMGZFJW346I42S","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"3YYMGZFJ","created_at":"2026-05-18T12:29:58.707656+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/3YYMGZFJW346I42SRDRV3OPAIK","json":"https://pith.science/pith/3YYMGZFJW346I42SRDRV3OPAIK.json","graph_json":"https://pith.science/api/pith-number/3YYMGZFJW346I42SRDRV3OPAIK/graph.json","events_json":"https://pith.science/api/pith-number/3YYMGZFJW346I42SRDRV3OPAIK/events.json","paper":"https://pith.science/paper/3YYMGZFJ"},"agent_actions":{"view_html":"https://pith.science/pith/3YYMGZFJW346I42SRDRV3OPAIK","download_json":"https://pith.science/pith/3YYMGZFJW346I42SRDRV3OPAIK.json","view_paper":"https://pith.science/paper/3YYMGZFJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.07565&json=true","fetch_graph":"https://pith.science/api/pith-number/3YYMGZFJW346I42SRDRV3OPAIK/graph.json","fetch_events":"https://pith.science/api/pith-number/3YYMGZFJW346I42SRDRV3OPAIK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3YYMGZFJW346I42SRDRV3OPAIK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3YYMGZFJW346I42SRDRV3OPAIK/action/storage_attestation","attest_author":"https://pith.science/pith/3YYMGZFJW346I42SRDRV3OPAIK/action/author_attestation","sign_citation":"https://pith.science/pith/3YYMGZFJW346I42SRDRV3OPAIK/action/citation_signature","submit_replication":"https://pith.science/pith/3YYMGZFJW346I42SRDRV3OPAIK/action/replication_record"}},"created_at":"2026-05-18T01:15:06.278564+00:00","updated_at":"2026-05-18T01:15:06.278564+00:00"}