{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:W6DVUILBVAO64ETFBGDIDNQERX","short_pith_number":"pith:W6DVUILB","canonical_record":{"source":{"id":"1702.07709","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-24T18:59:08Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"cfa266e6d4faac54936c2b36c7487fa2a5d88a21e6ea2fa432fbd8b25338fe7a","abstract_canon_sha256":"8788886c0886cbafbcefd5adc687622fafa365f3111e168af9542b13be0e65cf"},"schema_version":"1.0"},"canonical_sha256":"b7875a2161a81dee1265098681b6048dd6e7ca8d205295ba63af3f4b9762c2a6","source":{"kind":"arxiv","id":"1702.07709","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07709","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07709v1","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07709","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"pith_short_12","alias_value":"W6DVUILBVAO6","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"W6DVUILBVAO64ETF","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"W6DVUILB","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:W6DVUILBVAO64ETFBGDIDNQERX","target":"record","payload":{"canonical_record":{"source":{"id":"1702.07709","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-24T18:59:08Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"cfa266e6d4faac54936c2b36c7487fa2a5d88a21e6ea2fa432fbd8b25338fe7a","abstract_canon_sha256":"8788886c0886cbafbcefd5adc687622fafa365f3111e168af9542b13be0e65cf"},"schema_version":"1.0"},"canonical_sha256":"b7875a2161a81dee1265098681b6048dd6e7ca8d205295ba63af3f4b9762c2a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:02.444884Z","signature_b64":"dR3/xJeV2Pr9A94MhuQxrm+7q3JlT+y60UJ7FV91RZP8X8Azf8e0VmaApoWGb08ccBF6w1EQ0Grlk4EtRekGAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7875a2161a81dee1265098681b6048dd6e7ca8d205295ba63af3f4b9762c2a6","last_reissued_at":"2026-05-18T00:50:02.444184Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:02.444184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.07709","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-18T00:50:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vPDSsaWgKFqq3fVUXUke7pIak0n02upRCWqz9nLa8XhbkRkUivPvYgQ0IomzRGUbihd6ABcT+8+nyeW4aB65BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:34:08.864382Z"},"content_sha256":"cf4eb7d971ba3640351cd1c54de1c2894faba550cdb09c97aa9b242bd7c23a36","schema_version":"1.0","event_id":"sha256:cf4eb7d971ba3640351cd1c54de1c2894faba550cdb09c97aa9b242bd7c23a36"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:W6DVUILBVAO64ETFBGDIDNQERX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computationally Efficient Robust Estimation of Sparse Functionals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"stat.ML","authors_text":"Aarti Singh, Simon S. Du, Sivaraman Balakrishnan","submitted_at":"2017-02-24T18:59:08Z","abstract_excerpt":"Many conventional statistical procedures are extremely sensitive to seemingly minor deviations from modeling assumptions. This problem is exacerbated in modern high-dimensional settings, where the problem dimension can grow with and possibly exceed the sample size. We consider the problem of robust estimation of sparse functionals, and provide a computationally and statistically efficient algorithm in the high-dimensional setting. Our theory identifies a unified set of deterministic conditions under which our algorithm guarantees accurate recovery. By further establishing that these determinis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07709","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-18T00:50:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7wG29wpiKAw8jYLEuDSrogv6Mnaz4SO0wW52Kvsq5IL9WA/CuWedy9fuuhjM8DJMdj9x8h3sAepcAKn2CSpmCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:34:08.864726Z"},"content_sha256":"cfb35a241eb56d38bcf9f7af216017624455d411eec4e5fd080a43467d2ef901","schema_version":"1.0","event_id":"sha256:cfb35a241eb56d38bcf9f7af216017624455d411eec4e5fd080a43467d2ef901"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W6DVUILBVAO64ETFBGDIDNQERX/bundle.json","state_url":"https://pith.science/pith/W6DVUILBVAO64ETFBGDIDNQERX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W6DVUILBVAO64ETFBGDIDNQERX/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-02T08:34:08Z","links":{"resolver":"https://pith.science/pith/W6DVUILBVAO64ETFBGDIDNQERX","bundle":"https://pith.science/pith/W6DVUILBVAO64ETFBGDIDNQERX/bundle.json","state":"https://pith.science/pith/W6DVUILBVAO64ETFBGDIDNQERX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W6DVUILBVAO64ETFBGDIDNQERX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:W6DVUILBVAO64ETFBGDIDNQERX","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":"8788886c0886cbafbcefd5adc687622fafa365f3111e168af9542b13be0e65cf","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-24T18:59:08Z","title_canon_sha256":"cfa266e6d4faac54936c2b36c7487fa2a5d88a21e6ea2fa432fbd8b25338fe7a"},"schema_version":"1.0","source":{"id":"1702.07709","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07709","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07709v1","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07709","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"pith_short_12","alias_value":"W6DVUILBVAO6","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"W6DVUILBVAO64ETF","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"W6DVUILB","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:cfb35a241eb56d38bcf9f7af216017624455d411eec4e5fd080a43467d2ef901","target":"graph","created_at":"2026-05-18T00:50:02Z","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":"Many conventional statistical procedures are extremely sensitive to seemingly minor deviations from modeling assumptions. This problem is exacerbated in modern high-dimensional settings, where the problem dimension can grow with and possibly exceed the sample size. We consider the problem of robust estimation of sparse functionals, and provide a computationally and statistically efficient algorithm in the high-dimensional setting. Our theory identifies a unified set of deterministic conditions under which our algorithm guarantees accurate recovery. By further establishing that these determinis","authors_text":"Aarti Singh, Simon S. Du, Sivaraman Balakrishnan","cross_cats":["cs.DS","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-24T18:59:08Z","title":"Computationally Efficient Robust Estimation of Sparse Functionals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07709","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:cf4eb7d971ba3640351cd1c54de1c2894faba550cdb09c97aa9b242bd7c23a36","target":"record","created_at":"2026-05-18T00:50:02Z","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":"8788886c0886cbafbcefd5adc687622fafa365f3111e168af9542b13be0e65cf","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-24T18:59:08Z","title_canon_sha256":"cfa266e6d4faac54936c2b36c7487fa2a5d88a21e6ea2fa432fbd8b25338fe7a"},"schema_version":"1.0","source":{"id":"1702.07709","kind":"arxiv","version":1}},"canonical_sha256":"b7875a2161a81dee1265098681b6048dd6e7ca8d205295ba63af3f4b9762c2a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b7875a2161a81dee1265098681b6048dd6e7ca8d205295ba63af3f4b9762c2a6","first_computed_at":"2026-05-18T00:50:02.444184Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:02.444184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dR3/xJeV2Pr9A94MhuQxrm+7q3JlT+y60UJ7FV91RZP8X8Azf8e0VmaApoWGb08ccBF6w1EQ0Grlk4EtRekGAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:02.444884Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.07709","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf4eb7d971ba3640351cd1c54de1c2894faba550cdb09c97aa9b242bd7c23a36","sha256:cfb35a241eb56d38bcf9f7af216017624455d411eec4e5fd080a43467d2ef901"],"state_sha256":"6e1983e6a386fac8ee1b3430187181a6e0ccfc9badcf4dea09a4024385dc7ecb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L4qFSf7vXkD2f6WIHfMiAnLYmWAlBrPfa0eDuBgYDNG3l5J2pSWzTmvNFOPmygFPtKc78SJpCRaBU9Epk9VMBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T08:34:08.866667Z","bundle_sha256":"ecdb2abc9e43cb262b356be32ab12ab5acf87d18eab200a83d89ffc2894592de"}}