{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:AHIAYRBY3YWSQLWJI3RANGCQLE","short_pith_number":"pith:AHIAYRBY","schema_version":"1.0","canonical_sha256":"01d00c4438de2d282ec946e20698505905be0adf77f0131816ee132673fa62b2","source":{"kind":"arxiv","id":"1611.08639","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1611.08639","created_at":"2026-05-18T00:56:37.286569+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.08639v1","created_at":"2026-05-18T00:56:37.286569+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08639","created_at":"2026-05-18T00:56:37.286569+00:00"},{"alias_kind":"pith_short_12","alias_value":"AHIAYRBY3YWS","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"AHIAYRBY3YWSQLWJ","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"AHIAYRBY","created_at":"2026-05-18T12:30:07.202191+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/AHIAYRBY3YWSQLWJI3RANGCQLE","json":"https://pith.science/pith/AHIAYRBY3YWSQLWJI3RANGCQLE.json","graph_json":"https://pith.science/api/pith-number/AHIAYRBY3YWSQLWJI3RANGCQLE/graph.json","events_json":"https://pith.science/api/pith-number/AHIAYRBY3YWSQLWJI3RANGCQLE/events.json","paper":"https://pith.science/paper/AHIAYRBY"},"agent_actions":{"view_html":"https://pith.science/pith/AHIAYRBY3YWSQLWJI3RANGCQLE","download_json":"https://pith.science/pith/AHIAYRBY3YWSQLWJI3RANGCQLE.json","view_paper":"https://pith.science/paper/AHIAYRBY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.08639&json=true","fetch_graph":"https://pith.science/api/pith-number/AHIAYRBY3YWSQLWJI3RANGCQLE/graph.json","fetch_events":"https://pith.science/api/pith-number/AHIAYRBY3YWSQLWJI3RANGCQLE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AHIAYRBY3YWSQLWJI3RANGCQLE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AHIAYRBY3YWSQLWJI3RANGCQLE/action/storage_attestation","attest_author":"https://pith.science/pith/AHIAYRBY3YWSQLWJI3RANGCQLE/action/author_attestation","sign_citation":"https://pith.science/pith/AHIAYRBY3YWSQLWJI3RANGCQLE/action/citation_signature","submit_replication":"https://pith.science/pith/AHIAYRBY3YWSQLWJI3RANGCQLE/action/replication_record"}},"created_at":"2026-05-18T00:56:37.286569+00:00","updated_at":"2026-05-18T00:56:37.286569+00:00"}