{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:DYKTZKBMIEJGTD3TVOMVSGMV4N","short_pith_number":"pith:DYKTZKBM","canonical_record":{"source":{"id":"1211.3729","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-11-15T20:42:21Z","cross_cats_sorted":["cs.IT","math.IT","math.OC","math.PR","stat.TH"],"title_canon_sha256":"e3e3cce81f6621177af9b8e0543ba90538b5408a23838a1164f096bff6f5152d","abstract_canon_sha256":"ac960298dde457357646446d0b394e261cf7d9c1416494f710128befee5902f9"},"schema_version":"1.0"},"canonical_sha256":"1e153ca82c4112698f73ab99591995e37b275d519b305dace8b78e25ff783a92","source":{"kind":"arxiv","id":"1211.3729","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.3729","created_at":"2026-05-18T03:40:38Z"},{"alias_kind":"arxiv_version","alias_value":"1211.3729v1","created_at":"2026-05-18T03:40:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3729","created_at":"2026-05-18T03:40:38Z"},{"alias_kind":"pith_short_12","alias_value":"DYKTZKBMIEJG","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"DYKTZKBMIEJGTD3T","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"DYKTZKBM","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:DYKTZKBMIEJGTD3TVOMVSGMV4N","target":"record","payload":{"canonical_record":{"source":{"id":"1211.3729","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-11-15T20:42:21Z","cross_cats_sorted":["cs.IT","math.IT","math.OC","math.PR","stat.TH"],"title_canon_sha256":"e3e3cce81f6621177af9b8e0543ba90538b5408a23838a1164f096bff6f5152d","abstract_canon_sha256":"ac960298dde457357646446d0b394e261cf7d9c1416494f710128befee5902f9"},"schema_version":"1.0"},"canonical_sha256":"1e153ca82c4112698f73ab99591995e37b275d519b305dace8b78e25ff783a92","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:38.111491Z","signature_b64":"VJMW4Y6dbDi1xurjCJOyy8hgtRRhbT2gob/9CV51xZNVD2ffaokpUf0ZOxSyAgY8quZYhdbRatPjupfReu7SAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e153ca82c4112698f73ab99591995e37b275d519b305dace8b78e25ff783a92","last_reissued_at":"2026-05-18T03:40:38.110763Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:38.110763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.3729","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-18T03:40:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4mAI/l4Kx/qzuyAQBlJLKluBrxx/L84yq/asZC8QUrIx+ffyLtc84wibAOuGN1VGXGc4heJWOY0C53jt3KxbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:27:30.560231Z"},"content_sha256":"261d7df54b61d9b89b71ce885ab779ec709733fc15fd27c459a967d2bb96ba62","schema_version":"1.0","event_id":"sha256:261d7df54b61d9b89b71ce885ab779ec709733fc15fd27c459a967d2bb96ba62"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:DYKTZKBMIEJGTD3TVOMVSGMV4N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Data-Efficient Quickest Change Detection in Minimax Settings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC","math.PR","stat.TH"],"primary_cat":"math.ST","authors_text":"Taposh Banerjee, Venugopal V. Veeravalli","submitted_at":"2012-11-15T20:42:21Z","abstract_excerpt":"The classical problem of quickest change detection is studied with an additional constraint on the cost of observations used in the detection process. The change point is modeled as an unknown constant, and minimax formulations are proposed for the problem. The objective in these formulations is to find a stopping time and an on-off observation control policy for the observation sequence, to minimize a version of the worst possible average delay, subject to constraints on the false alarm rate and the fraction of time observations are taken before change. An algorithm called DE-CuSum is propose"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3729","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-18T03:40:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8GKmdQ2zOvH96CRRHTO0Aeiadtt2NWQhwo99rpuA/PHUXA8ZKtp8+ZO1dcwbM4EPUZE/pmKQNySnjpNg9+DUBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:27:30.560945Z"},"content_sha256":"1e79695480d3aebbaabc8a3d4ff8ef8642e0fe10b3070d1254a25d73766c9ece","schema_version":"1.0","event_id":"sha256:1e79695480d3aebbaabc8a3d4ff8ef8642e0fe10b3070d1254a25d73766c9ece"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DYKTZKBMIEJGTD3TVOMVSGMV4N/bundle.json","state_url":"https://pith.science/pith/DYKTZKBMIEJGTD3TVOMVSGMV4N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DYKTZKBMIEJGTD3TVOMVSGMV4N/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-04T22:27:30Z","links":{"resolver":"https://pith.science/pith/DYKTZKBMIEJGTD3TVOMVSGMV4N","bundle":"https://pith.science/pith/DYKTZKBMIEJGTD3TVOMVSGMV4N/bundle.json","state":"https://pith.science/pith/DYKTZKBMIEJGTD3TVOMVSGMV4N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DYKTZKBMIEJGTD3TVOMVSGMV4N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:DYKTZKBMIEJGTD3TVOMVSGMV4N","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":"ac960298dde457357646446d0b394e261cf7d9c1416494f710128befee5902f9","cross_cats_sorted":["cs.IT","math.IT","math.OC","math.PR","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-11-15T20:42:21Z","title_canon_sha256":"e3e3cce81f6621177af9b8e0543ba90538b5408a23838a1164f096bff6f5152d"},"schema_version":"1.0","source":{"id":"1211.3729","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.3729","created_at":"2026-05-18T03:40:38Z"},{"alias_kind":"arxiv_version","alias_value":"1211.3729v1","created_at":"2026-05-18T03:40:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3729","created_at":"2026-05-18T03:40:38Z"},{"alias_kind":"pith_short_12","alias_value":"DYKTZKBMIEJG","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"DYKTZKBMIEJGTD3T","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"DYKTZKBM","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:1e79695480d3aebbaabc8a3d4ff8ef8642e0fe10b3070d1254a25d73766c9ece","target":"graph","created_at":"2026-05-18T03:40:38Z","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":"The classical problem of quickest change detection is studied with an additional constraint on the cost of observations used in the detection process. The change point is modeled as an unknown constant, and minimax formulations are proposed for the problem. The objective in these formulations is to find a stopping time and an on-off observation control policy for the observation sequence, to minimize a version of the worst possible average delay, subject to constraints on the false alarm rate and the fraction of time observations are taken before change. An algorithm called DE-CuSum is propose","authors_text":"Taposh Banerjee, Venugopal V. Veeravalli","cross_cats":["cs.IT","math.IT","math.OC","math.PR","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-11-15T20:42:21Z","title":"Data-Efficient Quickest Change Detection in Minimax Settings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3729","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:261d7df54b61d9b89b71ce885ab779ec709733fc15fd27c459a967d2bb96ba62","target":"record","created_at":"2026-05-18T03:40:38Z","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":"ac960298dde457357646446d0b394e261cf7d9c1416494f710128befee5902f9","cross_cats_sorted":["cs.IT","math.IT","math.OC","math.PR","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-11-15T20:42:21Z","title_canon_sha256":"e3e3cce81f6621177af9b8e0543ba90538b5408a23838a1164f096bff6f5152d"},"schema_version":"1.0","source":{"id":"1211.3729","kind":"arxiv","version":1}},"canonical_sha256":"1e153ca82c4112698f73ab99591995e37b275d519b305dace8b78e25ff783a92","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1e153ca82c4112698f73ab99591995e37b275d519b305dace8b78e25ff783a92","first_computed_at":"2026-05-18T03:40:38.110763Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:40:38.110763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VJMW4Y6dbDi1xurjCJOyy8hgtRRhbT2gob/9CV51xZNVD2ffaokpUf0ZOxSyAgY8quZYhdbRatPjupfReu7SAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:40:38.111491Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.3729","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:261d7df54b61d9b89b71ce885ab779ec709733fc15fd27c459a967d2bb96ba62","sha256:1e79695480d3aebbaabc8a3d4ff8ef8642e0fe10b3070d1254a25d73766c9ece"],"state_sha256":"36c4cade8fd8cb8dbe1b7f6a8fd28f151961df0794025b8c24ec98af5b3f4683"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3rkc4DZM3qrPiodzaTUI9UK7bgotPNG5JrrOagePrjsokLeMj1vWyyP2oTsHMZbgTC81q4M9cZFB/uqOht9QCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T22:27:30.564473Z","bundle_sha256":"abb8872698c4d3d07103b0429aa9e852f1108ad2e2bfb3c14fb621c7d4948c8c"}}