{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BIUJAW7F5YZCLFA7ED5XFCFPUJ","short_pith_number":"pith:BIUJAW7F","canonical_record":{"source":{"id":"1810.04859","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-11T06:15:05Z","cross_cats_sorted":["cs.AI","cs.LG","cs.SY","math.IT","math.ST","stat.TH"],"title_canon_sha256":"a7439c1f9b6328557e186c88be8b9effaae6316b25ddc82f5b4f7e66d98bc2f4","abstract_canon_sha256":"6123cdb7b97ec99a9d91c3944afd47442b0e6ce1545350f48e52ab087429dda7"},"schema_version":"1.0"},"canonical_sha256":"0a28905be5ee3225941f20fb7288afa262dc45516a76e7eaa335adcbb3a1cbe5","source":{"kind":"arxiv","id":"1810.04859","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04859","created_at":"2026-05-18T00:03:31Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04859v1","created_at":"2026-05-18T00:03:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04859","created_at":"2026-05-18T00:03:31Z"},{"alias_kind":"pith_short_12","alias_value":"BIUJAW7F5YZC","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BIUJAW7F5YZCLFA7","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BIUJAW7F","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BIUJAW7F5YZCLFA7ED5XFCFPUJ","target":"record","payload":{"canonical_record":{"source":{"id":"1810.04859","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-11T06:15:05Z","cross_cats_sorted":["cs.AI","cs.LG","cs.SY","math.IT","math.ST","stat.TH"],"title_canon_sha256":"a7439c1f9b6328557e186c88be8b9effaae6316b25ddc82f5b4f7e66d98bc2f4","abstract_canon_sha256":"6123cdb7b97ec99a9d91c3944afd47442b0e6ce1545350f48e52ab087429dda7"},"schema_version":"1.0"},"canonical_sha256":"0a28905be5ee3225941f20fb7288afa262dc45516a76e7eaa335adcbb3a1cbe5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:31.444678Z","signature_b64":"/Xhw3pBcmpDE5z9VsVDLNWf16Ji+WynbqQ9CDK8gyeqh1RgBoFvkfFnFAdUdApUo3GQUd6kfXzEz1eQV0zY+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a28905be5ee3225941f20fb7288afa262dc45516a76e7eaa335adcbb3a1cbe5","last_reissued_at":"2026-05-18T00:03:31.443998Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:31.443998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.04859","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-18T00:03:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8uJj2ObFHOR93rVBJNf4pBwnUT1pHjkBSuSqpV7HgBd6wx/pgzlm3+4G9Pm8djF7Zau1GpTkaNfCe7nGbDVCCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T09:51:40.183513Z"},"content_sha256":"5295c799f84ca1e070769c58e6d3cd191e0985de0adced4b14feb6b8f1f0f6aa","schema_version":"1.0","event_id":"sha256:5295c799f84ca1e070769c58e6d3cd191e0985de0adced4b14feb6b8f1f0f6aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BIUJAW7F5YZCLFA7ED5XFCFPUJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Policy Design for Active Sequential Hypothesis Testing using Deep Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.SY","math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Dhruva Kartik, Ekraam Sabir, Prem Natarajan, Urbashi Mitra","submitted_at":"2018-10-11T06:15:05Z","abstract_excerpt":"Information theory has been very successful in obtaining performance limits for various problems such as communication, compression and hypothesis testing. Likewise, stochastic control theory provides a characterization of optimal policies for Partially Observable Markov Decision Processes (POMDPs) using dynamic programming. However, finding optimal policies for these problems is computationally hard in general and thus, heuristic solutions are employed in practice. Deep learning can be used as a tool for designing better heuristics in such problems. In this paper, the problem of active sequen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04859","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-18T00:03:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ABD4SsgyRXai6zJf93gL8uu7zRNfGBm81SN/HGISgI5Z5bNBR00nLECdpXOPN2n5FeDYriim6Z5KWhjVgHE+Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T09:51:40.183874Z"},"content_sha256":"d76d84df9b83366eb1189057095acfc76a4c45ea37650b8229c807c791f43da5","schema_version":"1.0","event_id":"sha256:d76d84df9b83366eb1189057095acfc76a4c45ea37650b8229c807c791f43da5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BIUJAW7F5YZCLFA7ED5XFCFPUJ/bundle.json","state_url":"https://pith.science/pith/BIUJAW7F5YZCLFA7ED5XFCFPUJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BIUJAW7F5YZCLFA7ED5XFCFPUJ/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-30T09:51:40Z","links":{"resolver":"https://pith.science/pith/BIUJAW7F5YZCLFA7ED5XFCFPUJ","bundle":"https://pith.science/pith/BIUJAW7F5YZCLFA7ED5XFCFPUJ/bundle.json","state":"https://pith.science/pith/BIUJAW7F5YZCLFA7ED5XFCFPUJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BIUJAW7F5YZCLFA7ED5XFCFPUJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BIUJAW7F5YZCLFA7ED5XFCFPUJ","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":"6123cdb7b97ec99a9d91c3944afd47442b0e6ce1545350f48e52ab087429dda7","cross_cats_sorted":["cs.AI","cs.LG","cs.SY","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-11T06:15:05Z","title_canon_sha256":"a7439c1f9b6328557e186c88be8b9effaae6316b25ddc82f5b4f7e66d98bc2f4"},"schema_version":"1.0","source":{"id":"1810.04859","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04859","created_at":"2026-05-18T00:03:31Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04859v1","created_at":"2026-05-18T00:03:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04859","created_at":"2026-05-18T00:03:31Z"},{"alias_kind":"pith_short_12","alias_value":"BIUJAW7F5YZC","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BIUJAW7F5YZCLFA7","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BIUJAW7F","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:d76d84df9b83366eb1189057095acfc76a4c45ea37650b8229c807c791f43da5","target":"graph","created_at":"2026-05-18T00:03:31Z","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":"Information theory has been very successful in obtaining performance limits for various problems such as communication, compression and hypothesis testing. Likewise, stochastic control theory provides a characterization of optimal policies for Partially Observable Markov Decision Processes (POMDPs) using dynamic programming. However, finding optimal policies for these problems is computationally hard in general and thus, heuristic solutions are employed in practice. Deep learning can be used as a tool for designing better heuristics in such problems. In this paper, the problem of active sequen","authors_text":"Dhruva Kartik, Ekraam Sabir, Prem Natarajan, Urbashi Mitra","cross_cats":["cs.AI","cs.LG","cs.SY","math.IT","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-11T06:15:05Z","title":"Policy Design for Active Sequential Hypothesis Testing using Deep Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04859","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:5295c799f84ca1e070769c58e6d3cd191e0985de0adced4b14feb6b8f1f0f6aa","target":"record","created_at":"2026-05-18T00:03:31Z","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":"6123cdb7b97ec99a9d91c3944afd47442b0e6ce1545350f48e52ab087429dda7","cross_cats_sorted":["cs.AI","cs.LG","cs.SY","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-11T06:15:05Z","title_canon_sha256":"a7439c1f9b6328557e186c88be8b9effaae6316b25ddc82f5b4f7e66d98bc2f4"},"schema_version":"1.0","source":{"id":"1810.04859","kind":"arxiv","version":1}},"canonical_sha256":"0a28905be5ee3225941f20fb7288afa262dc45516a76e7eaa335adcbb3a1cbe5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a28905be5ee3225941f20fb7288afa262dc45516a76e7eaa335adcbb3a1cbe5","first_computed_at":"2026-05-18T00:03:31.443998Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:31.443998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/Xhw3pBcmpDE5z9VsVDLNWf16Ji+WynbqQ9CDK8gyeqh1RgBoFvkfFnFAdUdApUo3GQUd6kfXzEz1eQV0zY+Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:31.444678Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.04859","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5295c799f84ca1e070769c58e6d3cd191e0985de0adced4b14feb6b8f1f0f6aa","sha256:d76d84df9b83366eb1189057095acfc76a4c45ea37650b8229c807c791f43da5"],"state_sha256":"c9af73bf99b35d61c32ee29aca4236f7fdd7e7b916d4ca2991cd1392af6836fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fUtb6XimJHL4c0bmoHEbknBKMEv+1qOvdaPhFvPQijzG09UguiY4QbkzzlgAWpFAX3+bYXakvYvRkxvegDlTDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T09:51:40.185831Z","bundle_sha256":"09b7d1d74a875b203ea24e95772e730e1dde8ba301a728baa1d4c276e3035cce"}}