{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ITUAO4VCTPRVCE5QXJ6BVB7GRE","short_pith_number":"pith:ITUAO4VC","canonical_record":{"source":{"id":"1309.5396","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-20T21:16:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d2e633ebeab9242b663cb930e1558c3a9c7153e95d8dc83be9a46d796cfbb434","abstract_canon_sha256":"ee92666be3a95d875831110a1b368e9b21819d00976a55e633cecbfc0774a2ab"},"schema_version":"1.0"},"canonical_sha256":"44e80772a29be35113b0ba7c1a87e689264e17b90b0994672e86c17bed465a83","source":{"kind":"arxiv","id":"1309.5396","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5396","created_at":"2026-05-18T02:47:41Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5396v2","created_at":"2026-05-18T02:47:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5396","created_at":"2026-05-18T02:47:41Z"},{"alias_kind":"pith_short_12","alias_value":"ITUAO4VCTPRV","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"ITUAO4VCTPRVCE5Q","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"ITUAO4VC","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ITUAO4VCTPRVCE5QXJ6BVB7GRE","target":"record","payload":{"canonical_record":{"source":{"id":"1309.5396","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-20T21:16:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d2e633ebeab9242b663cb930e1558c3a9c7153e95d8dc83be9a46d796cfbb434","abstract_canon_sha256":"ee92666be3a95d875831110a1b368e9b21819d00976a55e633cecbfc0774a2ab"},"schema_version":"1.0"},"canonical_sha256":"44e80772a29be35113b0ba7c1a87e689264e17b90b0994672e86c17bed465a83","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:41.006801Z","signature_b64":"xLHMMfqRJWhDiG/576sH0reUR8LshcUmiYxb9OYWhTnotEfj6VkyHO/IDm/kqZuXFPHb1duqndVcPZt1UJxTCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44e80772a29be35113b0ba7c1a87e689264e17b90b0994672e86c17bed465a83","last_reissued_at":"2026-05-18T02:47:41.005944Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:41.005944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.5396","source_version":2,"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-18T02:47:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WJl80NAPE3CEGvjZbcI0TJ9E54kUDoqY6Nab/IHjt05hG2OimR5RDB+5hMHQjLbqN48HtlNE+i5yz2JJoXYiAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T06:53:59.145369Z"},"content_sha256":"ad89550827be11f9c5e7e0c27abddc1a0f5839d9ecc8ef52ff6bfd17a70d3db8","schema_version":"1.0","event_id":"sha256:ad89550827be11f9c5e7e0c27abddc1a0f5839d9ecc8ef52ff6bfd17a70d3db8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ITUAO4VCTPRVCE5QXJ6BVB7GRE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bayesian Quickest Change Point Detection with Sampling Right Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Erhan Bayraktar, Jun Geng, Lifeng Lai","submitted_at":"2013-09-20T21:16:21Z","abstract_excerpt":"In this paper, Bayesian quickest change detection problems with sampling right constraints are considered. Specifically, there is a sequence of random variables whose probability density function will change at an unknown time. The goal is to detect this change in a way such that a linear combination of the average detection delay and the false alarm probability is minimized. Two types of sampling right constrains are discussed. The first one is a limited sampling right constraint, in which the observer can take at most $N$ observations from this random sequence. Under this setup, we show that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5396","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"},"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-18T02:47:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2wonVBsvfxraRqm5t0oxOkpn9oOu5y8GxQJyEgJSTbM9IRfFJkuCjTNvQX05TYN29Ywpj8YtI8ai/7Bdb/0DBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T06:53:59.145742Z"},"content_sha256":"32701472e2f266a6e16b6638e3f93cf0707c9d09a0e6b442a0519b6c045cbca1","schema_version":"1.0","event_id":"sha256:32701472e2f266a6e16b6638e3f93cf0707c9d09a0e6b442a0519b6c045cbca1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ITUAO4VCTPRVCE5QXJ6BVB7GRE/bundle.json","state_url":"https://pith.science/pith/ITUAO4VCTPRVCE5QXJ6BVB7GRE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ITUAO4VCTPRVCE5QXJ6BVB7GRE/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-21T06:53:59Z","links":{"resolver":"https://pith.science/pith/ITUAO4VCTPRVCE5QXJ6BVB7GRE","bundle":"https://pith.science/pith/ITUAO4VCTPRVCE5QXJ6BVB7GRE/bundle.json","state":"https://pith.science/pith/ITUAO4VCTPRVCE5QXJ6BVB7GRE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ITUAO4VCTPRVCE5QXJ6BVB7GRE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ITUAO4VCTPRVCE5QXJ6BVB7GRE","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":"ee92666be3a95d875831110a1b368e9b21819d00976a55e633cecbfc0774a2ab","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-20T21:16:21Z","title_canon_sha256":"d2e633ebeab9242b663cb930e1558c3a9c7153e95d8dc83be9a46d796cfbb434"},"schema_version":"1.0","source":{"id":"1309.5396","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5396","created_at":"2026-05-18T02:47:41Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5396v2","created_at":"2026-05-18T02:47:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5396","created_at":"2026-05-18T02:47:41Z"},{"alias_kind":"pith_short_12","alias_value":"ITUAO4VCTPRV","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"ITUAO4VCTPRVCE5Q","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"ITUAO4VC","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:32701472e2f266a6e16b6638e3f93cf0707c9d09a0e6b442a0519b6c045cbca1","target":"graph","created_at":"2026-05-18T02:47:41Z","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, Bayesian quickest change detection problems with sampling right constraints are considered. Specifically, there is a sequence of random variables whose probability density function will change at an unknown time. The goal is to detect this change in a way such that a linear combination of the average detection delay and the false alarm probability is minimized. Two types of sampling right constrains are discussed. The first one is a limited sampling right constraint, in which the observer can take at most $N$ observations from this random sequence. Under this setup, we show that","authors_text":"Erhan Bayraktar, Jun Geng, Lifeng Lai","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-20T21:16:21Z","title":"Bayesian Quickest Change Point Detection with Sampling Right Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5396","kind":"arxiv","version":2},"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:ad89550827be11f9c5e7e0c27abddc1a0f5839d9ecc8ef52ff6bfd17a70d3db8","target":"record","created_at":"2026-05-18T02:47:41Z","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":"ee92666be3a95d875831110a1b368e9b21819d00976a55e633cecbfc0774a2ab","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-20T21:16:21Z","title_canon_sha256":"d2e633ebeab9242b663cb930e1558c3a9c7153e95d8dc83be9a46d796cfbb434"},"schema_version":"1.0","source":{"id":"1309.5396","kind":"arxiv","version":2}},"canonical_sha256":"44e80772a29be35113b0ba7c1a87e689264e17b90b0994672e86c17bed465a83","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44e80772a29be35113b0ba7c1a87e689264e17b90b0994672e86c17bed465a83","first_computed_at":"2026-05-18T02:47:41.005944Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:41.005944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xLHMMfqRJWhDiG/576sH0reUR8LshcUmiYxb9OYWhTnotEfj6VkyHO/IDm/kqZuXFPHb1duqndVcPZt1UJxTCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:41.006801Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.5396","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad89550827be11f9c5e7e0c27abddc1a0f5839d9ecc8ef52ff6bfd17a70d3db8","sha256:32701472e2f266a6e16b6638e3f93cf0707c9d09a0e6b442a0519b6c045cbca1"],"state_sha256":"20c0cbd26261b6ddd8b9c8a0000f0184b049286d41a21242d06ed6081350bd4a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BuPII38wI+5OnRrHEbmIkx++GiN6IzhNReQqsRF0wQef5+xmLW2+nRgpu7O8o5m2PTIw8A3reuynKVrldfcNDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T06:53:59.148051Z","bundle_sha256":"bfde0b55023e36f65e9abfcc2d849803adb4ff31d1e2f17c6eed405b650e2417"}}