{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:WLFY5K2JTUOJAMND6WL74HTSJ4","short_pith_number":"pith:WLFY5K2J","canonical_record":{"source":{"id":"1902.01729","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-05T15:05:32Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"12d3f278d3254dbeca92f59a37c4193f238715ec832d246eea7babaf7d619440","abstract_canon_sha256":"39c09137f3554828cc71c0ef67e1989effc8641463e39af2a992b559b5c20646"},"schema_version":"1.0"},"canonical_sha256":"b2cb8eab499d1c9031a3f597fe1e724f181aae7fe2f38fab1289296eb52a9e70","source":{"kind":"arxiv","id":"1902.01729","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01729","created_at":"2026-05-17T23:54:46Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01729v1","created_at":"2026-05-17T23:54:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01729","created_at":"2026-05-17T23:54:46Z"},{"alias_kind":"pith_short_12","alias_value":"WLFY5K2JTUOJ","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"WLFY5K2JTUOJAMND","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"WLFY5K2J","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:WLFY5K2JTUOJAMND6WL74HTSJ4","target":"record","payload":{"canonical_record":{"source":{"id":"1902.01729","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-05T15:05:32Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"12d3f278d3254dbeca92f59a37c4193f238715ec832d246eea7babaf7d619440","abstract_canon_sha256":"39c09137f3554828cc71c0ef67e1989effc8641463e39af2a992b559b5c20646"},"schema_version":"1.0"},"canonical_sha256":"b2cb8eab499d1c9031a3f597fe1e724f181aae7fe2f38fab1289296eb52a9e70","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:46.914700Z","signature_b64":"EXR0ku6oFbXUpyJJiD+lpDCcqBjnE3BTpS7eiuV834nrwGSDT0uHp+/h5JC0A1o+ZBPIwUNCJLFkXxNv9KJCAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2cb8eab499d1c9031a3f597fe1e724f181aae7fe2f38fab1289296eb52a9e70","last_reissued_at":"2026-05-17T23:54:46.914094Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:46.914094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.01729","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-17T23:54:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vPXJZedoSVXBNx4qH3umqVQDfb1Xf20cJ6D0iOZJwvvsmBlxu/cAtdVDgnLgTeRMH36oLu7rpNrVoGl9vHBdBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:26:45.912489Z"},"content_sha256":"c43cce2f4429d03eb1e12f556dd32ddd685fea68e9d72e44fe30da7855825e66","schema_version":"1.0","event_id":"sha256:c43cce2f4429d03eb1e12f556dd32ddd685fea68e9d72e44fe30da7855825e66"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:WLFY5K2JTUOJAMND6WL74HTSJ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Regression via Online Feature Selection under Adversarial Data Corruption","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Arnold P. Boedihardjo, Chang-Tien Lu, Liang Zhao, Shuo Lei, Xuchao Zhang","submitted_at":"2019-02-05T15:05:32Z","abstract_excerpt":"The presence of data corruption in user-generated streaming data, such as social media, motivates a new fundamental problem that learns reliable regression coefficient when features are not accessible entirely at one time. Until now, several important challenges still cannot be handled concurrently: 1) corrupted data estimation when only partial features are accessible; 2) online feature selection when data contains adversarial corruption; and 3) scaling to a massive dataset. This paper proposes a novel RObust regression algorithm via Online Feature Selection (\\textit{RoOFS}) that concurrently"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01729","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-17T23:54:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"efhHnZgP5OI0DZhE0N5GOPD+RD63LdXiiEUsiMSv2xV6Sl6ROa2YnqvIMqIIcGj6rBPCxCgJC6QuXSDfJ5SaCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:26:45.913246Z"},"content_sha256":"3a0ca4b74ada9b4766b18281826f174f3870d75738db2b5804257501244599c4","schema_version":"1.0","event_id":"sha256:3a0ca4b74ada9b4766b18281826f174f3870d75738db2b5804257501244599c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WLFY5K2JTUOJAMND6WL74HTSJ4/bundle.json","state_url":"https://pith.science/pith/WLFY5K2JTUOJAMND6WL74HTSJ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WLFY5K2JTUOJAMND6WL74HTSJ4/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-31T18:26:45Z","links":{"resolver":"https://pith.science/pith/WLFY5K2JTUOJAMND6WL74HTSJ4","bundle":"https://pith.science/pith/WLFY5K2JTUOJAMND6WL74HTSJ4/bundle.json","state":"https://pith.science/pith/WLFY5K2JTUOJAMND6WL74HTSJ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WLFY5K2JTUOJAMND6WL74HTSJ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:WLFY5K2JTUOJAMND6WL74HTSJ4","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":"39c09137f3554828cc71c0ef67e1989effc8641463e39af2a992b559b5c20646","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-05T15:05:32Z","title_canon_sha256":"12d3f278d3254dbeca92f59a37c4193f238715ec832d246eea7babaf7d619440"},"schema_version":"1.0","source":{"id":"1902.01729","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01729","created_at":"2026-05-17T23:54:46Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01729v1","created_at":"2026-05-17T23:54:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01729","created_at":"2026-05-17T23:54:46Z"},{"alias_kind":"pith_short_12","alias_value":"WLFY5K2JTUOJ","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"WLFY5K2JTUOJAMND","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"WLFY5K2J","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:3a0ca4b74ada9b4766b18281826f174f3870d75738db2b5804257501244599c4","target":"graph","created_at":"2026-05-17T23:54:46Z","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 presence of data corruption in user-generated streaming data, such as social media, motivates a new fundamental problem that learns reliable regression coefficient when features are not accessible entirely at one time. Until now, several important challenges still cannot be handled concurrently: 1) corrupted data estimation when only partial features are accessible; 2) online feature selection when data contains adversarial corruption; and 3) scaling to a massive dataset. This paper proposes a novel RObust regression algorithm via Online Feature Selection (\\textit{RoOFS}) that concurrently","authors_text":"Arnold P. Boedihardjo, Chang-Tien Lu, Liang Zhao, Shuo Lei, Xuchao Zhang","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-05T15:05:32Z","title":"Robust Regression via Online Feature Selection under Adversarial Data Corruption"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01729","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:c43cce2f4429d03eb1e12f556dd32ddd685fea68e9d72e44fe30da7855825e66","target":"record","created_at":"2026-05-17T23:54:46Z","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":"39c09137f3554828cc71c0ef67e1989effc8641463e39af2a992b559b5c20646","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-05T15:05:32Z","title_canon_sha256":"12d3f278d3254dbeca92f59a37c4193f238715ec832d246eea7babaf7d619440"},"schema_version":"1.0","source":{"id":"1902.01729","kind":"arxiv","version":1}},"canonical_sha256":"b2cb8eab499d1c9031a3f597fe1e724f181aae7fe2f38fab1289296eb52a9e70","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b2cb8eab499d1c9031a3f597fe1e724f181aae7fe2f38fab1289296eb52a9e70","first_computed_at":"2026-05-17T23:54:46.914094Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:46.914094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EXR0ku6oFbXUpyJJiD+lpDCcqBjnE3BTpS7eiuV834nrwGSDT0uHp+/h5JC0A1o+ZBPIwUNCJLFkXxNv9KJCAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:46.914700Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.01729","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c43cce2f4429d03eb1e12f556dd32ddd685fea68e9d72e44fe30da7855825e66","sha256:3a0ca4b74ada9b4766b18281826f174f3870d75738db2b5804257501244599c4"],"state_sha256":"e897090e53874fe6fae3c28e78a8ea3c4a08556d4c10923e6aafaf75bdb0cd73"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y60pJlSGwBfQbxY9xsN/uCGJIMs+I5rvAyXQMRv27YRf90y+nO9I2Cw07NNUNCjyR8+iZAfc2EoEvHZx12V1CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T18:26:45.916837Z","bundle_sha256":"34dd64465d78450a4521fdbba700b7ae6f97eef55cd06f8b06894ec6f9937310"}}