{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ITUAO4VCTPRVCE5QXJ6BVB7GRE","short_pith_number":"pith:ITUAO4VC","schema_version":"1.0","canonical_sha256":"44e80772a29be35113b0ba7c1a87e689264e17b90b0994672e86c17bed465a83","source":{"kind":"arxiv","id":"1309.5396","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1309.5396","created_at":"2026-05-18T02:47:41.006082+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.5396v2","created_at":"2026-05-18T02:47:41.006082+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5396","created_at":"2026-05-18T02:47:41.006082+00:00"},{"alias_kind":"pith_short_12","alias_value":"ITUAO4VCTPRV","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"ITUAO4VCTPRVCE5Q","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"ITUAO4VC","created_at":"2026-05-18T12:27:49.015174+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/ITUAO4VCTPRVCE5QXJ6BVB7GRE","json":"https://pith.science/pith/ITUAO4VCTPRVCE5QXJ6BVB7GRE.json","graph_json":"https://pith.science/api/pith-number/ITUAO4VCTPRVCE5QXJ6BVB7GRE/graph.json","events_json":"https://pith.science/api/pith-number/ITUAO4VCTPRVCE5QXJ6BVB7GRE/events.json","paper":"https://pith.science/paper/ITUAO4VC"},"agent_actions":{"view_html":"https://pith.science/pith/ITUAO4VCTPRVCE5QXJ6BVB7GRE","download_json":"https://pith.science/pith/ITUAO4VCTPRVCE5QXJ6BVB7GRE.json","view_paper":"https://pith.science/paper/ITUAO4VC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.5396&json=true","fetch_graph":"https://pith.science/api/pith-number/ITUAO4VCTPRVCE5QXJ6BVB7GRE/graph.json","fetch_events":"https://pith.science/api/pith-number/ITUAO4VCTPRVCE5QXJ6BVB7GRE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ITUAO4VCTPRVCE5QXJ6BVB7GRE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ITUAO4VCTPRVCE5QXJ6BVB7GRE/action/storage_attestation","attest_author":"https://pith.science/pith/ITUAO4VCTPRVCE5QXJ6BVB7GRE/action/author_attestation","sign_citation":"https://pith.science/pith/ITUAO4VCTPRVCE5QXJ6BVB7GRE/action/citation_signature","submit_replication":"https://pith.science/pith/ITUAO4VCTPRVCE5QXJ6BVB7GRE/action/replication_record"}},"created_at":"2026-05-18T02:47:41.006082+00:00","updated_at":"2026-05-18T02:47:41.006082+00:00"}