{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:AHIAYRBY3YWSQLWJI3RANGCQLE","short_pith_number":"pith:AHIAYRBY","canonical_record":{"source":{"id":"1611.08639","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-11-25T23:47:30Z","cross_cats_sorted":[],"title_canon_sha256":"e54a75bdac2c6b479c04795b400b9c6664e639807ec90c9ce04074da97c3d616","abstract_canon_sha256":"1512772890ba8f416be621332e70fd982346a3850edf852cf98200b807db6c6d"},"schema_version":"1.0"},"canonical_sha256":"01d00c4438de2d282ec946e20698505905be0adf77f0131816ee132673fa62b2","source":{"kind":"arxiv","id":"1611.08639","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.08639","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"arxiv_version","alias_value":"1611.08639v1","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08639","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"pith_short_12","alias_value":"AHIAYRBY3YWS","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AHIAYRBY3YWSQLWJ","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AHIAYRBY","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:AHIAYRBY3YWSQLWJI3RANGCQLE","target":"record","payload":{"canonical_record":{"source":{"id":"1611.08639","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-11-25T23:47:30Z","cross_cats_sorted":[],"title_canon_sha256":"e54a75bdac2c6b479c04795b400b9c6664e639807ec90c9ce04074da97c3d616","abstract_canon_sha256":"1512772890ba8f416be621332e70fd982346a3850edf852cf98200b807db6c6d"},"schema_version":"1.0"},"canonical_sha256":"01d00c4438de2d282ec946e20698505905be0adf77f0131816ee132673fa62b2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:37.287138Z","signature_b64":"cfQXHPNjOXjHCp0qwTZv7lAs34UFg2weWEGbSu5luqAI0qicpSeHXKuLwqWbgcbtQ9zDL+ohO8EbGofjOOi1Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01d00c4438de2d282ec946e20698505905be0adf77f0131816ee132673fa62b2","last_reissued_at":"2026-05-18T00:56:37.286458Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:37.286458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.08639","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-18T00:56:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"idbaikkKIgHXqcAUS8eKY24lK3gRg1lc2Mc47GfmsBT2KD18LH9rsgOyLOHC2diilhsBWmzkljjnZxIvBMWIAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T02:17:46.868511Z"},"content_sha256":"ccc4e34b564fb157e51000c47e0f40fda24b614f712edc4a9ceb586c8fb4f232","schema_version":"1.0","event_id":"sha256:ccc4e34b564fb157e51000c47e0f40fda24b614f712edc4a9ceb586c8fb4f232"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:AHIAYRBY3YWSQLWJI3RANGCQLE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiple-change-point detection for high dimensional time series via sparsified binary segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Haeran Cho, Piotr Fryzlewicz","submitted_at":"2016-11-25T23:47:30Z","abstract_excerpt":"Time series segmentation, a.k.a. multiple change-point detection, is a well-established problem. However, few solutions are designed specifically for high-dimensional situations. In this paper, our interest is in segmenting the second-order structure of a high-dimensional time series. In a generic step of a binary segmentation algorithm for multivariate time series, one natural solution is to combine CUSUM statistics obtained from local periodograms and cross-periodograms of the components of the input time series. However, the standard \"maximum\" and \"average\" methods for doing so often fail i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08639","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-18T00:56:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pbwm3EWUDbV6qhCVqsilWS+c4sgoUdeIzS5h5XPRzi/lxxzDvsiGOIxek4kPzWLxxS25Z49KbU5+13sMwe+8DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T02:17:46.868859Z"},"content_sha256":"1624f0bc0b90396a27a744f052121ddfcb9e35cfcf770a1d69e114d40b259b10","schema_version":"1.0","event_id":"sha256:1624f0bc0b90396a27a744f052121ddfcb9e35cfcf770a1d69e114d40b259b10"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AHIAYRBY3YWSQLWJI3RANGCQLE/bundle.json","state_url":"https://pith.science/pith/AHIAYRBY3YWSQLWJI3RANGCQLE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AHIAYRBY3YWSQLWJI3RANGCQLE/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-07T02:17:46Z","links":{"resolver":"https://pith.science/pith/AHIAYRBY3YWSQLWJI3RANGCQLE","bundle":"https://pith.science/pith/AHIAYRBY3YWSQLWJI3RANGCQLE/bundle.json","state":"https://pith.science/pith/AHIAYRBY3YWSQLWJI3RANGCQLE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AHIAYRBY3YWSQLWJI3RANGCQLE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:AHIAYRBY3YWSQLWJI3RANGCQLE","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":"1512772890ba8f416be621332e70fd982346a3850edf852cf98200b807db6c6d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-11-25T23:47:30Z","title_canon_sha256":"e54a75bdac2c6b479c04795b400b9c6664e639807ec90c9ce04074da97c3d616"},"schema_version":"1.0","source":{"id":"1611.08639","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.08639","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"arxiv_version","alias_value":"1611.08639v1","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08639","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"pith_short_12","alias_value":"AHIAYRBY3YWS","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AHIAYRBY3YWSQLWJ","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AHIAYRBY","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:1624f0bc0b90396a27a744f052121ddfcb9e35cfcf770a1d69e114d40b259b10","target":"graph","created_at":"2026-05-18T00:56:37Z","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":"Time series segmentation, a.k.a. multiple change-point detection, is a well-established problem. However, few solutions are designed specifically for high-dimensional situations. In this paper, our interest is in segmenting the second-order structure of a high-dimensional time series. In a generic step of a binary segmentation algorithm for multivariate time series, one natural solution is to combine CUSUM statistics obtained from local periodograms and cross-periodograms of the components of the input time series. However, the standard \"maximum\" and \"average\" methods for doing so often fail i","authors_text":"Haeran Cho, Piotr Fryzlewicz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-11-25T23:47:30Z","title":"Multiple-change-point detection for high dimensional time series via sparsified binary segmentation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08639","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:ccc4e34b564fb157e51000c47e0f40fda24b614f712edc4a9ceb586c8fb4f232","target":"record","created_at":"2026-05-18T00:56:37Z","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":"1512772890ba8f416be621332e70fd982346a3850edf852cf98200b807db6c6d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-11-25T23:47:30Z","title_canon_sha256":"e54a75bdac2c6b479c04795b400b9c6664e639807ec90c9ce04074da97c3d616"},"schema_version":"1.0","source":{"id":"1611.08639","kind":"arxiv","version":1}},"canonical_sha256":"01d00c4438de2d282ec946e20698505905be0adf77f0131816ee132673fa62b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01d00c4438de2d282ec946e20698505905be0adf77f0131816ee132673fa62b2","first_computed_at":"2026-05-18T00:56:37.286458Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:37.286458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cfQXHPNjOXjHCp0qwTZv7lAs34UFg2weWEGbSu5luqAI0qicpSeHXKuLwqWbgcbtQ9zDL+ohO8EbGofjOOi1Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:37.287138Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.08639","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ccc4e34b564fb157e51000c47e0f40fda24b614f712edc4a9ceb586c8fb4f232","sha256:1624f0bc0b90396a27a744f052121ddfcb9e35cfcf770a1d69e114d40b259b10"],"state_sha256":"90af0f8b58575966203d072f84f7a9bf75eac6e75159a5ab127a5ec9253453cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Csz/4IqiQMA3rzp3Itp1UZBIFq+x4CXJTeYeq3F2X04E+kLwPJcgmIcWY0jMzHN15L+yvIcJRu2urKcPoev7AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T02:17:46.870757Z","bundle_sha256":"c126ce48c0145f57ff3568ad6dc1de3608fd9b91af5448ba6836e83980f65edb"}}