{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:Z3AY2FDJNIZYN5QV5PR7LZ4I4V","short_pith_number":"pith:Z3AY2FDJ","canonical_record":{"source":{"id":"1508.04720","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-08-19T17:51:26Z","cross_cats_sorted":["cs.IT","math.IT","math.PR","stat.TH"],"title_canon_sha256":"2d18d23402e9f46df0a849bcd56690c0fb8bc00b521d4b3a035841e32d12a80a","abstract_canon_sha256":"4c5a58d26eab19b6b1804291410972bbe554eb7d969990cacbb76d68c62efcde"},"schema_version":"1.0"},"canonical_sha256":"cec18d14696a3386f615ebe3f5e788e577fe6b72474257eaf3c55a2321b69d5d","source":{"kind":"arxiv","id":"1508.04720","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.04720","created_at":"2026-05-18T00:17:20Z"},{"alias_kind":"arxiv_version","alias_value":"1508.04720v3","created_at":"2026-05-18T00:17:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04720","created_at":"2026-05-18T00:17:20Z"},{"alias_kind":"pith_short_12","alias_value":"Z3AY2FDJNIZY","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"Z3AY2FDJNIZYN5QV","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"Z3AY2FDJ","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:Z3AY2FDJNIZYN5QV5PR7LZ4I4V","target":"record","payload":{"canonical_record":{"source":{"id":"1508.04720","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-08-19T17:51:26Z","cross_cats_sorted":["cs.IT","math.IT","math.PR","stat.TH"],"title_canon_sha256":"2d18d23402e9f46df0a849bcd56690c0fb8bc00b521d4b3a035841e32d12a80a","abstract_canon_sha256":"4c5a58d26eab19b6b1804291410972bbe554eb7d969990cacbb76d68c62efcde"},"schema_version":"1.0"},"canonical_sha256":"cec18d14696a3386f615ebe3f5e788e577fe6b72474257eaf3c55a2321b69d5d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:20.005520Z","signature_b64":"mvmPv6qsNqfnPJ5AFaIqhL6N/jlVBLkFbssY2oLDzqGAgnzuK8KJQP7ySGq5rG4cYtfiQRq8UDVbPQEF/jOYAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cec18d14696a3386f615ebe3f5e788e577fe6b72474257eaf3c55a2321b69d5d","last_reissued_at":"2026-05-18T00:17:20.004981Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:20.004981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.04720","source_version":3,"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:17:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"34LYDdndQwwNZn0VNE3CmWDkOXowQWnPzRFEcuqM8aJkwGJOOPOHwxppV4guHjmXwAxGJ+jeT7nv193pXgFXDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:42:32.432934Z"},"content_sha256":"066719ae8237f37cd984c880846dae2fbbe6917d90c0a15789153b2ffa2a0b1f","schema_version":"1.0","event_id":"sha256:066719ae8237f37cd984c880846dae2fbbe6917d90c0a15789153b2ffa2a0b1f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:Z3AY2FDJNIZYN5QV5PR7LZ4I4V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quickest Detection for Changes in Maximal kNN Coherence of Random Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.PR","stat.TH"],"primary_cat":"math.ST","authors_text":"Alfred O. Hero III, Hamed Firouzi, Taposh Banerjee","submitted_at":"2015-08-19T17:51:26Z","abstract_excerpt":"This paper addresses the problem of quickest detection of a change in the maximal coherence between columns of a $n\\times p$ random matrix based on a sequence of matrix observations having a single unknown change point. The random matrix is assumed to have identically distributed rows and the maximal coherence is defined as the largest of the $p \\choose 2$ correlation coefficients associated with any row. Likewise, the $k$ nearest neighbor (kNN) coherence is defined as the $k$-th largest of these correlation coefficients. The forms of the pre- and post-change distributions of the observed matr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04720","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":""},"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:17:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sb5vvCVGOZPZDHso4wyBrIHRki4WcdhalhAspGqfj45rjjxTQ+GqAyb+X5VeSL/f9H7PhrWicHBOAbx0VeADAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:42:32.433614Z"},"content_sha256":"d3801af04eaafffed584e529eeb96fb9c8ac704adae426e05f2d17f38c2ff3a5","schema_version":"1.0","event_id":"sha256:d3801af04eaafffed584e529eeb96fb9c8ac704adae426e05f2d17f38c2ff3a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z3AY2FDJNIZYN5QV5PR7LZ4I4V/bundle.json","state_url":"https://pith.science/pith/Z3AY2FDJNIZYN5QV5PR7LZ4I4V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z3AY2FDJNIZYN5QV5PR7LZ4I4V/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-05T02:42:32Z","links":{"resolver":"https://pith.science/pith/Z3AY2FDJNIZYN5QV5PR7LZ4I4V","bundle":"https://pith.science/pith/Z3AY2FDJNIZYN5QV5PR7LZ4I4V/bundle.json","state":"https://pith.science/pith/Z3AY2FDJNIZYN5QV5PR7LZ4I4V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z3AY2FDJNIZYN5QV5PR7LZ4I4V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:Z3AY2FDJNIZYN5QV5PR7LZ4I4V","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":"4c5a58d26eab19b6b1804291410972bbe554eb7d969990cacbb76d68c62efcde","cross_cats_sorted":["cs.IT","math.IT","math.PR","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-08-19T17:51:26Z","title_canon_sha256":"2d18d23402e9f46df0a849bcd56690c0fb8bc00b521d4b3a035841e32d12a80a"},"schema_version":"1.0","source":{"id":"1508.04720","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.04720","created_at":"2026-05-18T00:17:20Z"},{"alias_kind":"arxiv_version","alias_value":"1508.04720v3","created_at":"2026-05-18T00:17:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04720","created_at":"2026-05-18T00:17:20Z"},{"alias_kind":"pith_short_12","alias_value":"Z3AY2FDJNIZY","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"Z3AY2FDJNIZYN5QV","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"Z3AY2FDJ","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:d3801af04eaafffed584e529eeb96fb9c8ac704adae426e05f2d17f38c2ff3a5","target":"graph","created_at":"2026-05-18T00:17:20Z","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":"This paper addresses the problem of quickest detection of a change in the maximal coherence between columns of a $n\\times p$ random matrix based on a sequence of matrix observations having a single unknown change point. The random matrix is assumed to have identically distributed rows and the maximal coherence is defined as the largest of the $p \\choose 2$ correlation coefficients associated with any row. Likewise, the $k$ nearest neighbor (kNN) coherence is defined as the $k$-th largest of these correlation coefficients. The forms of the pre- and post-change distributions of the observed matr","authors_text":"Alfred O. Hero III, Hamed Firouzi, Taposh Banerjee","cross_cats":["cs.IT","math.IT","math.PR","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-08-19T17:51:26Z","title":"Quickest Detection for Changes in Maximal kNN Coherence of Random Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04720","kind":"arxiv","version":3},"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:066719ae8237f37cd984c880846dae2fbbe6917d90c0a15789153b2ffa2a0b1f","target":"record","created_at":"2026-05-18T00:17:20Z","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":"4c5a58d26eab19b6b1804291410972bbe554eb7d969990cacbb76d68c62efcde","cross_cats_sorted":["cs.IT","math.IT","math.PR","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-08-19T17:51:26Z","title_canon_sha256":"2d18d23402e9f46df0a849bcd56690c0fb8bc00b521d4b3a035841e32d12a80a"},"schema_version":"1.0","source":{"id":"1508.04720","kind":"arxiv","version":3}},"canonical_sha256":"cec18d14696a3386f615ebe3f5e788e577fe6b72474257eaf3c55a2321b69d5d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cec18d14696a3386f615ebe3f5e788e577fe6b72474257eaf3c55a2321b69d5d","first_computed_at":"2026-05-18T00:17:20.004981Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:20.004981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mvmPv6qsNqfnPJ5AFaIqhL6N/jlVBLkFbssY2oLDzqGAgnzuK8KJQP7ySGq5rG4cYtfiQRq8UDVbPQEF/jOYAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:20.005520Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.04720","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:066719ae8237f37cd984c880846dae2fbbe6917d90c0a15789153b2ffa2a0b1f","sha256:d3801af04eaafffed584e529eeb96fb9c8ac704adae426e05f2d17f38c2ff3a5"],"state_sha256":"41025021d623afcf068e461972f534d2c7e056c15322d135ae7d616e86016efd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yDq83o+Nb3VogCkZqnRJbKwD+wTqIQAaSlrk265pqeo3tTcG6B277TgWf+lIXHUjeMl8n3/5BMEIAL0qIFUpBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T02:42:32.437001Z","bundle_sha256":"6ac8302bae4e36b7872c41129a2e9a519bd4e14a0fc49c7182aa03d668cb7a06"}}