{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HEXYENHLHDSBDIQRASK2X44RWL","short_pith_number":"pith:HEXYENHL","canonical_record":{"source":{"id":"1506.06199","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-06-20T03:45:15Z","cross_cats_sorted":["cs.IT","math.IT","stat.ME","stat.TH"],"title_canon_sha256":"da27ed5cb9448b3f5f91fa8b7a215667b19af787ab1799ac51e36d649eef657d","abstract_canon_sha256":"28888f287dfa095b16208e54d08beae07fe4b619f190c14fe4161ca04d51eb07"},"schema_version":"1.0"},"canonical_sha256":"392f8234eb38e411a2110495abf391b2eb28c041bfa007f2b8546bebdc40bf2e","source":{"kind":"arxiv","id":"1506.06199","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.06199","created_at":"2026-05-18T01:41:58Z"},{"alias_kind":"arxiv_version","alias_value":"1506.06199v1","created_at":"2026-05-18T01:41:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06199","created_at":"2026-05-18T01:41:58Z"},{"alias_kind":"pith_short_12","alias_value":"HEXYENHLHDSB","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HEXYENHLHDSBDIQR","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HEXYENHL","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HEXYENHLHDSBDIQRASK2X44RWL","target":"record","payload":{"canonical_record":{"source":{"id":"1506.06199","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-06-20T03:45:15Z","cross_cats_sorted":["cs.IT","math.IT","stat.ME","stat.TH"],"title_canon_sha256":"da27ed5cb9448b3f5f91fa8b7a215667b19af787ab1799ac51e36d649eef657d","abstract_canon_sha256":"28888f287dfa095b16208e54d08beae07fe4b619f190c14fe4161ca04d51eb07"},"schema_version":"1.0"},"canonical_sha256":"392f8234eb38e411a2110495abf391b2eb28c041bfa007f2b8546bebdc40bf2e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:41:58.481487Z","signature_b64":"3FTnjyVZCgiSmn/sKyiCW6I0WoruBKTYoDUkKIgyhi2GuJvzk4LWO4K0vodaIGOIuufnBAyFXF0PLDHKR8YYCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"392f8234eb38e411a2110495abf391b2eb28c041bfa007f2b8546bebdc40bf2e","last_reissued_at":"2026-05-18T01:41:58.480910Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:41:58.480910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.06199","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-18T01:41:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jHQECT0+2QJPW59feErBOLtu/PzNE/prJw0z+/HHyV0qEyKlJpYg4QUksL2zXEB3dCf+BAWuahsK6ppRzNN4DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:20:01.454433Z"},"content_sha256":"9e5e1bce3649f4ba41ca7aae380fca5c4ceb2eb9a8e87d79d4f3a8c3f045663b","schema_version":"1.0","event_id":"sha256:9e5e1bce3649f4ba41ca7aae380fca5c4ceb2eb9a8e87d79d4f3a8c3f045663b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HEXYENHLHDSBDIQRASK2X44RWL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-parametric Quickest Change Detection for Large Scale Random Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ME","stat.TH"],"primary_cat":"math.ST","authors_text":"Alfred O. Hero III, Hamed Firouzi, Taposh Banerjee","submitted_at":"2015-06-20T03:45:15Z","abstract_excerpt":"The problem of quickest detection of a change in the distribution of a $n\\times p$ random matrix based on a sequence of observations having a single unknown change point is considered. The forms of the pre- and post-change distributions of the rows of the matrices are assumed to belong to the family of elliptically contoured densities with sparse dispersion matrices but are otherwise unknown. We propose a non-parametric stopping rule that is based on a novel summary statistic related to k-nearest neighbor correlation between columns of each observed random matrix. In the large scale regime of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06199","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-18T01:41:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2CKOw13pZPbEZzRp65e6nCoUeCw8JAUu1crSQDvmkU+MFLQxz+bjXUR3PKW0Qn17M+ykpVIlQ+LIBTx8BqzsAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:20:01.454784Z"},"content_sha256":"c23075aeb262dfb9dfb41f2a3bf997e4c0196ca7656deaf69013d3ca287107ec","schema_version":"1.0","event_id":"sha256:c23075aeb262dfb9dfb41f2a3bf997e4c0196ca7656deaf69013d3ca287107ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HEXYENHLHDSBDIQRASK2X44RWL/bundle.json","state_url":"https://pith.science/pith/HEXYENHLHDSBDIQRASK2X44RWL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HEXYENHLHDSBDIQRASK2X44RWL/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-05T01:20:01Z","links":{"resolver":"https://pith.science/pith/HEXYENHLHDSBDIQRASK2X44RWL","bundle":"https://pith.science/pith/HEXYENHLHDSBDIQRASK2X44RWL/bundle.json","state":"https://pith.science/pith/HEXYENHLHDSBDIQRASK2X44RWL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HEXYENHLHDSBDIQRASK2X44RWL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HEXYENHLHDSBDIQRASK2X44RWL","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":"28888f287dfa095b16208e54d08beae07fe4b619f190c14fe4161ca04d51eb07","cross_cats_sorted":["cs.IT","math.IT","stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-06-20T03:45:15Z","title_canon_sha256":"da27ed5cb9448b3f5f91fa8b7a215667b19af787ab1799ac51e36d649eef657d"},"schema_version":"1.0","source":{"id":"1506.06199","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.06199","created_at":"2026-05-18T01:41:58Z"},{"alias_kind":"arxiv_version","alias_value":"1506.06199v1","created_at":"2026-05-18T01:41:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06199","created_at":"2026-05-18T01:41:58Z"},{"alias_kind":"pith_short_12","alias_value":"HEXYENHLHDSB","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HEXYENHLHDSBDIQR","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HEXYENHL","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:c23075aeb262dfb9dfb41f2a3bf997e4c0196ca7656deaf69013d3ca287107ec","target":"graph","created_at":"2026-05-18T01:41:58Z","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 problem of quickest detection of a change in the distribution of a $n\\times p$ random matrix based on a sequence of observations having a single unknown change point is considered. The forms of the pre- and post-change distributions of the rows of the matrices are assumed to belong to the family of elliptically contoured densities with sparse dispersion matrices but are otherwise unknown. We propose a non-parametric stopping rule that is based on a novel summary statistic related to k-nearest neighbor correlation between columns of each observed random matrix. In the large scale regime of ","authors_text":"Alfred O. Hero III, Hamed Firouzi, Taposh Banerjee","cross_cats":["cs.IT","math.IT","stat.ME","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-06-20T03:45:15Z","title":"Non-parametric Quickest Change Detection for Large Scale Random Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06199","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:9e5e1bce3649f4ba41ca7aae380fca5c4ceb2eb9a8e87d79d4f3a8c3f045663b","target":"record","created_at":"2026-05-18T01:41:58Z","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":"28888f287dfa095b16208e54d08beae07fe4b619f190c14fe4161ca04d51eb07","cross_cats_sorted":["cs.IT","math.IT","stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-06-20T03:45:15Z","title_canon_sha256":"da27ed5cb9448b3f5f91fa8b7a215667b19af787ab1799ac51e36d649eef657d"},"schema_version":"1.0","source":{"id":"1506.06199","kind":"arxiv","version":1}},"canonical_sha256":"392f8234eb38e411a2110495abf391b2eb28c041bfa007f2b8546bebdc40bf2e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"392f8234eb38e411a2110495abf391b2eb28c041bfa007f2b8546bebdc40bf2e","first_computed_at":"2026-05-18T01:41:58.480910Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:41:58.480910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3FTnjyVZCgiSmn/sKyiCW6I0WoruBKTYoDUkKIgyhi2GuJvzk4LWO4K0vodaIGOIuufnBAyFXF0PLDHKR8YYCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:41:58.481487Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.06199","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e5e1bce3649f4ba41ca7aae380fca5c4ceb2eb9a8e87d79d4f3a8c3f045663b","sha256:c23075aeb262dfb9dfb41f2a3bf997e4c0196ca7656deaf69013d3ca287107ec"],"state_sha256":"8e05ae7f277bcd5506fc440bdd94a07147e8fe640b0bbbde956ff9574c18c9f9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n0lRyBc9gGRrZvgMdSzfbMAaU0XwHfEC6W1xJMLP6RvVQyUu3iocMALdjEdLfINGxYmfTWUYBbAyuni7ALUkBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:20:01.456736Z","bundle_sha256":"344925babb68c2baa3103a002a2dd2a07f67f44e962e9b38b669f8223bbbff83"}}