{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VXIJREHTGLIDP4G2L76HGUD6CE","short_pith_number":"pith:VXIJREHT","canonical_record":{"source":{"id":"1203.4626","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-20T23:52:42Z","cross_cats_sorted":["math.IT","math.OC","math.ST","stat.TH"],"title_canon_sha256":"4dbd0f2f2bbeeb8208a1db597243ad07827941521c0869b15ff3e0e78cdf9ec1","abstract_canon_sha256":"350fb306cf651630cbb07d4bee4adf3da73924109c713326ddfd617c4248616c"},"schema_version":"1.0"},"canonical_sha256":"add09890f332d037f0da5ffc73507e112444e6e953ad731c7ba0da8a04097c0d","source":{"kind":"arxiv","id":"1203.4626","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.4626","created_at":"2026-05-18T03:04:22Z"},{"alias_kind":"arxiv_version","alias_value":"1203.4626v4","created_at":"2026-05-18T03:04:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.4626","created_at":"2026-05-18T03:04:22Z"},{"alias_kind":"pith_short_12","alias_value":"VXIJREHTGLID","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VXIJREHTGLIDP4G2","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VXIJREHT","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VXIJREHTGLIDP4G2L76HGUD6CE","target":"record","payload":{"canonical_record":{"source":{"id":"1203.4626","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-20T23:52:42Z","cross_cats_sorted":["math.IT","math.OC","math.ST","stat.TH"],"title_canon_sha256":"4dbd0f2f2bbeeb8208a1db597243ad07827941521c0869b15ff3e0e78cdf9ec1","abstract_canon_sha256":"350fb306cf651630cbb07d4bee4adf3da73924109c713326ddfd617c4248616c"},"schema_version":"1.0"},"canonical_sha256":"add09890f332d037f0da5ffc73507e112444e6e953ad731c7ba0da8a04097c0d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:22.734307Z","signature_b64":"RGhDtI+lA+G1hQFKr0Ft9F/Umg4hduV66X53n5GCVK2wUhaVWqjbpargdi2nBk9OQMjbdhg0v5XM2hjtiixxDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"add09890f332d037f0da5ffc73507e112444e6e953ad731c7ba0da8a04097c0d","last_reissued_at":"2026-05-18T03:04:22.733858Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:22.733858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.4626","source_version":4,"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:04:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tKyWAoMCtBeBrWG+fmZ0+j6o1cD7SSc2J4KO4CSkvgoX416FXOENLBeVT7ro+4pzMR4VDtdsHtKfaPwkAy7DAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:05:25.689797Z"},"content_sha256":"3515aae971cf9afb1b44594502ccb304ac1370836a4b9e52fd9086c211e3050d","schema_version":"1.0","event_id":"sha256:3515aae971cf9afb1b44594502ccb304ac1370836a4b9e52fd9086c211e3050d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VXIJREHTGLIDP4G2L76HGUD6CE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Active sequential hypothesis testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Mohammad Naghshvar, Tara Javidi","submitted_at":"2012-03-20T23:52:42Z","abstract_excerpt":"Consider a decision maker who is responsible to dynamically collect observations so as to enhance his information about an underlying phenomena of interest in a speedy manner while accounting for the penalty of wrong declaration. Due to the sequential nature of the problem, the decision maker relies on his current information state to adaptively select the most ``informative'' sensing action among the available ones. In this paper, using results in dynamic programming, lower bounds for the optimal total cost are established. The lower bounds characterize the fundamental limits on the maximum a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.4626","kind":"arxiv","version":4},"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:04:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vaQgvytxBNxRM4mUiBHFqhh8Oe8pUtGuu4/wQHw5oAaix99iJa64j8X1dGVtiALKTMkMX7u21rs9brHZUWTNDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:05:25.690476Z"},"content_sha256":"46cf240b0507603b27bb24ca01b26018e432ae9cb4ec0c38258d6d90de7995b8","schema_version":"1.0","event_id":"sha256:46cf240b0507603b27bb24ca01b26018e432ae9cb4ec0c38258d6d90de7995b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VXIJREHTGLIDP4G2L76HGUD6CE/bundle.json","state_url":"https://pith.science/pith/VXIJREHTGLIDP4G2L76HGUD6CE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VXIJREHTGLIDP4G2L76HGUD6CE/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-07T21:05:25Z","links":{"resolver":"https://pith.science/pith/VXIJREHTGLIDP4G2L76HGUD6CE","bundle":"https://pith.science/pith/VXIJREHTGLIDP4G2L76HGUD6CE/bundle.json","state":"https://pith.science/pith/VXIJREHTGLIDP4G2L76HGUD6CE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VXIJREHTGLIDP4G2L76HGUD6CE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VXIJREHTGLIDP4G2L76HGUD6CE","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":"350fb306cf651630cbb07d4bee4adf3da73924109c713326ddfd617c4248616c","cross_cats_sorted":["math.IT","math.OC","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-20T23:52:42Z","title_canon_sha256":"4dbd0f2f2bbeeb8208a1db597243ad07827941521c0869b15ff3e0e78cdf9ec1"},"schema_version":"1.0","source":{"id":"1203.4626","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.4626","created_at":"2026-05-18T03:04:22Z"},{"alias_kind":"arxiv_version","alias_value":"1203.4626v4","created_at":"2026-05-18T03:04:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.4626","created_at":"2026-05-18T03:04:22Z"},{"alias_kind":"pith_short_12","alias_value":"VXIJREHTGLID","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VXIJREHTGLIDP4G2","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VXIJREHT","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:46cf240b0507603b27bb24ca01b26018e432ae9cb4ec0c38258d6d90de7995b8","target":"graph","created_at":"2026-05-18T03:04:22Z","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":"Consider a decision maker who is responsible to dynamically collect observations so as to enhance his information about an underlying phenomena of interest in a speedy manner while accounting for the penalty of wrong declaration. Due to the sequential nature of the problem, the decision maker relies on his current information state to adaptively select the most ``informative'' sensing action among the available ones. In this paper, using results in dynamic programming, lower bounds for the optimal total cost are established. The lower bounds characterize the fundamental limits on the maximum a","authors_text":"Mohammad Naghshvar, Tara Javidi","cross_cats":["math.IT","math.OC","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-20T23:52:42Z","title":"Active sequential hypothesis testing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.4626","kind":"arxiv","version":4},"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:3515aae971cf9afb1b44594502ccb304ac1370836a4b9e52fd9086c211e3050d","target":"record","created_at":"2026-05-18T03:04:22Z","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":"350fb306cf651630cbb07d4bee4adf3da73924109c713326ddfd617c4248616c","cross_cats_sorted":["math.IT","math.OC","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-20T23:52:42Z","title_canon_sha256":"4dbd0f2f2bbeeb8208a1db597243ad07827941521c0869b15ff3e0e78cdf9ec1"},"schema_version":"1.0","source":{"id":"1203.4626","kind":"arxiv","version":4}},"canonical_sha256":"add09890f332d037f0da5ffc73507e112444e6e953ad731c7ba0da8a04097c0d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"add09890f332d037f0da5ffc73507e112444e6e953ad731c7ba0da8a04097c0d","first_computed_at":"2026-05-18T03:04:22.733858Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:22.733858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RGhDtI+lA+G1hQFKr0Ft9F/Umg4hduV66X53n5GCVK2wUhaVWqjbpargdi2nBk9OQMjbdhg0v5XM2hjtiixxDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:22.734307Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.4626","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3515aae971cf9afb1b44594502ccb304ac1370836a4b9e52fd9086c211e3050d","sha256:46cf240b0507603b27bb24ca01b26018e432ae9cb4ec0c38258d6d90de7995b8"],"state_sha256":"ef6720edc0e7c86675750d91bb5fc8fa618abf47a5951a262577ae03c4e8f675"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L6NjZJKpMpe4EAYeBUc94WPaSB/kWnj4nfe0TCdAm8JJtusD2/yMOL2tTlgccfXkP6wz9qaR8zwNZPo1/DvJBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T21:05:25.694296Z","bundle_sha256":"86ca4cb3a7ee7488b178fd30711812aa32b5d69b77925ad3a8a690e3d36852ac"}}