{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:PNJN44DFYDOKMMPGXGGD53XUSL","short_pith_number":"pith:PNJN44DF","schema_version":"1.0","canonical_sha256":"7b52de7065c0dca631e6b98c3eeef492f88af39a5703d8abe5ef91ef3bbecffa","source":{"kind":"arxiv","id":"2501.10974","version":3},"attestation_state":"computed","paper":{"title":"Sequential Change Detection for Learning in Piecewise Stationary Bandit Environments","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY","math.IT","stat.OT"],"primary_cat":"cs.IT","authors_text":"Venugopal V. Veeravalli, Yu-Han Huang","submitted_at":"2025-01-19T07:27:24Z","abstract_excerpt":"A finite-horizon variant of the quickest change detection problem is investigated, which is motivated by a change detection problem that arises in piecewise stationary bandits. The goal is to minimize the \\emph{latency}, which is smallest threshold such that the probability that the detection delay exceeds the threshold is below a desired low level, while controlling the false alarm probability to a desired low level. When the pre- and post-change distributions are unknown, two tests are proposed as candidate solutions. These tests are shown to attain order optimality in terms of the horizon. "},"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":"2501.10974","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-01-19T07:27:24Z","cross_cats_sorted":["cs.SY","eess.SY","math.IT","stat.OT"],"title_canon_sha256":"f6a510edf6dd236810b64358cdddf97e8c825200ea6bd930a4df298c51b4b0d6","abstract_canon_sha256":"30e20de2258bc179bc3d74c074a9e78ce2979c4300774c5e0a12e0f336c9cebf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:23:22.428890Z","signature_b64":"dJSGK30VWjSVTPDn/+QQErP5BMFSUHRvn70WPNwvcPUXbwaA3OwJ6DTcaVwXu9h4jiWjooFedBKQB+v8JVAMDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b52de7065c0dca631e6b98c3eeef492f88af39a5703d8abe5ef91ef3bbecffa","last_reissued_at":"2026-07-05T11:23:22.428360Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:23:22.428360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sequential Change Detection for Learning in Piecewise Stationary Bandit Environments","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY","math.IT","stat.OT"],"primary_cat":"cs.IT","authors_text":"Venugopal V. Veeravalli, Yu-Han Huang","submitted_at":"2025-01-19T07:27:24Z","abstract_excerpt":"A finite-horizon variant of the quickest change detection problem is investigated, which is motivated by a change detection problem that arises in piecewise stationary bandits. The goal is to minimize the \\emph{latency}, which is smallest threshold such that the probability that the detection delay exceeds the threshold is below a desired low level, while controlling the false alarm probability to a desired low level. When the pre- and post-change distributions are unknown, two tests are proposed as candidate solutions. These tests are shown to attain order optimality in terms of the horizon. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.10974","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.10974/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2501.10974","created_at":"2026-07-05T11:23:22.428420+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.10974v3","created_at":"2026-07-05T11:23:22.428420+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.10974","created_at":"2026-07-05T11:23:22.428420+00:00"},{"alias_kind":"pith_short_12","alias_value":"PNJN44DFYDOK","created_at":"2026-07-05T11:23:22.428420+00:00"},{"alias_kind":"pith_short_16","alias_value":"PNJN44DFYDOKMMPG","created_at":"2026-07-05T11:23:22.428420+00:00"},{"alias_kind":"pith_short_8","alias_value":"PNJN44DF","created_at":"2026-07-05T11:23:22.428420+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/PNJN44DFYDOKMMPGXGGD53XUSL","json":"https://pith.science/pith/PNJN44DFYDOKMMPGXGGD53XUSL.json","graph_json":"https://pith.science/api/pith-number/PNJN44DFYDOKMMPGXGGD53XUSL/graph.json","events_json":"https://pith.science/api/pith-number/PNJN44DFYDOKMMPGXGGD53XUSL/events.json","paper":"https://pith.science/paper/PNJN44DF"},"agent_actions":{"view_html":"https://pith.science/pith/PNJN44DFYDOKMMPGXGGD53XUSL","download_json":"https://pith.science/pith/PNJN44DFYDOKMMPGXGGD53XUSL.json","view_paper":"https://pith.science/paper/PNJN44DF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.10974&json=true","fetch_graph":"https://pith.science/api/pith-number/PNJN44DFYDOKMMPGXGGD53XUSL/graph.json","fetch_events":"https://pith.science/api/pith-number/PNJN44DFYDOKMMPGXGGD53XUSL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PNJN44DFYDOKMMPGXGGD53XUSL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PNJN44DFYDOKMMPGXGGD53XUSL/action/storage_attestation","attest_author":"https://pith.science/pith/PNJN44DFYDOKMMPGXGGD53XUSL/action/author_attestation","sign_citation":"https://pith.science/pith/PNJN44DFYDOKMMPGXGGD53XUSL/action/citation_signature","submit_replication":"https://pith.science/pith/PNJN44DFYDOKMMPGXGGD53XUSL/action/replication_record"}},"created_at":"2026-07-05T11:23:22.428420+00:00","updated_at":"2026-07-05T11:23:22.428420+00:00"}