{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:2ELNZ44DKVL4US5Q7HHGHXAUXB","short_pith_number":"pith:2ELNZ44D","canonical_record":{"source":{"id":"1901.07687","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-23T02:06:51Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"18187b2321f3d5d91034392e5c8a004f727ca4d04e958e6f4a8fb0bc811e6ae4","abstract_canon_sha256":"1bb4b4c2805726a4defe44ebbf38b94db62bbae6fccf07f9601ac4cfbe878b12"},"schema_version":"1.0"},"canonical_sha256":"d116dcf3835557ca4bb0f9ce63dc14b856d923dcd62d6456fa53c72b4e873b86","source":{"kind":"arxiv","id":"1901.07687","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07687","created_at":"2026-05-17T23:46:29Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07687v3","created_at":"2026-05-17T23:46:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07687","created_at":"2026-05-17T23:46:29Z"},{"alias_kind":"pith_short_12","alias_value":"2ELNZ44DKVL4","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2ELNZ44DKVL4US5Q","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2ELNZ44D","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:2ELNZ44DKVL4US5Q7HHGHXAUXB","target":"record","payload":{"canonical_record":{"source":{"id":"1901.07687","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-23T02:06:51Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"18187b2321f3d5d91034392e5c8a004f727ca4d04e958e6f4a8fb0bc811e6ae4","abstract_canon_sha256":"1bb4b4c2805726a4defe44ebbf38b94db62bbae6fccf07f9601ac4cfbe878b12"},"schema_version":"1.0"},"canonical_sha256":"d116dcf3835557ca4bb0f9ce63dc14b856d923dcd62d6456fa53c72b4e873b86","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:29.118838Z","signature_b64":"Ej8DaTviCG55HuCk0vDaN/lrfGbi3KeMRNqUEYgx402uOZ/9HJEcuN5YZMBdu555rD9GS+25eOrBRGcUXKbfCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d116dcf3835557ca4bb0f9ce63dc14b856d923dcd62d6456fa53c72b4e873b86","last_reissued_at":"2026-05-17T23:46:29.118148Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:29.118148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.07687","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-17T23:46:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x6vHfyEcmlthCW9U0mE9+ldSrSTm1T15rItRRBo7cccaq8ks+ej6/8AK65xBDILv4gt+tGIyjukYAnQvRhuDDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:07:11.630515Z"},"content_sha256":"d6b893af797fb61047473d003205172aaac742f09529d1f01ef564d2a704e521","schema_version":"1.0","event_id":"sha256:d6b893af797fb61047473d003205172aaac742f09529d1f01ef564d2a704e521"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:2ELNZ44DKVL4US5Q7HHGHXAUXB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Adaptive Principal Component Analysis and Its extensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrew Lamperski, Jianjun Yuan","submitted_at":"2019-01-23T02:06:51Z","abstract_excerpt":"We propose algorithms for online principal component analysis (PCA) and variance minimization for adaptive settings. Previous literature has focused on upper bounding the static adversarial regret, whose comparator is the optimal fixed action in hindsight. However, static regret is not an appropriate metric when the underlying environment is changing. Instead, we adopt the adaptive regret metric from the previous literature and propose online adaptive algorithms for PCA and variance minimization, that have sub-linear adaptive regret guarantees. We demonstrate both theoretically and experimenta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07687","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-17T23:46:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QzVZjs8/hQn+//B3ao1tD4wRDXngf3fqF/jw+2NZzPBOjoH/kXo42XDyipHj4xyPR478tQ6WQ1sv5AQMofI9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:07:11.630849Z"},"content_sha256":"c48a5bd829bc67e6918900272bc69b9158b551796fea4a1a8f7768ce4d23a923","schema_version":"1.0","event_id":"sha256:c48a5bd829bc67e6918900272bc69b9158b551796fea4a1a8f7768ce4d23a923"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2ELNZ44DKVL4US5Q7HHGHXAUXB/bundle.json","state_url":"https://pith.science/pith/2ELNZ44DKVL4US5Q7HHGHXAUXB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2ELNZ44DKVL4US5Q7HHGHXAUXB/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-01T14:07:11Z","links":{"resolver":"https://pith.science/pith/2ELNZ44DKVL4US5Q7HHGHXAUXB","bundle":"https://pith.science/pith/2ELNZ44DKVL4US5Q7HHGHXAUXB/bundle.json","state":"https://pith.science/pith/2ELNZ44DKVL4US5Q7HHGHXAUXB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2ELNZ44DKVL4US5Q7HHGHXAUXB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:2ELNZ44DKVL4US5Q7HHGHXAUXB","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":"1bb4b4c2805726a4defe44ebbf38b94db62bbae6fccf07f9601ac4cfbe878b12","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-23T02:06:51Z","title_canon_sha256":"18187b2321f3d5d91034392e5c8a004f727ca4d04e958e6f4a8fb0bc811e6ae4"},"schema_version":"1.0","source":{"id":"1901.07687","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07687","created_at":"2026-05-17T23:46:29Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07687v3","created_at":"2026-05-17T23:46:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07687","created_at":"2026-05-17T23:46:29Z"},{"alias_kind":"pith_short_12","alias_value":"2ELNZ44DKVL4","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2ELNZ44DKVL4US5Q","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2ELNZ44D","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:c48a5bd829bc67e6918900272bc69b9158b551796fea4a1a8f7768ce4d23a923","target":"graph","created_at":"2026-05-17T23:46:29Z","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":"We propose algorithms for online principal component analysis (PCA) and variance minimization for adaptive settings. Previous literature has focused on upper bounding the static adversarial regret, whose comparator is the optimal fixed action in hindsight. However, static regret is not an appropriate metric when the underlying environment is changing. Instead, we adopt the adaptive regret metric from the previous literature and propose online adaptive algorithms for PCA and variance minimization, that have sub-linear adaptive regret guarantees. We demonstrate both theoretically and experimenta","authors_text":"Andrew Lamperski, Jianjun Yuan","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-23T02:06:51Z","title":"Online Adaptive Principal Component Analysis and Its extensions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07687","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:d6b893af797fb61047473d003205172aaac742f09529d1f01ef564d2a704e521","target":"record","created_at":"2026-05-17T23:46:29Z","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":"1bb4b4c2805726a4defe44ebbf38b94db62bbae6fccf07f9601ac4cfbe878b12","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-23T02:06:51Z","title_canon_sha256":"18187b2321f3d5d91034392e5c8a004f727ca4d04e958e6f4a8fb0bc811e6ae4"},"schema_version":"1.0","source":{"id":"1901.07687","kind":"arxiv","version":3}},"canonical_sha256":"d116dcf3835557ca4bb0f9ce63dc14b856d923dcd62d6456fa53c72b4e873b86","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d116dcf3835557ca4bb0f9ce63dc14b856d923dcd62d6456fa53c72b4e873b86","first_computed_at":"2026-05-17T23:46:29.118148Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:29.118148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ej8DaTviCG55HuCk0vDaN/lrfGbi3KeMRNqUEYgx402uOZ/9HJEcuN5YZMBdu555rD9GS+25eOrBRGcUXKbfCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:29.118838Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.07687","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6b893af797fb61047473d003205172aaac742f09529d1f01ef564d2a704e521","sha256:c48a5bd829bc67e6918900272bc69b9158b551796fea4a1a8f7768ce4d23a923"],"state_sha256":"0fd2652c7f75d8e9db06568d75b0661e1c03e731535b4d423ea3c86a330debd4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SovH8EfkBcHOt++oErKX/JzxUBszmBR8QqNngAH3pFQqQ5a2BdFjtyXRw6U4cG5j76Qvr+yRumRGjef10ShrDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:07:11.632729Z","bundle_sha256":"2867f9d11c1c50e3eabb021024d504f563bd53592d8a8675ab5acf15a988ecd6"}}