{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AGTKCPN6IQCRC3VAZ6AAEEF3FU","short_pith_number":"pith:AGTKCPN6","schema_version":"1.0","canonical_sha256":"01a6a13dbe4405116ea0cf800210bb2d2471bd7bed98c761e32c3e422438905a","source":{"kind":"arxiv","id":"1710.00675","version":1},"attestation_state":"computed","paper":{"title":"Sensor Synthesis for POMDPs with Reachability Objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Krishnendu Chatterjee, Martin Chmelik, Ufuk Topcu","submitted_at":"2017-09-29T08:27:24Z","abstract_excerpt":"Partially observable Markov decision processes (POMDPs) are widely used in probabilistic planning problems in which an agent interacts with an environment using noisy and imprecise sensors. We study a setting in which the sensors are only partially defined and the goal is to synthesize \"weakest\" additional sensors, such that in the resulting POMDP, there is a small-memory policy for the agent that almost-surely (with probability~1) satisfies a reachability objective. We show that the problem is NP-complete, and present a symbolic algorithm by encoding the problem into SAT instances. We illustr"},"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":"1710.00675","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-09-29T08:27:24Z","cross_cats_sorted":[],"title_canon_sha256":"b61eee6106b8d82fef601dedf6915ee0a259d8401dc6f56f4e03562415a0d2e3","abstract_canon_sha256":"dd206825efcdac58bc48b57635bb7034a39683659e46bbdc835a07fa6b24c835"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:54.072028Z","signature_b64":"pKF4MuOIRVpuw6R/3fCpE/30KMbQRq16Xl5X32A1GUYC70KdHv/aX5uPtKYRZ7gVMokSrNK4qXI77E2KqRZPBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01a6a13dbe4405116ea0cf800210bb2d2471bd7bed98c761e32c3e422438905a","last_reissued_at":"2026-05-18T00:33:54.071407Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:54.071407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sensor Synthesis for POMDPs with Reachability Objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Krishnendu Chatterjee, Martin Chmelik, Ufuk Topcu","submitted_at":"2017-09-29T08:27:24Z","abstract_excerpt":"Partially observable Markov decision processes (POMDPs) are widely used in probabilistic planning problems in which an agent interacts with an environment using noisy and imprecise sensors. We study a setting in which the sensors are only partially defined and the goal is to synthesize \"weakest\" additional sensors, such that in the resulting POMDP, there is a small-memory policy for the agent that almost-surely (with probability~1) satisfies a reachability objective. We show that the problem is NP-complete, and present a symbolic algorithm by encoding the problem into SAT instances. We illustr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00675","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":"1710.00675","created_at":"2026-05-18T00:33:54.071518+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.00675v1","created_at":"2026-05-18T00:33:54.071518+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00675","created_at":"2026-05-18T00:33:54.071518+00:00"},{"alias_kind":"pith_short_12","alias_value":"AGTKCPN6IQCR","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AGTKCPN6IQCRC3VA","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AGTKCPN6","created_at":"2026-05-18T12:31:05.417338+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/AGTKCPN6IQCRC3VAZ6AAEEF3FU","json":"https://pith.science/pith/AGTKCPN6IQCRC3VAZ6AAEEF3FU.json","graph_json":"https://pith.science/api/pith-number/AGTKCPN6IQCRC3VAZ6AAEEF3FU/graph.json","events_json":"https://pith.science/api/pith-number/AGTKCPN6IQCRC3VAZ6AAEEF3FU/events.json","paper":"https://pith.science/paper/AGTKCPN6"},"agent_actions":{"view_html":"https://pith.science/pith/AGTKCPN6IQCRC3VAZ6AAEEF3FU","download_json":"https://pith.science/pith/AGTKCPN6IQCRC3VAZ6AAEEF3FU.json","view_paper":"https://pith.science/paper/AGTKCPN6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.00675&json=true","fetch_graph":"https://pith.science/api/pith-number/AGTKCPN6IQCRC3VAZ6AAEEF3FU/graph.json","fetch_events":"https://pith.science/api/pith-number/AGTKCPN6IQCRC3VAZ6AAEEF3FU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AGTKCPN6IQCRC3VAZ6AAEEF3FU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AGTKCPN6IQCRC3VAZ6AAEEF3FU/action/storage_attestation","attest_author":"https://pith.science/pith/AGTKCPN6IQCRC3VAZ6AAEEF3FU/action/author_attestation","sign_citation":"https://pith.science/pith/AGTKCPN6IQCRC3VAZ6AAEEF3FU/action/citation_signature","submit_replication":"https://pith.science/pith/AGTKCPN6IQCRC3VAZ6AAEEF3FU/action/replication_record"}},"created_at":"2026-05-18T00:33:54.071518+00:00","updated_at":"2026-05-18T00:33:54.071518+00:00"}