{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2HEWIUC2WLBX2JVUWLIQ4ITMW4","short_pith_number":"pith:2HEWIUC2","canonical_record":{"source":{"id":"1407.0312","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-01T16:37:22Z","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"title_canon_sha256":"ba82a17422545610fd1d5a37f1c532f4598c0771d710f8557fba5bac40c91412","abstract_canon_sha256":"331f9d203ab411c7751ac7c3d8f1a760900b0e14e2ec2bebaef1f6ab7f8587a2"},"schema_version":"1.0"},"canonical_sha256":"d1c964505ab2c37d26b4b2d10e226cb7392a61d55e24009992ee538dcfe6bd24","source":{"kind":"arxiv","id":"1407.0312","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.0312","created_at":"2026-05-18T01:42:42Z"},{"alias_kind":"arxiv_version","alias_value":"1407.0312v3","created_at":"2026-05-18T01:42:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0312","created_at":"2026-05-18T01:42:42Z"},{"alias_kind":"pith_short_12","alias_value":"2HEWIUC2WLBX","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2HEWIUC2WLBX2JVU","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2HEWIUC2","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2HEWIUC2WLBX2JVUWLIQ4ITMW4","target":"record","payload":{"canonical_record":{"source":{"id":"1407.0312","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-01T16:37:22Z","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"title_canon_sha256":"ba82a17422545610fd1d5a37f1c532f4598c0771d710f8557fba5bac40c91412","abstract_canon_sha256":"331f9d203ab411c7751ac7c3d8f1a760900b0e14e2ec2bebaef1f6ab7f8587a2"},"schema_version":"1.0"},"canonical_sha256":"d1c964505ab2c37d26b4b2d10e226cb7392a61d55e24009992ee538dcfe6bd24","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:42:42.958268Z","signature_b64":"zSPHfO4jxUS3jD7nH4JOkCbcooCHtA1iOXmHQcsIj7nRmnffzd1LXN96X0KqSksHCFQBkgHVjNs1WCPSurToDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1c964505ab2c37d26b4b2d10e226cb7392a61d55e24009992ee538dcfe6bd24","last_reissued_at":"2026-05-18T01:42:42.957724Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:42:42.957724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.0312","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-18T01:42:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ERACecQhcwjni9uUKdY22geL+2o8VzM2QoRMl90JcGEGWk0f6G5bnhUM/aaeu5z6VnmD5KJLDGpZahlNxr7lBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:26:43.175693Z"},"content_sha256":"5c77b933adaddfc6b515531744c7e4f956a34a7fb7393852d71ccd2c17dabcf0","schema_version":"1.0","event_id":"sha256:5c77b933adaddfc6b515531744c7e4f956a34a7fb7393852d71ccd2c17dabcf0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2HEWIUC2WLBX2JVUWLIQ4ITMW4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Identifying Outliers in Large Matrices via Randomized Adaptive Compressive Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Jarvis Haupt, Xingguo Li","submitted_at":"2014-07-01T16:37:22Z","abstract_excerpt":"This paper examines the problem of locating outlier columns in a large, otherwise low-rank, matrix. We propose a simple two-step adaptive sensing and inference approach and establish theoretical guarantees for its performance; our results show that accurate outlier identification is achievable using very few linear summaries of the original data matrix -- as few as the squared rank of the low-rank component plus the number of outliers, times constant and logarithmic factors. We demonstrate the performance of our approach experimentally in two stylized applications, one motivated by robust coll"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0312","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-18T01:42:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"crCj2q8JASZ0R2SyEuZJoegjwhQg6IdOkUJpt2Fx8hybmdLNMH04o2cTcMW5rCd7vo9gLo03H6EPFvUj5zJaBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:26:43.176445Z"},"content_sha256":"522ca9247ed77ef466129ae8d43721cde1e0f03078b98c4dcc044b2b3289a5ff","schema_version":"1.0","event_id":"sha256:522ca9247ed77ef466129ae8d43721cde1e0f03078b98c4dcc044b2b3289a5ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2HEWIUC2WLBX2JVUWLIQ4ITMW4/bundle.json","state_url":"https://pith.science/pith/2HEWIUC2WLBX2JVUWLIQ4ITMW4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2HEWIUC2WLBX2JVUWLIQ4ITMW4/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-05-25T18:26:43Z","links":{"resolver":"https://pith.science/pith/2HEWIUC2WLBX2JVUWLIQ4ITMW4","bundle":"https://pith.science/pith/2HEWIUC2WLBX2JVUWLIQ4ITMW4/bundle.json","state":"https://pith.science/pith/2HEWIUC2WLBX2JVUWLIQ4ITMW4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2HEWIUC2WLBX2JVUWLIQ4ITMW4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2HEWIUC2WLBX2JVUWLIQ4ITMW4","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":"331f9d203ab411c7751ac7c3d8f1a760900b0e14e2ec2bebaef1f6ab7f8587a2","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-01T16:37:22Z","title_canon_sha256":"ba82a17422545610fd1d5a37f1c532f4598c0771d710f8557fba5bac40c91412"},"schema_version":"1.0","source":{"id":"1407.0312","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.0312","created_at":"2026-05-18T01:42:42Z"},{"alias_kind":"arxiv_version","alias_value":"1407.0312v3","created_at":"2026-05-18T01:42:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0312","created_at":"2026-05-18T01:42:42Z"},{"alias_kind":"pith_short_12","alias_value":"2HEWIUC2WLBX","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2HEWIUC2WLBX2JVU","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2HEWIUC2","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:522ca9247ed77ef466129ae8d43721cde1e0f03078b98c4dcc044b2b3289a5ff","target":"graph","created_at":"2026-05-18T01:42:42Z","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 examines the problem of locating outlier columns in a large, otherwise low-rank, matrix. We propose a simple two-step adaptive sensing and inference approach and establish theoretical guarantees for its performance; our results show that accurate outlier identification is achievable using very few linear summaries of the original data matrix -- as few as the squared rank of the low-rank component plus the number of outliers, times constant and logarithmic factors. We demonstrate the performance of our approach experimentally in two stylized applications, one motivated by robust coll","authors_text":"Jarvis Haupt, Xingguo Li","cross_cats":["cs.LG","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-01T16:37:22Z","title":"Identifying Outliers in Large Matrices via Randomized Adaptive Compressive Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0312","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:5c77b933adaddfc6b515531744c7e4f956a34a7fb7393852d71ccd2c17dabcf0","target":"record","created_at":"2026-05-18T01:42:42Z","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":"331f9d203ab411c7751ac7c3d8f1a760900b0e14e2ec2bebaef1f6ab7f8587a2","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-01T16:37:22Z","title_canon_sha256":"ba82a17422545610fd1d5a37f1c532f4598c0771d710f8557fba5bac40c91412"},"schema_version":"1.0","source":{"id":"1407.0312","kind":"arxiv","version":3}},"canonical_sha256":"d1c964505ab2c37d26b4b2d10e226cb7392a61d55e24009992ee538dcfe6bd24","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1c964505ab2c37d26b4b2d10e226cb7392a61d55e24009992ee538dcfe6bd24","first_computed_at":"2026-05-18T01:42:42.957724Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:42:42.957724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zSPHfO4jxUS3jD7nH4JOkCbcooCHtA1iOXmHQcsIj7nRmnffzd1LXN96X0KqSksHCFQBkgHVjNs1WCPSurToDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:42:42.958268Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.0312","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c77b933adaddfc6b515531744c7e4f956a34a7fb7393852d71ccd2c17dabcf0","sha256:522ca9247ed77ef466129ae8d43721cde1e0f03078b98c4dcc044b2b3289a5ff"],"state_sha256":"de1492476205e2f6942df66eea3e6776b91e9f6c63037c453c1ef0b4bd093331"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9PmvcOY1Uh+G9ZkdiWFCievAn/bQGLlf6sJ2tRo/U9wtaX7bGMS8rbto1LrwBZYfh2gKLJg0a0O7xgiEu7+OAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:26:43.180266Z","bundle_sha256":"18e29c6fc6f7dea2e06ed933599f49f40c8cc781d1f0e72063194b5be0e9cda9"}}