{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GOGR4XTRON5QMLJT5QF4672SRY","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":"03b2efe4d06f3db9ba6b605f9705c38e299e43e62bd065eed055af1cd0216724","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-05-13T09:35:19Z","title_canon_sha256":"1f6fddd5539c38240085eb11b30d33bd4ca86c4a81b524e50f048a2611ace688"},"schema_version":"1.0","source":{"id":"2605.13252","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13252","created_at":"2026-05-18T02:44:49Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13252v1","created_at":"2026-05-18T02:44:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13252","created_at":"2026-05-18T02:44:49Z"},{"alias_kind":"pith_short_12","alias_value":"GOGR4XTRON5Q","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"GOGR4XTRON5QMLJT","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"GOGR4XTR","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:2b3dd1e06c47d3f01d3976cc782cd458d0e623e6c0192317be9f4f429f53cffd","target":"graph","created_at":"2026-05-18T02:44:49Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We demonstrate, both empirically and theoretically, that for general δ and η, the complexity is jointly governed by the jumps and the relative positions of the change points."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The number of change points is known in advance and the underlying function is exactly piecewise constant with jumps of unknown but fixed magnitudes; if the number is unknown or the function has smooth transitions instead of sharp jumps, the detection and refinement phases may fail to achieve the stated precision."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"An adaptive bandit algorithm for multiple change-point localization achieves non-asymptotic sample bounds jointly controlled by jump magnitudes and change-point spacing for any fixed δ and η."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Sample complexity for locating multiple change points under bandit feedback is governed jointly by jump sizes and their relative positions."}],"snapshot_sha256":"f040c4a91066f728ce927b0c256fda7fd2c539b7b941a07498ca0bc24fb60ebe"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"ef9575b1c42969d1947202da7914291feb1a3a56af72c3a78b7eb6455e1d75f5"},"paper":{"abstract_excerpt":"We study multiple change point localization under bandit feedback. An unknown piecewise-constant function on a compact interval can be queried sequentially at adaptively chosen inputs, and each query returns a noisy evaluation of the function. The goal is to identify a prescribed number of discontinuities, known as change points, within a target precision $\\eta$ and confidence level $1-\\delta$, while using as few samples as possible. We propose an adaptive algorithm that first detects intervals likely to contain change points and then refines their locations to precision $\\eta$. We establish n","authors_text":"Maximilian Graf, Victor Thuot","cross_cats":["cs.LG","math.ST","stat.TH"],"headline":"Sample complexity for locating multiple change points under bandit feedback is governed jointly by jump sizes and their relative positions.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-05-13T09:35:19Z","title":"The Sample Complexity of Multiple Change Point Identification under Bandit Feedback"},"references":{"count":45,"internal_anchors":0,"resolved_work":45,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Adaptive sensing performance lower bounds for sparse signal detection and support estimation , author=. Bernoulli , volume=. 2014 , publisher=","work_id":"0a407f93-91c5-434a-b1a5-876f7cc7ad41","year":2014},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"The 28th International Conference on Artificial Intelligence and Statistics , year=","work_id":"8ac2bab9-4e49-430e-8d6d-36cd08f5b276","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Proceedings of the 42nd International Conference on Machine Learning , pages =","work_id":"c19854bc-64d3-4c14-a768-a6933ed9794f","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Conference on Learning Theory , pages=","work_id":"1bb1909a-9054-4311-873c-f4a3a3fc0873","year":2016},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Safety Aware Changepoint Detection for Piecewise i.i.d. Bandits , author=. The 38th Conference on Uncertainty in Artificial Intelligence , year=","work_id":"39ec369c-879c-48ff-ad98-ad8dd170a640","year":null}],"snapshot_sha256":"80b8617f22001bedb7082ed737331d5c71acb93de8761974fc7526cebd756981"},"source":{"id":"2605.13252","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T17:44:18.218992Z","id":"8a5a5687-0378-405d-9870-55fa974f2aae","model_set":{"reader":"grok-4.3"},"one_line_summary":"An adaptive bandit algorithm for multiple change-point localization achieves non-asymptotic sample bounds jointly controlled by jump magnitudes and change-point spacing for any fixed δ and η.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Sample complexity for locating multiple change points under bandit feedback is governed jointly by jump sizes and their relative positions.","strongest_claim":"We demonstrate, both empirically and theoretically, that for general δ and η, the complexity is jointly governed by the jumps and the relative positions of the change points.","weakest_assumption":"The number of change points is known in advance and the underlying function is exactly piecewise constant with jumps of unknown but fixed magnitudes; if the number is unknown or the function has smooth transitions instead of sharp jumps, the detection and refinement phases may fail to achieve the stated precision."}},"verdict_id":"8a5a5687-0378-405d-9870-55fa974f2aae"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:767b700ee05a1554f671bf59bc2970f179fa6fa361892cb349497f276dc84d31","target":"record","created_at":"2026-05-18T02:44:49Z","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":"03b2efe4d06f3db9ba6b605f9705c38e299e43e62bd065eed055af1cd0216724","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-05-13T09:35:19Z","title_canon_sha256":"1f6fddd5539c38240085eb11b30d33bd4ca86c4a81b524e50f048a2611ace688"},"schema_version":"1.0","source":{"id":"2605.13252","kind":"arxiv","version":1}},"canonical_sha256":"338d1e5e71737b062d33ec0bcf7f528e3d454ffa526f315512032f918433a883","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"338d1e5e71737b062d33ec0bcf7f528e3d454ffa526f315512032f918433a883","first_computed_at":"2026-05-18T02:44:49.419270Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:49.419270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1XyCceipMqFUOueG61C6JcfZa9Ep1y6CvWdlCtdd3YyD4fhsVdeFIL2dzzcuMyQeMIpg8gQDG5S4TztpCSVwAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:49.419689Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13252","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:767b700ee05a1554f671bf59bc2970f179fa6fa361892cb349497f276dc84d31","sha256:2b3dd1e06c47d3f01d3976cc782cd458d0e623e6c0192317be9f4f429f53cffd"],"state_sha256":"fb73fa43e47b63d7027e7739904e3a35f221a2204adfc4885cc7f32ef59a23c2"}