{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:HCIG4VUPMEFP7XPUBWEGHTRPQT","short_pith_number":"pith:HCIG4VUP","canonical_record":{"source":{"id":"1201.1662","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-01-08T22:23:40Z","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"title_canon_sha256":"1371de18c6af58c6c4d7d65624243d2d88f4f02e7c32f7ae0ba9a89df18cfb7c","abstract_canon_sha256":"054b3d4bc4b7a67cdaf7c266a765c59f9823831f410348b096cd83142cef78a0"},"schema_version":"1.0"},"canonical_sha256":"38906e568f610affddf40d8863ce2f84e0623ccc7f2e382edbbaf9cef3ca7f1a","source":{"kind":"arxiv","id":"1201.1662","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.1662","created_at":"2026-05-18T03:20:06Z"},{"alias_kind":"arxiv_version","alias_value":"1201.1662v4","created_at":"2026-05-18T03:20:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.1662","created_at":"2026-05-18T03:20:06Z"},{"alias_kind":"pith_short_12","alias_value":"HCIG4VUPMEFP","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HCIG4VUPMEFP7XPU","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HCIG4VUP","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:HCIG4VUPMEFP7XPUBWEGHTRPQT","target":"record","payload":{"canonical_record":{"source":{"id":"1201.1662","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-01-08T22:23:40Z","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"title_canon_sha256":"1371de18c6af58c6c4d7d65624243d2d88f4f02e7c32f7ae0ba9a89df18cfb7c","abstract_canon_sha256":"054b3d4bc4b7a67cdaf7c266a765c59f9823831f410348b096cd83142cef78a0"},"schema_version":"1.0"},"canonical_sha256":"38906e568f610affddf40d8863ce2f84e0623ccc7f2e382edbbaf9cef3ca7f1a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:06.729215Z","signature_b64":"r87DT2uUvqUT4VVlhMk9M9tcVZs/j+kep+YlV2wNkzPz/QHSeKJGqIcVf6QFMEE75Hzb8RFfHStlrMYMFIn4Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38906e568f610affddf40d8863ce2f84e0623ccc7f2e382edbbaf9cef3ca7f1a","last_reissued_at":"2026-05-18T03:20:06.728742Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:06.728742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.1662","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:20:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Ans23QpeoOUbRg2RPJeH1VQ63BM3ZugsNDv8DDpcv8uNEgak+fVJWfehgD+sWiqbYFB25EZWiklNP7f9aKGCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T16:46:58.950572Z"},"content_sha256":"51f931d7abfc4e8133e6baab4881eebf644d3f01b45b831635f6a82b03977479","schema_version":"1.0","event_id":"sha256:51f931d7abfc4e8133e6baab4881eebf644d3f01b45b831635f6a82b03977479"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:HCIG4VUPMEFP7XPUBWEGHTRPQT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quickest Search over Brownian Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC"],"primary_cat":"math.PR","authors_text":"Erhan Bayraktar, Ross Kravitz","submitted_at":"2012-01-08T22:23:40Z","abstract_excerpt":"In this paper we resolve an open problem proposed by Lai, Poor, Xin, and Georgiadis (2011, IEEE Transactions on Information Theory). Consider a sequence of Brownian Motions with unknown drift equal to one or zero, which we may be observed one at a time. We give a procedure for finding, as quickly as possible, a process which is a Brownian Motion with nonzero drift. This original quickest search problem, in which the filtration itself is dependent on the observation strategy, is reduced to a single filtration impulse control and optimal stopping problem, which is in turn reduced to an optimal s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.1662","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:20:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xn8VfkHEE6jmTgTp75N66kyNuVBs46R3YobEBVokzG/67EBSPuyGJayMFp8fqbM05ZDeo7O7sRTIKfxoH+JcCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T16:46:58.950935Z"},"content_sha256":"86a4afb87b47cccd766f84648d88ecc0a86650e602daa66d3d33edcce255b5d7","schema_version":"1.0","event_id":"sha256:86a4afb87b47cccd766f84648d88ecc0a86650e602daa66d3d33edcce255b5d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HCIG4VUPMEFP7XPUBWEGHTRPQT/bundle.json","state_url":"https://pith.science/pith/HCIG4VUPMEFP7XPUBWEGHTRPQT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HCIG4VUPMEFP7XPUBWEGHTRPQT/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-05-20T16:46:58Z","links":{"resolver":"https://pith.science/pith/HCIG4VUPMEFP7XPUBWEGHTRPQT","bundle":"https://pith.science/pith/HCIG4VUPMEFP7XPUBWEGHTRPQT/bundle.json","state":"https://pith.science/pith/HCIG4VUPMEFP7XPUBWEGHTRPQT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HCIG4VUPMEFP7XPUBWEGHTRPQT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:HCIG4VUPMEFP7XPUBWEGHTRPQT","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":"054b3d4bc4b7a67cdaf7c266a765c59f9823831f410348b096cd83142cef78a0","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-01-08T22:23:40Z","title_canon_sha256":"1371de18c6af58c6c4d7d65624243d2d88f4f02e7c32f7ae0ba9a89df18cfb7c"},"schema_version":"1.0","source":{"id":"1201.1662","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.1662","created_at":"2026-05-18T03:20:06Z"},{"alias_kind":"arxiv_version","alias_value":"1201.1662v4","created_at":"2026-05-18T03:20:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.1662","created_at":"2026-05-18T03:20:06Z"},{"alias_kind":"pith_short_12","alias_value":"HCIG4VUPMEFP","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HCIG4VUPMEFP7XPU","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HCIG4VUP","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:86a4afb87b47cccd766f84648d88ecc0a86650e602daa66d3d33edcce255b5d7","target":"graph","created_at":"2026-05-18T03:20:06Z","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":"In this paper we resolve an open problem proposed by Lai, Poor, Xin, and Georgiadis (2011, IEEE Transactions on Information Theory). Consider a sequence of Brownian Motions with unknown drift equal to one or zero, which we may be observed one at a time. We give a procedure for finding, as quickly as possible, a process which is a Brownian Motion with nonzero drift. This original quickest search problem, in which the filtration itself is dependent on the observation strategy, is reduced to a single filtration impulse control and optimal stopping problem, which is in turn reduced to an optimal s","authors_text":"Erhan Bayraktar, Ross Kravitz","cross_cats":["cs.IT","math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-01-08T22:23:40Z","title":"Quickest Search over Brownian Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.1662","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:51f931d7abfc4e8133e6baab4881eebf644d3f01b45b831635f6a82b03977479","target":"record","created_at":"2026-05-18T03:20:06Z","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":"054b3d4bc4b7a67cdaf7c266a765c59f9823831f410348b096cd83142cef78a0","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-01-08T22:23:40Z","title_canon_sha256":"1371de18c6af58c6c4d7d65624243d2d88f4f02e7c32f7ae0ba9a89df18cfb7c"},"schema_version":"1.0","source":{"id":"1201.1662","kind":"arxiv","version":4}},"canonical_sha256":"38906e568f610affddf40d8863ce2f84e0623ccc7f2e382edbbaf9cef3ca7f1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"38906e568f610affddf40d8863ce2f84e0623ccc7f2e382edbbaf9cef3ca7f1a","first_computed_at":"2026-05-18T03:20:06.728742Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:20:06.728742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r87DT2uUvqUT4VVlhMk9M9tcVZs/j+kep+YlV2wNkzPz/QHSeKJGqIcVf6QFMEE75Hzb8RFfHStlrMYMFIn4Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:20:06.729215Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.1662","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51f931d7abfc4e8133e6baab4881eebf644d3f01b45b831635f6a82b03977479","sha256:86a4afb87b47cccd766f84648d88ecc0a86650e602daa66d3d33edcce255b5d7"],"state_sha256":"db43106897e575eed1c9b62961957969b1913dbed08ea98e2e0b493712c0e759"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j1BI2mZMsoyu8ldzJqSXZGYbJXP0MihBZS0sHM6h5s7Kwp5lkwTYILiXsNkJ0ar7NA39/7RmxWd3EE/tpRaVBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T16:46:58.953138Z","bundle_sha256":"cef325151cc6798cdb52bb17add895a7a6502de0144825a2b342e02e5b62f395"}}